An efficient proof method for non-clausal reasoning

DOI10.1007/3-540-39963-1_56MaRDI QIDQ2766990zbMATH OpenFDO

Authors Edgar Altamirano, Gonçal Escalada-Imaz

Publication date 25 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-39963-1_56

Mathematics Subject Classification ID

Recommendations

• Finding tractable formulas in NNF
• scientific article; zbMATH DE number 1844517
• A first polynomial non-clausal class in many-valued logic
• A hierarchy of tractable satisfiability problems
• Linear-time algorithms for testing the satisfiability of propositional horn formulae

Cited in

(5)

• scientific article; zbMATH DE number 1696816 (Why is no real title available?)
• scientific article; zbMATH DE number 1844517 (Why is no real title available?)
• Tractable inference systems: an extension with a deducibility predicate
• Reductions for non-clausal theorem proving
• A first polynomial non-clausal class in many-valued logic

This page was built for publication: An efficient proof method for non-clausal reasoning

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