论文信息 - Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time

Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time

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.

Peter Jonsson | Mathias Broxvall

[1] Drew McDermott,et al. A Temporal Logic for Reasoning About Processes and Plans , 1982, Cogn. Sci..

[2] E. Clarke,et al. Automatic Veriication of Nite-state Concurrent Systems Using Temporal-logic Speciications. Acm , 1993 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Leslie Lamport,et al. The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.

[5] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[6] Peter Jonsson,et al. A Complete Classification of Tractability in RCC-5 , 1997, J. Artif. Intell. Res..

[7] Mark S. Boddy,et al. Reasoning About Partially Ordered Events , 1988, Artificial Intelligence.

[8] Frank D. Anger,et al. On Lamport's interprocessor communication model , 1989, TOPL.

[9] Mathias Broxvall. Computational Complexity of Point Algebras for Nonlinear Time , 2000 .

[10] Bernhard Nebel,et al. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.