On satisfiability trees

DOI10.12732/IJAM.V29I5.5MaRDI QIDQ2981086zbMATH OpenOpenAlexFDO

Authors Marcel Maretić

Publication date 8 May 2017

Published in International Journal of Apllied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12732/ijam.v29i5.5

zbMATH Keywords

matchingresolutionrooted formula treesatisfiability treesemantic treetableau

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Recommendations

• Satisfiability testing for Boolean formulas using -trees
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• scientific article; zbMATH DE number 1759377
• Theory and Applications of Satisfiability Testing
• Solving propositional satisfiability problems

Cited in

(6)

• Satisfiability testing for Boolean formulas using -trees
• Trees and finite satisfiability: proof of a conjecture of Burgess
• scientific article; zbMATH DE number 4162838 (Why is no real title available?)
• scientific article; zbMATH DE number 1943845 (Why is no real title available?)
• scientific article; zbMATH DE number 1759377 (Why is no real title available?)
• On multiple conclusion deductions in classical logic

This page was built for publication: On satisfiability trees

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