Filters








192 Hits in 2.0 sec

Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems [chapter]

Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik
2005 Lecture Notes in Computer Science  
By unrolling the transition relation, the sequential circuit state space diameter problem can be formulated as an evaluation for satisfiability of a Quantified Boolean Formula (QBF).  ...  This result is important as it highlights the need to explore non-search based or hybrid of search and non-search based QBF algorithms for the sequential circuit state space diameter problem.  ...  A non-search based algorithm or a hybrid of search based and non-search based methods are possible candidates for using QBF evaluation to solve the circuit state space diameter problem.  ... 
doi:10.1007/11527695_23 fatcat:xia6vfbey5b5pez2ulyg6nuowe

An AIG-Based QBF-solver using SAT for preprocessing

Florian Pigorsch, Christoph Scholl
2010 Proceedings of the 47th Design Automation Conference on - DAC '10  
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs).  ...  Moreover, we present a novel SAT-based method for preprocessing QBFs that is able to efficiently detect variables with forced truth assignments, allowing for an elimination of these variables from the  ...  In [29] the authors describe a similar algorithm for the use in a decision procedure for logic programming problems.  ... 
doi:10.1145/1837274.1837318 dblp:conf/dac/PigorschS10 fatcat:nfvxrtnuujhgdfhtev7hugx6hy

QBF-Based Formal Verification: Experience and Perspectives

Marco Benedetti, Hratch Mangassarian, Miroslav N. Velev
2008 Journal on Satisfiability, Boolean Modeling and Computation  
In the second part of this paper, we investigate for the first time the relevance of some advanced QBF techniques to FV tasks.  ...  We first provide an account of the status quo in QBF-based FV. We examine commonly adopted formalizations and the relative strengths of different decision procedures.  ...  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

Evaluating QBFs via Symbolic Skolemization [chapter]

Marco Benedetti
2005 Lecture Notes in Computer Science  
To leverage all these techniques at once we show how to evaluate QBFs by symbolically reasoning on a compact representation for the propositional expansion of the skolemized problem.  ...  We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications.  ...  I'm grateful to Marco Cadoli for discussing this work with me. Finally, Amedeo Cesta deserves a special thought for his indefatigable encouragement.  ... 
doi:10.1007/978-3-540-32275-7_20 fatcat:2yelkanibzhsphim7tqz7icrii

Exploiting structure in an AIG based QBF solver

Florian Pigorsch, Christoph Scholl
2009 2009 Design, Automation & Test in Europe Conference & Exhibition  
In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure.  ...  on which state-of-the-art QBF solvers known from literature fail.  ...  We modified the quantifier tree algorithm from [5] to be able to cope with our hybrid QBF formulas by making it aware of functional definitions for CNF variables.  ... 
doi:10.1109/date.2009.5090919 dblp:conf/date/PigorschS09 fatcat:u2n5heedizdslanu7yrwoobvjq

A self-adaptive multi-engine solver for quantified Boolean formulas

Luca Pulina, Armando Tacchella
2008 Constraints  
for domain-specific tuning.  ...  In this paper we study the problem of engineering a robust solver for quantified Boolean formulas (QBFs), i.e., a tool that can efficiently solve formulas across different problem domains without the need  ...  Acknowledgements We wish to thank the Italian Ministry of University and Research for its financial support.  ... 
doi:10.1007/s10601-008-9051-2 fatcat:zbrs2atvpvakzgabktmfzj2plq

Forthcoming Papers

2003 Artificial Intelligence  
Modern domain-independent heuristic planners evaluate their plans on the single basis of their length.  ...  We show how it is possible to incorporate both conflict-directed and solution-directed backjumping in a DLL-based decision procedure for satisfiability of QBFs.  ...  Many decision procedures have been proposed in the last few years, most of them based on the Davis, Logemann, Loveland procedure (DLL) for propositional satisfiability (SAT).  ... 
doi:10.1016/s0004-3702(03)00031-6 fatcat:vv67l2cr4vevzh7tzkehconbjq

Symbolic Decision Procedures for QBF [chapter]

Guoqiang Pan, Moshe Y. Vardi
2004 Lecture Notes in Computer Science  
Much recent work has gone into adapting techniques that were originally developed for SAT solving to QBF solving. In particular, QBF solvers are often based on SAT solvers.  ...  We extend some recent symbolic approaches for SAT solving to symbolic QBF solving, using various decision-diagram formalisms such as OBDDs and ZDDs.  ...  Acknowledgement We would like to thank Laurent Simon for making available to us his ZRes package, which served as the basis for QMRES.  ... 
doi:10.1007/978-3-540-30201-8_34 fatcat:qh6tulx5mrelfj2cm6abw5qkty

The QBF Gallery: Behind the scenes

Florian Lonsing, Martina Seidl, Allen Van Gelder
2016 Artificial Intelligence  
These benchmarks became the basis for the experiments conducted in the context of the QBF Gallery 2013 and follow-up evaluations. In this paper, we report on the setup of the QBF Gallery.  ...  Frameworks for certification and solution extraction emerged that allow for a detailed interpretation of a QBF solver's results, and new types of QBF encodings were presented for various application problems  ...  We would like to thank all participants of the QBF Gallery 2013 and 2014 as well as the participants of the QBF Workshops 2013 and 2014 for their feedback.  ... 
doi:10.1016/j.artint.2016.04.002 fatcat:yafedcj36fc6fj4pm5uwf6377e

Quantifier Trees for QBFs [chapter]

Marco Benedetti
2005 Lecture Notes in Computer Science  
Means to profit from a quantifier tree are presented for all the main families of QBF solvers. Surprising experiments on QBFLIB instances are also reported.  ...  We present a method-called quantifier tree reconstruction-that allows to efficiently recover ex-post a portion of the internal structure of QBF instances which was hidden as a consequence of the cast to  ...  We thank Lucas Bordeaux for pointing out connections to query optimization, and Luciano Serafini for hints on previous versions of this paper.  ... 
doi:10.1007/11499107_28 fatcat:7uzkfga6wfhynd57xcqtl6zc5m

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.  ...  For more details the interested reader is referred to the report on the evaluation of QBF solvers for the SAT'2003 conference [12] .  ... 
doi:10.1007/s10009-004-0183-4 fatcat:d6hub3n6uzezhkl7dnneh2glgu

Qute in the QBF Evaluation 2018

Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider, Martina Seidl, Luca Pulina
2019 Journal on Satisfiability, Boolean Modeling and Computation  
Qute is a solver for Quantified Boolean Formulas (QBFs) based on Quantified Conflict-Driven Constraint Learning (QCDCL).  ...  Its main distinguishing feature is dependency learning, a lazy technique for relaxing restrictions on the order of variable assignments imposed by nested quantifiers.  ...  The success of CDCL for SAT has lead to a generalization of this algorithm to the satisfiability problem (or evaluation problem) of Quantified Boolean Formulas (QBFs) under the name of Quantified CDCL  ... 
doi:10.3233/sat190124 fatcat:nmrf5wkuwfheljqzwbceu4uc6q

Linkage and association mapping reveals the genetic basis of brown fibre (Gossypium hirsutum )

Tianwang Wen, Mi Wu, Chao Shen, Bin Gao, De Zhu, Xianlong Zhang, Chunyuan You, Zhongxu Lin
2018 Plant Biotechnology Journal  
Gh_A07G2341 and Gh_A07G0100 were identified as candidate genes for qBF-A07-1 and qBF-A07-2, respectively.  ...  We identified 10 quantitative trait loci (QTLs) for fibre yield and 19 QTLs for fibre quality through a genome-wide association study (GWAS) and found that qBF-A07-2 negatively affects fibre yield and  ...  The authors appreciate the public resource of the CottonGen database and the researchers working for the cotton community.  ... 
doi:10.1111/pbi.12902 pmid:29476651 pmcid:PMC6097129 fatcat:7acnvmochfh73p5ffsx2tlmadm

Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test

Hratch Mangassarian, Andreas Veneris, Marco Benedetti
2010 IEEE transactions on computers  
Admittedly, this work encourages further research in the use of QBF in CAD for VLSI.  ...  This work proposes a succinct QBF encoding for modeling sequential circuit behavior. The encoding is parametrized and further compression is achieved using time-frame windowing.  ...  The generated instances are solved using sKizzo [24] , a state-of-the-art hybrid QBF solver based on symbolic skolemization.  ... 
doi:10.1109/tc.2010.74 fatcat:a5ggxauhsbbdji3w2pfx7z7o7q

Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers

Marco Maratea, Francesco Ricca, Wolfgang Faber, Nicola Leone
2008 Journal of Algorithms  
We have also evaluated the same benchmark using "native" QBF solvers, which were among the best solvers in recent QBF Evaluations.  ...  DLV is the state-of-the-art system for evaluating disjunctive answer set programs.  ...  We would like to thank the anonymous reviewers for their useful suggestions.  ... 
doi:10.1016/j.jalgor.2008.02.006 fatcat:ydr5g4mebrcnjbjck73kph2ulq
« Previous Showing results 1 — 15 out of 192 results