Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68195DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325848FDOQ5325848

Armando Tacchella, Ian P. Gent, Massimo Narizzano, Andrew Rowley, Enrico Giunchiglia

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)

Cited In (5)

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

Uses Software

• Chaff

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325848)