Constraint Retraction for Dynamic Constraint Satisfaction Problems over Disjoint Real Intervals

Duong Tuan Anh ()
Additional contact information
Duong Tuan Anh: Hochiminh City University of Technology

A chapter in Modeling, Simulation and Optimization of Complex Processes, 2005, pp 1-14 from Springer

Abstract: Summary In a dynamic constraint satisfaction problem (dynamic CSP),we can add a new constraint to the constraint network (a restriction) or delete an old constraint (a relaxation) at any time. Therefore, incrementality is crucial for solving a dynamic CSP since we do not want to resolve the whole constraint system from scratch whenever a restriction or a relaxation occurs. In this paper, we propose an algorithm that can handle incremental constraint retraction in dynamic CSPs over real intervals. Basing on the hierarchical arc-consistency technique for disjoint real intervals developed by G. Sidebottom and W.S. Havens, we extent the proposed algorithm to be the one dealing with constraint deletion in dynamic CSPs over disjoint real intervals. The extended algorithm makes incremental deletion of constraints over disjoint real intervals a feasible task that can be efficiently implemented.

Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-27170-3_1

Ordering information: This item can be ordered from
http://www.springer.com/9783540271703

DOI: 10.1007/3-540-27170-8_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().