8094 search results - page 81 / 1619 » Improvements in Formula Generalization |
CP
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
ISMVL
2010
IEEE
14 years 2 months ago
2010
IEEE
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...
RSA
2006
13 years 9 months ago
2006
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
ALGORITHMICA
2011
13 years 4 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
CADE
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...