Modelling and solving temporal reasoning as propositional satisfiability

Artificial Intelligence

Volumn 172, Issue 15, 2008, Pages 1752-1782

  Pham, Duc Nghia ^a,b   Thornton, John ^a,b   Sattar, Abdul ^a,b  

^a CSIRO   (Australia)

^b GRIFFITH UNIVERSITY   (Australia)

Author keywords

DPLL; Interval Algebra; Satisfiability; Satisfiability modulo theories; Search; Temporal reasoning

Indexed keywords

ALGEBRA; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; DATA STRUCTURES; ENCODING (SYMBOLS); MAPS; NUCLEAR PROPULSION; SPEECH TRANSMISSION; SURFACE MOUNT TECHNOLOGY; TECHNOLOGY; THEOREM PROVING;

BOOLEAN SATISFIABILITY; BOOLEAN VARIABLES; DPLL; ENCODING SCHEMES; ENCODINGS; IA NETWORK; INTEGER DIFFERENCE LOGIC; INTERVAL ALGEBRA; MODULO THEORIES; NP-COMPLETE; ORIGINAL PROBLEM; PHASE TRANSITIONS; POINT-BASED; PROPOSITIONAL FORMULAS; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY; SATISFIABILITY MODULO THEORIES; SEARCH; TEMPORAL INFORMATION; TEMPORAL REASONING; TIME-DEPENDENT;

BOOLEAN FUNCTIONS;

EID: 50649125567     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.06.003     Document Type: Article

References (55)

1. Allen J.F. Maintaining knowledge about temporal intervals. Communications of the ACM 26 (1983) 832-843
2. Anbulagan, D. Nghia Pham, J. Slaney, A. Sattar, Old resolution meets modern SLS, in: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), 2005, pp. 354-359
3. A. Armando, C. Castellini, E. Giunchiglia, SAT-based procedures for temporal reasoning, in: Proceedings of the Fifth European Conference on Planning, 2000, pp. 97-108
4. A. Armando, C. Castellini, E. Giunchiglia, M. Idini, M. Maratea, TSAT++: An open platform for satisfiability modulo theories, in: Proceedings of the Second Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR-04), 2004
5. A. Armando, C. Castellini, E. Giunchiglia, M. Maratea, A SAT-based decision procedure for the boolean combination of difference constraints, in: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing SAT 2004, Selected Revised Papers, Lecture Notes in Computer Science, vol. 3542, 2004, pp. 16-29
6. R. Béjar, F. Manyà, Solving the round robin problem using propositional logic, in: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), 2000, pp. 262-266
7. C. Bessière, E. Hebrard, T. Walsh, Local consistencies in SAT, in: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing SAT 2003, Selected Revised Papers, Lecture Notes in Computer Science, vol. 2919, 2003, pp. 299-314
8. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), 1991, pp. 331-337
9. Crawford J.M., and Auton L.D. Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81 1-2 (1996) 31-57
10. Dechter R. Constraint Processing (2003), Morgan Kaufmann, San Francisco
11. Dechter R., Meiri I., and Pearl J. Temporal constraint networks. Artificial Intelligence 49 1-3 (1991) 61-95
12. Dixon H.E., Ginsberg M.L., and Parkes A.J. Generalizing Boolean satisfiability I: Background and survey of existing work. Journal of Artificial Intelligence Research 21 (2004) 193-243
13. B. Dutertre, L. Mendonça de Moura, A fast linear-arithmetic solver for DPLL(T), in: Proceedings of the Eighteenth International Conference on Computer Aided Verification, 2006, pp. 81-94
14. N. Eén, N. Sörensson, An extensible SAT solver, in: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT-03), Selected Revised Papers, Lecture Notes in Computer Science, vol. 2919, 2003, pp. 502-518
15. Freuder E.C. Synthesizing constraint expressions. Communication of ACM 21 11 (1978) 958-966
16. Freuder E.C. A sufficient condition for backtrack-free search. Journal of ACM 29 1 (1982) 24-32
17. A.M. Frisch, T.J. Peugniez, Solving non-Boolean satisfiability problems with stochastic local search, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), 2001, pp. 282-290
18. I.P. Gent, Arc consistency in SAT, in: Proceedings of the Fifteenth European Conference on Artificial Intelligence (ECAI-02), 2002, pp. 121-125
19. I.P. Gent, T. Walsh, The SAT phase transition, in: Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI-94), 1994, pp. 105-109
20. Ghiathi K., and Ghassem-Sani G. Using satisfiability in temporal planning. WSEAS Transactions on Computers 3 4 (2004) 963-969
21. Golumbic M.C., and Shamir R. Complexity and algorithms for reasoning about time: A graph-theoretic approach. Journal of ACM (1993) 1108-1133
22. Haralick R.M., and Elliott G.L. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 3 (1980) 263-313
23. Hooker J.N. Needed: an empirical science of algorithms. Operations Research 42 2 (1994) 201-212
24. H.H. Hoos, SAT-encodings, search space structure, and local search performance, in: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), 1999, pp. 296-302
25. F. Hutter, D.A.D. Tompkins, H.H. Hoos, Scaling and probabilistic smoothing: Efficient dynamic local search for SAT, in: Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP-02), 2002, pp. 233-248
26. H. Kautz, D. McAllester, B. Selman, Encoding plans in propositional logic, in: Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96), 1996, pp. 374-384
27. H. Kautz, Y. Ruan, D. Achlioptas, C. Gomes, B. Selman, M. Stickel, Balance and filtering in structured satisfiable problems, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), 2001, pp. 351-358
28. H. Kautz, B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 1194-1201
29. Ladkin P., and Reinefeld A. Effective solution of qualitative interval constraint problems. Artificial Intelligence 57 1 (1992) 105-124
30. P. Ladkin, A. Reinefeld, A symbolic approach to interval constraint problems, in: Artificial Intelligence and Symbolic Mathematical Computation, 1993, pp. 65-84
31. Ladkin P., and Reinefeld A. Fast algebraic methods for interval constraint problems. Annals of Mathematics and Artificial Intelligence 19 (1997) 383-411
32. C.M. Li, Anbulagan, Look-ahead versus look-back for satisfiability problems, in: Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP-97), 1997, pp. 341-355
33. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence 8 1 (1977) 99-118
34. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), 1992, pp. 459-465
35. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in: Proceedings of the 38th Design Automation Conference (DAC-01), 2001, pp. 530-535
36. Nebel B. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class. Constraints 1 3 (1997) 175-190
37. Nebel B., and Bürckert H.-J. Reasoning about temporal relations: A maximal tractable subclass of Allen's Interval Algebra. Journal of ACM 42 1 (1995) 43-66
38. D. Nghia Pham, J. Thornton, A. Sattar, Modelling and solving temporal reasoning as satisfiability, in: Proceedings of the 4th International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 2005, pp. 117-131
39. D. Nghia Pham, J. Thornton, A. Sattar, Towards an efficient SAT encoding for temporal reasoning, in: Proceedings of the Twelfth International Conference on the Principles and Practice of Constraint Programming (CP-06), 2006, pp. 421-436
40. D. Nghia Pham, J. Thornton, A. Sattar, A. Ishtaiwi, SAT-based versus CSP-based constraint weighting for satisfiability, in: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), 2005, pp. 455-460
41. S. Prestwich, Local search on SAT-encoded colouring problems, in: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT-03), Selected Revised Papers, Lecture Notes in Computer Science, vol. 2919, 2003, pp. 105-119
42. Prosser P. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence 81 1-2 (1996) 81-109
43. A.K. Pujari, G. Vijaya Kumari, A. Sattar, INDU: An interval and duration network, in: Proceedings of the Twelfth Australian Joint Conference on Artificial Intelligence, 1999, pp. 291-303
44. S. Ranise, C. Tinelli, The Satisfiability Modulo Theories Library (SMT-LIB), www.SMT-LIB.org, 2006
45. Renz J., and Nebel B. Efficient methods for qualitative spatial reasoning. Journal of Artificial Intelligence Research 15 (2001) 289-318
46. B. Selman, H. Kautz, D. McAllester, Ten challenges in propositional reasoning and search, in: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), 1997, pp. 50-54
47. Smith B.M., and Dyer M.E. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence 81 1-2 (1996) 155-181
48. Thornton J., Beaumont M., Sattar A., and Maher M. A local search approach to modelling and solving Interval Algebra problems. Journal of Logic and Computation 14 1 (2004) 93-112
49. J. Thornton, D. Nghia Pham, S. Bain, V. Ferreira Jr., Additive versus multiplicative clause weighting for SAT, in: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-04), 2004, pp. 191-196
50. Tsamardinos I., and Pollack M. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151 1 (2003) 43-89
51. van Beek P. Reasoning about qualitative temporal information. Artificial Intelligence 58 (1992) 297-326
52. van Beek P., and Cohen R. Exact and approximate reasoning about temporal relations. Computational Intelligence 6 (1990) 132-144
53. van Beek P., and Manchak D.W. The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research 4 (1996) 1-18
54. M. Vilain, H. Kautz, Constraint propagation algorithms for temporal reasoning, in: Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI-86), 1986, pp. 377-382
55. T. Walsh, SAT v CSP, in: Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming (CP-00), 2000, pp. 441-456