| Forward Countermodel Construction in Modal Logic K. | 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 |
| Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations. | 0 | 0.34 | 2015 |
| An Evaluation-Driven Decision Procedure for G3i | 6 | 0.57 | 2015 |
| 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 |
| Terminating Calculi for Propositional Dummett Logic with Subformula Property | 2 | 0.39 | 2012 |
| Simplification Rules for Intuitionistic Propositional Tableaux | 6 | 0.55 | 2012 |
| Refutation in dummett logic using a sign to express the truth at the next possible world | 2 | 0.40 | 2011 |
| BCDL\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic | 0 | 0.34 | 2010 |
| Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus | 7 | 0.55 | 2010 |
| Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge. | 1 | 0.37 | 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 |
| Optimization techniques for propositional intuitionistic logic and their implementation | 8 | 0.65 | 2008 |
| Improvements to the Tableau Prover PITP | 1 | 0.37 | 2007 |
| A Constructive Semantics for ALC | 8 | 0.66 | 2007 |
| ESBC: an application for computing stabilization bounds | 2 | 0.40 | 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 |
| Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics | 2 | 0.40 | 2002 |
| 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 |
| An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic | 7 | 0.60 | 2001 |
| Efficient learning with equivalence queries of conjunctions of modulo functions | 2 | 0.45 | 1995 |
