Dependency learning for QBF
From MaRDI portal
Publication:1680261
DOI10.1007/978-3-319-66263-3_19zbMath1478.68330OpenAlexW2742414663MaRDI QIDQ1680261
Stefan Szeider, Tomáš Peitl, Friedrich Slivovsky
Publication date: 15 November 2017
Full work available at URL: http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-3440
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity of proofs (03F20)
Related Items (11)
Long-distance Q-resolution with dependency schemes ⋮ Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Building strategies into QBF proofs ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ Knowledge representation analysis of graph mining ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers
Uses Software
This page was built for publication: Dependency learning for QBF
