283 search results - page 49 / 57 » Solving Over-Constrained Problems with SAT |
138
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
134
click to vote
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
136
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
128
click to vote
FPGA
2007
ACM
15 years 10 months ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
122
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...