Peter Jonsson (jonsson-p)
Contributions to Philosophie.ch
No contributions yet
Bibliography
Bronxvall, Matthias and Jonsson, Peter. 2003. “Point Algebras for Temporal Reasoning: Algorithms and Complexity.” Artificial Intelligence 149(2): 179–220.
Broxvall, Matthias, Jonsson, Peter and Renz, Jochen. 2002. “Disjunctions, Independence, Refinements.” Artificial Intelligence 140(1–2): 153–173.
Drakengren, Thomas and Jonsson, Peter. 1997. “Twenty-One Large Tractable Subclasses of Allen’s Algebra.” Artificial Intelligence 93(1–2): 297–319.
Drakengren, Thomas and Jonsson, Peter. 1998. “A Complete Classification of Tractability in Allen’s Algebra Relative to Subsets of Basic Relations.” Artificial Intelligence 106(2): 205–219.
Jonsson, Peter and Bäckström, Christer. 1998a. “State-Variable Planning under Structural Restrictions: Algorithms and Complexity.” Artificial Intelligence 100(1–2): 125–176.
Jonsson, Peter and Bäckström, Christer. 1998b. “A Unifying Approach to Temporal Constraint Reasoning.” Artificial Intelligence 102(1): 143–155.
Jonsson, Peter, Drakengren, Thomas and Bäckström, Christer. 1996. “Tractable Subclasses of the Point-Interval Algebra: A Complete Classification.” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 352–363. San Francisco, California: Morgan Kaufmann Publishers.
Jonsson, Peter, Drakengren, Thomas and Bäckström, Christer. 1999. “Computational Complexity of Relating Time Points with Intervals.” Artificial Intelligence 109(1–2): 273–295.