Satisfiability testing for Boolean formulas using \(\Delta\)-trees

DOI10.1023/A:1020530109551zbMath1017.03003OpenAlexW1565252114MaRDI QIDQ1863824

Manuel Ojeda Aciego, J. Martínez, A. Valverde, G. Gutiérrez, Inma 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 structurespropositional formulassatisfiabilityautomated deductionreduction strategies\(\Delta\)-treesnegation normal formssize of search space

Mathematics Subject Classification ID

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

Related Items (2)

Generalizations of lattices via non-deterministic operators ⋮ Unnamed Item

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