(Enter summary)
Abstract: The framework of Temporal constraint Satisfaction Problems (TCSP) has been proposed
for representing and processing temporal knowledge. Deciding consistency of TCSPs
is known to be intractable. As demonstrates in this paper, even local consistency
algorithms like path-consistency can be exponential due to the fragmentation problem. (Update)
Similar documents based on text: More All
0.9: Processing Disjunctions in Temporal Constraint Networks - Schwalb, Dechter (1995)
(Correct)
0.6: Processing Temporal Constraint Networks - Schwalb, Dechter (1994)
(Correct)
0.6: Coping with Disjunctions in Temporal Constraint Satisfaction.. - Schwalb, Dechter (1993)
(Correct)
BibTeX entry: (Update)
Eddie Schwalb and Rina Dechter. Processing disjunctions in temporal constraint networks. AI, 93:29--61, 1997. http://citeseer.ist.psu.edu/article/schwalb95processing.html More
@article{ schwalb97processing,
author = "Eddie Schwalb and Rina Dechter",
title = "Processing Disjunctions in Temporal Constraint Networks",
journal = "Artificial Intelligence",
volume = "93",
pages = "29-61",
year = "1997",
url = "citeseer.ist.psu.edu/article/schwalb95processing.html" }
Citations (may not include all citations):
1044
Maintaining knowledge about temporal intervals (context) - Allen - 1983
278
Natural Language Understanding (context) - Allen - 1987
8
Managing Disjunction for Practical Temporal Reasoning
- Boddy, Carciofini et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~dechter/publications/): More
Up and Down Mini-Buckets: A Scheme for Approximating.. - Kask, Larrosa, Dechter (2001)
(Correct)
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998)
(Correct)
On the Time Complexity of Bucket Elimination Algorithms - Larrosa (2001)
(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