Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68195OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325848

Armando Tacchella, Massimo Narizzano, Andrew Rowley, Enrico Giunchiglia, Ian Philip Gent

Publication date: 24 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

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

Related Items (5)

Solving quantified constraint satisfaction problems ⋮ Message passing algorithm for solving QBF using more reasoning ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ Non-binary quantified CSP: Algorithms and modelling ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1

Uses Software

• Chaff

This page was built for publication: Theory and Applications of Satisfiability Testing