default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th IJCAR 2024: Nancy, France - Part I
- Christoph Benzmüller
, Marijn J. H. Heule, Renate A. Schmidt:
Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14739, Springer 2024, ISBN 978-3-031-63497-0
Invited Contributions
- Jeremy Avigad:
Automated Reasoning for Mathematics. 3-20 - Laura Kovács, Petra Hozzová, Márton Hajdú, Andrei Voronkov:
Induction in Saturation. 21-29 - Geoff Sutcliffe:
Stepping Stones in the TPTP World. 30-50
Theorem Proving and Tools
- Geoff Sutcliffe, Christian B. Suttner, Lars Kotthoff, C. Raymond Perrault, Zain Khalid:
An Empirical Assessment of Progress in Automated Theorem Proving. 53-74 - Ahmed Bhayat, Martin Suda:
A Higher-Order Vampire (Short Paper). 75-85 - Johannes Niederhauser, Chad E. Brown, Cezary Kaliszyk:
Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic. 86-104 - Adrian De Lon:
The Naproche-ZF Theorem Prover (Short Paper). 105-114 - Márton Hajdú, Laura Kovács, Michael Rawson, Andrei Voronkov:
Reducibility Constraints in Superposition. 115-132 - Martin Bromberger, Florent Krasnopol, Sibylle Möhle, Christoph Weidenbach:
First-Order Automatic Literal Model Generation. 133-153 - Petra Hozzová, Daneshvar Amrollahi, Márton Hajdú, Laura Kovács, Andrei Voronkov, Eva Maria Wagner:
Synthesis of Recursive Programs in Saturation. 154-171 - Jan Heuer, Christoph Wernhard:
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic. 172-193 - Filip Bártek, Karel Chvalovský, Martin Suda:
Regularization in Spider-Style Strategy Discovery and Schedule Construction. 194-213 - Sólrún Halla Einarsdóttir, Márton Hajdú, Moa Johansson, Nicholas Smallbone, Martin Suda:
Lemma Discovery and Strategies for Automated Induction. 214-232 - Nils Lommen, Éléanore Meyer, Jürgen Giesl:
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper) - (Short Paper). 233-243 - Uwe Waldmann:
On the (In-)Completeness of Destructive Equality Resolution in the Superposition Calculus. 244-261
SAT, SMT and Quantifier Elimination
- Silvio Ghilardi, Lia M. Poidomani:
Model Completeness for Rational Trees. 265-283 - Nils Froleyks, Emily Yu, Armin Biere, Keijo Heljanko:
Certifying Phase Abstraction. 284-303 - Samuel Chassot, Viktor Kuncak:
Verifying a Realistic Mutable Hash Table - Case Study (Short Paper). 304-314 - Maximilian Heisinger, Simone Heisinger, Martina Seidl:
Booleguru, the Propositional Polyglot (Short Paper). 315-324 - Simone Heisinger, Maximilian Heisinger, Adrian Rebola-Pardo, Martina Seidl:
Quantifier Shifting for Quantified Boolean Formulas Revisited. 325-343 - Florian Frohn, Jürgen Giesl:
Satisfiability Modulo Exponential Integer Arithmetic. 344-365 - Adrien Pommellet, Daniel Stan, Simon Scatton:
SAT-Based Learning of Computation Tree Logic. 366-385 - Thomas Hader, Daniela Kaufmann, Ahmed Irfan, Stéphane Graham-Lengrand, Laura Kovács:
MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper). 386-395 - Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Magnus O. Myreen, Jakob Nordström:
Certified MaxSAT Preprocessing. 396-418 - Rui Ge, Ronald Garcia, Alexander J. Summers:
A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations. 419-438 - Peter Lammich:
Fast and Verified UNSAT Certificate Checking. 439-457 - Nestan Tsiskaridze, Clark W. Barrett, Cesare Tinelli:
Generalized Optimization Modulo Theories. 458-479
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.
last updated on 2025-07-15 20:37 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:
