default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automated Reasoning, Volume 66
Volume 66, Number 1, February 2022
- Sarah Sigley, Olaf Beyersdorff
:
Proof Complexity of Modal Resolution. 1-41 - Maria Paola Bonacina, Stéphane Graham-Lengrand, Natarajan Shankar:
Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs. 43-91 - Jonathan Julián Huerta y Munive, Georg Struth:
Predicate Transformer Semantics for Hybrid Systems. 93-139 - Sadegh Dalvandi, Brijesh Dongol, Simon Doherty, Heike Wehrheim:
Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL. 141-171 - André Platzer:
Correction to: Differential Dynamic Logic for Hybrid Systems. 173
Volume 66, Number 2, May 2022
- Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq Formalization of Lebesgue Integration of Nonnegative Functions. 175-213 - Robert Y. Lewis, Minchao Wu:
A Bi-Directional Extensible Interface Between Lean and Mathematica. 215-238 - Piotr Wojciechowski, K. Subramani, R. Chandrasekaran:
Analyzing Read-Once Cutting Plane Proofs in Horn Systems. 239-274
Volume 66, Number 3, August 2022
- Nicolas Peltier, Viorica Sofronie-Stokkermans:
Special Issue of Selected Extended Papers of IJCAR 2020. 275-276 - Joshua Brakensiek, Marijn Heule, John Mackey, David E. Narváez:
The Resolution of Keller's Conjecture. 277-300 - Franz Baader, Deepak Kapur:
Deciding the Word Problem for Ground and Strongly Shallow Identities w.r.t. Extensional Symbols. 301-329 - Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Polite Combination of Algebraic Datatypes. 331-355 - Franz Baader, Jakub Rydval:
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains. 357-407 - Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin:
Combination of Uniform Interpolants via Beth Definability. 409-435
Volume 66, Number 4, November 2022
- Maria Paola Bonacina:
Six Decades of Automated Reasoning: Papers in Memory of Larry Wos. 437-438 - Michael Beeson, Maria Paola Bonacina, Michael Kinyon, Geoff Sutcliffe:
Larry Wos: Visions of Automated Reasoning. 439-461 - Maria Paola Bonacina:
Set of Support, Demodulation, Paramodulation: A Historical Perspective. 463-497 - Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette:
A Comprehensive Framework for Saturation Theorem Proving. 499-539 - Petar Vukmirovic, Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Visa Nummelin, Sophie Tourret:
Making Higher-Order Superposition Work. 541-564 - Robert Veroff:
A Wos Challenge Met. 565-574 - Sophie Tourret, Christoph Weidenbach:
A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column. 575-584
- Andreas Lochbihler:
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory. 585-610 - Anne Baanen, Sander R. Dahmen, Ashvni Narayanan, Filippo A. E. Nuccio Mortarino Majno di Capriglio:
A Formalization of Dedekind Domains and Class Groups of Global Fields. 611-637 - Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Local is Best: Efficient Reductions to Modal Logic K. 639-666 - Akihisa Yamada:
Tuple Interpretations for Termination of Term Rewriting. 667-688 - Predrag Janicic, Julien Narboux:
Theorem Proving as Constraint Solving with Coherent Logic. 689-746 - David J. Pearce, Mark Utting, Lindsay Groves:
Verifying Whiley Programs with Boogie. 747-803 - Joshua Meyers, David I. Spivak, Ryan Wisnesky:
Fast Left Kan Extensions Using the Chase. 805-844 - Dennis de Champeaux:
Faster Linear Unification Algorithm. 845-860 - Nuno Macedo, Julien Brunel, David Chemouil, Alcino Cunha:
Pardinus: A Temporal Relational Model Finder. 861-904 - Mallku Soldevila, Beta Ziliani, Bruno Silvestre:
From Specification to Testing: Semantics Engineering for Lua 5.2. 905-952 - Richard Schmoetten, Jake E. Palmer, Jacques D. Fleuriot:
Towards Formalising Schutz' Axioms for Minkowski Spacetime in Isabelle/HOL. 953-988 - Wilmer Ricciotti, James Cheney:
A Formalization of SQL with Nulls. 989-1030 - Thiago Mendonça Ferreira Ramos, Ariane Alves Almeida, Mauricio Ayala-Rincón:
Formalization of the Computational Theory of a Turing Complete Functional Language Model. 1031-1063 - Jose Divasón, René Thiemann:
A Formalization of the Smith Normal Form in Higher-Order Logic. 1065-1095 - Jose Divasón, René Thiemann:
Correction to: A Formalization of the Smith Normal Form in Higher-Order Logic. 1097 - Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
Correction to: Local is Best: Efficient Reductions to Modal Logic K. 1099
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-02-28 21:52 CET 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:
