default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulian Parsert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Julian Parsert
, Elizabeth Polgreen:
Reinforcement Learning and Data-Generation for Syntax-Guided Synthesis. AAAI 2024: 10670-10678- [c8]Yixuan Li, Julian Parsert, Elizabeth Polgreen:
Guiding Enumerative Program Synthesis with Large Language Models. CAV (2) 2024: 280-301 - [i7]Yixuan Li, Julian Parsert, Elizabeth Polgreen:
Guiding Enumerative Program Synthesis with Large Language Models. CoRR abs/2403.03997 (2024) - [i6]Julian Parsert:
Linear Programming in Isabelle/HOL. CoRR abs/2403.19639 (2024) - [i5]David M. Cerna, Julian Parsert:
One is all you need: Second-order Unification without First-order Variables. CoRR abs/2404.10616 (2024) - 2023
- [c7]Julian Parsert, Chad E. Brown, Mikolas Janota, Cezary Kaliszyk:
Experiments on Infinite Model Finding in SMT Solving. LPAR 2023: 317-328 - [i4]Julian Parsert, Elizabeth Polgreen:
Reinforcement Learning for Syntax-Guided Synthesis. CoRR abs/2307.09564 (2023) - 2022
- [c6]Mirco Giacobbe, Daniel Kroening, Julian Parsert:
Neural termination analysis. ESEC/SIGSOFT FSE 2022: 633-645 - 2021
- [j5]Stanislaw J. Purgal, Julian Parsert, Cezary Kaliszyk:
A study of continuous vector representations for theorem proving. J. Log. Comput. 31(8): 2057-2083 (2021) - [i3]Stanislaw J. Purgal, Julian Parsert, Cezary Kaliszyk:
A Study of Continuous Vector Representationsfor Theorem Proving. CoRR abs/2101.09142 (2021) - [i2]Mirco Giacobbe, Daniel Kroening, Julian Parsert:
Neural Termination Analysis. CoRR abs/2102.03824 (2021) - 2020
- [c5]Julian Parsert, Stephanie Autherith, Cezary Kaliszyk:
Property Preserving Embedding of First-order Logic. GCAI 2020: 70-82
2010 – 2019
- 2019
- [j4]Julian Parsert, Cezary Kaliszyk:
Linear Programming. Arch. Formal Proofs 2019 (2019) - 2018
- [j3]Julian Parsert, Cezary Kaliszyk:
Von-Neumann-Morgenstern Utility Theorem. Arch. Formal Proofs 2018 (2018) - [c4]Cezary Kaliszyk, Julian Parsert:
Formal microeconomic foundations and the first welfare theorem. CPP 2018: 91-101 - [c3]Florian Meßner, Julian Parsert, Jonas Schöpf, Christian Sternagel:
A Formally Verified Solver for Homogeneous Linear Diophantine Equations. ITP 2018: 441-458 - [c2]Julian Parsert, Cezary Kaliszyk:
Towards Formal Foundations for Game Theory. ITP 2018: 495-503 - [c1]Yutaka Nagashima, Julian Parsert:
Goal-Oriented Conjecturing for Isabelle/HOL. CICM 2018: 225-231 - [i1]Yutaka Nagashima, Julian Parsert:
Goal-Oriented Conjecturing for Isabelle/HOL. CoRR abs/1806.04774 (2018) - 2017
- [j2]Florian Messner, Julian Parsert, Jonas Schöpf, Christian Sternagel:
Homogeneous Linear Diophantine Equations. Arch. Formal Proofs 2017 (2017) - [j1]Julian Parsert, Cezary Kaliszyk:
Microeconomics and the First Welfare Theorem. Arch. Formal Proofs 2017 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
