Author:
Büning Hans Kleine,Zhao Xishun,Bubeck Uwe
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Anderaa, S., Börger, E.: The Equivalence of Horn and Network Complexity for Boolean Functions. Acta Informatica 15, 303–307 (1981)
2. Lecture Notes in Computer Science;B. Borchert,1997
3. Bubeck, U., Kleine Büning, H.: Models and Quantifier Elimination for Quantified Horn Formulas. Discrete Applied Mathematics 156(10), 1606–1622 (2008)
4. Bubeck, U., Kleine Büning, H.: Encoding Nested Boolean Functions as Quantified Boolean Formulas. In: 3rd Guangzhou Symposium on Satisfiability in Logic-based Modeling, Zhuhai, China (2010)
5. Lecture Notes in Computer Science;U. Bubeck,2010