Transformations into Normal Forms for Quantified Circuits
From MaRDI portal
Publication:3007687
DOI10.1007/978-3-642-21581-0_20zbMath1330.68103MaRDI QIDQ3007687
Hans Kleine Büning, Zhao, Xishun, Uwe Bubeck
Publication date: 17 June 2011
Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_20
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Uses Software
Cites Work
- Models and quantifier elimination for quantified Horn formulas
- The equivalence of Horn and network complexity for Boolean functions
- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
- Exploiting Circuit Representations in QBF Solving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item