Results 1 
9 of
9
Deriving Filtering Algorithms from Constraint Checkers
 Principles and Practice of Constraint Programming (CP’2004), volume 3258 of LNCS
, 2004
"... Abstract. This reportdeals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in ¦ , where ¦ is the number of variables of the corresponding global constraint. By reformulating the automaton as a conjunction ..."
Abstract

Cited by 50 (10 self)
 Add to MetaCart
(Show Context)
Abstract. This reportdeals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in ¦ , where ¦ is the number of variables of the corresponding global constraint. By reformulating the automaton as a conjunction of signature and transition constraints we show how to systematically obtain a filtering algorithm. Under some restrictions on the signature and transition constraints this filtering algorithm achieves arcconsistency. An implementation based on some constraints as well as on the metaprogramming facilities of SICStus Prolog is available. For a restricted class of automata we provide a filtering algorithm for the relaxed case, where the violation cost is the minimum number of variables to unassign in order to get back to a solution. Keywords: Constraint Programming,
Constraint logic programming  an informal introduction
 LOGIC PROGRAMMING IN ACTION, NUMBER 636 IN LNCS
, 1992
"... Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
(Show Context)
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduling, planning or resource allocation can now be solved, which were intractable for logic programming so far. The most important advantage that these languages offer is the short development time while exhibiting an efficiency comparable to imperative languages. This tutorial aims at presenting the principles and concepts underlying these languages and explaining them by examples. The objective of this paper is not to give a technical survey of the current state of art in research on CLP, but rather to give a tutorial introduction and to convey the basic philosophy that is behind the different ideas in CLP. It will discuss the currently most successful computation domains and provide an overview on the different consi...
An abstract interpretation based combinator for modeling while loops in constraint programming
 In Proceedings of Principles and Practices of Constraint Programming (CP’07), Springer Verlag, LNCS 4741
, 2007
"... Abstract. We present the w constraint combinator that models while loops in Constraint Programming. Embedded in a finite domain constraint solver, it allows programmers to develop nontrivial arithmetical relations using loops, exactly as in an imperative language style. The deduction capabilities o ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
(Show Context)
Abstract. We present the w constraint combinator that models while loops in Constraint Programming. Embedded in a finite domain constraint solver, it allows programmers to develop nontrivial arithmetical relations using loops, exactly as in an imperative language style. The deduction capabilities of this combinator come from abstract interpretation over the polyhedra abstract domain. This combinator has already demonstrated its utility in constraintbased verification and we argue that it also facilitates the rapid prototyping of arithmetic constraints (e.g. power, gcd or sum). 1
Reformulation of global constraints based on constraints checkers. Constraints 10(4):339–362
, 2005
"... Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended nite automaton whose size is bounded by a polynomial in n, where n is the number of variables of the corresponding global constraint. By reducing the automaton to a conjunction of si ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended nite automaton whose size is bounded by a polynomial in n, where n is the number of variables of the corresponding global constraint. By reducing the automaton to a conjunction of signature and transition constraints we show how to systematically obtain an automaton reformulation. Under some restrictions on the signature and transition constraints, this reformulation maintains arcconsistency. An implementation based on some constraints as well as on the metaprogramming facilities of SICStus Prolog is available. For a restricted class of automata we provide an automaton reformulation for the relaxed case, where the violation cost is the minimum number of variables to unassign in order to get back to a solution. 1
A TheoremProving Approach to Jobshop Scheduling
, 1994
"... In this paper we formulate the jobshop scheduling problem in the theoremproving framework described in [12, 5]. In the theoremproving framework two kinds of predicates are allowed: ordinary predicates, defined by ifandonlyifdefinitions [3], and primitive predicates, "defined" by axi ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper we formulate the jobshop scheduling problem in the theoremproving framework described in [12, 5]. In the theoremproving framework two kinds of predicates are allowed: ordinary predicates, defined by ifandonlyifdefinitions [3], and primitive predicates, "defined" by axioms that can be thought of as integrity constraints. The framework seeks to unify constraint logic programming (CLP) and abductive logic programming (ALP). The class of the primitive predicates includes constraint predicates like equality and inequality as well as abducible predicates. The "integrity constraints" defining the primitive predicates consist of axioms for equality and inequality in the case of constraint predicates and more conventional integrity constraints in the case of abducibles. The framework differs from conventional CLP primarily in the fact that constraint handling is performed by explicit execution of integrity constraints written in logical form. In the theoremproving framewor...
A Planning Architecture using Temporal Constraint Solving
, 1993
"... In this report we describe a generic planning architecture developed in the context of Constraint Logic Programming. Constraintsolving is used to handle both temporal and nontemporal reasoning tasks that arise in planning. The architecture allows considerable sophistication in problem specificatio ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this report we describe a generic planning architecture developed in the context of Constraint Logic Programming. Constraintsolving is used to handle both temporal and nontemporal reasoning tasks that arise in planning. The architecture allows considerable sophistication in problem specification, and naturally produces plans with a high degree of concurrency in action execution.
CHIC  Final Technical Report
, 1995
"... This documents provides an overview on the CHIC project. It describes its structure and summarizes its main objectives. A summary of the applications developed in the project is following showing the wide applicability of constraint logic programming. Based on the experience gained in developing CLP ..."
Abstract
 Add to MetaCart
This documents provides an overview on the CHIC project. It describes its structure and summarizes its main objectives. A summary of the applications developed in the project is following showing the wide applicability of constraint logic programming. Based on the experience gained in developing CLP applications the first steps towards a methodology for constraint applications is presented. It then presents an outline of the research results achieved in the course of the project. These resarch results are integrated in the CHIC platform Eclipse, the new constraint logic programming platform developed in the CHIC project.
Constraint Logic Programming  Status and Prospects
"... this paper, the CLP framework suuports a close cooperation between the algorithms in a way that is not supported, for example, when a set of packages are glued together by the underlying operating system. Constraints programming has been successfully applied for solving complex industrial problems i ..."
Abstract
 Add to MetaCart
this paper, the CLP framework suuports a close cooperation between the algorithms in a way that is not supported, for example, when a set of packages are glued together by the underlying operating system. Constraints programming has been successfully applied for solving complex industrial problems in areas such as planning, transportation, scheduling and resource allocation: but applications are the subject of the third section. 2.2 Constraints Programming Example