3 citations found. Retrieving documents...
Vilain, M. and Kautz, H.: \Constraint Propogation Algorithm for Temporal Reasoning", Proc. 5th American Conf. on AI (AAAI-86), Philadelphia, 1986, pages 377-382.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Qualitative Spatial Representation and Reasoning: An Overview - Cohn, Hazarika (2001)   (66 citations)  (Correct)

....nature of the calculus. For a representation using a limited set of binary relations, the simplicity of the compositional inference makes it an attractive means of e ective reasoning. Since their introduction, composition tables have received considerable attention from researchers, e.g. [178, 60, 79, 149, 158, 36, 161]. Most of the calculi mentioned in this paper have had composition tables constructed for them, though it has at times posed something of a challenge [149] A reformulation of the RCC rst order logic into a zero order representation 18 [7] in which intuitionistic propositional formulae ....

Vilain, M. and Kautz, H.: \Constraint Propogation Algorithm for Temporal Reasoning", Proc. 5th American Conf. on AI (AAAI-86), Philadelphia, 1986, pages 377-382.


Plans And Resource-Bounded Practical Reasoning - Bratman, Israel, Pollack (1988)   (227 citations)  (Correct)

....between options and design the compatibility filter so that it rules out all and only those options that overlap inappropriately with already intended actions. For an important class of cases, such a scheme can be implemented as a polynomial time constraint propagation algorithm over intervals (Kautz and Vilain 1986). Another idea would be to employ a Bratman, Israel, and Pollack 14 tractable system of defeasible reasoning involving imperfect, albeit still useful, filters. Such filters may be leaky , in that they sometimes let through options that are in fact incompatible, or they may be clogged , in that ....

H. A. Kautz and M. Vilain. 1986. Constraint Propogation Algorithms for Temporal Reasoning. In AAAI-86, Proceedings of the Fifth National Conference of the American Association for Artificial Intelligence, Philadelphia, Pennsylvania. Pages 377-382.


Retrieval Schedules Based on Resource Availibility .. - Selçuk.. (1996)   (1 citation)  (Correct)

No context found.

M. Vilain and H. Kautz (1986) Constraint Propogation Algorithms for Temporal Reasoning, Proceedings of AAAI-86, Artificial Intelligence, Aug. 1986, pp. 377-382.

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