Results 211 to 220 of about 29,551 (265)
Some of the next articles are maybe not open access.
Constraint programming and maths programming
The Knowledge Engineering Review, 2001Maths programming (MP) and constraint programming (CP) are two techniques that are able to solve difficult industrial optimisation problems. The purpose of this paper is to compare them from an algorithmic and a modelling point of view. Algorithmic principles of each approach are described and contrasted. Some ways of combining both techniques are also
Jean-François Puget, Irvin Lustig
openaire +2 more sources
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
1998
Constraint Programming (CP) has proven useful in several areas, and though the initial impetus came from logic programming frameworks like CLP and CCP, the use of CP and constraint solving is obtaining wider appeal. We suggest that the limiting features of traditional CP are a dependence on a (logic) language, the need for monotonicity in the ...
Joxan Jaffar, Roland H. C. Yap
openaire +2 more sources
Constraint Programming (CP) has proven useful in several areas, and though the initial impetus came from logic programming frameworks like CLP and CCP, the use of CP and constraint solving is obtaining wider appeal. We suggest that the limiting features of traditional CP are a dependence on a (logic) language, the need for monotonicity in the ...
Joxan Jaffar, Roland H. C. Yap
openaire +2 more sources
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
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
Principles of Constraint Programming
2003Constraints are everywhere: most computational problems can be described in terms of restrictions imposed on the set of possible solutions, and constraint programming is a problem-solving technique that works by incorporating those restrictions in a programming environment. It draws on methods from combinatorial optimisation and artificial intelligence,
openaire +4 more sources
Programming with a Quadratic Constraint
Management Science, 1966A method is given for maximizing a linear function subject to a quadratic and a number of linear constraints. The method differs from general convex programming methods by terminating in a finite number of iterations and is actually an application of the Simplex and dual methods for quadratic programming to parametric quadratic programming problems ...
openaire +1 more source
Constraint Programming in Sweden
IEEE Intelligent Systems, 2009Many important problems must be solved by intelligent search for example, problems in scheduling, rostering, configuration, facility location, biology, finance, circuit layout, and hard/software specification checking. Constraint programming (CP) is rapidly becoming the method of choice in some areas, such as scheduling and configuration.
Pierre Flener +2 more
openaire +1 more source
Parallelizing constraint programs
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming, 2010The availability of commodity multicore and multiprocessor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. Both constraint-based local search and finite-domain techniques can dramatically benefit from parallelization.
openaire +2 more sources
Observation of Constraint Programs
2003Constraint programming still lacks the suitable debugging tools and techniques. When a program gives incorrect results or when its performances are disappointing, the developer gets very little support from his programming environment to find out the problem. Specific tools are needed to ease this debugging stage.
openaire +1 more source