Reduction theorems for Boolean formulas using -trees

DOI10.1007/3-540-40006-0_13MaRDI QIDQ4536325zbMATH OpenFDO

Authors G. Gutiérrez, J. Martínez, A. Valverde, I. P. de Guzmán, Manuel Ojeda-Aciego

Publication date 25 November 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-40006-0_13

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)

Recommendations

• Satisfiability testing for Boolean formulas using -trees
• scientific article; zbMATH DE number 1974022
• scientific article; zbMATH DE number 1943845
• Logics in Artificial Intelligence
• On satisfiability trees

Cited in

(8)

• Satisfiability testing for Boolean formulas using -trees
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• On satisfiability trees
• scientific article; zbMATH DE number 1943845 (Why is no real title available?)
• scientific article; zbMATH DE number 1974022 (Why is no real title available?)
• Restricted ideals and the groupability property. Tools for temporal reasoning.
• Logics in Artificial Intelligence
• Generalizations of lattices via non-deterministic operators

This page was built for publication: Reduction theorems for Boolean formulas using \(\Delta\)-trees

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