Temporal Constraint Networks
@inproceedings{Dechter1989TemporalCN, title={Temporal Constraint Networks}, author={R. Dechter and Itay Meiri and J. Pearl}, booktitle={Artif. Intell.}, year={1989} }
Abstract This paper extends network-based methods of constraint satisfaction to include continuous variables, thus providing a framework for processing temporal constraints. In this framework, called temporal constraint satisfaction problem (TCSP), variables represent time points and temporal information is represented by a set of unary and binary constraints, each specifying a set of permitted intervals. The unique feature of this framework lies in permitting the processing of metric… CONTINUE READING
Topics from this paper
2,055 Citations
A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games
- Computer Science
- 2014 21st International Symposium on Temporal Representation and Reasoning
- 2014
- 13
- Highly Influenced
- PDF
A new temporal CSP framework handling composite variables and activity constraints
- Computer Science
- 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)
- 2005
- 11
Conditional and composite temporal CSPs
- Computer Science
- Applied Intelligence
- 2010
- 13
- Highly Influenced
- PDF
Handling contingency in temporal constraint networks: from consistency to controllabilities
- Computer Science
- J. Exp. Theor. Artif. Intell.
- 1999
- 256
- Highly Influenced
Optimal Design of Consistent Simple Temporal Networks
- Computer Science
- 2013 20th International Symposium on Temporal Representation and Reasoning
- 2013
- 1
Modelling and managing disjunctions in scheduling problems
- Mathematics, Computer Science
- J. Intell. Manuf.
- 1995
- 13
- PDF
A Scheduling Tool for Conditionally Independent Temporal Preferences
- Computer Science
- 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)
- 2015
- PDF
Contingent durations in temporal CSPs: from consistency to controllabilities
- Computer Science
- Proceedings of TIME '97: 4th International Workshop on Temporal Representation and Reasoning
- 1997
- 29
- PDF
References
SHOWING 1-10 OF 51 REFERENCES
Network-Based Heuristics for Constraint-Satisfaction Problems
- Mathematics, Computer Science
- Artif. Intell.
- 1987
- 515
Networks of constraints: Fundamental properties and applications to picture processing
- Computer Science
- Inf. Sci.
- 1974
- 1,533
- Highly Influential
The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems
- Mathematics, Computer Science
- Artif. Intell.
- 1985
- 741
Approximation Algorithms for Temporal Reasoning
- Mathematics, Computer Science
- IJCAI
- 1989
- 131
- Highly Influential
- PDF
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
- Mathematics, Computer Science
- IJCAI
- 1989
- 127
- PDF