Separating signs in the propositional satisfiability problem

DOI10.1007/BF02362266MaRDI QIDQ1977918zbMATH OpenOpenAlexFDO

Authors 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

Recommendations

• The SAT problem of signed CNF formulas
• The SAT-based approach to separation logic
• Solving propositional satisfiability problems
• scientific article; zbMATH DE number 7650083
• Compositional satisfiability solving in separation logic
• Propositional SAT solving
• scientific article; zbMATH DE number 1903355
• Satisfiability problem in propositional and renominative composition-nominative logic

Cites work

• A Computing Procedure for Quantification Theory
• scientific article; zbMATH DE number 3952007 (Why is no real title available?)
• scientific article; zbMATH DE number 4039349 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303594 (Why is no real title available?)
• scientific article; zbMATH DE number 1113996 (Why is no real title available?)
• Solving satisfiability in less than \(2^ n\) steps
• Two systems for proving tautologies, based on the split method

Cited in

(3)

• BREAKUP: A preprocessing algorithm for satisfiability testing of CNF formulas
• The SAT problem of signed CNF formulas
• scientific article; zbMATH DE number 1775484 (Why is no real title available?)

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

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