Integration and Optimization of Rule-Based Constraint Solvers

Abdennadher, Slim; Frühwirth, Thom

doi:10.1007/978-3-540-25938-1_17

Cited by 16 publications

(21 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2. Redundancy Pruning: To suppress the generation of redundant rules, we use the algorithm proposed in [1]. The idea of the algorithm is based on operational equivalence of programs.…”

Section: Combined Approachmentioning

confidence: 99%

Generation of Rule-Based Constraint Solvers: Combined Approach

Abdennadher

Sobhi

2008

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. Inductive Constraint Solving is a subfield of inductive machine learning concerned with the automatic generation of rule-based constraint solvers. In this paper, we propose an approach to generate constraint solvers given the definition of the constraints that combines the advantages of generation by construction with generation by testing. In our proposed approach, semantically valid rules are constructed symbolically, then the constructed rules are used to prune the search tree of a generate and test method. The combined approach leads in general to more expressive and efficient constraint solvers. The generated rules are implemented in the language Constraint Handling Rules.

show abstract

“…2. Redundancy Pruning: To suppress the generation of redundant rules, we use the algorithm proposed in [1]. The idea of the algorithm is based on operational equivalence of programs.…”

Section: Combined Approachmentioning

confidence: 99%

Generation of Rule-Based Constraint Solvers: Combined Approach

Abdennadher

Sobhi

2008

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is achieved by expanding the guard expressions to disjunctive normal form and splitting each disjunct into a new rule. Then, we apply the redundant rules removal algorithm of [9] on the complete rule set. After redundant rules are removed, guards originating from the same rule are recombined to avoid loss of completeness.…”

Section: Solver Optimizationmentioning

confidence: 99%

“…To remove redundant rules, the algorithm of [9] is used. The idea of the algorithm is based on operational equivalence of programs.…”

Section: Redundant Rules Removalmentioning

confidence: 99%

“…To reduce the search space of the generate and test method, the symbolic construction algorithm is run first and the constructed rules eliminated from the enumeration tree of the generate and test. Moreover, the algorithm of [9] is used to remove the redundant rules of the combined solver. In general, the combined solvers are more expressive than the solvers of either approaches.…”

Section: Combined Approachmentioning

confidence: 99%

See 1 more Smart Citation

Constructing Rule-Based Solvers for Intentionally-Defined Constraints

Sobhi

Abdennadher

Betz

2008

Constraint Handling Rules

Self Cite

View full text Add to dashboard Cite

Abstract. Developing constraint solvers which are key requisites of constraint programming languages is time consuming and difficult. In this paper, we propose a generic algorithm that symbolically constructs rulebased solvers from the intensional definition of the constraint. Unlike the well-established "generate and test" approach, our symbolic construction approach is capable of generating recursive rules from a recursive constraint definition. Combining the two approaches gives better filtering capabilities than either of the approaches acting alone.

show abstract

“…At the current state of research, we would like to refer to the papers [AF04] in which techniques to detect redundant rules in a program is described.…”

Section: Redundant Rules For Correctnessmentioning

confidence: 99%

Specialization of Concurrent Guarded Multi-set Transformation Rules

Frühwirth

2005

Logic Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. Program transformation and in particular partial evaluation are appealing techniques for declarative programs to improve not only their performance. This paper presents the first step towards developing program transformation techniques for a concurrent constraint programming language where guarded rules rewrite and augment multi-sets of atomic formulae, called Constraint Handling Rules (CHR). We study the specialization of rules with regard to a given goal (query). We show the correctness of this program transformation: Adding and removing specialized rules in a program does not change the program's operational semantics. Furthermore termination and confluence of the program are shown to be preserved.

show abstract

Integration and Optimization of Rule-Based Constraint Solvers

Cited by 16 publications

References 15 publications

Generation of Rule-Based Constraint Solvers: Combined Approach

Generation of Rule-Based Constraint Solvers: Combined Approach

Constructing Rule-Based Solvers for Intentionally-Defined Constraints

Specialization of Concurrent Guarded Multi-set Transformation Rules

Contact Info

Product

Resources

About