Satisfiability testing for Boolean formulas using -trees

DOI10.1023/A:1020530109551MaRDI QIDQ1863824zbMATH OpenOpenAlexFDO

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

Publication date 12 March 2003

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020530109551

zbMATH Keywords

data structuresautomated deductionpropositional formulassatisfiabilityreduction strategies\(\Delta\)-treesnegation normal formssize of search space

Mathematics Subject Classification ID

Data structures (68P05) Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 1759377
• Algorithms for testing the satisfiability of propositional formulae
• Algorithms for testing satisfiability formulas
• On satisfiability trees
• A satisfiability procedure for quantified Boolean formulae
• scientific article; zbMATH DE number 1701749
• SATRIX -- algorithms for Boolean satisfiability
• Exponential complexity of satisfiability testing for linear-size Boolean formulas
• Satisfiability algorithms and lower bounds for Boolean formulas over finite bases

Cited in

(8)

• scientific article; zbMATH DE number 1113999 (Why is no real title available?)
• Generalizations of lattices via non-deterministic operators
• Restricted ideals and the groupability property. Tools for temporal reasoning.
• On satisfiability trees
• Logics in Artificial Intelligence
• scientific article; zbMATH DE number 1974022 (Why is no real title available?)
• scientific article; zbMATH DE number 1759377 (Why is no real title available?)
• scientific article; zbMATH DE number 1943845 (Why is no real title available?)

This page was built for publication: Satisfiability testing 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 Q1863824)