Download PDFOpen PDF in browser

Partial Regularization of First-Order Resolution Proofs

12 pagesPublished: April 27, 2020


Proofs are a key feature of modern propositional and first-order theorem provers. Proofs generated by such tools serve as explanations for unsatisfiability of statements. However, these explanations are complicated by proofs which are not necessarily as concise as possible. There are a wide variety of compression techniques for propositional resolution proofs, but fewer compression techniques for first-order resolution proofs generated by automated theorem provers. This paper describes an approach to compressing first-order logic proofs based on lifting proof compression ideas used in propositional logic to first-order logic. An empirical evaluation of the approach is included.

Keyphrases: first-order logic, Proof Compression, resolution, unification

In: Gregoire Danoy, Jun Pang and Geoff Sutcliffe (editors). GCAI 2020. 6th Global Conference on Artificial Intelligence (GCAI 2020), vol 72, pages 34--45

BibTeX entry
  author    = {Jan Gorzny and Ezequiel Postan and Bruno Woltzenlogel Paleo},
  title     = {Partial Regularization of First-Order Resolution Proofs},
  booktitle = {GCAI 2020. 6th Global Conference on Artificial Intelligence (GCAI 2020)},
  editor    = {Gregoire Danoy and Jun Pang and Geoff Sutcliffe},
  series    = {EPiC Series in Computing},
  volume    = {72},
  pages     = {34--45},
  year      = {2020},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2398-7340},
  url       = {},
  doi       = {10.29007/3r41}}
Download PDFOpen PDF in browser