Encoding Two-Valued Nonclassical Logics in Classical Logic

[1]  Maarten de Rijke,et al.  Tree-based Heuristics in Modal Theorem Proving , 2000, ECAI.

[2]  Steven K. Thomason.  Reduction of Tense Logic to Modal Logic. I , 1974, J. Symb. Log..

[3]  Larry Wos,et al.  Experiments in Automated Deduction with Condensed Detachment , 1992, CADE.

[4]  Ian Horrocks,et al.  An Analysis of Empirical Testing for Modal Decision Procedures , 2000, Log. J. IGPL.

[5]  Martin Otto,et al.  Undecidability Results on Two-Variable Logics , 1997, STACS.

[6]  Peter F. Patel-Schneider,et al.  DLP System Description , 1998, Description Logics.

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

[8]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[9]  Hans Jürgen Ohlbach.  Combining Hilbert Style and Semantic Reasoning in a Resolution Framework , 1998, CADE.

[10]  Margus Veanes,et al.  The two-variable guarded fragment with transitive relations , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[11]  Alberto Policriti,et al.  T-Theorem Proving I , 1995, J. Symb. Comput..

[12]  M. de Rijke,et al.  Expressiveness of Concept Expressions in First-Order Description Logics , 1999, Artif. Intell..

[13]  D. Gabbay.  An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames , 1981 .

[14]  J. Benthem.  DYNAMIC BITS AND PIECES , 1997 .

[15]  Christoph Walther,et al.  A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.

[16]  Reiner Hähnle,et al.  Tableaux and Related Methods , 2001, Handbook of Automated Reasoning.

[17]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[18]  D. Gabbay.  Expressive Functional Completeness in Tense Logic (Preliminary report) , 1981 .

[19]  Christian G. Fermüller,et al.  A non-elementary speed-up in proof length by structural clause form transformation , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[20]  Luis Fariñas del Cerro,et al.  Linear Modal Deductions , 1988, CADE.

[21]  Xiao-Shan Gao,et al.  Automated Reasoning in Geometry , 2001, Handbook of Automated Reasoning.

[22]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[23]  D. Gabbay.  Decidability results in non-classical logics: Part I , 1975 .

[24]  K. Schütte.  Untersuchungen zum Entscheidungsproblem der mathematischen Logik , 1934 .

[25]  Herman Geuvers,et al.  Proof-Assistants Using Dependent Type Systems , 2001, Handbook of Automated Reasoning.

[26]  Dov M. Gabbay,et al.  Temporal logic (vol. 1): mathematical foundations and computational aspects , 1994 .

[27]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[28]  Reinhold Letz,et al.  Model Elimination and Connection Tableau Procedures , 2001, Handbook of Automated Reasoning.

[29]  Andreas Herzig.  Raisonnement automatique en logique modale et algorithmes d'unification , 1989 .

[30]  Christoph Weidenbach,et al.  Optimised Functional Translation and Resolution , 1998 .

[31]  Hans Jürgen Ohlbach,et al.  A Resolution Calculus for Modal Logics , 1988, CADE.

[32]  Renate A. Schmidt.  E-Unification for Subsystems of S4 , 1998, RTA.

[33]  Hans Jürgen Ohlbach,et al.  Semantics-Based Translation Methods for Modal Logics , 1991, J. Log. Comput..

[34]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[35]  Igor Walukiewicz,et al.  On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.

[36]  Andreas Nonnengart,et al.  Resolution-Based Calculi for Modal and Temporal Logics , 1996, CADE.

[37]  Diego Calvanese,et al.  Reasoning in Expressive Description Logics , 2001, Handbook of Automated Reasoning.

[38]  M. de Rijke,et al.  Description and/or hybrid logic , 2000 .

[39]  Krister Segerberg,et al.  An essay in classical modal logic , 1971 .

[40]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[41]  Arild Waaler,et al.  Connections in Nonclassical Logics , 2001, Handbook of Automated Reasoning.

[42]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[43]  Andreas Nonnengart.  First-order modal logic theorem proving and standard PROLOG , 1992 .

[44]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[45]  Nils Klarlund,et al.  Mona: Monadic Second-Order Logic in Practice , 1995, TACAS.

[46]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[47]  I. V. Ramakrishnan,et al.  Term Indexing , 1995, Lecture Notes in Computer Science.

[48]  Johan van Benthem,et al.  Modal Deduction in Second-Order Logic and Set Theory - II , 1998, Stud Logica.

[49]  Andrei Voronkov,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[50]  Marcus Kracht,et al.  Normal monomodal logics can simulate all others , 1999, Journal of Symbolic Logic.

[51]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[52]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[53]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[54]  Renate A. Schmidt,et al.  Resolution is a Decision Procedure for Many Propositional Modal Logics , 1996, Advances in Modal Logic.

[55]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

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

[57]  Harald Ganzinger,et al.  A superposition decision procedure for the guarded fragment with equality , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[58]  M. de Rijke.  Extending modal logic , 1993 .

[59]  Marta Cialdea Mayer,et al.  A Polynomial Translation of S4 into T and Contraction-Free Tableaux for S4 , 1997, Log. J. IGPL.

[60]  Christoph Weidenbach,et al.  Combining Superposition, Sorts and Splitting , 2001, Handbook of Automated Reasoning.

[61]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[62]  Henrik Sahlqvist.  Completeness and Correspondence in the First and Second Order Semantics for Modal Logic , 1975 .

[63]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[64]  R. Schmidt.  Optimised modal translation and resolution , 1997 .

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

[66]  Nils Klarlund,et al.  Automata based symbolic reasoning in hardware verification , 1998, FM-Trends 1998.

[67]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

[68]  L. Kalmár.  Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten , 1933 .

[69]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[70]  Petr Hájek,et al.  Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.

[71]  Andrei Voronkov,et al.  Equality Reasoning in Sequent-Based Calculi , 2001, Handbook of Automated Reasoning.

[72]  Faron Moller,et al.  On the expressive power of CTL , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[73]  Jean Goubault-Larrecq,et al.  Normal Form Transformations , 2001, Handbook of Automated Reasoning.

[74]  Peter Graf,et al.  Term Indexing , 1996, Lecture Notes in Computer Science.

[75]  Dov M. Gabbay.  On decidable, finitely axiomatizable, modal and tense logics without the finite model property Part II , 1971 .

[76]  Ulrich Furbach,et al.  Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.

[77]  Alan Bundy,et al.  The Automation of Proof by Mathematical Induction , 1999, Handbook of Automated Reasoning.

[78]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[79]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[80]  Leon Henkin.  Logical systems containing only a finite number of symbols , 1966 .

[81]  Frank Pfenning,et al.  Logical Frameworks , 2001, Handbook of Automated Reasoning.

[82]  Michael J. Maher,et al.  Solving Numerical Constraints , 2001, Handbook of Automated Reasoning.

[83]  Ullrich Hustadt.  Resolution based decision procedures for subclasses of first-order logic , 1999 .

[84]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[85]  Peter B. Andrews.  Classical Type Theory , 2001, Handbook of Automated Reasoning.

[86]  Willard Van Orman Quine,et al.  From a Logical Point of View , 1955 .

[87]  D. Gabbay.  Decidability results in non-classical logic. III , 1971 .

[88]  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..

[89]  Christian G. Fermüller,et al.  Resolution Decision Procedures , 2001, Handbook of Automated Reasoning.

[90]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[91]  M. de Rijke,et al.  Bisimulations for Temporal Logic , 1997, J. Log. Lang. Inf..

[92]  Patrice Enjalbert,et al.  Modal Theorem Proving: An Equational Viewpoint , 1989, IJCAI.

[93]  Stéphane Demri,et al.  An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic , 1998, FTP.

[94]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[95]  Gilles Dowek,et al.  Higher-Order Unification and Matching , 2001, Handbook of Automated Reasoning.

[96]  M. de Rijke,et al.  Description and/or Hybrid Logics , 2000 .

[97]  Johan van Benthem,et al.  Modal Deduction in Second-Order Logic and Set Theory - I , 1997, J. Log. Comput..

[98]  Renate A. Schmidt,et al.  Functional Translation and Second-Order Frame Properties of Modal Logics , 1997, J. Log. Comput..

[99]  Andreas Nonnengart,et al.  First-Order Modal Logic Theorem Proving and Functional Simulation , 1993, IJCAI.

[100]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[101]  Christian G. Fermüller,et al.  Automated Deduction for Many-Valued Logics , 2001, Handbook of Automated Reasoning.

[102]  Graham Wrightson,et al.  Solving a Problem in Relevance Logic with an Automated Theorem Prover , 1984, CADE.

[103]  Martin D. Davis,et al.  The Early History of Automated Deduction , 2001, Handbook of Automated Reasoning.

[104]  Eric Rosen,et al.  Modal Logic over Finite Structures , 1997, J. Log. Lang. Inf..

[105]  Hans de Nivelle,et al.  A Resolution Decision Procedure for the Guarded Fragment , 1998, CADE.

[106]  Andreas Nonnengart.  A resolution-based calculus for temporal logics , 1995 .