Cargando…
Proof Complexity of Modal Resolution
We investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3–4):117–134, 2007) and Nalon et al. (in: Automated reasoning with analytic Tableaux and related methods—24th international conference, (TABLEAUX’15), pp 185–200, 2015), which form the basis...
Autores principales: | Sigley, Sarah, Beyersdorff, Olaf |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Netherlands
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8752563/ https://www.ncbi.nlm.nih.gov/pubmed/35068630 http://dx.doi.org/10.1007/s10817-021-09609-9 |
Ejemplares similares
-
Building Strategies into QBF Proofs
por: Beyersdorff, Olaf, et al.
Publicado: (2020) -
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths
por: Beyersdorff, Olaf, et al.
Publicado: (2020) -
Proof theory of modal logic
por: Wansing, Heinrich
Publicado: (1996) -
Short Q-Resolution Proofs with Homomorphisms
por: Shukla, Ankit, et al.
Publicado: (2020) -
Theory and applications of satisfiability testing - SAT 2018: 21st international conference, SAT 2018, held as part of the federated logic conference, FLOC 2018, Oxford, UK, July 9-12, 2018, proceedings
por: Beyersdorff, Olaf, et al.
Publicado: (2018)