62 Hits in 7.6 sec

Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination [chapter]

Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl
2015 Lecture Notes in Computer Science  
We investigate the power of dynamically applying QBCE in search-based QBF solving with clause and cube learning (QCDCL).  ...  Among preprocessing techniques for quantified Boolean formula (QBF) solving, quantified blocked clause elimination (QBCE) has been found to be extremely effective.  ...  concepts of search-based QBF solving with learning.  ... 
doi:10.1007/978-3-662-48899-7_29 fatcat:caqxrjkbe5c6znryjj5uviyafe

Binary Clause Reasoning in QBF [chapter]

Horst Samulowitz, Fahiem Bacchus
2006 Lecture Notes in Computer Science  
We develop a DPLL based QBF solver that employs extended binary clause reasoning (hyper-binary resolution) to infer new binary clauses both before and during search.  ...  In this paper we investigate the use of binary clause reasoning in the context of solving Quantified Boolean Formulas (QBF).  ...  In particular, it does not really matter much if (dynamic) binary clause reasoning improves the efficiency of solving by search instances that are more easily solved by variable elimination.  ... 
doi:10.1007/11814948_33 fatcat:tkh5hb6fubgcjjd7bfqgb7vkze

Conformant planning as a case study of incremental QBF solving

Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
2016 Annals of Mathematics and Artificial Intelligence  
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.  ...  Acknowledgments Open access funding provided by TU Wien.  ... 
doi:10.1007/s10472-016-9501-2 fatcat:2pgojtu73jdebhorc36337xqpq

Conformant Planning as a Case Study of Incremental QBF Solving [chapter]

Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler
2014 Lecture Notes in Computer Science  
Since the generated QBFs have many clauses and variables in common, our approach avoids redundancy both in the encoding phase and in the solving phase.  ...  Experimental results show that incremental QBF solving outperforms non-incremental QBF solving.  ...  Acknowledgments Open access funding provided by TU Wien.  ... 
doi:10.1007/978-3-319-13770-4_11 fatcat:fkrtsv4ez5hslhtuek24o2mzs4

DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL [chapter]

Florian Lonsing, Uwe Egly
2017 Lecture Notes in Computer Science  
QCDCL solvers can produce QRES proofs of QBFs in prenex conjunctive normal form (PCNF) as a byproduct of the solving process.  ...  We present the latest major release version 6.0 of the quantified Boolean formula (QBF) solver DepQBF, which is based on QCDCL.  ...  Propositional abstractions and SAT solving leverage the benefits of techniques like trivial truth and trivial falsity presented already in early search-based QBF solvers [9] .  ... 
doi:10.1007/978-3-319-63046-5_23 fatcat:lxho37px5beatcsgkapx4gmq5q

Clause Elimination for SAT and QSAT

Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, Armin Biere
2015 The Journal of Artificial Intelligence Research  
Extending known procedures such as tautology, subsumption, and blocked clause elimination, we introduce novel elimination procedures based on asymmetric variants of these techniques, and also develop a  ...  It turns out that the importance of applying the clause elimination procedures developed in this work is empirically emphasized in the context of state-of-the-art QSAT solving.  ...  This dynamic interplay between simplification and search is captured by the inprocessing SAT solving paradigm (Järvisalo, Heule, & Biere, 2012b) .  ... 
doi:10.1613/jair.4694 fatcat:elpzpnuci5e3bffetdy3mhmwna

Using SAT in QBF [chapter]

Horst Samulowitz, Fahiem Bacchus
2005 Lecture Notes in Computer Science  
In this paper we present a technique for alleviating some of this complexity by utilizing an order unconstrained SAT solver during QBF solving.  ...  QBF generalizes SAT (SAT is QBF under the restriction all variables are existential) and is in practice much harder to solve than SAT.  ...  ) sized DPLL search tree exists when a dynamic ordering is used [8, 2] .  ... 
doi:10.1007/11564751_43 fatcat:usi5nujhkzab7e6ruh4i2glmrq

A survey of recent advances in SAT-based formal verification

Mukul R. Prasad, Armin Biere, Aarti Gupta
2005 International Journal on Software Tools for Technology Transfer (STTT)  
Dramatic improvements in SAT solver technology over the last decade, and the growing need for more efficient and scalable verification solutions have fueled research in verification methods based on SAT  ...  This paper presents a survey of the latest developments in SAT-based formal verification, including incomplete methods such as bounded model checking, and complete methods for model checking.  ...  This image computation procedure was enhanced in [51] by adding circuit structure information to the CNF formula, in order to dynamically detect and remove redundant clauses.  ... 
doi:10.1007/s10009-004-0183-4 fatcat:d6hub3n6uzezhkl7dnneh2glgu

QBF-Based Formal Verification: Experience and Perspectives

Marco Benedetti, Hratch Mangassarian, Miroslav N. Velev
2008 Journal on Satisfiability, Boolean Modeling and Computation  
Some new insights on how challenging instances are solved by state-of-the-art provers are given in Section 2.5. The Perspectives part (Section 3) looks at the future.  ...  are formulated than about the solving strategy.  ...  We thank Arnaud Lallouet for his contributions to improving the paper, Andreas Veneris for his strong encouragement to pursue QBF-based FV and for comments on parts of this work, and the anonymous reviewers  ... 
doi:10.3233/sat190055 fatcat:smzdgdfttzgmjcigbvfhwlz5wm

Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas

E. Giunchiglia, M. Narizzano, A. Tacchella
2006 The Journal of Artificial Intelligence Research  
Deduction starts by inferring new clauses by resolution, and goes on until the empty clause is generated or satisfiability of the set of clauses is proven, e.g., because no new clauses can be generated  ...  We show that the computation performed by most of the available procedures for QBFs --based on the Davis-Logemann-Loveland procedure (DLL) for propositional satisfiability-- corresponds to a tree in which  ...  This work has been partially supported by MIUR.  ... 
doi:10.1613/jair.1959 fatcat:mwo4ediuh5d45h4elrkanm7doy

Solving quantified constraint satisfaction problems

Ian P. Gent, Peter Nightingale, Andrew Rowley, Kostas Stergiou
2008 Artificial Intelligence  
The discovery of particularly effective encodings influenced the design of more effective algorithms: by analyzing the properties of these encodings, we identify the features in QBF solvers responsible  ...  In this paper we report significant contributions to two very different methods for solving QCSPs.  ...  The aim was to gather some initial evidence as to whether the enhanced log encoding is as efficient with non search-based solvers as it is with search-based ones like CSBJ.  ... 
doi:10.1016/j.artint.2007.11.003 fatcat:3fmxgpa6rrbojiueahzaual7b4

CAQE and QuAbS: Abstraction Based QBF Solvers

Leander Tentrup, Martina Seidl, Luca Pulina
2019 Journal on Satisfiability, Boolean Modeling and Computation  
Expansion-based solving methods eliminate quantifiers by rewriting the formula into propositional form.  ...  QBF solving techniques can be roughly characterized into search-based and expansion-based methods.  ...  Search-based Solving. Search-based solvers typically extend algorithms for the propositional satisfiability (SAT) problem to the richer logic.  ... 
doi:10.3233/sat190121 fatcat:xup2acwn5jg2loexwb6fk5nfie

A Symbolic Search Based Approach for Quantified Boolean Formulas [chapter]

Gilles Audemard, Lakhdar Saïs
2005 Lecture Notes in Computer Science  
To set free the variable ordering heuristics that are traditionally constrained by the static order of the QBF quantifiers, a new symbolic search based approach (QBDD(SAT)) is proposed.  ...  Our approach is enhanced with two interesting extensions. First, powerful reduction operators are introduced in order to dynamically reduce the BDD size and to answer the validity of the QBF.  ...  Such preset static ordering limits the efficiency of the search-based QBF solvers.  ... 
doi:10.1007/11499107_2 fatcat:nzvuplefsjgyfbbicjkadapsie

DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving [article]

Anastasios Kyrillidis, Moshe Y. Vardi, Zhiwei Zhang
2022 arXiv   pre-print
To address this issue, we propose a novel dynamic-programming approach for solving generalized MaxSAT problems -- called Dynamic-Programming-MaxSAT or DPMS for short -- based on Algebraic Decision Diagrams  ...  Empirical results indicate that DPMS is able to solve certain problems quickly, where other algorithms based on various techniques all fail.  ...  Acknowledgement Work supported in part by NSF grants IIS-1527668, CCF-1704883, IIS-1830549, DoD MURI grant N00014-20-1-2787, Andrew Ladd Graduate Fellowship of Rice Ken Kennedy Institute, and an award  ... 
arXiv:2205.03747v1 fatcat:52xrnh6ganfbldywxqvuqrbsgy

Learning for Dynamic subsumption [article]

Youssef Hamadi, Said Jabbour, Lakhdar Sais
2009 arXiv   pre-print
Our approach give rise to a strong and dynamic simplification technique that exploits learning to eliminate literals from the original clauses.  ...  It exploits simple and sufficient conditions to detect during conflict analysis, clauses from the original formula that can be reduced by subsumption.  ...  represent important low-level building blocks for many important fields, e.g., SMT solving, Theorem proving, Model finding, QBF solving, etc.  ... 
arXiv:0904.0029v1 fatcat:wojezk575nfvtkcqpso6hqkene
« Previous Showing results 1 — 15 out of 62 results