default search action
25th LPAR 2024: Port Louis, Mauritius
- Nikolaj S. Bjørner, Marijn Heule, Andrei Voronkov:
LPAR 2024: Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, Port Louis, Mauritius, May 26-31, 2024. EPiC Series in Computing 100, EasyChair 2024 - Frédéric Blanqui:
Translating HOL-Light proofs to Coq. 1-18 - Guilherme Vicentin de Toledo, Yoni Zohar:
Combining Combination Properties: Minimal Models. 19-35 - Luís Cruz-Filipe, Peter Schneider-Kamp:
Minimizing Sorting Networks at the Sub-Comparator Level. 36-50 - Lachlan McGinness, Peter Baumgartner:
Automated Theorem Provers Help Improve Large Language Model Reasoning. 51-69 - Robert Freiman, Carlos Olarte, Elaine Pimentel, Christian G. Fermüller:
Reasoning About Group Polarization: From Semantic Games to Sequent Systems. 70-87 - Pamina Georgiou, Márton Hajdú, Laura Kovács:
Saturating Sorting without Sorts. 88-105 - Tanel Tammet:
Waste Reduction: Experiments in Sharing Clauses between Runs of a Portfolio of Strategies (Experimental Paper). 106-115 - Naïm Moussaoui Remil, Caterina Urban, Antoine Miné:
Automatic Detection of Vulnerable Variables for CTL Properties of Programs. 116-126 - Aaron Hunter, Alberto Iglesias:
A Tool for Reasoning about Trust and Belief. 127-135 - Joseph Tafese, Arie Gurfinkel:
Efficient Simulation for Hardware Model Checking. 136-146 - Johannes Schoisswohl, Laura Kovács, Konstantin Korovin:
VIRAS: Conflict-Driven Quantifier Elimination for Integer-Real Arithmetic. 147-164 - Mark Chimes, Radu Iosif, Florian Zuleger:
Tree-Verifiable Graph Grammars. 165-180 - Pablo Barenbaum, Delia Kesner, Mariana Milicich:
Hybrid Intersection Types for PCF. 181-197 - Martin Bromberger, Simon Schwarz, Christoph Weidenbach:
Automatic Bit- and Memory-Precise Verification of eBPF Code. 198-221 - Sophie Rain, Lea Salome Brugger, Anja Petkovic Komel, Laura Kovács, Michael Rawson:
Scaling CheckMate for Game-Theoretic Security. 222-231 - Matthias Baaz, Anela Lolic:
On Translations of Epsilon Proofs to LK. 232-245 - Johann Rosain, Richard Bonichon, Julie Cailler, Olivier Hermant:
A Generic Deskolemization Strategy. 246-263 - Jelle Piepenbrock, Mikolas Janota, Josef Urban, Jan Jakubuv:
First Experiments with Neural cvc5. 264-277 - Márton Hajdú, Laura Kovács, Michael Rawson:
Rewriting and Inductive Reasoning. 278-294 - Alexander Leitsch, Anela Lolic:
Herbrand's Theorem in Inductive Proofs. 295-310 - Daniel Ranalter, Chad E. Brown, Cezary Kaliszyk:
Experiments with Choice in Dependently-Typed Higher-Order Logic. 311-320 - Katalin Fazekas, Florian Pollitt, Mathias Fleury, Armin Biere:
Certifying Incremental SAT Solving. 321-340 - Christian G. Fermüller, Robert Freiman, Timo Lang:
A Simple Token Game and its Logic. 341-359 - Kristina Aleksandrova, Jan Jakubuv, Cezary Kaliszyk:
Prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery. 360-369 - Ozan Kahramanogullari:
Deep Inference in Proof Search: The Need for Shallow Inference. 370-389 - Rolf Hennicker, Alexander Knapp, Martin Wirsing:
Symbolic Realisation of Epistemic Processes. 390-407 - Bernardo Subercaseaux:
Sometimes Hoarding is Harder than Cleaning: NP-hardness of Maximum Blocked-Clause Addition. 408-425 - Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob:
Fuzzy Datalog∃ over Arbitrary t-Norms. 426-444 - Mudathir Mohamed, Andrew Reynolds, Cesare Tinelli, Clark W. Barrett:
Verifying SQL queries using theories of tables and relations. 445-463 - Giulio Guerrieri, Giulia Manara, Lorenzo Tortora de Falco, Lionel Vaux Auclair:
Confluence for Proof-Nets via Parallel Cut Elimination. 464-483 - S. Akshay, Supratik Chakraborty, Amir Kafshdar Goharshady, R. Govind, Harshit J. Motwani, Sai Teja Varanasi:
Automated Synthesis of Decision Lists for Polynomial Specifications over Integers. 484-502
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.