| First order linear temporal logic over finite time structures S Cerrito, MC Mayer, S Praud Logic for Programming and Automated Reasoning: 6th International Conference …, 1999 | 45 | 1999 |
| Pattern matching as cut elimination S Cerrito, D Kesner Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 34 | 1999 |
| Bounded model search in linear temporal logic and its application to planning S Cerrito, MC Mayer International Conference on Automated Reasoning with Analytic Tableaux and …, 1998 | 32 | 1998 |
| Using linear temporal logic to model and solve planning problems S Cerrito, MC Mayer International Conference on Artificial Intelligence: Methodology, Systems …, 1998 | 31 | 1998 |
| A first step towardsmodeling semistructured data in hybrid multimodal logic N Bidoit, S Cerrito, V Thion Journal of Applied Non-Classical Logics 14 (4), 447-475, 2004 | 30 | 2004 |
| A linear semantics for allowed logic programs S Cerrito [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science …, 1990 | 30 | 1990 |
| Pattern matching as cut elimination S Cerrito, D Kesner Theoretical Computer Science 323 (1-3), 71-127, 2004 | 23 | 2004 |
| A polynomial translation of S4 into T and contraction–free tableaux for S4 S Cerrito, MC Mayer Logic Journal of IGPL 5 (2), 287-300, 1997 | 22 | 1997 |
| Nominal substitution at work with the global and converse modalities S Cerrito, MC Mayer Advances in Modal Logic (AIML 2010), 59--76, 2010 | 21 | 2010 |
| A linear axiomatization of negation as failure S Cerrito the Journal of Logic Programming 12 (1-2), 1-24, 1992 | 21 | 1992 |
| A general theorem prover for quantified modal logics V Thion, S Cerrito, MC Mayer Automated Reasoning with Analytic Tableaux and Related Methods …, 2002 | 15 | 2002 |
| A tableaux based decision procedure for a broad class of hybrid formulae with binders S Cerrito, M Cialdea Mayer International Conference on Automated Reasoning with Analytic Tableaux and …, 2011 | 14 | 2011 |
| Hintikka multiplicities in matrix decision methods for some propositional modal logics S Cerrito, MC Mayer Automated Reasoning with Analytic Tableaux and Related Methods …, 1997 | 14 | 1997 |
| Optimal tableaux-based decision procedure for testing satisfiability in the alternating-time temporal logic ATL+ S Cerrito, A David, V Goranko International Joint Conference on Automated Reasoning, 277-291, 2014 | 12 | 2014 |
| An efficient approach to nominal equalities in hybrid logic tableaux S Cerrito, MC Mayer Journal of Applied Non-Classical Logics 20 (1-2), 39-61, 2010 | 12 | 2010 |
| Ground and free-variable tableaux for variants of quantified modal logics MC Mayer, S Cerrito Studia Logica 69, 97-131, 2001 | 11 | 2001 |
| Herod and Pilate: two tableau provers for basic hybrid logic M Cialdea Mayer, S Cerrito Automated Reasoning: 5th International Joint Conference, IJCAR 2010 …, 2010 | 10 | 2010 |
| Variants of first-order modal logics M Cialdea Mayer, S Cerrito International Conference on Automated Reasoning with Analytic Tableaux and …, 2000 | 10 | 2000 |
| Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL+ S Cerrito, A David, V Goranko ACM Transactions on Computational Logic (TOCL) 17 (1), 1-34, 2015 | 9 | 2015 |
| Terminating tableaux for HL (@) without loop-cheking S Cerrito, MC Mayer | 9 | 2007 |
