Negation and control in Prolog
Negation and control in Prolog
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A methodology for managing hard constraints in CLP systems
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent constraint programming
Concurrent constraint programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
From concurrent logic programming to concurrent constraint programming
Advances in logic programming theory
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
Solving the Multiplication Constraint in Several Approximation Spaces
Proceedings of the 17th International Conference on Logic Programming
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Constraint Representation for Propagation
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Logic programming in the context of multiparadigm programming: the Oz experience
Theory and Practice of Logic Programming
Constraint programming viewed as rule-based programming
Theory and Practice of Logic Programming
A compositional semantics for CHR
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A compositional semantics for CHR
ACM Transactions on Computational Logic (TOCL)
Local consistency for extended CSPs
Theoretical Computer Science
Finite domain bounds consistency revisited
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
| Hi-index | 0.00 |
We develop a framework for addressing correctness and timeliness-of-propagation issues for reactive constraints - global constraints or user-defined constraints that are implemented through constraint propagation. The notion of propagation completeness is introduced to capture timeliness of constraint propagation. A generalized form of arc-consistency is formulated which unifies many local consistency conditions in the literature. We show that propagation complete implementations of reactive constraints achieve this arc-consistency when propagation quiesces. Finally, we use the framework to state and prove an impossibility result: that CHR cannot implement a common relation with a desirable degree of timely constraint propagation.