Abstract
A module for quantitative constraint propagation forms the core of any problem solving architecture devoted to planning and scheduling in realistic applications. This paper deals with temporal constraint propagation in quantitative networks. We are interested in developing a module that efficiently checks the consistency of an incrementally built temporalized solution. The paper presents a clean definition of the consistency checking problem in temporal networks and describes an algorithm that is correct and complete with respect to such a definition. A sufficient condition for inconsistency is also presented which is useful for improving the algorithm, and the computational complexity of the approach as a whole is discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
