Two systems for proving tautologies, based on the split method

DOI10.1007/BF01084392MaRDI QIDQ1838470zbMATH OpenFDO

Authors E. Ya. Dantsin

Publication date 1983

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01084392

zbMATH Keywords

classes with polynomial time recognition algorithmpropositional tautologies

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)

Cited in

(5)

• New methods for 3-SAT decision and worst-case analysis
• Separating signs in the propositional satisfiability problem
• The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
• Merging relational database technology with constraint technology
• An improved upper bound for SAT

This page was built for publication: Two systems for proving tautologies, based on the split method

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