Separating signs in the propositional satisfiability problem

DOI10.1007/BF02362266zbMath0961.68049OpenAlexW1980777597MaRDI QIDQ1977918

Yanyan Li

Publication date: 6 June 2000

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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

zbMATH Keywords

SATsatisfiability of a propositional formula

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving satisfiability in less than \(2^ n\) steps
• Two systems for proving tautologies, based on the split method
• A Computing Procedure for Quantification Theory

This page was built for publication: Separating signs in the propositional satisfiability problem