Results 201 to 210 of about 31,869 (248)

Value Constraints in the CLP Scheme

Constraints, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Optimizing compilation of CLP( ℛ )

ACM Transactions on Programming Languages and Systems, 1998
Constraint Logic Programming (CLP) languages extend logic programming by allowing the use of constraints from different domains such as real numbers or Boolean functions. They have proved to be ideal for expressing problems that require interactive mathematical modeling and complex combinatorial optimization problems. However, CLP languages have mainly
Kelly, A.D., Marriott, K., Macdonald, A., Stuckey, P.J., Yap, R.   +4 more
openaire   +1 more source

Path consistency in clp(FD)

2005
We consider methods for handling constraints over finite domains based on the notion of path consistency. We show that these methods can be easily integrated in the glassbox constraint-solver of the clp(FD) system. Besides the clp(FD) indexical constraints encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call ...
Philippe Codognet, Giuseppe Nardiello
openaire   +1 more source

ATP-promoted interaction between Clp A and Clp P in activation of Clp protease from Escherichia coli

Biochemical Society Transactions, 1991
Summary Clp protease is a high relative molecular mass, ATP-dependent protease found in the cytoplasm of Escherichia coli. Clp protease is composed of two protein components, Clp A, which has ATPase activity, and Clp P, which has the proteolytic active site and is activated by Clp A in the presence of ATP.
openaire   +2 more sources

Interpreting Abduction in CLP.

2003
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an efficient abductive solver where abducibles are treated as constraints. We propose two possible implementations, in which integrity constraints are exploited either (i) as the ...
GAVANELLI, Marco, LAMMA, Evelina, MELLO P., MILANO M., TORRONI P.   +4 more
openaire   +1 more source

An optimizing compiler for CLP(ℛ)

1995
The considerable expressive power and flexibility gained by combining constraint programming with logic programming is not without cost. Implementations of constraint logic programming (CLP) languages must include expensive constraint solving algorithms tailored to specific domains, such as trees, Booleans, or real numbers.
Andrew D. Kelly, Andrew D. Macdonald, Kim Marriott, Harald Søndergaard, Peter J. Stuckey, Roland H. C. Yap   +5 more
openaire   +1 more source

Short overview of the CLPS system

1991
We propose an extension of Prolog to deal with set expressions using equality and membership operators and allowing restricted universal quantifiers in goals. Such extension allows a better expressive power, in particular when the language is used for a functional specification purpose. Those set expressions are treated as symbolic constraints and some
Bruno Legeard, Emmanuel Legros
openaire   +1 more source

CLP-the Cornell list processor

Communications of the ACM, 1965
Presented in this paper are the highlights of CLP, a teaching language which has been employed at Cornell University and was constructed to serve as a means of introducing simulation and other list-processing concepts. The various advantages of CLP are discussed and examples are given.
Richard W. Conway, J. J. Delfausse, William L. Maxwell, W. E. Walker   +3 more
openaire   +1 more source

Early Projection in CLP(R)

1998
During the evaluation of a constraint logic program, many local variables become inaccessible, or dead. In Prolog and other programming languages, the data bound to local variables can be removed automatically by garbage collection. The case of CLP is more complex, as the variables may be involved in several constraints.
Andreas Fordan, Roland H. C. Yap
openaire   +1 more source

A CLP approach for examination planning

1995
In this chapter, we present an application of Constraint Logic Programming to the examination planning problem of our University. Each year, in June, 4000 students of various branches of instruction have to attend examination during a couple of weeks for academic reasons. The problem (for June 1993) consists of planning 308 different examinations on 33
Patrice Boizumault, Yan Delon, Laurent Péridy   +2 more
openaire   +1 more source