Exploiting Circuit Representations in QBF Solving

DOI10.1007/978-3-642-14186-7_29zbMath1306.68158OpenAlexW1597075322MaRDI QIDQ4930601

Alexandra Goultiaeva, Fahiem Bacchus

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Quantified maximum satisfiability ⋮ Long-distance Q-resolution with dependency schemes ⋮ Unnamed Item ⋮ Counterexample-Guided Model Synthesis ⋮ Transformations into Normal Forms for Quantified Circuits ⋮ Long Distance Q-Resolution with Dependency Schemes ⋮ CirQit2 ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers ⋮ Solving QBF with counterexample guided refinement

Uses Software

• Nenofex
• QBFLIB
• QUBE

This page was built for publication: Exploiting Circuit Representations in QBF Solving