1990
DOI: 10.1145/79204.79209
|View full text |Cite
|
Sign up to set email alerts
|

Constraint logic programming languages

Abstract: aphon final survival corresponds to the existence of a solution ||lem expressed in the language of constraints. Better yet 0ng a solution amounts to finding a "creature" capable of "Ch mtiilessxonstraints. Jacpes CoheDconstraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the pattern matching mechanism of unification, as used in Prolog, by a more general operation called constraint satisfaction. This article provides a panoramic view of the recent work done in designing and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
52
0
2

Year Published

1992
1992
2009
2009

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 195 publications
(54 citation statements)
references
References 17 publications
0
52
0
2
Order By: Relevance
“…The key to Refresh's healing capabilities is its ability to use a constraint solver (Cohen, 1990) to derive a new feature selection for the application automatically. Prior work (Benavides et al, 2005(Benavides et al, , 2007White et al, 2007a) provides extensive details on the process for transforming a feature selection problem into a CSP (Cohen, 1990), which is the input format of a constraint solver and deriving a feature selection.…”
Section: Automated Feature Selection Using a Constraint Solvermentioning
confidence: 99%
See 1 more Smart Citation
“…The key to Refresh's healing capabilities is its ability to use a constraint solver (Cohen, 1990) to derive a new feature selection for the application automatically. Prior work (Benavides et al, 2005(Benavides et al, , 2007White et al, 2007a) provides extensive details on the process for transforming a feature selection problem into a CSP (Cohen, 1990), which is the input format of a constraint solver and deriving a feature selection.…”
Section: Automated Feature Selection Using a Constraint Solvermentioning
confidence: 99%
“…Prior work (Benavides et al, 2005(Benavides et al, , 2007White et al, 2007a) provides extensive details on the process for transforming a feature selection problem into a CSP (Cohen, 1990), which is the input format of a constraint solver and deriving a feature selection. We briefly cover this mapping below.…”
Section: Automated Feature Selection Using a Constraint Solvermentioning
confidence: 99%
“…Constraint Logic Programming (CLP) [3] has proved to be an adequate Artificial Intelligence (AI) tool for supporting the declarative geometric programming found in GeoSpecif. We have used the following advantages of the CLP language Prolog III [4]:…”
Section: Declarative Geometric Programmingmentioning
confidence: 99%
“…mathematics. and formal languages" [Cohen 1990]. The combination of logic programming with constraint satisfaction is a natural extension of traditional logic programming languages since the fundamental unification process can be viewed as a special case of constraint satisfaction; i.e., unification of f(X,a) with f(bY) is equivalent to solving f(X.a)=f(b.Y).…”
Section: Constraint Logic Programmingmentioning
confidence: 99%