HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Generalization of Equational Proof Theory?

Olivier Bournez 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Recently rule based languages focussed on the use of rewriting as a modeling tool which results in making specifications executable. To extend the modeling capabilities of rule based languages, we explored in a previous work the possibility of making the rule applications subject to probabilistic choices, and started to study the generalization of the results in the rewriting community about abstract reduction systems to systems with probabilistic choices. This paper presents a new contribution on this line by presenting a generalization of classical equational proof theory. We obtain a nice proof theory which is sound and complete, and which has initial models.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:52:41 PM
Last modification on : Friday, May 13, 2022 - 10:18:05 PM


  • HAL Id : inria-00100885, version 1



Olivier Bournez. A Generalization of Equational Proof Theory?. Second Joint International Workshop on Process Algebras and Performance Modeling / Probabilistic Methods In Verification - PAPM-PROBMIV'02, Jul 2002, Copenhagen, Denmark, pp.207-208. ⟨inria-00100885⟩



Record views