| Publication | Date of Publication | Type |
|---|
General clauses for SAT-based proof search in intuitionistic propositional logic
Journal of Automated Reasoning | 2024-09-27 | Paper |
SAT-based proof search in intermediate propositional logics
| 2022-12-07 | Paper |
Efficient SAT-based proof search in intuitionistic propositional logic
| 2021-12-01 | Paper |
A forward internal calculus for model generation in S4
Journal Of Logic And Computation | 2021-09-22 | Paper |
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
| 2020-05-14 | Paper |
Goal-oriented proof-search in natural deduction for intuitionistic propositional logic
Journal of Automated Reasoning | 2019-02-15 | Paper |
From Constructivism to Logic Programming: an Homage to Mario Ornaghi
Fundamenta Informaticae | 2018-10-02 | Paper |
A forward unprovability calculus for intuitionistic propositional logic
| 2018-02-02 | Paper |
JTabWb: a Java framework for implementing terminating sequent and tableau calculi
Fundamenta Informaticae | 2017-11-10 | Paper |
On the complexity of the disjunction property in intuitionistic and modal logics
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
A semantical analysis of focusing and contraction in intuitionistic logic
Fundamenta Informaticae | 2016-08-15 | Paper |
Proof-Search in Natural Deduction Calculus for Classical Propositional Logic
Lecture Notes in Computer Science | 2015-12-11 | Paper |
Simplification Rules for Intuitionistic Propositional Tableaux
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
An evaluation-driven decision procedure for G3i
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models
Journal of Automated Reasoning | 2015-06-23 | Paper |
Terminating sequent calculi for proving and refuting formulas in S4
Journal Of Logic And Computation | 2015-02-26 | Paper |
A Terminating Evaluation-Driven Variant of G3i
Lecture Notes in Computer Science | 2013-10-04 | Paper |
fCube: an efficient prover for intuitionistic propositional logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
A Decidable Constructive Description Logic
Logics in Artificial Intelligence | 2010-10-01 | Paper |
\(\mathcal {BCDL}\): Basic constructive description logic
Journal of Automated Reasoning | 2010-05-26 | Paper |
A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
Towards a Type Discipline for Answer Set Programming
Lecture Notes in Computer Science | 2009-07-02 | Paper |
Snapshot Generation in a Constructive Object-Oriented Modeling Language
Logic-Based Program Synthesis and Transformation | 2009-01-22 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
scientific article; zbMATH DE number 2090126 (Why is no real title available?)
| 2004-08-12 | Paper |
A secondary semantics for Second Order Intuitionistic Propositional Logic
MLQ | 2004-03-29 | Paper |
scientific article; zbMATH DE number 1980925 (Why is no real title available?)
| 2003-09-15 | Paper |
scientific article; zbMATH DE number 1973214 (Why is no real title available?)
| 2003-09-01 | Paper |
Combining word problems through rewriting in categories with products
Theoretical Computer Science | 2003-07-29 | Paper |
scientific article; zbMATH DE number 1950257 (Why is no real title available?)
| 2003-07-17 | Paper |
A proof-theoretical analysis of semiconstructive intermediate theories
Studia Logica | 2003-04-27 | Paper |
Hypercanonicity, extensive canonicity, canonicity and strong completeness of intermediate propositional logics
Reports on Mathematical Logic | 2002-07-22 | Paper |
Extracting information from intermediate semiconstructive HA-systems -- extended abstract
MSCS. Mathematical Structures in Computer Science | 2001-10-10 | Paper |
A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
Logic Journal of the IGPL | 2000-01-30 | Paper |
All intermediate logics with extra axioms in one variable except eight are not strongly \(\omega\)-complete.
The Journal of Symbolic Logic | 2000-01-01 | Paper |
On maximal intermediate predicate constructive logics
Studia Logica | 1997-01-16 | Paper |
