The SAT problem of signed CNF formulas

MaRDI QIDQ2701980zbMATH OpenFDO

Authors Bernhard Beckert, Reiner Hähnle, Felip Manya

Publication date 5 July 2001

zbMATH Keywords

algorithmslogical language for knowledge representationsatisfiabilitysigned conjunctive normal formsigned literal

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 1775484
• Separating signs in the propositional satisfiability problem
• Resolution procedures for multiple-valued optimization
• A complexity analysis of the SAT problem
• On Linear CNF Formulas

Cited in

(16)

• On the refutational completeness of signed binary resolution and hyperresolution
• Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
• Separating signs in the propositional satisfiability problem
• Analytic tableaux for non-deterministic semantics
• New complexity results for Łukasiewicz logic
• Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
• Resolution procedures for multiple-valued optimization
• An algorithm for random signed 3-SAT with intervals
• Regular-SAT: A many-valued approach to solving combinatorial problems
• Learning general constraints in CSP
• Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
• scientific article; zbMATH DE number 1775484 (Why is no real title available?)
• A note on the signed occurrences of propositional variables
• MaxSAT resolution for regular propositional logic
• A first polynomial non-clausal class in many-valued logic
• Binary resolution over Boolean lattices

This page was built for publication: The SAT problem of signed CNF formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701980)