Networks of qualitative interval relations: Combining circuit consistency and path consistency in the search for a solution

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 1996, Pages 57-62

  Isli, A ^a   Bennaceur, H ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

ATOMIC NETWORKS; CIRCUIT CONSISTENCY; INTERVAL NETWORK; ONE-FACTOR; PATH CONSISTENCY; SEARCH ALGORITHMS; SEARCH TREES;

TIMING CIRCUITS;

EID: 33749551658     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.1996.555682     Document Type: Conference Paper

References (13)

1. Allen, J.F., Maintaintng Knowledge About Temporal Intervals, Communications of the ACM 26 (11) (1983) 832-843.
2. Bennaceur, H. , Partial Consistency for Constraint Satisfaction Problems, in: Proceedings ECAI-94, Amsterdam, (1994) 120-124.
3. Dechter, R., Meiri, I. and Pearl, J., Temporal Constraint Networks, Artificial Intelligence 49 (1991) 61-95.
4. Freuder, E.C., A Suficient Condition for Backtrack-free Search, Journal of the ACM 29 (1982) 24-32.
5. Gaschnig, J., Experimental case studies of backtrack us. Waltz-Type us. new algorithms for satasficing asszgnment problems, in: Proceedings of the Second Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Toronto, Ont., (1978) 268-277.
6. Isli, A. and Bennaceur, H., Networks of qualitative interval relations: combining circuit consistency and path consistency in the search for a solution, Pré-publication, LI. P.N., Université Paris 13, France (to appear).
7. Ladkin, P. and Reinefeld, A., Effective solution of qualitative constraint problems, Artificial Intelligence 57 (1992) 105-124.
8. Mackworth, A.K., Consistency in Networks of Relations, Artificial Intelligence 8 (1977) 99-118.
9. Montanan, U., Networks of Constraints: Fundamental Properties and Applicatzons to Picture Processing, Information Sciences 7 (1974) 95-132.
10. Nebel, B. and Biirckert, H.J., Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allens interval Algebra, in: Proceedings AAAI-94, Seattle, WA, (1994) 356-361.
11. Valdés-Pérez, R.E., The satisfiability of temporal constraint networks, in: Proceedings AAAI-87, Seattle, Washington, (1987) 256-260.
12. van Beek, P., Reasoning about Qualitative Temporal Information, Artificial Intelligence 58 (1992) 297-326.
13. Vilain, M. and Kautz, H., Con. straint Propagation Algorithms for Temporal Reasoning, in: Proceedings AAAI-82, Philadelphia, PA, (1986) 377-382.