Disjunctive Temporal Reasoning in Partially Ordered Models of Time

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 464-469

  Broxvall, Mathias ^a   Jonsson, Peter ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

computational complexity; constraint satisfaction; Temporal reasoning

Indexed keywords

ALGEBRA; ARTIFICIAL INTELLIGENCE; CONSTRAINT SATISFACTION PROBLEMS; DISTRIBUTED COMPUTER SYSTEMS;

AGENT SYSTEMS; CONSTRAINT SATISFACTION; COOPERATING AGENTS; DISTRIBUTED SYSTEMS; MODELS OF TIME; ORDERED MODELS; PARTIAL ORDER; TEMPORAL MODELS; TEMPORAL REASONING; TIME-SCALES;

COMPUTATIONAL COMPLEXITY;

EID: 85158157127     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Allen, J. F. 1983. Maintaining knowledge about temporal intervals. Communications of the ACM 26(11):832-843.
2. Anger, F. 1989. On Lamport's interprocessor communication model. ACM Transactions on Programming Languages Systems 11(3):404-417.
3. Broxvall, M., and Jonsson, P. 1999. Towards a complete classification of tractability in point algebras for nonlinear time. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP-99), 448-454.
4. Cohen, D.; Jeavons, P.; and Koubarakis, M. 1997. Tractable disjunctive constraints. In Proceedings of the 3rd International Conference on Principles and Practice for Constraint Programming, 478-490.
5. Jonsson, P., and Bäckström, C. 1998. A unifying approach to temporal constraint reasoning. Artificial Intelligence 102(1):143-155.
6. Koubarakis, M. 1996. Tractable disjunctions of linear constraints. In Proceedings of the 2nd International Conference on Principles and Practice for Constraint Programming, 297-307.
7. Lamport, L. 1986. The mutual exclusion problem: Part I-a theory of interprocess communication. Journal of the ACM 33(2):313-326.
8. Nebel, B., and Bürckert, H.-J. 1995. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM 42(1):43-66.