Algorithms for testing satisfiability formulas

DOI10.1023/A:1011006014945MaRDI QIDQ5939378zbMATH OpenFDO

Authors Marin Vlada

Publication date 16 January 2002

Published in Artificial Intelligence Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1011006014945

zbMATH Keywords

first-order logicpropositional logicresolutionresolutive derivationsatisfiability

Mathematics Subject Classification ID

Classical propositional logic (03B05) Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35)

Recommendations

• Algorithms for testing the satisfiability of propositional formulae
• scientific article; zbMATH DE number 1737608
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• A satisfiability tester for non-clausal propositional calculus
• scientific article; zbMATH DE number 956865

Cited in

(13)

• A satisfiability tester for non-clausal propositional calculus
• New methods for computing inferences in first order logic
• BREAKUP: A preprocessing algorithm for satisfiability testing of CNF formulas
• Satisfiability testing for Boolean formulas using -trees
• Counting for satisfiability by inverting resolution
• scientific article; zbMATH DE number 991069 (Why is no real title available?)
• scientific article; zbMATH DE number 3864540 (Why is no real title available?)
• scientific article; zbMATH DE number 3870637 (Why is no real title available?)
• Algorithms for testing the satisfiability of propositional formulae
• Testing satisfiability
• scientific article; zbMATH DE number 1737608 (Why is no real title available?)
• Partitioning methods for satisfiability testing on large formulas
• Polynomial time termination and constraint satisfaction tests

This page was built for publication: Algorithms for testing satisfiability formulas

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