A Design for a Generic Constraint Solver for Ordered Domains (1998) [3 citations — 2 self]
Download:
|
|
by Antonio J. Fern'andez
In Proc. of TCLP'98:Types for Constraint Logic Programming, a JICSLP'98 Post Conference Workshop
http://discipl.inria.fr/TCLP98/hill.ps.gz
Add To MetaCart
Abstract:
Abstract. It is well known that the expressive power and efficiency of Constraint Logic Programming (CLP) systems is reduced by the strong partitioning of the domains in which constraints can be expressed. This means constraints defined on a particular domain must be solved by a specific reasoning method with its associated solver that is not appropriate for constraints defined on other domains. In this paper, we describe a common unified framework for constraints on any computation domain in which an ordering has been defined. It is based on a single generic constraint and unique inference rule. We demonstrate, through examples, the expressiveness of our framework on a number of domains.
Citations
| 909 | Consistency in networks of relations – Mackworth - 1977 |
| 775 | Constraint Logic Programming – Jaffar, Lassez - 1987 |
| 157 | Applying interval arithmetic to real, integer and Boolean constraints – Benhamou, Older - 1997 |
| 148 | Compiling constraints in clp(fd – Codognet, Diaz - 1996 |
| 82 | Logical arithmetic – Cleary - 1987 |
| 78 | Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language – GERVET - 1997 |
| 19 | Hierarchical Arc Consistency for Disjoint Real Intervals in Constraint logic programming – SIDEBOTTOM, HAVENS - 1992 |
| 18 | Interval Computation as deduction in CHIP – Lee, Emden - 1993 |
| 3 | CLP(! lin ) Revised – REFALO, HENTENRYCK - 1996 |
| 2 | Curso de Algebra y Geometr'ia – BURGOS - 1988 |
