| Efficient Sat-Based Proof Search In Intuitionistic Propositional Logic | 0 | 0.34 | 2021 |
| A Forward Internal Calculus For Model Generation In S4 | 0 | 0.34 | 2021 |
| Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic. | 0 | 0.34 | 2020 |
| Connections Between Answer Set Semantics and Information Terms Semantics in Constructive EL_bot (Extended Abstract). | 0 | 0.34 | 2020 |
| Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic | 0 | 0.34 | 2020 |
| A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms. | 0 | 0.34 | 2020 |
| Reasoning on Information Term Semantics with ASP for Constructive ELꓕ. | 0 | 0.34 | 2020 |
| An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic. | 0 | 0.34 | 2019 |
| Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic. | 0 | 0.34 | 2019 |
| Forward Countermodel Construction in Modal Logic K. | 0 | 0.34 | 2018 |
| From Constructivism to Logic Programming: an Homage to Mario Ornaghi. | 0 | 0.34 | 2018 |
| Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic. | 0 | 0.34 | 2018 |
| Proof-Search in Hilbert Calculi. | 0 | 0.34 | 2017 |
| JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. | 2 | 0.38 | 2017 |
| A Forward Unprovability Calculus for Intuitionistic Propositional Logic. | 0 | 0.34 | 2017 |
| LOGI: A Didactic Tool for a Beginners' Course in Logic (System Description). | 0 | 0.34 | 2017 |
| Proof-Search in Natural Deduction Calculus for Classical Propositional Logic. | 3 | 0.47 | 2015 |
| A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic. | 1 | 0.36 | 2015 |
| Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations. | 0 | 0.34 | 2015 |
| Terminating sequent calculi for proving and refuting formulas in S4. | 0 | 0.34 | 2015 |
| An Evaluation-Driven Decision Procedure for G3i | 6 | 0.57 | 2015 |
| Focusing on Contraction. | 0 | 0.34 | 2013 |
| Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models | 11 | 0.74 | 2013 |
| A Terminating Evaluation-Driven Variant of G3i. | 6 | 0.58 | 2013 |
| Simplification Rules for Intuitionistic Propositional Tableaux | 6 | 0.55 | 2012 |
| BCDL\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic | 0 | 0.34 | 2010 |
| A constructive approach to testing model transformations | 16 | 0.67 | 2010 |
| FCUBE: an efficient prover for intuitionistic propositional logic | 13 | 0.85 | 2010 |
| A decidable constructive description logic | 5 | 0.56 | 2010 |
| A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications | 2 | 0.42 | 2009 |
| Applying ASP to UML Model Validation | 2 | 0.44 | 2009 |
| Towards a Type Discipline for Answer Set Programming | 1 | 0.39 | 2008 |
| Snapshot Generation in a Constructive Object-Oriented Modeling Language | 4 | 0.47 | 2007 |
| A Constructive Semantics for ALC | 8 | 0.66 | 2007 |
| ESBC: an application for computing stabilization bounds | 2 | 0.40 | 2006 |
| A Constructive Object Oriented Modeling Language for Information Systems | 5 | 0.46 | 2006 |
| On the complexity of the disjunction property in intuitionistic and modal logics | 3 | 0.43 | 2005 |
| A secondary semantics for Second Order Intuitionistic Propositional Logic | 0 | 0.34 | 2004 |
| A Proof-theoretical Analysis of Semiconstructive Intermediate Theories | 2 | 0.41 | 2003 |
| Combining word problems through rewriting in categories with products | 10 | 0.82 | 2003 |
| Tableau Calculi for the Logics of Finite k-Ary Trees | 0 | 0.34 | 2002 |
| On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics | 1 | 0.38 | 2002 |
| Extracting information from intermediate semiconstructive HA-systems – extended abstract | 1 | 0.38 | 2001 |
| Hypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics | 0 | 0.34 | 2001 |
| Extracting Exact Time Bounds from Logical Proofs | 3 | 0.56 | 2001 |
| All Intermediate Logics with Extra Axions in One Variable, Except Eight, Are Not Strongly omega-Complete | 0 | 0.34 | 2000 |
| A formal framework for synthesis and verification of logic programs | 3 | 0.44 | 2000 |
| A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications | 3 | 0.44 | 1999 |
| On maximal intermediate predicate constructive logics | 2 | 0.41 | 1996 |
