Access the full text.
Sign up today, get DeepDyve free for 14 days.
Marijn Heule, M. Seidl, Armin Biere (2014)
Efficient extraction of Skolem functions from QRAT proofs2014 Formal Methods in Computer-Aided Design (FMCAD)
Paolo Marin, Christian Miller, B. Becker (2012)
Incremental QBF Preprocessing for Partial Design Verification - (Poster Presentation)
Héctor Palacios, Hector Geffner (2009)
Compiling Uncertainty Away in Conformant Planning Problems with Bounded WidthJ. Artif. Intell. Res., 35
Gilles Audemard, Jean-Marie Lagniez, Laurent Simon (2013)
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
J. Hoffmann, R. Brafman (2004)
Conformant planning via heuristic forward search: A new approach
Mikoláš Janota, Joao Marques-Silva (2015)
Expansion-based QBF solving versus Q-resolutionTheor. Comput. Sci., 577
Jean-Marie Lagniez, Armin Biere (2013)
Factoring Out Assumptions to Speed Up MUS Extraction
Florian Lonsing, U. Egly, A. Gelder (2013)
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
Mikoláš Janota, Radu Grigore, Joao Marques-Silva (2013)
On QBF Proofs and PreprocessingArXiv, abs/1310.2491
Armin Biere (2004)
Resolve and Expand
Mikoláš Janota, William Klieber, Joao Marques-Silva, E. Clarke (2012)
Solving QBF with Counterexample Guided Refinement
Valeriy Balabanov, J. Jiang (2012)
Unified QBF certification and its applicationsFormal Methods in System Design, 41
Marijn Heule, M. Järvisalo, Florian Lonsing, M. Seidl, Armin Biere (2015)
Clause Elimination for SAT and QSATJ. Artif. Intell. Res., 53
Alexandra Goultiaeva, A. Gelder, F. Bacchus (2011)
A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas
H. Büning, Marek Karpinski, Andreas Flögel (1995)
Resolution for Quantified Boolean FormulasInf. Comput., 117
David Smith, Daniel Weld (1998)
Conformant Graphplan
M. Samer, Stefan Szeider (2007)
Backdoor Sets of Quantified Boolean FormulasJournal of Automated Reasoning, 42
Chitta Baral, V. Kreinovich, Raul Trejo (1999)
Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness
E. Giunchiglia, Paolo Marin, Massimo Narizzano (2010)
sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
Yinlei Yu, S. Malik (2005)
Validating the result of a quantified Boolean formula (QBF) solver: theory and practiceProceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005., 2
M. Seidl, Robert Könighofer (2014)
Partial witnesses from preprocessed quantified Boolean formulas2014 Design, Automation & Test in Europe Conference & Exhibition (DATE)
Marco Cadoli, M. Schaerf, A. Giovanardi, Massimo Giovanardi (2002)
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental EvaluationJournal of Automated Reasoning, 28
H. Samulowitz, Jessica Davies, F. Bacchus (2006)
Preprocessing QBF
N. Eén, Niklas Sörensson (2003)
Temporal induction by incremental SAT solving
Armin Biere, Florian Lonsing, M. Seidl (2011)
Blocked Clause Elimination for QBF
Olaf Beyersdorff, Leroy Chew, Mikoláš Janota (2015)
Proof Complexity of Resolution-based QBF CalculiElectron. Colloquium Comput. Complex., TR14
Uwe Bubeck, H. Büning (2007)
Bounded Universal Expansion for Preprocessing QBF
O. Kullmann (1999)
On a Generalization of Extended ResolutionDiscret. Appl. Math., 96-97
Paolo Marin, Christian Miller, Matthew Lewis, B. Becker (2012)
Verification of partial designs using incremental QBF solving2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)
Martin Davis, G. Logemann, D. Loveland (2011)
A machine program for theorem-provingCommun. ACM, 5
M. Järvisalo, Marijn Heule, Armin Biere (2012)
Inprocessing Rules
Aina Niemetz, Mathias Preiner, Florian Lonsing, M. Seidl, Armin Biere (2012)
Resolution-Based Certificate Extraction for QBF - (Tool Presentation)
Christian Miller, Paolo Marin, B. Becker (2015)
Verification of partial designs using incremental QBFAI Commun., 28
Florian Lonsing, U. Egly (2014)
Incremental QBF Solving by DepQBF
Avrim Blum, M. Furst (1995)
Fast Planning Through Planning Graph Analysis
Marijn Heule, M. Seidl, Armin Biere (2014)
A Unified Proof System for QBF Preprocessing
Michael Cashmore, M. Fox, E. Giunchiglia (2012)
Planning as Quantified Boolean Formula
J. Rintanen (2007)
Asymptotically Optimal Encodings of Conformant Planning in QBF
M. Järvisalo, Armin Biere (2010)
Reconstructing Solutions after Blocked Clause Elimination
(2013)
Conformant planning as a benchmark for QBFsolvers
A. Gelder, Samuel Wood, Florian Lonsing (2012)
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
E. Giunchiglia, Massimo Narizzano, A. Tacchella (2006)
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean FormulasArXiv, abs/1111.0860
Florian Lonsing, Armin Biere (2008)
Nenofex: Expanding NNF for QBF Solving
Florian Lonsing, F. Bacchus, Armin Biere, U. Egly, M. Seidl (2015)
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
Alexander Nadel, Vadim Ryvchin, O. Strichman (2014)
Ultimately Incremental SAT
Florian Lonsing, U. Egly (2014)
Incremental QBF SolvingArXiv, abs/1402.2410
Stefan Kupferschmid, Matthew Lewis, Tobias Schubert, B. Becker (2011)
Incremental preprocessing methods for use in BMCFormal Methods in System Design, 39
Lintao Zhang, S. Malik (2002)
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
R. Letz (2002)
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
T. Heyman, Dan Smith, Yogesh Mahajan, L. Leong, Husam Abu-Haimed (2014)
Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving. We report on experiments with a workflow to incrementally encode a planning instance into a sequence of QBFs. To solve this sequence of successively constructed QBFs, we use our general-purpose incremental QBF solver DepQBF. Since the generated QBFs have many clauses and variables in common, our approach avoids redundancy both in the encoding phase as well as in the solving phase. We also present experiments with incremental preprocessing techniques that are based on blocked clause elimination (QBCE). QBCE allows to eliminate certain clauses from a QBF in a satisfiability preserving way. We implemented the QBCE-based techniques in DepQBF in three variants: as preprocessing, as inprocessing (which extends preprocessing by taking into account variable assignments that were fixed by the QBF solver), and as a novel dynamic approach where QBCE is tightly integrated in the solving process. For DepQBF, experimental results show that incremental QBF solving with incremental QBCE outperforms incremental QBF solving without QBCE, which in turn outperforms nonincremental QBF solving. For the first time we report on incremental QBF solving with incremental QBCE as inprocessing. Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 24, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.