A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules

Abstract : We devise a calculus based on the resolution and paramodulation rules and operating on schemata of formulæ. These schemata are defined inductively, using convergent rewrite systems encoding primitive recursive definitions. The main original feature of this calculus is that the rules operate on formulæ or terms occurring at arbitrarily deep positions inside the considered schemata, possibly by applying transformations on the corresponding rewrite system. Each inference step in the new calculus corresponds to several applications of the usual resolution or paramodulation rules over the instances of the considered schemata. The calculus has been implemented in the proof editor Shred. As an example of application we provide a formal refutation of a schema of clause sets generated by applying the CERES cut-elimination method on Fürstenberg's proof of the infinity of prime numbers.
Type de document :
Article dans une revue
Journal of Logic and Computation, Oxford University Press (OUP), 2017, 27 (2), pp.549-576
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01516896
Contributeur : Nicolas Peltier <>
Soumis le : mardi 2 mai 2017 - 13:55:16
Dernière modification le : samedi 6 mai 2017 - 01:04:45

Identifiants

  • HAL Id : hal-01516896, version 1

Collections

Citation

Nicolas Peltier. A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules . Journal of Logic and Computation, Oxford University Press (OUP), 2017, 27 (2), pp.549-576. <hal-01516896>

Partager

Métriques

Consultations de la notice

65