Constraint retraction in CLP(FD): Formal framework and performance results
From MaRDI portal
Publication:1294043
DOI10.1023/A:1009893626769zbMATH Open0928.68023MaRDI QIDQ1294043FDOQ1294043
Authors: Yan Georget, Philippe Codognet, Francesca Rossi 
Publication date: 9 January 2000
Published in: Constraints (Search for Journal in Brave)
Recommendations
- Justifications in constraint handling rules for logical retraction in dynamic algorithms
- Justifications in constraint handling rules for logical retraction in dynamic algorithms: theory, implementations, and complexity
- Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14].1
- scientific article; zbMATH DE number 2152986
- Principles and Practice of Constraint Programming – CP 2004
Cited In (7)
- Constraint retraction in FD
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
- Title not available (Why is that?)
- Justifications in constraint handling rules for logical retraction in dynamic algorithms
- Justifications in constraint handling rules for logical retraction in dynamic algorithms: theory, implementations, and complexity
- Constraint solving in uncertain and dynamic environments: A survey
- Contractibility for open global constraints
This page was built for publication: Constraint retraction in CLP(FD): Formal framework and performance results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294043)
