Rewriting and Inductive Reasoning

17 pages•Published: May 26, 2024

Marton Hajdu, Laura Kovács and Michael Rawson

Abstract

Rewriting techniques based on reduction orderings generate “just enough” consequences to retain first-order completeness. This is ideal for superposition-based first-order theorem proving, but for at least one approach to inductive reasoning we show that we are miss- ing crucial consequences. We therefore extend the superposition calculus with rewriting- based techniques to generate sufficient consequences for automating induction in satura- tion. When applying our work within the unit-equational fragment, our experiments with the theorem prover Vampire show significant improvements for inductive reasoning.

Keyphrases: induction, rewriting, saturation, superposition

In: Nikolaj Bjørner, Marijn Heule and Andrei Voronkov (editors). Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 100, pages 278-294.

Links:	https://easychair.org/publications/paper/T1mjX
	https://doi.org/10.29007/vbfp

BibTeX entry

@inproceedings{LPAR2024:Rewriting_Inductive_Reasoning,
  author    = {Marton Hajdu and Laura Kovács and Michael Rawson},
  title     = {Rewriting and Inductive Reasoning},
  booktitle = {Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Nikolaj Bjørner and Marijn Heule and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {100},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/T1mjX},
  doi       = {10.29007/vbfp},
  pages     = {278-294},
  year      = {2024}}

Download PDF Open PDF in browser