Download PDFOpen PDF in browser

New Techniques in Clausal Form Generation

13 pagesPublished: September 29, 2016

Abstract

In automated reasoning it is common that first-order formulas need to be translated into clausal normal form for proof search. The structure of this normal form can have a large impact on the performance of first-order theorem provers, influencing whether a proof can be found and how quickly. It is common folklore that transformations should ideally minimise both the size of the generated clause set and extensions to the signature. This paper introduces a new top-down approach to clausal form generation for first-order formulas that aims to achieve this goal in a new way. The main advantage of this approach over existing bottom-up techniques is that more contextual information is available at points where decisions such as subformula-naming and Skolemisation occur. Experimental results show that our implementation of the transformation in Vampire can lead to clausal forms which are smaller and better suited to proof search.

Keyphrases: automated reasoning, Clausal Normal Form, Clausification, first-order logic, theorem proving

In: Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas (editors). GCAI 2016. 2nd Global Conference on Artificial Intelligence, vol 41, pages 11--23

Links:
BibTeX entry
@inproceedings{GCAI2016:New_Techniques_in_Clausal,
  author    = {Giles Reger and Martin Suda and Andrei Voronkov},
  title     = {New Techniques in Clausal Form Generation},
  booktitle = {GCAI 2016. 2nd Global Conference on Artificial Intelligence},
  editor    = {Christoph Benzm\textbackslash{}"uller and Geoff Sutcliffe and Raul Rojas},
  series    = {EPiC Series in Computing},
  volume    = {41},
  pages     = {11--23},
  year      = {2016},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/XncX},
  doi       = {10.29007/dzfz}}
Download PDFOpen PDF in browser