11 search results - page 1 / 3 » On 2-SAT and Renamable Horn |
AAAI
2000
14 years 10 days ago
2000
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
AAAI
2008
14 years 1 months ago
2008
We extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment)...
SAT
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
SAT
2005
Springer
14 years 4 months ago
2005
Springer
IPL
2002
13 years 10 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...