Abstract
Efficient reasoning about temporal constraints over nonlinear time models is vital in numerous application areas, such as planning, distributed systems and cooperating agents. We identify all tractable subclasses of the point algebra for partially-ordered time and examine one large, nontrivial tractable subclass of the point algebra for branching time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anger, F.: On Lamport’s interprocessor communication model. ACM Transactions on Programming Languages Systems 11(3), 404–417 (1989)
Anger, F., Mitra, D., Rodriguez, R.: Temporal constraint networks in nonlinear time. Technical report, ECAI Workshop on Temporal and Spatial Reasoning (1998)
Broxvall, M.: 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)
Clarke, E., Emerson, E., Sistla, A.: utomatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages Systems 8(2), 244–263 (1986)
Dean, T., Boddy, M.: Reasoning about partially ordered events. Artificial Intelligence 36, 375–399 (1988)
Emerson, A.E., Halpern, J.Y.: “Sometimes” and “not never” revisited: On branching versus linear temporal logic. Journal of the ACM 33(1), 151–178 (1986)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Jonsson, P., Drakengren, T.: A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research 6, 211–221 (1997)
Lamport, L.: The mutual exclusion problem: Part I—a theory of interprocess communication. Journal of the ACM 33(2), 313–326 (1986)
McDermott, D.: A temporal logic for reasoning about processes and plans. Cognitive Science 6, 101–155 (1982)
Nebel, B., Bürckert, H.-J.: Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. Journal of the ACM 42(1), 43–66 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broxvall, M., Jonsson, P. (1999). Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive