Deductive Generation of Constraint Propagation Rules
โ Scribed by Sebastian Brand; Eric Monfroy
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 189 KB
- Volume
- 86
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
โฆ Synopsis
Constraint propagation can often be conveniently expressed by rules. In recent years, a number of techniques for automatic generation of rule-based constraint solvers have been developed, most of them using a generate-and-test approach. We examine a generation method that is based on deduction. A solver (i. e., a set of rules) for a complex constraint is obtained from one or several weaker solvers for simple constraints. We describe incremental solver constructions for several types of constraint modifications, including conjunction, existential and universal quantification.
๐ SIMILAR VOLUMES
We consider a constrained equational logic where the constraints are membership conditions t โ s where s is interpreted as a regular tree language. Our logic includes a fragment of second-order equational logic (without projections) where second-order variables range over regular sets of contexts. T
Constraint Handling Rules (CHR) are our proposal to allow more ยฏexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-deยฎned constraints. CHR are essentially a committedchoice language consisting of multi
The Internal Revenue Service recently issued a ruling signaling a change in its position affecting the deductibility of performance-based compensation that can be paid to a highly compensated officer when that employee is terminated or retires. The ruling concludes that such compensation does not qu