Results 1  10
of
29
Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type
, 2000
"... This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in ..."
Abstract

Cited by 75 (11 self)
 Add to MetaCart
This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in term of graph properties that have to hold, where the graph is a structured network of same elementary constraints. Since this classification is based on the internal structure of the global constraints it is also a strong hint for the pruning algorithms of the global constraints. Keywords Constraint, finite domain, global constraint, classification, resource constraint scheduling, graph partitioning, timetabling. 2 Table of contents Table of contents ....................................................................................................................................................... 2 Table of figures.........................................................................
Watched literals for constraint propagation in minion
 In Proc. CP2006, 182–197
, 2006
"... Abstract. Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the propositional satisfiability community, can also be used to provide highly efficient implementations of constraint propagators. We describe in detail three im ..."
Abstract

Cited by 41 (14 self)
 Add to MetaCart
(Show Context)
Abstract. Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the propositional satisfiability community, can also be used to provide highly efficient implementations of constraint propagators. We describe in detail three important aspects of watched literals as we apply them to constraints, and we describe how they are implemented in the Minion constraint solver. We show three successful applications of watched literals to constraint propagators: the sum of boolean variables; generalised arc consistency for the ‘element ’ constraint; and generalised arc consistency for the ‘table ’ constraint. 1
Constraint and Integer Programming in OPL
 INFORMS Journal on Computing
, 2002
"... In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become an active research topic. The optimization programming la ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become an active research topic. The optimization programming language opl was a first attempt at integrating these technologies both at the language and at the solver levels. In particular, opl is a modeling language integrating the rich language of constraint programming and the ability to specify search procedures at a high level of abstraction. Its implementation includes both constraint and mathematical programming solvers, as well as some cooperation schemes to make them collaborate on a given problem. The purpose of this paper is to illustrate, using opl, the constraintprogramming approach to combinatorial optimization and the complementary strengths of constraint and integer programming. (Artificial Intelligence; Computer Science; Integer Programming) 1.
The Range and Roots Constraints: Specifying Counting and Occurrence Problems
 In IJCAI
, 2005
"... ..."
Propagating logical combinations of constraints
 In Proc. of 19th IJCAI
, 2005
"... Many constraint toolkits provide logical connectives like disjunction, negation and implication. These permit complex constraint expressions to be built from primitive constraints. However, the propagation of such complex constraint expressions is typically limited. We therefore present a simple and ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Many constraint toolkits provide logical connectives like disjunction, negation and implication. These permit complex constraint expressions to be built from primitive constraints. However, the propagation of such complex constraint expressions is typically limited. We therefore present a simple and light weight method for propagating complex constraint expressions. We provide a precise characterization of when this method enforces generalized arcconsistency. In addition, we demonstrate that with our method many different global constraints can be easily implemented. 1
Variable and Value Ordering When Solving Balanced Academic Curriculum Problems
 In 6th Annual Workshop of the ERCIM Working Group on Constraints
, 2001
"... ar ..."
(Show Context)
The slide metaconstraint
"... We study the Slide metaconstraint. This slides a constraint down one or more sequences of variables. We show that Slide can be used to encode and propagate a wide range of global constraints. We consider a number of extensions including sliding down sequences of set variables, and combining Slide ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
(Show Context)
We study the Slide metaconstraint. This slides a constraint down one or more sequences of variables. We show that Slide can be used to encode and propagate a wide range of global constraints. We consider a number of extensions including sliding down sequences of set variables, and combining Slide with a global cardinality constraint. We also show how to propagate Slide. Our experiments demonstrate that using Slide to encode constraints can be just as efficient and effective as using specialized propagators.
Exploiting Interchangeabilities for Case Adaptation
 In Proc. of the 4th ICCBR01 (2001
, 2001
"... While there are many general methods for case retrieval, case adaptation usually requires problemspecific knowledge and it is still an open problem. In this paper we propose a general method for solving case adaptation problems for the large class of problems which can be formulated as Constraint ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
While there are many general methods for case retrieval, case adaptation usually requires problemspecific knowledge and it is still an open problem. In this paper we propose a general method for solving case adaptation problems for the large class of problems which can be formulated as Constraint Satisfaction Problems. This method is based on the concept of interchangeability between values in problem solutions. The method is able to determine how change propagates in a solution set and generate a minimal set of choices which need to be changed to adapt an existing solution to a new problem. The paper presents the proposed method, algorithms and test results for a resource allocation domain.
Model expansion in the presence of function symbols using constraint programming
 In ICTAI
, 2013
"... The traditional approach to model expansion (generating models of a logic theory extending a partial structure) is to reduce the theory to a propositional language and apply a search algorithm to the resulting theory. Function symbols are typically replaced by predicate symbols representing the gr ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
The traditional approach to model expansion (generating models of a logic theory extending a partial structure) is to reduce the theory to a propositional language and apply a search algorithm to the resulting theory. Function symbols are typically replaced by predicate symbols representing the graph of the function, an operation that blows up the reduced theory. In this paper, we present an improved approach to handle function symbols in a groundandsolve methodology, building on ideas from Constraint Programming. We do so in the context of FO(·)IDP, the knowledge representation language that extends FirstOrder logic with, among others, inductive definitions, arithmetic and aggregates. A model expansion algorithm is developed, consisting of (i) a grounding algorithm for FO(·)IDP that is parametrized by the function symbols the are allowed to occur in the reduced theory, and (ii) a search algorithm for unrestricted, ground FO(·)IDP. The ideas are implemented within the IDP knowledgebase system and experimental evaluation shows that both more compact groundings and improved search performance are obtained.