A Resolution-Based Calculus for Preferential Logics

The vast majority of modal theorem provers implement modal tableau, or backwards proof search in (cut-free) sequent calculi. The design of suitable calculi is highly non-trivial, and employs nested sequents, labelled sequents and/or specifically designated transitional formulae. Theorem provers for first-order logic, on the other hand, are by and large based on resolution. In this paper, we present a resolution system for preference-based modal logics, specifically Burgess’ system Open image in new window . Our main technical results are soundness and completeness. Conceptually, we argue that resolution-based systems are not more difficult to design than cut-free sequent calculi but their purely syntactic nature makes them much better suited for implementation in automated reasoning systems.

[1]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[3]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

[4]  Bernhard Beckert,et al.  System Description: leanK 2.0 , 1998, CADE.

[5]  Camilla Schwind,et al.  A sequent calculus and a theorem prover for standard conditional logics , 2007, TOCL.

[6]  Dominique Longin,et al.  LoTREC: Logical Tableaux Research Engineering Companion , 2005, TABLEAUX.

[7]  Clare Dixon,et al.  Ordered Resolution for Coalition Logic , 2015, TABLEAUX.

[8]  Amélie David.  Deciding ATL*Satisfiability by Tableaux , 2015, CADE.

[9]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[10]  Stephan Schulz,et al.  System Description: E 0.81 , 2004, IJCAR.

[11]  John P. Burgess,et al.  Quick completeness proofs for some logics of conditionals , 1981, Notre Dame J. Formal Log..

[12]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[13]  Laura Giordano,et al.  Tableau calculus for preference-based conditional logics: PCL and its extensions , 2009, TOCL.

[14]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[15]  Christoph Weidenbach,et al.  SPASS Version 3.5 , 2009, CADE.

[16]  Laura Giordano,et al.  Analytic tableaux calculi for KLM logics of nonmonotonic reasoning , 2006, TOCL.

[17]  Nicola Olivetti,et al.  Nested Sequent Calculi and Theorem Proving for Normal Conditional Logics , 2013, CILC.

[18]  Dirk Pattinson,et al.  Optimal Tableaux for Conditional Logics with Cautious Monotonicity , 2010, ECAI.

[19]  Dirk Pattinson,et al.  Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description) , 2014, IJCAR.

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

[21]  Joseph Y. Halpern,et al.  On the Complexity of Conditional Logics , 1994, KR.