Results 1  10
of
3,012
Minimum Satisfying Assignments for SMT ⋆
"... Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum satisfying assignments have applications in software and hardware verification, electronic design automation, and diagnost ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum satisfying assignments have applications in software and hardware verification, electronic design automation
Finding AlmostSatisfying Assignments
 In Proceedings of the 30th Annual ACM Symposium on Theory of Computing
, 1997
"... Schaefer showed, long ago, that there are, essentially, only three nontrivial classes of conjunctive Boolean formulae (or constraint satisfaction problems) for which satis ability can be decided in polynomial time (assuming P 6= NP ). These three classes are LIN, 2SAT and HORNSAT. LIN is the c ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
Schaefer showed, long ago, that there are, essentially, only three nontrivial classes of conjunctive Boolean formulae (or constraint satisfaction problems) for which satis ability can be decided in polynomial time (assuming P 6= NP ). These three classes are LIN, 2SAT and HORNSAT. LIN is the constraint satisfaction problem in which all the constraints are linear equations modulo 2. 2SAT is the constraint satisfaction problem in which all the constraints are disjunctions of at most two variables or their negations. HORNSAT is the constraint satisfaction problem in which all the constraints are Horn clauses, i.e., disjunctions containing at most one negated variable.
Counting Satisfying Assignments in 2SAT and 3SAT
 IN PROCEEDINGS OF THE 8TH ANNUAL INTERNATIONAL COMPUTING AND COMBINATORICS CONFERENCE (COCOON2002
, 2002
"... We present an O(1.3247^n) algorithm for counting the number of satisfying assignments for instances of 2SAT and an O(1.6894^n) algorithm for instances of 3SAT. This is an improvement compared to the previously best known algorithms running in O(1.381^n) and O(1.739^n) time, respectively. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We present an O(1.3247^n) algorithm for counting the number of satisfying assignments for instances of 2SAT and an O(1.6894^n) algorithm for instances of 3SAT. This is an improvement compared to the previously best known algorithms running in O(1.381^n) and O(1.739^n) time, respectively.
Satisfying Assignments of Random Boolean CSP: Clusters and Overlaps
, 2007
"... Abstract. The distribution of overlaps of solutions of a random CSP is an indicator of the overall geometry of its solution space. For random kSAT, nonrigorous methods from Statistical Physics support the validity of the “one step replica symmetry breaking ” approach. Some of these predictions were ..."
Abstract
 Add to MetaCart
: – there exists an exponential number of clusters of satisfying assignments. – the distance between satisfying assignments in different clusters is linear. We aim to understand the structural properties of random CSP that lead to solution clustering. To this end, we prove two results on the cluster structure
Hiding satisfying assignments: two are better than one
 In Proceedings of AAAI’04
, 2004
"... The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random kSAT formulas whose clauses are chosen uniformly from among all clauses satisfying some randomly chosen truth assignment ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random kSAT formulas whose clauses are chosen uniformly from among all clauses satisfying some randomly chosen truth assignment
Prime Clauses for Fast Enumeration of Satisfying Assignments to Boolean Circuits
 In Proceedings of the IEEE/ACM Design Automation Conference
, 2005
"... Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clauserecording propositional satisfiability solver with the ability to add blocking clauses, which prevent the solver from visiting th ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clauserecording propositional satisfiability solver with the ability to add blocking clauses, which prevent the solver from visiting
Geometric properties of satisfying assignments of random ε1ink SAT
, 2008
"... We study the geometric structure of the set of solutions of random ǫ1ink SAT problem [2, 15]. For l ≥ 1, two satisfying assignments A and B are lconnected if there exists a sequence of satisfying assignments connecting them by changing at most l bits at a time. We first prove that w.h.p. two a ..."
Abstract
 Add to MetaCart
We study the geometric structure of the set of solutions of random ǫ1ink SAT problem [2, 15]. For l ≥ 1, two satisfying assignments A and B are lconnected if there exists a sequence of satisfying assignments connecting them by changing at most l bits at a time. We first prove that w.h.p. two
Efficient conflict analysis for finding all satisfying assignments of a boolean circuit
 In TACAS’05, LNCS 3440
, 2005
"... Abstract. Finding all satisfying assignments of a propositional formula has many applications to the synthesis and verification of hardware and software. An approach to this problem that has recently emerged augments a clauserecording propositional satisfiability solver with the ability to add “blo ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Abstract. Finding all satisfying assignments of a propositional formula has many applications to the synthesis and verification of hardware and software. An approach to this problem that has recently emerged augments a clauserecording propositional satisfiability solver with the ability to add
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps 1
"... Abstract: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random kSAT, nonrigorous methods from Statistical Physics support the validity of the one step replica symmetry breaking approach. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
kSAT, k ≥ 8, and constraint densities close enough to the phase transition: – there exists an exponential number of clusters of satisfying assignments. – the distance between satisfying assignments in different clusters is linear. We aim to understand the structural properties of random CSP
Results 1  10
of
3,012