121 search results - page 7 / 25 » Bound Consistency for Binary Length-Lex Set Constraints |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
ECP
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...
FMCAD
2007
Springer
14 years 1 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
CP
2008
Springer
13 years 9 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
DEXAW
2006
IEEE
13 years 9 months ago
2006
IEEE
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...