Applying local search to temporal reasoning

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2002-January, Issue , 2002, Pages 94-99

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

^a GRIFFITH UNIVERSITY   (Australia)

^b LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

Algebra; Artificial intelligence; Australia; Constraint optimization; Costs; Feedback; Gold; Information technology; Natural language processing; Process planning

Indexed keywords

ALGEBRA; ARTIFICIAL INTELLIGENCE; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; COSTS; FEEDBACK; GOLD; INFORMATION TECHNOLOGY; LAGRANGE MULTIPLIERS; LOCAL SEARCH (OPTIMIZATION); NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; PROCESS PLANNING;

AUSTRALIA; BACKTRACKING ALGORITHM; BINARY CONSTRAINT SATISFACTION; CONSTRAINT OPTIMIZATIONS; LOCAL SEARCH TECHNIQUES; NATURAL LANGUAGE PROCESSING; PROPOSITIONAL SATISFIABILITY; TEMPORAL CONSTRAINT SATISFACTION PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84948461091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2002.1027481     Document Type: Conference Paper

References (12)

1. J. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, 1983.
2. M. Beaumont, A. Sattar, M. Maher, and J. Thornton. Solving over-constrained temporal reasoning problems. In Proceedings of the 14th Australian Joint Conference on Artificial Intelligence (AI 01), pages 37-49, 2001.
3. E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1):21-70, 1992.
4. A. Mackworth. Constraint satisfaction. Technical report, TR-85-15, University of British Columbia, Vancouver, Canada, 1985.
5. 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.
6. B. Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class. Constraints, 1:175-190, 1997.
7. B. Nebel and H. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1):43-66, 1995.
8. E. Schwalb and L. Vila. Temporal constraints: A survey. Constraints, 3:129-149, 1998.
9. 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), pages 440-446, 1992.
10. Y. Shang and B. Wah. A discrete Lagrangian-based global search method for solving satisfiability problems. J. Global Optimization, 12:61-99, 1998.
11. P. van Beek and D. Manchak. The design and an experimental analysis of algorithms for temporal reasoning. Journal of AI Research, 4:1-18, 1996.
12. M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI-86), pages 377-382, 1986.