论文信息 - Tree-based Heuristics in Modal Theorem Proving

Tree-based Heuristics in Modal Theorem Proving

We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas. We provide both the mathematical underpinnings and experimental results concerning our improved translation method.

Maarten de Rijke | Rosella Gennari | Carlos Areces | Juan Heguiabehere

[1] Ronald Fagin,et al. Reasoning about knowledge , 1995 .

[2] Joseph Y. Halpern. The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[3] Ullrich Hustadt,et al. On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.

[4] Johan van Benthem,et al. Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[5] Erich Grädel,et al. Why are Modal Logics so Robustly Decidable? , 2001, Bull. EATCS.

[6] M. de Rijke,et al. Encoding Two-Valued Nonclassical Logics in Classical Logic , 2001, Handbook of Automated Reasoning.

[7] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[8] Richard Spencer-Smith,et al. Modal Logic , 2007 .

[9] Moshe Y. Vardi. Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[10] Francesco M. Donini,et al. Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison , 2000, TABLEAUX.

[11] Ullrich Hustadt,et al. On Evaluating Decision Procedures for Modal Logics , 1997 .