(Enter summary)
Abstract: We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and
time points in temporal contexts. This temporal model is composed of a labeled temporal algebra
and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric pointbased
constraints, where each disjunct in each input disjunctive constraint is univocally associated
to a label. Reasoning algorithms manage labeled constraints, associated label lists, and sets of... (Update)
Context of citations to this paper: More
...every execution scenario si. Thus, the two steps of the algorithm are: 1. Find the set of execution scenarios SC. 14 (obs (road b s) [2, 2] Stwt (go nome b (ohs (road b s) Figure ,t. The projected STPs of Figure 2 for all scenm ios. Pr(A) is shown in the top part and Pr(A)...
.... And we process it with a method that realizes a total closure process of metric and disjunctive constraints, like the one defined in [3]. This method infers new constraints from those explicitly asserted, and it obtains always a minimal LTCN (Labeled Temporal Constraint...
Cited by: More
Extending the Point Algebra into the Qualitative Algebra - Krokhin, Jonsson
(Correct)
Representation and Reasoning with Disjunctive Temporal.. - Galipienso, Sanchis
(Correct)
Efficient Solution Techniques for Disjunctive Temporal.. - Tsamardinos, Pollack (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Scheduling in a Planning Environment - Garrido, Salido, Barber (2000)
(Correct)
0.5: Constraint Satisfaction over Connected Row Convex.. - Deville, Barette, Van.. (1997)
(Correct)
0.5: Developing Real-Time Multi-Agent Systems - Julian, Botti (2002)
(Correct)
Similar documents based on text: More All
0.8: Simple And Effective Feature Extraction For Optical Character.. - Perez, Vidal
(Correct)
0.7: SAT-based Procedures for Temporal Reasoning - Armando, Castellini, Giunchiglia (1999)
(Correct)
0.6: An Incremental and Non-binary CSP Solver: The Hyperpolyhedron .. - Salido, Barber (2001)
(Correct)
Related documents from co-citation: More All
5: Backtracking algorithms for disjunctions of temporal constraints
- Stergiou, Koubarakis - 1998
4: Temporal Constraint networks (context) - DECHTER, MEIRI et al. - 1991
3: Combining qualitative and quantitative constraints in temporal reasoning
- Meiri - 1991
BibTeX entry: (Update)
Barber, F.: 2000, `Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts'. Journal of Arti cial Intelligence Research 12, 35-86. http://citeseer.ist.psu.edu/barber00reasoning.html More
@article{ barber00reasoning,
author = "Federico Barber",
title = "Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts",
journal = "Journal of Artificial Intelligence Research",
volume = "12",
pages = "35-86",
year = "2000",
url = "citeseer.ist.psu.edu/barber00reasoning.html" }
Citations (may not include all citations):
340
Temporal constraint networks (context) - Meiri, Pearl - 1991
307
Networks of constraints: fundamental properties and applicat.. (context) - Montanari - 1974
284
Constraint propagation algorithm for temporal reasoning (context) - Vilain, Kautz et al. - 1986
185
A sufficient condition for backtrack-free search (context) - Freuder - 1982
166
Synthesizing constraint expressions (context) - Freuder - 1978
106
Temporal data base management (context) - Dean, McDermott - 1987
82
Integrating metric and qualitative temporal reasoning
- Kautz, Ladkin - 1991
80
From local to global consistency
- Dechter - 1992
38
Artificial Intelligence
- Cooper - 1990
38
Situation Recognition: Representation and Algorithms (context) - Dousson, Gaborit et al. - 1993
31
A linear-programming approach to temporal reasoning
- Jonsson, Bckstrm - 1996
25
Tractable disjunctions of Linear Constraints
- Stergiou, Koubarakis - 1996
19
Eight maximal tractable subclasses of Allen's algebra with m..
- Drakengren, Jonsson - 1997
19
Efficient algorithms for qualitative reasoning about time
- Gerevini, Schubert - 1995
14
consistency and closure (context) - Jeavons, Cohen et al. - 1998
14
A unifying approach to temporal constraint reasoning
- Jonsson, Bckstrm - 1998
10
Performance of temporal reasoning systems (context) - Yampratoom, Allen - 1993
7
Computational complexity of relating time points and interva..
- Jonsson, Drakengren et al. - 1999
7
Temporal query processing with indefinite information
- Van Beek - 1991
5
Later: Managing temporal information efficiently (context) - Brusoni, Console et al. - 1997
5
How to determine the expressive power of constraints
- Jeavons, Cohen et al. - 1999
5
Constraint tightness and looseness versus local and global c..
- Van Beek, Dechter - 1997
5
Tractable disjunctive constraints
- Cohen, Jeavons et al. - 1996
2
the minimality and global consistency of row convex networks (context) - Van Beek, Detcher - 1995
2
Hierarchisation of the Seach Space in Temporal Planning (context) - Garcia, Laborie - 1996
2
Efficient planning through separate resource scheduling
- Srivastava, Kambhampati - 1999
2
Temporal reasoning in Reakt: An environment for real-time kn.. (context) - Barber, Botti et al. - 1994
1
Bactracking algorithms for disjunctions of temporal constrai.. (context) - Stergiou, Koubarakis - 1998
1
A model for planning and scheduling integration (context) - Garrido, Marzal et al. - 1999
1
Temporal representation with qualitative and quantitative in.. (context) - Wetprasit, Sattar - 1998
Documents on the same site (http://www.cs.washington.edu/research/jair/contents/complete-with-abstracts.html): More
A Uniform Framework for Concept Definitions in Description.. - De Giacomo, Lenzerini (1997)
(Correct)
Lifeworld Analysis - Agre, Horswill (1997)
(Correct)
The Design and Experimental Analysis of Algorithms for.. - van Beek, Manchak (1996)
(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