Results 221 to 230 of about 3,012,120 (253)
Some of the next articles are maybe not open access.
The Knowledge Engineering Review, 1991
Abstract Constraint logic programming (CLP) is a generalization of logic programming (LP) where unification, the basic operation of LP languages, is replaced by constraint handling in a constraint system. The resulting languages combine the advantages of LP (declarative semantics, nondeterminism, relational form) with the efficiency ...
openaire +2 more sources
Abstract Constraint logic programming (CLP) is a generalization of logic programming (LP) where unification, the basic operation of LP languages, is replaced by constraint handling in a constraint system. The resulting languages combine the advantages of LP (declarative semantics, nondeterminism, relational form) with the efficiency ...
openaire +2 more sources
2002
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages and systems are now available either as open source programs or as
openaire +1 more source
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages and systems are now available either as open source programs or as
openaire +1 more source
A constraint logic programming shell
2005The Constraint Logic Programming (CLP) scheme generalizes the model-theoretic and operational models of logic programming to include constraints over particular problem domains (structures). The scheme explicitly separates logical inference steps and structure satisfiability questions.
Pierre Lim, Peter J. Stuckey
openaire +2 more sources
Termination of constraint logic programs
1997In this paper, we introduce a method for proving universal termination of constraint logic programs by strictly extending the approach of Apt and Pedreschi [1]. Taking into account a generic constraint domain instead of the standard Herbrand univers, acceptable (CLP) programs are defined. We prove correctness and completeness of the method w.r.t.
openaire +3 more sources
Interval constraint logic programming
1995In this paper, we present an overview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate n-ary relations over IR with Cartesian products of intervals whose bounds are taken in a finite subset of IR.
openaire +1 more source
Sequences constraint solving in constraint logic programming
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94, 2002This paper deals with consistency techniques over sequences constraints embedded in Constraint Logic Programming CLPS. CLP Sequences constraints are defined over Hereditarily Homogeneous Finite Sets HHFS built on atomic elements to characterise a family of admissible sequences. The relations we are dealing with are classical sets relations (/spl isin/,/
Pierre Baptiste +2 more
openaire +2 more sources
An algebraic perspective of constraint logic programming
Journal of Logic and Computation, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank S. de Boer +2 more
openaire +3 more sources
Constraint logic programming languages
Communications of the ACM, 1990Constraint 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 aritcle provides a panoramic view of the recent work done in designing and implementing CLP languages. It also presents a summary of
openaire +1 more source
Induction of Constraint Logic Programs
1996Inductive Logic Programming is mainly concerned with the problem of learning concept definitions from positive and negative examples of these concepts and background knowledge. Because of complexity problems, the underlying first order language is often restricted to variables, predicates and constants.
Lionel Martin, Christel Vrain
openaire +2 more sources
Logic, Optimization, and Constraint Programming
INFORMS Journal on Computing, 2002Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how these ways ...
openaire +1 more source

