Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68608OpenAlexW2483910514MaRDI QIDQ5714770FDOQ5714770

Authors: Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella 

Publication date: 16 December 2005

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

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

Recommendations

• Report of the third QBF solvers evaluation
• The seventh QBF solvers evaluation (QBFEVAL'10)
• Theory and Applications of Satisfiability Testing
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Formal Methods in Computer-Aided Design

Mathematics Subject Classification ID

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

Cited In (9)

• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Reasoning under minimal upper bounds in propositional logic
• The seventh QBF solvers evaluation (QBFEVAL'10)
• Evaluating and certifying QBFs: a comparison of state-of-the-art tools
• Models and quantifier elimination for quantified Horn formulas
• Theory and Applications of Satisfiability Testing
• Report of the third QBF solvers evaluation
• Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows
• A solver for QBFs in negation normal form

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 Q5714770)