S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for nite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP00, LNCS 1894. Springer-Verlag, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint Solver Synthesis using Tabled - Resolution For Constraint Self-citation (Abdennadher Rigotti) (Correct)
No context found.
S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for nite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP00, LNCS 1894. Springer-Verlag, 2000.
Rule-Based Constraint Programming: Theory and Practice - Abdennadher (2001) Self-citation (Abdennadher) (Correct)
....to specify the form of the rules she he wants to generate. The method allows any kind of constraints in the left hand side of rules and in their right hand side as well. The generation of rules is performed in two steps. In a rst step, only propagation rules are generated (Section 4. 1) [10]. This method is inspired by techniques used in the eld of knowledge discovery. Since a propagation rule does not rewrite constraints but adds new ones, the constraint store may contain super uous information. Constraints can be removed from the constraint store using simpli cation rules. In ....
S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for nite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP00, LNCS 1894. SpringerVerlag, 2000. 105
Automatic Generation of Rule-based Solvers for.. - Abdennadher, Rigotti (2002) Self-citation (Abdennadher Rigotti) (Correct)
No context found.
S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for nite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP'00, LNCS 1894, pages 18-34. Springer-Verlag, September 2000.
Using Confluence to Generate Rule-based Constraint Solvers - Abdennadher, Rigotti (2001) Self-citation (Abdennadher Rigotti) (Correct)
....ABSTRACT A general approach to implement propagation and simpli cation of constraints consists of applying rules over these constraints. Recently, several proposals have been made to solve nite constraint satisfaction problems by means of automatically generated propagation rules [4, 9, 3]. Since propagation rules do not rewrite constraints but add new ones, the constraint store may contain super uous constraints. Removing these constraints not only allows saving of space but also decreases the cost of constraint solving. Constraints can be removed using simpli cation rules. In ....
....solvers. A diculty that arises frequently when writing a constraint solver is to determine the constraint propagation algorithm. Recently, several proposals have been made to solve nite constraint satisfaction problems by means of automatically generated constraint propagation algorithms [4, 9, 3]. The approach we have taken in [3] is to develop an automatic method to generate propagation rules de ning some properties of constraints given their extensional de nition. Using our method based on techniques used in the eld of knowledge discovery the user has the possibility to specify the ....
[Article contains additional citation context not shown here]
S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for nite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP00, LNCS 1894. Springer-Verlag, 2000.
Towards Inductive Constraint Solving - Abdennadher, Rigotti (2001) Self-citation (Abdennadher Rigotti) (Correct)
....69621 Villeurbanne Cedex, France Christophe.Rigotti insa lyon.fr Abstract. A diculty that arises frequently when writing a constraint solver is to determine the constraint propagation and simpli cation algorithm. In previous work, di erent methods for automatic generation of propagation rules [5, 17, 3] and simpli cation rules [4] for constraints de ned over nite domains have been proposed. In this paper, we present a method for generating rule based solvers for constraint predicates de ned by means of a constraint logic program, even when the constraint domain is in nite. This approach ....
....ICLP extends ideas and results from ILP to the learning of constraint logic programs. In this paper, we propose a method to learn rule based constraint solvers from the de nitions of the constraint predicates. We call this approach Inductive Constraint Solving (ICS) It extends previous works [5, 17, 3] where di erent methods for automatic generation of propagation rules for constraints de ned over nite domains have been proposed. In rule based constraint programming, the solving process of constraints consists of a repeated application of rules. In general, we distinguish two kinds of rules: ....
[Article contains additional citation context not shown here]
S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for nite domains. In Proc. of the 6th International Conference on Principles and Practice of Constraint Programming, CP'00, LNCS 1894, pages 18-34. SpringerVerlag, September 2000.
Using Confluence to Generate Rule-based Constraint Solvers - Abdennadher, Rigotti (2001) Self-citation (Abdennadher Rigotti) (Correct)
....89 2178 2211 Abstract: A general approach to implement propagation and simpli cation of constraints consists of applying rules over these constraints. Recently, several proposals have been made to solve nite constraint satisfaction problems by means of automatically generated propagation rules [4,9,3]. Since propagation rules do not rewrite constraints but add new ones, the constraint store may contain super uous constraints. Removing these constraints not only allows saving of space but also decreases the cost of constraint solving. Constraints can be removed using simpli cation rules. In ....
....ABSTRACT A general approach to implement propagation and simpli cation of constraints consists of applying rules over these constraints. Recently, several proposals have been made to solve nite constraint satisfaction problems by means of automatically generated propagation rules [4, 9, 3]. Since propagation rules do not rewrite constraints but add new ones, the constraint store may contain super uous constraints. Removing these constraints not only allows saving of space but also decreases the cost of constraint solving. Constraints can be removed using simpli cation rules. In ....
[Article contains additional citation context not shown here]
S. Abdennadher and C. Rigotti. Automatic generation of propagation rules for nite domains. In 6th International Conference on Principles and Practice of Constraint Programming, CP00, LNCS 1894. Springer-Verlag, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC