Thomas Drakengren, Peter Jonsson  Home/Search
Context Related
| informatix.ida.liu.se/pu...paper2.ps.gz ida.liu.se/ext/pur/tphd...paper2.ps.gz ida.liu.se/pub/labs/tcslab/pete...J3.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatix.ida.liu.se/publicat... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper continues Nebel and Burckert's investigation of Allen's interval algebra by presenting nine more maximal tractable subclasses of the algebra (provided that P 6= NP ), in addition to their previously reported ORD-Horn subclass. Furthermore, twelve tractable subclasses are identified, whose maximality is not decided. Four of them can express the notion of sequentiality between intervals, which is not possible in the ORD-Horn algebra. All of the algebras are considerably larger than... (Update)
Context of citations to this paper: More
.... has motivated the search for e ective heuristics, e.g. 17, 22, 32] and the study of the complexity of fragments of the algebra, e.g. [7, 8, 11, 23]. In this paper we follow the second approach assuming that P 6= NP . Research in this direction has focused on identifying...
.... instance of QA SAT(X) where X 2 II tr Gamma fH; Sp ; Epg By studying the correctness proofs of the algorithms for these subclasses [4, 5], one notices that Pi always has a model M such that the intersection of all intervals is itself a non empty interval, say J . Thus, we...
Cited by: More
Temporal Representation and Reasoning in Artificial.. - Chittaro, Montanari (2002) (Correct)
The Complexity of Constraint Satisfaction Problems For Small.. - Hirsch (Correct)
A Complete Classification of Complexity in Allen's Algebra - In The Presence (Correct)
Similar documents (at the sentence level):
27.5%: Maximal Tractable Subclasses of Allen's Interval Algebra.. - Drakengren, Jonsson (1996) (Correct)
Active bibliography (related documents): More All
0.4: Algorithms and Complexity for Temporal and Spatial Formalisms - .. - Drakengren (1997) (Correct)
0.3: A Complete Classification of Tractability in Allen's.. - Drakengren, Jonsson (1998) (Correct)
0.3: Towards a Complete Classification of Tractability in Allen's .. - Drakengren, Jonsson (1997) (Correct)
Similar documents based on text: More All
0.3: Eight Maximal Tractable Subclasses of Allen's Algebra with.. - Drakengren, Jonsson (1997) (Correct)
0.3: The Computational Complexity of Relating Points with.. - Jonsson, Drakengren, .. (Correct)
0.3: Algorithms and Complexity for Temporal and Spatial Formalisms - Drakengren (1997) (Correct)
Related documents from co-citation: More All
19: Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986
16: Reasoning about temporal relations: a maximal tractable subset of Allen's interv.. - Nebel - 1995
14: Combining qualitative and quantitative constraints in temporal reasoning - Meiri - 1991
BibTeX entry: (Update)
Thomas Drakengren and Peter Jonsson. Twenty--one large tractable subclasses of allen's algebra. AI, 93:297--319, 1997. http://citeseer.ist.psu.edu/53369.html More
@misc{ drakengren97twentyone,
author = "T. Drakengren and P. Jonsson",
title = "Twenty--one large tractable subclasses of allen's algebra",
text = "Thomas Drakengren and Peter Jonsson. Twenty--one large tractable subclasses
of allen's algebra. AI, 93:297--319, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/53369.html" }
Citations (may not include all citations):1044 Maintaining knowledge about temporal intervals (context) - Allen - 1983
702 Consistency in networks of relations (context) - Mackworth - 1977
307 Networks of constraints: Fundamental properties and applicat.. (context) - Montanari - 1974
284 Constraint propagation algorithms for temporal reasoning: A .. (context) - Vilain, Kautz et al. - 1989
117 Features and Fluents (context) - Sandewall - 1994
111 Reasoning about temporal relations: A maximal tractable subc.. - Nebel, Burckert - 1995
81 Reasoning about qualitative temporal information (context) - van Beek - 1992
34 Effective solution of qualitative interval constraint proble.. (context) - Ladkin, Reinefeld - 1992
32 Approximation algorithms for temporal reasoning (context) - van Beek - 1989
32 Solving hard qualitative temporal reasoning problems: Evalua.. - Nebel - 1996
25 Temporal reasoning in Timegraph I--II (context) - Gerevini, Schubert et al. - 1993
19 Complexity and algorithms for reasoning about time: A graph-.. - Golumbic, Shamir - 1993
19 A new proof of tractability for ORD-Horn relations (context) - Ligozat - 1996
19 Eight maximal tractable subclasses of Allen's algebra with m.. - Drakengren, Jonsson - 1997
18 Computer Algorithms (context) - Baase - 1988
17 Temporal reasoning based on semiintervals - Freksa - 1992
16 Maximal tractable subclasses of Allen's interval algebra: Pr.. - Drakengren, Jonsson - 1996
10 Towards a complete classification of tractability in Allen's.. - Drakengren, Jonsson - 1997
10 Software for machine assisted analysis of Allen's interval a.. (context) - Nebel, Burckert - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://informatix.ida.liu.se/publications/t-phd/1997/0498/): More
Towards a Complete Classification of Tractability in Allen's .. - Drakengren, Jonsson (1997) (Correct)
Algorithms and Complexity for Temporal and Spatial Formalisms - .. - Drakengren (1997) (Correct)
Reasoning about Action in Polynomial Time - Drakengren, Bjäreland (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC