A local search approach to modelling and solving interval algebra problems

Journal of Logic and Computation

Volumn 14, Issue 1, 2004, Pages 93-122

  Thornton, J ^a   Beaumont, M ^a   Sattar, A ^a   Maher, Michael ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

Constraint satisfaction; Interval algebra; Local search; Temporal reasoning

Indexed keywords

ALGEBRA; ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION;

INTERVAL ALGEBRA; LOCAL SEARCH; SATISFIABILITY PROBLEMS; TEMPORAL REASONING;

PROBLEM SOLVING;

EID: 1342303476     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/14.1.93     Document Type: Article

References (16)

1. J. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26, 832-843, 1983.
2. M. Beaumont, A. Sattar, M. Maher, and J. Thornton. Solving over-constrained temporal reasoning problems. In Proceedings of the Fourteenth Australian Joint Conference on Artificial Intelligence (AI 01), pp. 37-49, 2001.
3. B. Cheesman, P. Kanefski, and W. Taylor. Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), pp. 331-337, 1991.
4. E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58, 21-70, 1992.
5. I. Gent, H. Hoos, P. Prosser, and T. Walsh. Morphing: Combining structure and randomness. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), 1999.
6. A. Mackworth. Constraint satisfaction. Technical report, TR-85-15, University of British Columbia, Vancouver, Canada, 1985.
7. S. Minton, M. Johnston, A. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58, 161-205, 1992.
8. B. Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class. Constraints, 1, 175-190, 1997.
9. B. Nebel and H. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42, 43-66, 1995.
10. E. Schwald and L. Vila. Temporal constraints: A survey. Constraints, 3, 129-149, 1998.
11. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 440-446, 1992.
12. Y. Shang and B. Wah. A discrete Lagrangian-based global search method for solving satisfiability problems. Journal of Global Optimization, 12, 61-99, 1998.
13. J. Thornton. Constraint Weighting Local Search for Constraint Satisfaction. PhD thesis, School of Information Technology, Griffith University Gold Coast, Australia, January 2000.
14. J. Thornton, M. Beaumont, A. Sattar, and M. Maher. Applying local search to temporal reasoning. In Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME-02), pp. 94-99, 2002.
15. P. van Beek and D.W. Manchak. The design and experimental analysis of algorithms for temporal reasoning. Journal of AI Research, 4, 1-18, 1996.
16. M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI-86), pp. 377-382, 1986.