6 search results - page 1 / 2 » The 2-SAT Problem of Regular Signed CNF Formulas |
ISMVL
2000
IEEE
13 years 9 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
ISMVL
2007
IEEE
13 years 10 months ago
2007
IEEE
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...