Journal of Automated Reasoning 4/2022

18.07.2022

Six Decades of Automated Reasoning: Papers in Memory of Larry Wos

Foreword

Maria Paola Bonacina

28.02.2022

Larry Wos: Visions of Automated Reasoning

Michael Beeson, Maria Paola Bonacina, Michael Kinyon, Geoff Sutcliffe

Open Access 24.05.2022

Set of Support, Demodulation, Paramodulation: A Historical Perspective

Maria Paola Bonacina

PDF-Version jetzt herunterladen Zum Volltext

Open Access 07.06.2022

A Comprehensive Framework for Saturation Theorem Proving

Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette

PDF-Version jetzt herunterladen Zum Volltext

17.01.2022

Making Higher-Order Superposition Work

Petar Vukmirović, Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Visa Nummelin, Sophie Tourret

09.01.2022

A Wos Challenge Met

Robert Veroff

Open Access 01.02.2022

A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column

Sophie Tourret, Christoph Weidenbach

PDF-Version jetzt herunterladen Zum Volltext

15.01.2022

A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory

Andreas Lochbihler

Open Access 08.09.2022

A Formalization of Dedekind Domains and Class Groups of Global Fields

Anne Baanen, Sander R. Dahmen, Ashvni Narayanan, Filippo A. E. Nuccio Mortarino Majno di Capriglio

PDF-Version jetzt herunterladen Zum Volltext

Open Access 23.05.2022

Local is Best: Efficient Reductions to Modal Logic K

Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon

PDF-Version jetzt herunterladen Zum Volltext

25.07.2022

Tuple Interpretations for Termination of Term Rewriting

Akihisa Yamada

20.05.2022

Theorem Proving as Constraint Solving with Coherent Logic

Predrag Janičić, Julien Narboux

Open Access 20.03.2022

Verifying Whiley Programs with Boogie

David J. Pearce, Mark Utting, Lindsay Groves

PDF-Version jetzt herunterladen Zum Volltext

06.07.2022

Fast Left Kan Extensions Using the Chase

Joshua Meyers, David I. Spivak, Ryan Wisnesky

12.08.2022

Faster Linear Unification Algorithm

Dennis de Champeaux

12.09.2022

Pardinus: A Temporal Relational Model Finder

Nuno Macedo, Julien Brunel, David Chemouil, Alcino Cunha

11.08.2022

From Specification to Testing: Semantics Engineering for Lua 5.2

Mallku Soldevila, Beta Ziliani, Bruno Silvestre

Open Access 01.10.2022

Towards Formalising Schutz’ Axioms for Minkowski Spacetime in Isabelle/HOL

Richard Schmoetten, Jake E. Palmer, Jacques D. Fleuriot

PDF-Version jetzt herunterladen Zum Volltext

Open Access 27.07.2022

A Formalization of SQL with Nulls

Wilmer Ricciotti, James Cheney

PDF-Version jetzt herunterladen Zum Volltext

30.01.2022

Formalization of the Computational Theory of a Turing Complete Functional Language Model

Thiago Mendonça Ferreira Ramos, Ariane Alves Almeida, Mauricio Ayala-Rincón

Open Access 26.05.2022

A Formalization of the Smith Normal Form in Higher-Order Logic

Jose Divasón, René Thiemann

PDF-Version jetzt herunterladen Zum Volltext

Open Access 06.08.2022 | Correction

Correction to: A Formalization of the Smith Normal Form in Higher-Order Logic

Jose Divasón, René Thiemann

PDF-Version jetzt herunterladen Zum Volltext

Open Access 14.09.2022 | Correction

Correction to: Local is Best: Efficient Reductions to Modal Logic K

Fabio Papacchini, Cláudia Nalon, Ullrich Hustadt, Clare Dixon

PDF-Version jetzt herunterladen Zum Volltext

Springer Professional

Journal of Automated Reasoning

Ausgabe 4/2022

Special issue on Six Decades of Automated Reasoning: Papers in Memory of Larry Wos (437-584)

Inhaltsverzeichnis (23 Artikel)

Six Decades of Automated Reasoning: Papers in Memory of Larry Wos

Larry Wos: Visions of Automated Reasoning

Set of Support, Demodulation, Paramodulation: A Historical Perspective

A Comprehensive Framework for Saturation Theorem Proving

Making Higher-Order Superposition Work

A Wos Challenge Met

A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column

A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory

A Formalization of Dedekind Domains and Class Groups of Global Fields

Local is Best: Efficient Reductions to Modal Logic K

Tuple Interpretations for Termination of Term Rewriting

Theorem Proving as Constraint Solving with Coherent Logic

Verifying Whiley Programs with Boogie

Fast Left Kan Extensions Using the Chase

Faster Linear Unification Algorithm

Pardinus: A Temporal Relational Model Finder

From Specification to Testing: Semantics Engineering for Lua 5.2

Towards Formalising Schutz’ Axioms for Minkowski Spacetime in Isabelle/HOL

A Formalization of SQL with Nulls

Formalization of the Computational Theory of a Turing Complete Functional Language Model

A Formalization of the Smith Normal Form in Higher-Order Logic

Correction to: A Formalization of the Smith Normal Form in Higher-Order Logic

Correction to: Local is Best: Efficient Reductions to Modal Logic K

Aktuelle Ausgaben

Ausgabe 1/2023

Ausgabe 4/2022

Ausgabe 3/2022

Ausgabe 2/2022

Ausgabe 1/2022

Ausgabe 8/2021

Ausgabe 7/2021

Ausgabe 6/2021

Ausgabe 5/2021

Ausgabe 4/2021

Premium Partner