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...

Descripción completa

Detalles Bibliográficos
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