Cargando…
Short Q-Resolution Proofs with Homomorphisms
We introduce new proof systems for quantified Boolean formulas (QBFs) by enhancing Q-resolution systems with rules which exploit local and global symmetries. The rules are based on homomorphisms that admit non-injective mappings between literals. This results in systems that are stronger than Q-reso...
Autores principales: | Shukla, Ankit, Slivovsky, Friedrich, Szeider, Stefan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326547/ http://dx.doi.org/10.1007/978-3-030-51825-7_29 |
Ejemplares similares
-
Long-Distance Q-Resolution with Dependency Schemes
por: Peitl, Tomáš, et al.
Publicado: (2018) -
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
por: Slivovsky, Friedrich, et al.
Publicado: (2020) -
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness
por: Schlaipfer, Matthias, et al.
Publicado: (2020) -
Graphs and Homomorphisms
por: Hell, Pavol, et al.
Publicado: (2004) -
On transfer homomorphisms of Krull monoids
por: Geroldinger, Alfred, et al.
Publicado: (2021)