Propagation completeness of reactive constraints

DOI10.1007/3-540-45619-8_11MaRDI QIDQ4809162zbMATH OpenFDO

Authors Michael J. Maher

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2401/24010148.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• The essence of constraint propagation
• scientific article; zbMATH DE number 1234564
• Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14].1
• Automatic generation of constraint propagation algorithms for small finite domains
• Constraint propagation: Between abstract models and ad hoc strategies

Cited in

(3)

• Local consistency for extended CSPs
• View-based propagation of decomposable constraints
• Completeness of Conversion between Reactive Programs for Ultrametric Models

This page was built for publication: Propagation completeness of reactive constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809162)