Constraint programming
Publisher Summary Constraint programming is a powerful paradigm for solving
combinatorial search problems that draws on a wide range of techniques from artificial …
combinatorial search problems that draws on a wide range of techniques from artificial …
Propositional satisfiability and constraint programming: A comparative survey
Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …
relatively independent threads of research cross-fertilizing occasionally. These two …
[LIVRE][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
[LIVRE][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Constraint propagation
C Bessiere - Foundations of Artificial Intelligence, 2006 - Elsevier
Publisher Summary This chapter discusses that constraint reasoning involves various types
of techniques to tackle the inherent intractability of the problem of satisfying a set of …
of techniques to tackle the inherent intractability of the problem of satisfying a set of …
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
K Xu, F Boussemart, F Hemery, C Lecoutre - Artificial intelligence, 2007 - Elsevier
In this paper, we show that the models of random CSP instances proposed by Xu and Li [K.
Xu, W. Li, Exact phase transitions in random constraint satisfaction problems, Journal of …
Xu, W. Li, Exact phase transitions in random constraint satisfaction problems, Journal of …
STR2: optimized simple tabular reduction for table constraints
C Lecoutre - Constraints, 2011 - Springer
Table constraints play an important role within constraint programming. Recently, many
schemes or algorithms have been proposed to propagate table constraints and/or to …
schemes or algorithms have been proposed to propagate table constraints and/or to …
Compact-table: efficiently filtering table constraints with reversible sparse bit-sets
In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized
Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator …
Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator …
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
JR Ullmann - Journal of Experimental Algorithmics (JEA), 2011 - dl.acm.org
A solution to a binary constraint satisfaction problem is a set of discrete values, one in each
of a given set of domains, subject to constraints that allow only prescribed pairs of values in …
of a given set of domains, subject to constraints that allow only prescribed pairs of values in …
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
KCK Cheng, RHC Yap - Constraints, 2010 - Springer
A table constraint is explicitly represented as its set of solutions or non-solutions. This ad hoc
(or extensional) representation may require space exponential to the arity of the constraint …
(or extensional) representation may require space exponential to the arity of the constraint …