Modelling and solving temporal reasoning as propositional satisfiability

Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely used formalisms for representing interval-based qualitative temporal information is Allen's interval algebra (IA). The fundamental reasoning task in IA is to find a scenario that is consistent with the given information. This problem is in general NP-complete. In this paper, we investigate how an interval-based representation, or IA network, can be encoded into a propositional formula of Boolean variables and/or predicates in decidable theories. Our task is to discover whether satisfying such a formula can be more efficient than finding a consistent scenario for the original problem. There are two basic approaches to modelling an IA network: one represents the relations between intervals as variables and the other represents the end-points of each interval as variables. By combining these two approaches with three different Boolean satisfiability (SAT) encoding schemes, we produced six encoding schemes for converting IA to SAT. In addition, we also showed how IA networks can be formulated into satisfiability modulo theories (SMT) formulae based on the quantifier-free integer difference logic (QF-IDL). These encodings were empirically studied using randomly generated IA problems of sizes ranging from 20 to 100 nodes. A general conclusion we draw from these experimental results is that encoding IA into SAT produces better results than existing approaches. More specifically, we show that the new point-based 1-D support SAT encoding of IA produces consistently better results than the other alternatives considered. In comparison with the six different SAT encodings, the SMT encoding came fourth after the point-based and interval-based 1-D support schemes and the point-based direct scheme. Further, we observe that the phase transition region maps directly from the IA encoding to each SAT or SMT encoding, but, surprisingly, the location of the hard region varies according to the encoding scheme. Our results also show a fixed performance ranking order over the various encoding schemes.

[1]  Steven David Prestwich,et al.  Local Search on SAT-encoded Colouring Problems , 2003, SAT.

[2]  Holger H. Hoos.  SAT-Encodings, Search Space Structure, and Local Search Performance , 1999, IJCAI.

[3]  Alexander Reinefeld,et al.  Fast algebraic methods for interval constraint problems , 1997, Annals of Mathematics and Artificial Intelligence.

[4]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[5]  John Thornton,et al.  Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.

[6]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[7]  Abdul Sattar,et al.  Old Resolution Meets Modern SLS , 2005, AAAI.

[8]  Enrico Giunchiglia,et al.  TSAT++: an Open Platform for Satisfiability Modulo Theories , 2005, Electron. Notes Theor. Comput. Sci..

[9]  Bernhard Nebel,et al.  Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class , 1997, Constraints.

[10]  Peter van Beek,et al.  The Design and Experimental Analysis of Algorithms for Temporal Reasoning , 1995, J. Artif. Intell. Res..

[11]  Alan M. Frisch,et al.  Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings , 2001, Journal of Automated Reasoning.

[12]  Alexander Reinefeld,et al.  Effective Solution of Qualitative Interval Constraint Problems , 1992, Artif. Intell..

[13]  Enrico Giunchiglia,et al.  A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints , 2004, SAT.

[14]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[15]  Peter van Beek,et al.  The design and experimental analysis of algorithms for temporal reasoning , 1996 .

[16]  Bart Selman,et al.  Balance and Filtering in Structured Satisfiable Problems , 2001, IJCAI.

[17]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[18]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[19]  Peter van Beek,et al.  Exact and approximate reasoning about temporal relations 1 , 1990, Comput. Intell..

[20]  Matthew L. Ginsberg,et al.  Generalizing Boolean Satisfiability I: Background and Survey of Existing Work , 2011, J. Artif. Intell. Res..

[21]  Toby Walsh,et al.  Local Consistencies in SAT , 2003, SAT.

[22]  KAMAL-ALDIN Ghiathi,et al.  USING SATISFIABILITY IN TEMPORAL PLANNING , 2004 .

[23]  Enrico Giunchiglia,et al.  SAT-Based Procedures for Temporal Reasoning , 1999, ECP.

[24]  Chu Min Li,et al.  Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.

[25]  Carlos Ansótegui,et al.  Boosting Chaff's Performance by Incorporating CSP Heuristics , 2003, CP.

[26]  Ramón Béjar,et al.  Solving the Round Robin Problem Using Propositional Logic , 2000, AAAI/IAAI.

[27]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[28]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[29]  Martha E. Pollack,et al.  Efficient solution techniques for disjunctive temporal reasoning problems , 2003, Artif. Intell..

[30]  Bernhard Nebel,et al.  Efficient Methods for Qualitative Spatial Reasoning , 2001, J. Artif. Intell. Res..

[31]  Armando Tacchella,et al.  Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919) , 2004 .

[32]  Wei Li,et al.  The SAT phase transition , 1999, ArXiv.

[33]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[34]  Abdul Sattar,et al.  SAT-Based versus CSP-Based Constraint Weighting for Satisfiability , 2005, AAAI.

[35]  John N. Hooker,et al.  Needed: An Empirical Science of Algorithms , 1994, Oper. Res..

[36]  Bart Selman,et al.  Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.

[37]  Alexander Reinefeld,et al.  A Symbolic Approach to Interval Constraint Problems , 1992, AISMC.

[38]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

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

[40]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[41]  Michael J. Maher,et al.  A Local Search Approach to Modelling and Solving Interval Algebra Problems , 2004, J. Log. Comput..

[42]  Abdul Sattar,et al.  Modelling and Solving Temporal Reasoning as Satisfiability , 2005 .

[43]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[44]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[45]  Bruno Dutertre,et al.  A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[46]  Holger H. Hoos,et al.  Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.

[47]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[48]  Henry Kautz,et al.  Pushing the envelope: planning , 1996 .

[49]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.

[50]  Abdul Sattar,et al.  INDU: An Interval and Duration Network , 1999, Australian Joint Conference on Artificial Intelligence.

[51]  Peter van Beek,et al.  Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..

[52]  James M. Crawford,et al.  Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[53]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[54]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[55]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[56]  Patrick Prosser,et al.  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[57]  Ian P. Gent.  Arc Consistency in SAT , 2002, ECAI.

[58]  Ron Shamir,et al.  Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.

[59]  Abdul Sattar,et al.  Towards an Efficient SAT Encoding for Temporal Reasoning , 2006, CP.