Modelling modal satisfiability in constraint logic programming

We present a novel encoding of modal satisfiability problems as Constraint Satisfaction Problems. We allow the domains of the resulting constraints to contain other values than just the Boolean 0 or 1, and add various constraints to reason about these values. This modelling is pivotal to speeding up the performance of our constraint-based procedure for modal satisfiability in Constraint Logic Programming (CLP). Our encoding results in a correct solver that attempts to minimize the size of the tree model that it is implicitly trying to generate. An important advantage of our modelling is that we do not need to change the underlying CSP algorithms, and can use them almost as "black boxes".

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

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

[3]  Armando Tacchella,et al.  *SAT System Description , 1999, Description Logics.

[4]  Krzysztof R. Apt,et al.  Schedulers for rule-based constraint programming , 2003, SAC '03.

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

[6]  Ulrike Sattler,et al.  BDD-Based Decision Procedures for K , 2002, CADE.

[7]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m) , 2000, Inf. Comput..

[8]  Krzysztof R. Apt,et al.  Constraint programming viewed as rule-based programming , 2000, Theory and Practice of Logic Programming.

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

[10]  Toby Walsh,et al.  SAT v CSP , 2000, CP.

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

[12]  Peter Balsiger,et al.  A Benchmark Method for the Propositional Modal Logics K, KT, S4 , 2004, Journal of Automated Reasoning.

[13]  M. de Rijke,et al.  Constraint Programming for Modelling and Solving Modal Satisfability , 2003, CP.

[14]  Rina Dechter,et al.  Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming , 2000 .

[15]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.