Using Rewriting and Strategies for Describing the B Predicate Prover - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Using Rewriting and Strategies for Describing the B Predicate Prover

Abstract

The framework of computational systems has been already used for describing several computational logics. In this paper is described the way a propositional prover and a predicate prover are implemented in ELAN, the system developed in Nancy for describing and executing computational systems. The inference rules for the provers are described by conditional rewrite rules and their application is controlled by strategies. We show how different strategies using the same set of rewrite rules can yield different proof methods.
Fichier principal
Vignette du fichier
98-R-276.pdf (196.69 Ko) Télécharger le fichier

Dates and versions

inria-00098715 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098715 , version 1

Cite

Horatiu Cirstea, Claude Kirchner. Using Rewriting and Strategies for Describing the B Predicate Prover. Proceedings of the Workshop on Strategies in Automated Deduction - CADE-15, F. Pfenning, B. Gramlich, 1998, Lindau, Germany, pp.23-34. ⟨inria-00098715⟩
46 View
50 Download

Share

Gmail Facebook X LinkedIn More