Bernhard Nebel, Hans-Jürgen Bürckert  Home/Search
Context Related
Links: DBLP | informatik.unifre...ckertjacm95.ps.gz 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: informatik.unifreibur...journals (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming<F NaN> P6=NP). In fact, it is the... (Update)
Cited by: More
Determining the Consistency of - Partial Tree Descriptions (Correct)
Global Consistency in Interval Algebra Networks: - Tractable Subclasses Christian (Correct)
Using a Temporal Constraint Network for Business Process.. - Governatori (2006) (Correct)
Similar documents (at the sentence level):
24.3%: Reasoning about Temporal Relations: A Maximal Tractable.. - Nebel, Bürckert (1994) (Correct)
Active bibliography (related documents): More All
0.8: Efficient Algorithms for Qualitative Reasoning about Time - Gerevini, Schubert (1995) (Correct)
0.6: The Temporal Reasoning Systems TimeGraph I-II - Gerevini, Schubert, Schaeffer (1994) (Correct)
0.4: Solving Hard Qualitative Temporal Reasoning Problems: Evaluating.. - Nebel (1997) (Correct)
Similar documents based on text: More All
0.3: Twenty-one Large Tractable Subclasses of Allen's Algebra - Drakengren, Jonsson (1997) (Correct)
0.2: A Complete Classification of Tractability in the Spatial.. - Jonsson, Drakengren (1997) (Correct)
0.2: Algorithms and Complexity for Temporal and Spatial Formalisms - .. - Drakengren (1997) (Correct)
Related documents from co-citation: More All
82: Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986
78: Maintaining knowledge about temporal intervals (context) - Allen - 1983
27: On binary constraint problems - Ladkin, Maddux - 1994
BibTeX entry: (Update)
B Nebel. Reasoning about temporal relations: a maximal tractable subset of Allen's interval algebra. Journal of the Association for Computing Machinery, 42(1):43--66, January 1995. http://citeseer.ist.psu.edu/nebel95reasoning.html More
@techreport{ nebel93reasoning,
author = "Bernhard Nebel and Hans-J{\"u}rgen B{\"u}rckert",
title = "Reasoning about Temporal Relations: {A} Maximal Tractable Subclass of Allen's Interval Algebra",
number = "RR-93-11",
address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
pages = "28",
year = "1993",
url = "citeseer.ist.psu.edu/nebel95reasoning.html" }
Citations (may not include all citations):1044 Maintaining knowledge about temporal intervals (context) - Allen - 1983 ACM DBLP
702 Consistency in networks of relations (context) - Mackworth - 1977 ACM DBLP
444 Towards a general theory of action and time (context) - Allen - 1984 ACM DBLP
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
284 Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986 DBLP
191 Linear time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
185 The complexity of some polynomial network consistency algori.. (context) - Mackworth, Freuder - 1985 ACM DBLP
166 Synthesizing constraint expressions (context) - Freuder - 1978 ACM DBLP
99 Temporal reasoning based on semi-intervals - Freksa - 1992 ACM DBLP
94 Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987 DBLP
85 Planning using a temporal world model (context) - Allen, Koomen - 1983 DBLP
81 Reasoning about qualitative temporal information (context) - van Beek - 1990 ACM DBLP
69 A common-sense theory of time (context) - Allen, Hayes - 1985 ACM DBLP
63 On binary constraint problems - Ladkin, Maddux - 1994 ACM DBLP
59 Temporal reasoning and planning (context) - Allen - 1991
58 Complexity and algorithms for reasoning about time: A graph-.. - Golumbic, Shamir - 1993 DBLP
48 Exact and approximate reasoning about temporal relations (context) - van Beek, Cohen - 1990 ACM DBLP
41 Terminological reasoning with constraint networks and an app.. - Weida, Litman - 1992 DBLP
32 Managing efficiently temporal relations through indexed span.. (context) - Ghallab, Alaoui DBLP
32 Approximation algorithms for temporal reasoning (context) - van Beek DBLP
27 On binary constraint networks - Ladkin, Maddux - 1988
24 Unit refutations and Horn sets (context) - Henschen, Wos - 1974 ACM DBLP
24 Efficient temporal reasoning through timegraphs (context) - Gerevini, Schubert - 1993 DBLP
21 The interpretation of temporal relations in narrative (context) - Song, Cohen - 1988 DBLP
19 Models of axioms for time intervals (context) - Ladkin DBLP
16 Temporally Distributed Symptoms in Technical Diagnosis (context) - Nokel - 1991
11 Convex relations between time intervals (context) - Nokel - 1989
8 The satisfiability of temporal constraint networks (context) - Vald'ez-P'erez DBLP
6 Algorithms and complexity for reasoning about time (context) - Golumbic, Shamir - 1992 DBLP
5 Towards coordinated temporal multimedia presentation (context) - Feiner, Litman et al. - 1993
3 Department of Computer Science (context) - Koubarakis, Mylopoulos et al. - 1987
3 Complexity of temporal reasoning with disjunctions of inequa.. (context) - Gerevini, Schubert - 1993
1 PPP: Personalized plan-based presenter --- Project Proposal (context) - Andr'e, Graf et al. - 1993
1 Logic programming and graph rewriting (context) - Gallier, Raatz - 1985 DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-freiburg.de/~nebel/journals.html): More
Computational Complexity of Terminological Reasoning in BACK - Nebel (1988) (Correct)
On the Expressivity of Feature Logics with.. - Baader, Bürckert, .. (1993) (Correct)
On the Computational Complexity of Temporal Projection.. - Nebel, Bäckström (1994) (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