scientific article; zbMATH DE number 3870637

MaRDI QIDQ3336732zbMATH OpenFDO

Authors Allen Van Gelder

Publication date 1984

zbMATH Keywords

algorithmsatisfiability of boolean expressions

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A satisfiability tester for non-clausal propositional calculus
• Algorithms for testing the satisfiability of propositional formulae
• Algorithms for testing satisfiability formulas
• Solving satisfiability in less than \(2^ n\) steps
• An algorithm for the satisfiability problem of formulas in conjunctive normal form

Cited in

(8)

• A satisfiability tester for non-clausal propositional calculus
• An optimality result for clause form translation
• Simplification in a satisfiability checker for VLSI applications
• Boolean unification - the story so far
• scientific article; zbMATH DE number 1098495 (Why is no real title available?)
• scientific article; zbMATH DE number 1737608 (Why is no real title available?)
• FUNCTIONAL PEARL Functional satisfaction
• Satisfiability Checking of Non-clausal Formulas Using General Matings

This page was built for publication:

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