Traditionally, constraint satisfaction has been applied inclosed-world scenarios,where all choices and constraints are known from the beginning and fixed. Withthe Internet, many of the traditional CSP applications in...
详细信息
In this work, we extend the class of Horn constraints to include disjunctions with an arbitrary number of linear inequalities, linear disequations and non-linear disequations. We propose a preprocess step in which two...
详细信息
the aim of this paper is to demonstrate that CP could be abetter candidate than MIP for solving the master problem within a Benders decomposition approach. Our demonstration is based on a case study of a workforce sch...
详细信息
In this paper we define partial symmetry breaking, a concept that has been used in many previous papers without being the main topic of any research. this paper is the first systematic study of partial symmetry breaki...
详细信息
Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the sa...
详细信息
Real-world constraint problems abound with *** with incomplete or erroneous data are often simplified at present to tractable deterministic models, or modified using error correction methods, withthe aim of seeking a...
详细信息
Random instances are widely used as benchmarks in evaluating algorithms for finite-domain constraint satisfaction problems (CSPs).We present an analysis that shows why deciding satisfiability of instances from some di...
详细信息
作者：
Bennaceur, HachemiLi, Chu MinLIPN
Institut Galilée Université Paris 13 Av J B Clément Villetaneuse93240 France LaRIA
Université de Picardie Jules Verne 5 Rue du Moulin Neuf Amiens80000 France
Using the literal encoding of the satisfiability problem (SAT)as a binary constraint satisfaction problem (CSP), we relate the path consistency concept and the row convexity of CSPs withthe inference rules in the pro...
详细信息
the generalization of the satisfiability problem with arbitrary quantifiers is a challenging problem of boththeoretical and practical relevance. Being PSPACE-complete, it provides a canonical model for solving other ...
详细信息
暂无评论