Towards a complete classification of tractability in point algebras for nonlinear time

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

Volumn 1713, Issue , 1999, Pages 129-143

  Broxvall, Mathias ^a   Jonsson, Peter ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

APPLICATION AREA; BRANCHING TIME; COMPLETE CLASSIFICATION; COOPERATING AGENTS; DISTRIBUTED SYSTEMS; NON-LINEAR TIME MODELS; POINT ALGEBRAS; TEMPORAL CONSTRAINTS;

ALGEBRA;

EID: 33646151505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_10     Document Type: Conference Paper

References (11)

1. F. Anger. On Lamport's interprocessor communication model. ACM Transactions on Programming Languages Systems, 11(3):404-417, 1989.
2. F. Anger, D. Mitra, and R. Rodriguez. Temporal constraint networks in nonliear time. Technical report, ECAI Workshop on Temporal and Spatial Reasoning, 1998.
3. M. Broxvall. Computational complexity of point algebras for nonlinear time. Master Thesis Report LiTH-IDA-Ex-99/48, Department of Computer Science, Linköping, Sweden, June 1999.
4. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Program- ming Languages Systems, 8(2):244-263, 1986.
5. T. Dean and M. Boddy. Reasoning about partially ordered events. Artificial Intelligence, 36:375-399, 1988.
6. A. E. Emerson and J. Y. Halpern. “Sometimes" and “not never" revisited: On branching versus linear temporal logic. Journal of the ACM, 33(1):151-178, Jan. 1986.
7. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
8. P. Jonsson and T. Drakengren. A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research, 6:211-221, 1997.
9. L. Lamport. The mutual exclusion problem: Part I-a theory of interprocess communication. Journal of the ACM, 33(2):313-326, 1986.
10. D. McDermott. A temporal logic for reasoning about processes and plans. Cognitive Science, 6:101-155, 1982.
11. B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1):43-66, 1995.