Temporal Constraint Networks

@inproceedings{Dechter1989TemporalCN,
  title={Temporal Constraint Networks},
  author={R. Dechter and Itay Meiri and J. Pearl},
  booktitle={Artif. Intell.},
  year={1989}
}
  • R. Dechter, Itay Meiri, J. Pearl
  • Published in Artif. Intell. 1989
  • Computer Science, Mathematics
  • 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
    2,055 Citations

    Topics from this paper

    Hyper temporal networks
    • 7
    • Highly Influenced
    • PDF
    A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games
    • 13
    • Highly Influenced
    • PDF
    A new temporal CSP framework handling composite variables and activity constraints
    • M. Mouhoub, Amrudee Sukpan
    • Computer Science
    • 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)
    • 2005
    • 11
    Conditional and composite temporal CSPs
    • 13
    • Highly Influenced
    • PDF
    Handling contingency in temporal constraint networks: from consistency to controllabilities
    • 256
    • Highly Influenced
    Optimal Design of Consistent Simple Temporal Networks
    • R. Rizzi, R. Posenato
    • Computer Science
    • 2013 20th International Symposium on Temporal Representation and Reasoning
    • 2013
    • 1
    Modelling and managing disjunctions in scheduling problems
    • 13
    • PDF
    A Scheduling Tool for Conditionally Independent Temporal Preferences
    • Roberto Micalizio, G. Torta
    • Computer Science
    • 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)
    • 2015
    • PDF
    Contingent durations in temporal CSPs: from consistency to controllabilities
    • T. Vidal, H. Fargier
    • 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
    • 515
    On binary constraint networks
    • 71
    Consistency in Networks of Relations
    • 2,864
    • Highly Influential
    • PDF
    Networks of constraints: Fundamental properties and applications to picture processing
    • 1,533
    • Highly Influential
    Temporal Data Base Management
    • 434
    The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems
    • 741
    Reasoning in Time and Space
    • 76
    • PDF
    Approximation Algorithms for Temporal Reasoning
    • 131
    • Highly Influential
    • PDF
    Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
    • 127
    • PDF