Abstract
For many real-life problems naturally modeled as constraints systems, we have to manage dynamically systems of constraints. So, a model based on the formalism of finite Constraint Satisfaction Problems (CSPs) (Montanari, 1974) has been proposed with Dynamic CSPs (DCSPs) to handle this kind of problem (Dechter and Dechter, 1988; Janssen et al., 1990). Some classical techniques defined in the field of CSPs are usable in DCSPs, but the management of dynamicity induces new problems such as management of over-constrained systems and consistency maintenance. At present, Constraint Programming tools generally do not offer a framework for integrating dynamic constraints. The purpose of this paper is to introduce an efficient way to solve DCSPs based on a logical approach. We use and extend Ordered Binary Decision Diagrams (OBDDs) (Bryant, 1986) and propose a particular coding for dynamicity. We show that our approach allows to solve some major questions in the field of DCSPs.
Sign-in/Register to access full text options 
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.
