Cargando...
A Comprehensive Framework for Saturation Theorem Proving
We present a framework for formal refutational completeness proofs of abstract provers that implement saturation calculi, such as ordered resolution or superposition. The framework relies on modular extensions of lifted redundancy criteria. It allows us to extend redundancy criteria so that they cov...
Gardado en:
| Publicado en: | Automated Reasoning |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
2020
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7324260/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51074-9_18 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|