Induction with generalization in superposition reasoning
Paper i 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.

Författare

Márton Hajdú

Technische Universität Wien

Petra Hozzová

Technische Universität Wien

Laura Kovacs

Technische Universität Wien

Chalmers, Data- och informationsteknik, Formella metoder

Johannes Schoisswohl

Technische Universität Wien

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-137

13th International Conference on Intelligent Computer Mathematics, CICM 2020
Bertinoro, Italy,

Ämneskategorier

Filosofi

Datavetenskap (datalogi)

Kompositmaterial och -teknik

DOI

10.1007/978-3-030-53518-6_8

Mer information

Senast uppdaterat

2020-08-28