, Tableaux'98 Results

C. Areces and M. De-rijke, Computational modal logic, 2003.

A. Balint, A. Belov, M. Järvisalo, and C. Sinz, Overview and analysis of the SAT Challenge 2012 solver competition, Artif. Intell, vol.223, pp.120-155, 2015.

P. Balsiger and A. Heuerding, Comparison of theorem provers for modal logics : introduction and summary, Autom. Reasoning with Analytic Tableaux and Related Methods, pp.25-26, 1998.

P. Balsiger, A. Heuerding, and S. Schwendimann, A Benchmark Method for the Propositional Modal Logics K, KT, S4, J. Autom. Reasoning, vol.24, issue.3, pp.297-317, 2000.

D. Challenge, Satisfiability: Suggested Format. DIMACS Challenge. DIMACS, 1993.

E. M. Clarke, O. Grumberg, and D. Peled, Model checking, 1999.

L. A. Dennis, M. Fisher, N. Lincoln, A. Lisitsa, and S. M. Veres, Practical Verification of Decision-Making in Agent-Based Autonomous Systems, 2013.

N. Eén and N. Sörensson, An Extensible SAT-solver, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Selected Revised Papers, pp.502-518, 2003.

P. Enjalbert and L. F. Del-cerro, Modal Resolution in Clausal Form, Theor. Comput. Sci, vol.65, issue.1, pp.1-33, 1989.

O. Gasquet, A. Herzig, B. Said, and F. Schwarzentruber, Kripke's Worlds -An Introduction to Modal Logics via Tableaux. Studies in Universal Logic, 2014.

E. Giunchiglia and A. Tacchella, System description: *SAT: A platform for the development of modal decision procedures, Automated Deduction -CADE-17 Proceedings, pp.291-296, 2000.

E. Giunchiglia, A. Tacchella, and F. Giunchiglia, SAT-Based Decision Procedures for Classical Modal Logics, J. Automated Reasoning, vol.28, issue.2, pp.143-171, 2002.

D. Götzmann, M. Kaminski, and G. Smolka, Spartacus: A Tableau Prover for Hybrid Logic, ENTCS, vol.262, pp.127-139, 2010.

J. Y. Halpern and Y. Moses, A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief, Artificial Intelligence, vol.54, issue.2, pp.319-379, 1992.

A. Heuerding, G. Jäger, S. Schwendimann, and M. Seyfried, Propositional logics on the computer, Theorem Proving with Analytic Tableaux and Related Methods, pp.310-323, 1995.

M. Heule, W. A. , and N. Wetzler, Trimming while checking clausal proofs, FMCAD 2013, pp.181-188, 2013.

G. Jaeger, P. Balsiger, A. Heuerding, and S. Schwendiman, LWB 1.1 Manual. Unpublished, 1997.

M. Järvisalo, D. L. Berre, O. Roussel, and L. Simon, The International SAT Solver Competitions. AI Magazine, vol.33, issue.1, 2012.

M. Kaminski and T. Tebbi, InKreSAT: Modal Reasoning via Incremental Reduction to SAT, Automated Deduction -CADE-24 Proceedings, pp.436-442, 2013.

S. A. Kripke, Semantical analysis of modal logic i normal modal propositional calculi, Mathematical Logic Quarterly, vol.9, issue.5-6, pp.67-96, 1963.

R. E. Ladner, The computational complexity of provability in systems of modal propositional logic, SIAM Journal of Computing, 1977.

F. Massacci, Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison, Autom. Reasoning, International Conf., '99 Proceedings, pp.14-18, 1999.

F. Massacci and F. M. Donini, Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison, Autom. Reasoning., International Conf., 2000 Proceedings, pp.52-56, 2000.

M. Narizzano, C. Peschiera, L. Pulina, and A. Tacchella, Evaluating and certifying QBFs: A comparison of state-of-the-art tools, AI Communications, vol.22, issue.4, pp.191-210, 2009.

P. Patel-schneider and B. Swartout, Description-logic knowledge representation system specification from the KRSS group of the ARPA knowledge sharing effort, 1993.

O. Roussel, Controlling a solver execution with the runsolver tool system description, Boolean Modeling and Computation, vol.7, pp.139-144, 2011.

A. Saffidine, Minimal proof search for modal logic K model checking, 2012.

M. Schmidt-schauß and G. Smolka, Attributive Concept Descriptions with Complements, Artificial Intelligence, vol.48, issue.1, pp.1-26, 1991.

R. Sebastiani and M. Vescovi, Automated reasoning in modal and description logics via SAT encoding: the case study of k(m)/alc-satisfiability, J. Artif. Intell. Res. (JAIR), vol.35, pp.343-389, 2009.

L. Simon, D. Berre, and E. A. Hirsch, The SAT2002 competition, Annals of Mathematics and Artificial Intelligence, vol.43, issue.1, pp.307-342, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00022662

W. A. Trybulec, Pigeon hole principle, JFM, vol.2, p.0, 1990.

D. Tsarkov and I. Horrocks, FACT++ Description Logic Reasoner: System Description, IJCAR 2006 Proceedings, pp.292-297, 2006.

C. Weidenbach, U. Brahm, T. Hillenbrand, E. Keen, C. Theobald et al., Spass Version 2.0, Aut. Deduction CADE18, pp.275-279, 2002.

H. Zhang, SATO: An Efficient Propositional Prover, Automated Deduction -CADE-14 Proceedings, pp.272-275, 1997.