Cargando…
Long-Distance Q-Resolution with Dependency Schemes
Resolution proof systems for quantified Boolean formulas (QBFs) provide a formal model for studying the limitations of state-of-the-art search-based QBF solvers that use these systems to generate proofs. We study a combination of two proof systems supported by the solver DepQBF: Q-resolution with ge...
Autores principales: | Peitl, Tomáš, Slivovsky, Friedrich, Szeider, Stefan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Netherlands
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6478654/ https://www.ncbi.nlm.nih.gov/pubmed/31105366 http://dx.doi.org/10.1007/s10817-018-9467-3 |
Ejemplares similares
-
Short Q-Resolution Proofs with Homomorphisms
por: Shukla, Ankit, et al.
Publicado: (2020) -
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
por: Slivovsky, Friedrich, et al.
Publicado: (2020) -
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths
por: Beyersdorff, Olaf, et al.
Publicado: (2020) -
Working memory differences in long-distance dependency resolution
por: Nicenboim, Bruno, et al.
Publicado: (2015) -
Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing
por: Slivovsky, Friedrich
Publicado: (2020)