Constraint propagation with interval labels
Artificial Intelligence
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Constraint relaxation may be perfect
Artificial Intelligence
Artificial intelligence (3rd ed.)
Artificial intelligence (3rd ed.)
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
C4.5: programs for machine learning
C4.5: programs for machine learning
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Fast discovery of association rules
Advances in knowledge discovery and data mining
Rule-based constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
A proof theoretic view of constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
The essence of constraint propagation
Theoretical Computer Science
Maintaining knowledge about temporal intervals
Communications of the ACM
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Selected Papers from Constraint Programming: Basics and Trends
The Rough Guide to Constraint Propagation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Propagation Completeness of Reactive Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Indexical-Based Solver Learning
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Schedulers for rule-based constraint programming
Proceedings of the 2003 ACM symposium on Applied computing
Automatic generation of rule-based constraint solvers over finite domains
ACM Transactions on Computational Logic (TOCL)
Schedulers and redundancy for a class of constraint propagation rules
Theory and Practice of Logic Programming
Removing propagation redundant constraints in redundant modeling
ACM Transactions on Computational Logic (TOCL)
Boolean Propagation Based on Literals for Quantified Boolean Formulae
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Using AI for olympic equestrian event preparation
IAAI'08 Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3
Propagation redundancy for permutation channels
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Decision supporting system based on fuzzy default reasoning
HSI'09 Proceedings of the 2nd conference on Human System Interactions
A note on redundant rules in rule-based constraint programming
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Generating special-purpose stateless propagators for arbitrary constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A hybrid BDD and SAT finite domain constraint solver
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Explaining constraint programming
Processes, Terms and Cycles
On rule systems whose consistency can be locally maintained
AI Communications - Intelligent Engineering Techniques for Knowledge Bases
Hi-index | 0.00 |
We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas. Then we consider constraint satisfaction problems that are based on predefined, explicitly given constraints. To solve them we first derive rules from these explicitly given constraints and limit the computation process to a repeated application of these rules, combined with labeling. We consider two types of rule here. The first type, that we call equality rules, leads to a new notion of local consistency, called rule consistency that turns out to be weaker than arc consistency for constraints of arbitrary arity (called hyper-arc consistency in Marriott & Stuckey (1998)). For Boolean constraints rule consistency coincides with the closure under the well-known propagation rules for Boolean constraints. The second type of rules, that we call membership rules, yields a rule-based characterization of arc consistency. To show feasibility of this rule-based approach to constraint programming, we show how both types of rules can be automatically generated, as CHR rules of Frühwirth (1995). This yields an implementation of this approach to programming by means of constraint logic programming. We illustrate the usefulness of this approach to constraint programming by discussing various examples, including Boolean constraints, two typical examples of many valued logics, constraints dealing with Waltz's language for describing polyhedral scenes, and Allen's qualitative approach to temporal logic.