Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325883
DOI10.1007/B95238zbMATH Open1204.68204DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325883FDOQ5325883
Authors: Daniel Le Berre, Laurent Simon, Armando Tacchella 
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
Recommendations
Cited In (19)
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
- Principles and Practice of Constraint Programming – CP 2004
- Theory and Applications of Satisfiability Testing
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- The complexity of pure literal elimination
- Theory and Applications of Satisfiability Testing
- The seventh QBF solvers evaluation (QBFEVAL'10)
- Evaluating and certifying QBFs: a comparison of state-of-the-art tools
- 2QBF: challenges and solutions
- Report of the third QBF solvers evaluation
- Bounded semantics
- A complexity perspective on entailment of parameterized linear constraints
- Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows
- CAQE and QuAbS: Abstraction Based QBF Solvers
- Using SAT in QBF
- A solver for QBFs in negation normal form
- Automated benchmarking of incremental SAT and QBF solvers
- True crafted formula families for benchmarking quantified satisfiability solvers
Uses Software
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 Q5325883)
