The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
A minimal extension of the WAM for clp(FD)
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The nature of statistical learning theory
The nature of statistical learning theory
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
A high-level intermediate language and the algorithms for compiling finite-domain constraints
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
The essence of constraint propagation
Theoretical Computer Science
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Automatic Generation of Propagation Rules for Finite Domains
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Towards Inductive Constraint Solving
CP '01 Proceedings of the 7th 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
The CHIP System: Constraint Handling In Prolog
Proceedings of the 9th International Conference on Automated Deduction
Constraint programming viewed as rule-based programming
Theory and Practice of Logic Programming
On the implementation of gnu prolog
Theory and Practice of Logic Programming - Prolog Systems
Maintaining Generalized Arc Consistency on Ad-hoc n-ary Boolean Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Efficient representation of adhoc constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Finite domain constraint solver learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Towards solver-independent propagators
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
The pioneering works of Apt and Monfroy, and Abdennadher and Rigotti have shown that the construction of rule-based solvers can be automated using machine learning techniques. Both works implement the solver as a set of CHRs. But many solvers use the more specialized chaotic iteration of operators as operational semantics and not CHR's rewriting semantics. In this paper, we first define a language-independent framework for operator learning and then we apply it to the learning of partial arc-consistency operators for a subset of the indexical language of Gnu-Prolog and show the effectiveness of our approach by two implementations. On tested examples, Gnu-Prolog solvers are learned from their original constraints and powerful propagators are found for user-defined constraints.