Induction with generalization in superposition reasoning
Paper in proceeding, 2020
We describe an extension of automating induction in superposition-based reasoning by strengthening inductive properties and generalizing terms over which induction should be applied. We implemented our approach in the first-order theorem prover Vampire and evaluated our work against state-of-the-art reasoners automating induction. We demonstrate the strength of our technique by showing that many interesting mathematical properties of natural numbers and lists can be proved automatically using this extension.
Author
Márton Hajdú
Vienna University of Technology
Petra Hozzová
Vienna University of Technology
Laura Kovacs
Vienna University of Technology
Chalmers, Computer Science and Engineering (Chalmers), Formal methods
Johannes Schoisswohl
Vienna University of Technology
University of Manchester
A. Voronkov
University of Manchester
EasyChair
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 12236 LNAI 123-137978-303053517-9 (ISBN)
13th International Conference on Intelligent Computer Mathematics, CICM 2020
Bertinoro, Italy,
Bertinoro, Italy,
Subject Categories
Philosophy
Computer Science
Composite Science and Engineering
DOI
10.1007/978-3-030-53518-6_8