Towards an efficient SAT encoding for temporal reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4204 LNCS, Issue , 2006, Pages 421-436

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

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; PHASE TRANSITIONS; PROBLEM SOLVING; RANDOM PROCESSES;

IA NETWORK; PERFORMANCE RANKING; TEMPORAL REASONING;

ENCODING (SYMBOLS);

EID: 33750349814     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_31     Document Type: Conference Paper

References (22)

1. James F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26:832-843, 1983.
2. Peter Cheeseman, Bob Kanefsky, and William M. Taylor. Where the really hard problems are. In IJCAI-91, pages 331-337, 1991.
3. Eugene C. Freuder. Synthesizing constraint expressions. Communication of ACM, 21(11):958-966, 1978.
4. Alan M. Frisch and Timothy J. Peugniez. Solving non-Boolean satisfiability problems with stochastic local search. In IJCAI-01, pages 282-290, 2001.
5. Ian P. Gent. Arc consistency in SAT. In ECAI-02, pages 121-125, 2002.
6. K. Ghiathi and G. Ghassem-Sani. Using satisfiability in temporal planning. WSEAS Transactions on Computers, 3(4):963-969, 2004.
7. Martin C. Golumbic and Ron Shamir. Complexity and algorithms for reasoning about time: A graph-theoretic approach. Journal of ACM, pages 1108-1133, 1993.
8. Holger H. Hoos. SAT-encodings, search space structure, and local search performance. In IJCAI-99, pages 296-302, 1999.
9. Henry Kautz, David McAllester, and Bart Selman. Encoding plans in prepositional logic. In KR-96, pages 374-384, 1996.
10. Peter Ladkin and Alexander Reinefeld. Effective solution of qualitative interval constraint problems. Artificial Intelligence, 57(1):105-124, 1992.
11. Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1): 99-118, 1977.
12. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In DAC-01, pages 530-535, 2001.
13. Bernhard Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class. Constraints, 1(3): 175-190, 1997.
14. Bernhard Nebel and Hans-Jürgen Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's Interval Algebra. Journal of ACM, 42(1):43-66, 1995.
15. Steven Prestwich. Local search on SAT-encoded colouring problems. In SAT-03, pages 105-119, 2003.
16. Barbara M. Smith and Martin E. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81(1-2):155-181, 1996.
17. John Thornton, Matthew Beaumont, Abdul Sattar, and Michael Maher. A local search approach to modelling and solving Interval Algebra problems. Journal of Logic and Computation, 14(1):93-112, 2004.
18. Peter van Beek. Reasoning about qualitative temporal information. Artificial Intelligence, 58:297-326, 1992.
19. Peter van Beek and Robin Cohen. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6:132-144, 1990.
20. Peter van Beek and Dennis W. Manchak. The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research, 4:1-18, 1996.
21. Marc Vilain and Henry Kautz. Constraint propagation algorithms for temporal reasoning. In AAAI-86, pages 377-382, 1986.
22. Toby Walsh. SAT v CSP. In CP-00, pages 441-456, 2000.