Finding tractable formulas in NNF

DOI10.1007/3-540-44957-4_33MaRDI QIDQ2767082zbMATH OpenFDO

Authors Edgar Altamirano, Gonçal Escalada-Imaz

Publication date 28 April 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44957-4_33

Mathematics Subject Classification ID

Recommendations

• An efficient proof method for non-clausal reasoning
• A first polynomial non-clausal class in many-valued logic
• Decomposable negation normal form
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Normal Forms for Knowledge Compilation

Cited in

(2)

• scientific article; zbMATH DE number 1696743 (Why is no real title available?)
• A first polynomial non-clausal class in many-valued logic

This page was built for publication: Finding tractable formulas in NNF

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