Jens Otten

Revantha Ramanayake

Proceedings of the 5th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2024) affiliated with the 12th International Joint Conference on Automated Reasoning (IJCAR 2024), 2024

2023

Connections: Markov Decision Processes for Classical, Intuitionistic and Modal Connection Calculi.

[BibT_eX]

[DOI]

Fredrik Rømming

Sean B. Holden

Proceedings of the 1st International Workshop on Automated Reasoning with Connection Calculi (AReCCa 2023) affiliated with the 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2023), 2023

A Syntax for Connection Proofs.

[BibT_eX]

[DOI]

Sean B. Holden

20 Years of leanCoP - An Overview of the Provers.

[BibT_eX]

[DOI]

2022

A Highly-Integrated 20-300V 0.5W Active-Clamp Flyback DCDC Converter with 76.7% Peak Efficiency.

[BibT_eX]

[DOI]

Christoph Rindfleisch

Bernhard Wicht

Proceedings of the IEEE Custom Integrated Circuits Conference, 2022

Advancing Automated Theorem Proving for the Modal Logics D and S5.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022) affiliated with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022), 2022

2021

The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

2020

Equality Preprocessing in Connection Calculi.

[BibT_eX]

[DOI]

Benjamin E. Oliver

Proceedings of the Joint Proceedings of the 7th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 5th Satisfiability Checking and Symbolic Computation Workshop (SC-Square) Workshop, 2020

2019

Converting ALC Connection Proofs into ALC Sequents.

[BibT_eX]

[DOI]

Eunice Palmeira da Silva

Fred Freitas

Proceedings of the Proceedings Sixth Workshop on Proof eXchange for Theorem Proving, 2019

2018

The Pocket Reasoner -- Automatic Reasoning on Small Devices.

[BibT_eX]

[DOI]

Proceedings of the 31st Norsk Informatikkonferanse, 2018

Proof Search Optimizations for Non-Clausal Connection Calculi.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Practical Aspects of Automated Reasoning co-located with Federated Logic Conference 2018 (FLoC 2018), 2018

2017

Non-clausal Connection Calculi for Non-classical Logics.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

RACCOON: A Connection Reasoner for the Description Logic ALC.

[BibT_eX]

[DOI]

Dimas Melo Filho

Fred Freitas

Proceedings of the LPAR-21, 2017

nanoCoP: Natural Non-clausal Theorem Proving.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Advances in Connection-Based Automated Theorem Proving.

[BibT_eX]

[DOI]

Wolfgang Bibel

Proceedings of the Provably Correct Systems, 2017

2016

Non-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2016) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2016)., 2016

nanoCoP: A Non-clausal Connection Prover.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

A Connection Calculus for the Description Logic <i>ALC</i>.

[BibT_eX]

[DOI]

Fred Freitas

Proceedings of the Advances in Artificial Intelligence, 2016

2014

Problem Libraries for Non-Classical Logics.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning in Quantified Non-Classical Logics, 2014

MleanCoP: A Connection Prover for First-Order Modal Logic.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

Connection calculi for automated theorem proving in classical and non-classical logics.

[BibT_eX]

[DOI]

PhD thesis, 2013

Konnektionskalküle für automatisches Beweisen in klassischen und nicht-klassischen Logiken.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2013, 2013

2012

Implementing Connection Calculi for First-order Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the IWIL 2012: The 9th International Workshop on the Implementation of Logics, 2012

Implementing and Evaluating Provers for First-order Modal Logics.

[BibT_eX]

[DOI]

Christoph Benzmüller

Proceedings of the ECAI 2012, 2012

The QMLTP Problem Library for First-Order Modal Logics.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

Implementing Different Proof Calculi for First-order Modal Logics.

[BibT_eX]

[DOI]

Christoph Benzmüller

Proceedings of the Third Workshop on Practical Aspects of Automated Reasoning, 2012

2011

Implementing and Evaluating Theorem Provers for First-Order Modal Logics.

[BibT_eX]

Proceedings of the TABLEAUX 2011, 2011

A Non-clausal Connection Calculus.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

2010

Restricting backtracking in connection calculi.

[BibT_eX]

[DOI]

AI Commun., 2010

Specifying and Verifying Organizational Security Properties in First-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the Verification, Induction, Termination Analysis, 2010

2008

randoCoP: Randomizing the Proof Search Order in the Connection Calculus.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Practical Aspects of Automated Reasoning, 2008

leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions).

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

The ILTP Problem Library for Intuitionistic Logic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2007

2005

The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

2003

leanCoP: lean connection-based theorem proving.

[BibT_eX]

[DOI]

Wolfgang Bibel

J. Symb. Comput., 2003

2000

Matrix-based Constructive Theorem Proving.

[BibT_eX]

Proceedings of the Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday), 2000

1999

Connection-based Theorem Proving in Classical and Non-classical Logics.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

linTAP: A Tableau Prover for Linear Logic.

[BibT_eX]

[DOI]

Heiko Mantel

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

1997

ileanTAP: An Intuitionistic Theorem Prover.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

A Multi-level Approach to Program Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1997

Connection-Based Proof Construction in Linear Logic.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 1997

1996

T-String Unification: Unifying Prefixes in Non-classical Proof Methods.

[BibT_eX]

[DOI]

Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

A Uniform Proof Procedure for Classical and Non-Classical Logics.

[BibT_eX]

[DOI]

Proceedings of the KI-96: Advances in Artificial Intelligence, 1996

1995

A Connection Based Proof Method for Intuitionistic Logic.

[BibT_eX]

[DOI]

Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

Guiding Program Development Systems by a Connection Based Proof Strategy.

[BibT_eX]

[DOI]