226 search results - page 20 / 46 » GAC on Conjunctions of Constraints |
FOIKS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
104
Voted
CSCLP
2004
Springer
15 years 2 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
101
click to vote
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
79
Voted
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
76
Voted
IS
2008
14 years 9 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...