Circuit-based search space pruning in QBF

DOI10.1007/978-3-319-94144-8_12OpenAlexW2810531069MaRDI QIDQ1656577

Mikoláš Janota

Publication date: 10 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94144-8_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

\(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers ⋮ Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification ⋮ Unnamed Item ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers

This page was built for publication: Circuit-based search space pruning in QBF