3 search results - page 1 / 1 » Satisfiability of Acyclic and Almost Acyclic CNF Formulas |
FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
VLSID
2007
IEEE
14 years 11 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...