Peter Jonsson, Christer Bäckström  Home/Search
Context Related
| ida.liu.se/pub/labs/tcslab/pete...J6.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: ida.liu.se/~petej/Resea...article (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a formalism, Disjunctive Linear Relations (DLRs), for reasoning about temporal constraints. DLRs subsume most of the formalisms for temporal constraint reasoning proposed in the literature and is therefore computationally expensive. We also present a restricted type of DLRs, Horn DLRs, which have a polynomial-time satisfiability problem. We prove that most approaches to tractable temporal constraint reasoning can be encoded as Horn DLRs, including the ORD-Horn algebra by Nebel ... (Update)
Context of citations to this paper: More
.... Some examples of these problems, including scheduling, planning, and inde nite temporal constraint databases, can be found in [26, 31, 49] (see also [10] for more information on tractable disjunctive constraints) De nition 2 Let V = fx 1 ; x n g be a set of real...
...constraints, etc. This gives rise to the need to manage nonbinary constraints. Although there are some models for non binary CSP [10] [8], we intend to show the high expressiveness provided by the Labelled TCSP model [4] which allows us to specify and reason about a great...
Cited by: More
Multi-Calendar Appointment Scheduling: Calendar Modeling and.. - Spranger, Bry (2006) (Correct)
The Complexity of Constraints on Intervals and Lengths - Krokhin, Jeavons, Jonsson (2002) (Correct)
Extending the Point Algebra into the Qualitative Algebra - Krokhin, Jonsson (Correct)
Similar documents (at the sentence level):
45.1%: A Linear-Programming Approach to Temporal Reasoning - Jonsson, Bäckström (1996) (Correct)
23.6%: Issues in Diagnosis, Supervision and Safety - Nielsen, Nyberg, Frisk.. (1996) (Correct)
8.4%: Computational Complexity of Temporal Constraint Problems - Drakengren, Jonsson (1998) (Correct)
Active bibliography (related documents): More All
0.8: Algorithms and Complexity for Temporal and Spatial Formalisms - .. - Drakengren (1997) (Correct)
0.6: Reasoning about Action in Polynomial Time - Drakengren, Bjäreland (1997) (Correct)
0.5: Computational Complexity of Relating Time Points with.. - Jonsson, Drakengren.. (1999) (Correct)
Similar documents based on text: More All
0.6: Eight Maximal Tractable Subclasses of Allen's Algebra with.. - Drakengren, Jonsson (1997) (Correct)
0.4: Dais System Performance, First Results From The.. - Strobl, Richter.. (1996) (Correct)
0.3: Studies in Action Planning - Algorithms and Complexity - Jonsson (Correct)
Related documents from co-citation: More All
11: Maintaining knowledge about temporal intervals (context) - Allen - 1983
11: Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986
9: Reasoning about temporal relations: a maximal tractable subset of Allen's interv.. - Nebel - 1995
BibTeX entry: (Update)
Peter Jonsson and Christer Backstrom. A unifying approach to temporal constraint reasoning. Artificial Intelligence, To appear. http://citeseer.ist.psu.edu/429592.html More
@article{ jonsson98unifying,
author = "Peter Jonsson and Christer Bm",
title = "A Unifying Approach to Temporal Constraint Reasoning",
journal = "Artificial Intelligence",
volume = "102",
number = "1",
pages = "143-155",
year = "1998",
url = "citeseer.ist.psu.edu/429592.html" }
Citations (may not include all citations):1044 Maintaining knowledge about temporal intervals (context) - Allen - 1983
448 A new polynomial time algorithm for linear programming (context) - Karmarkar - 1984
340 Temporal constraint networks (context) - Dechter, Meiri et al. - 1991
315 Constraint query languages - Kanellakis, Kuper et al. - 1995
284 Constraint propagation algorithms for temporal reasoning: A .. (context) - Vilain, Kautz et al. - 1990
129 A polynomial algorithm in linear programming (context) - Khachiyan - 1979
111 Reasoning about temporal relations: A maximal tractable subc.. - Nebel, Burckert - 1995
107 Combining qualitative and quantitative constraints in tempor.. - Meiri - 1996
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1989
59 Temporal reasoning and planning (context) - Allen - 1991
58 Complexity and algorithms for reasoning about time: A graph-.. - Golumbic, Shamir - 1993
34 A system for reasoning about time (context) - Vilain - 1982
31 A linear-programming approach to temporal reasoning - Jonsson, Backstrom
25 the topology of the genetic fine structure (context) - Benzer - 1959
25 Tractable disjunctions of linear constraints - Koubarakis - 1996
25 A canonical form for generalized linear constraints (context) - Lassez, McAloon - 1992
25 Temporal reasoning in Timegraph I--II (context) - Gerevini, Schubert et al. - 1993
21 The interpretation of temporal relations in narrative (context) - Song, Cohen - 1988
20 Dense time and temporal constraints with (context) - Koubarakis - 1992
19 Eight maximal tractable subclasses of Allen's algebra with m.. - Drakengren, Jonsson - 1997
16 Twenty-one large tractable subclasses of Allen's algebra - Drakengren, Jonsson - 1997
14 Exact and approximate reasoning about temporal relations (context) - van Beek, Cohen - 1990
10 A metric time-point and duration-based temporal model - Barber - 1993
9 Integrating metric and temporal qualitative temporal reasoni.. (context) - Kautz, Ladkin
5 Tractable subclasses of the point-interval algebra: A comple.. (context) - Jonsson, Drakengren et al. - 1996
5 Reasoning about action in polynomial time - Drakengren, Bjareland - 1997
4 Nat'l Conf (context) - th - 1996
4 Nat'l Conf (context) - th - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ida.liu.se/~petej/Research/article.html): More
Boolean Constraint Satisfaction: Complexity Results for.. - Jonsson (Correct)
Near-Optimal Nonapproximability Results for Some NPO PB-Complete.. - Jonsson (1998) (Correct)
Tractable Plan Existence Does Not Imply Tractable Plan.. - Jonsson, Bäckström (1998) (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