Julian Parsert : Publications

Reinforcement Learning and Data−Generation for Syntax−Guided Synthesis

Julian Parsert and Elizabeth Polgreen

In Michael J. Wooldridge‚ Jennifer G. Dy and Sriraam Natarajan, editors, Thirty−Eighth AAAI Conference on Artificial Intelligence‚ AAAI 2024‚ Thirty−Sixth Conference on Innovative Applications of Artificial Intelligence‚ IAAI 2024‚ Fourteenth Symposium on Educational Advances in Artificial Intelligence‚ EAAI 2014‚ February 20−27‚ 2024‚ Vancouver‚ Canada. Pages 10670–10678. AAAI Press. 2024.

Details about Reinforcement Learning and Data−Generation for Syntax−Guided Synthesis | BibTeX data for Reinforcement Learning and Data−Generation for Syntax−Guided Synthesis | DOI (10.1609/AAAI.V38I9.28938) | Link to Reinforcement Learning and Data−Generation for Syntax−Guided Synthesis

Experiments on Infinite Model Finding in SMT Solving

Julian Parsert‚ Chad E. Brown‚ Mikolas Janota and Cezary Kaliszyk

In Ruzica Piskac and Andrei Voronkov, editors, LPAR 2023: Proceedings of 24th International Conference on Logic for Programming‚ Artificial Intelligence and Reasoning‚ Manizales‚ Colombia‚ 4−9th June 2023. Vol. 94 of EPiC Series in Computing. Pages 317–328. EasyChair. 2023.

Details about Experiments on Infinite Model Finding in SMT Solving | BibTeX data for Experiments on Infinite Model Finding in SMT Solving | DOI (10.29007/SLRM) | Link to Experiments on Infinite Model Finding in SMT Solving

Neural termination analysis

Mirco Giacobbe‚ Daniel Kroening and Julian Parsert

In Abhik Roychoudhury‚ Cristian Cadar and Miryung Kim, editors, Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering‚ ESEC/FSE 2022‚ Singapore‚ Singapore‚ November 14−18‚ 2022. Pages 633–645. ACM. 2022.

Details about Neural termination analysis | BibTeX data for Neural termination analysis | DOI (10.1145/3540250.3549120) | Link to Neural termination analysis

A study of continuous vector representations for theorem proving

Stanislaw J. Purgal‚ Julian Parsert and Cezary Kaliszyk

In J. Log. Comput.. Vol. 31. No. 8. Pages 2057–2083. 2021.

Details about A study of continuous vector representations for theorem proving | BibTeX data for A study of continuous vector representations for theorem proving | DOI (10.1093/LOGCOM/EXAB006) | Link to A study of continuous vector representations for theorem proving

Property Preserving Embedding of First−order Logic

Julian Parsert‚ Stephanie Autherith and Cezary Kaliszyk

In Grégoire Danoy‚ Jun Pang and Geoff Sutcliffe, editors, 6th Global Conference on Artificial Intelligence‚ GCAI 2020‚ Hangzhou‚ China‚ April 6−9‚ 2020. Vol. 72 of EPiC Series in Computing. Pages 70–82. EasyChair. 2020.

Details about Property Preserving Embedding of First−order Logic | BibTeX data for Property Preserving Embedding of First−order Logic | DOI (10.29007/18T1) | Link to Property Preserving Embedding of First−order Logic

Goal−Oriented Conjecturing for Isabelle/HOL

Yutaka Nagashima and Julian Parsert

In Florian Rabe‚ William M. Farmer‚ Grant O. Passmore and Abdou Youssef, editors, Intelligent Computer Mathematics − 11th International Conference‚ CICM 2018‚ Hagenberg‚ Austria‚ August 13−17‚ 2018‚ Proceedings. Vol. 11006 of Lecture Notes in Computer Science. Pages 225–231. Springer. 2018.

Details about Goal−Oriented Conjecturing for Isabelle/HOL | BibTeX data for Goal−Oriented Conjecturing for Isabelle/HOL | DOI (10.1007/978-3-319-96812-4\_19) | Link to Goal−Oriented Conjecturing for Isabelle/HOL

Towards Formal Foundations for Game Theory

Julian Parsert and Cezary Kaliszyk

In Jeremy Avigad and Assia Mahboubi, editors, Interactive Theorem Proving − 9th International Conference‚ ITP 2018‚ Held as Part of the Federated Logic Conference‚ FloC 2018‚ Oxford‚ UK‚ July 9−12‚ 2018‚ Proceedings. Vol. 10895 of Lecture Notes in Computer Science. Pages 495–503. Springer. 2018.

Details about Towards Formal Foundations for Game Theory | BibTeX data for Towards Formal Foundations for Game Theory | DOI (10.1007/978-3-319-94821-8\_29) | Link to Towards Formal Foundations for Game Theory

A Formally Verified Solver for Homogeneous Linear Diophantine Equations

Florian Meßner‚ Julian Parsert‚ Jonas Schöpf and Christian Sternagel

In Jeremy Avigad and Assia Mahboubi, editors, Interactive Theorem Proving − 9th International Conference‚ ITP 2018‚ Held as Part of the Federated Logic Conference‚ FloC 2018‚ Oxford‚ UK‚ July 9−12‚ 2018‚ Proceedings. Vol. 10895 of Lecture Notes in Computer Science. Pages 441–458. Springer. 2018.

Details about A Formally Verified Solver for Homogeneous Linear Diophantine Equations | BibTeX data for A Formally Verified Solver for Homogeneous Linear Diophantine Equations | DOI (10.1007/978-3-319-94821-8\_26) | Link to A Formally Verified Solver for Homogeneous Linear Diophantine Equations

Formal microeconomic foundations and the first welfare theorem

Cezary Kaliszyk and Julian Parsert

In June Andronick and Amy P. Felty, editors, Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs‚ CPP 2018‚ Los Angeles‚ CA‚ USA‚ January 8−9‚ 2018. Pages 91–101. ACM. 2018.

Details about Formal microeconomic foundations and the first welfare theorem | BibTeX data for Formal microeconomic foundations and the first welfare theorem | DOI (10.1145/3167100) | Link to Formal microeconomic foundations and the first welfare theorem