Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325848zbMATH OpenOpenAlexDBLPFDO

Authors Enrico Giunchiglia, Massimo Narizzano, Andrew Rowley, Armando Tacchella, Ian P. 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)

Recommendations

• Formal Methods in Computer-Aided Design
• Contributions to the theory of practical quantified Boolean formula solving
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2004
• Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation

Cited in

(5)

• The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
• 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
• Non-binary quantified CSP: Algorithms and modelling

Describes a project that uses

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)