Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

SAT
2004
Springer

favoriteEmaildiscussreport

111views Hardware» more SAT 2004»

A Note on Satisfying Truth-Value Assignments of Boolean Formulas

13 years 9 months ago

A Note on Satisfying Truth-Value Assignments of Boolean Formulas

Download www.satisfiability.org

Abstract. In this paper we deﬁne a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisﬁable Boolean formula has at least one bounded assignment. This allows us to show that satisfying truthvalue assignments of formulas in USAT can be syntactically deﬁned in the language of classical propositional logic. We also discuss a possible application of bounded truth-value assignments in local search and other methods for solving Boolean satisﬁability problems.

Zbigniew Stachniak

Real-time Traffic

Certain Substitutional Property | SAT 2004 | Satisﬁable Boolean Formula | Truth-value Assignments |

claim paper

Related Content

» Exploiting QBF Duality on a Circuit Representation

» Testing Properties of ConstraintGraphs

» Fault Tolerant Boolean Satisfiability

» New Upper Bounds for Maximum Satisfiability

» Prime clauses for fast enumeration of satisfying assignments to boolean circuits

» Learning to Solve QBF

» SAT and ATPG Boolean engines for formal hardware verification

» Generalized Modal Satisfiability

» Survey propagation an algorithm for satisfiability

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	SAT
Authors	Zbigniew Stachniak

Comments (0)