Results 241 to 250 of about 1,803,631 (274)

Constraint Logic Programming

Lecture Notes in Computer Science, 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
Mark Wallace
exaly   +2 more sources

A constraint logic programming shell

2005
The 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.
Peter Stuckey
exaly   +3 more sources

Logic, Optimization, and Constraint Programming

INFORMS Journal on Computing, 2002
Because 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 ...
exaly   +2 more sources

Functional and Constraint Logic Programming

Lecture Notes in Computer Science, 2001
Mario Rodriguez-Artalejo
exaly   +2 more sources

Constraint logic programming

Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87, 1987
We address the problem of designing programming systems to reason with and about constraints. Taking a logic programming approach, we define a class of programming languages, the CLP languages, all of which share the same essential semantic properties.
Joxan Jaffar, Jean-Louis Lassez
openaire   +1 more source

Constraint logic programming

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

Termination of constraint logic programs

1997
In 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

1995
In 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, 2002
This 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

Home - About - Disclaimer - Privacy