Abstract Canonical Inference Systems - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Abstract Canonical Inference Systems

Résumé

We provide a general proof theoretical setting under which the so-called ``completion processes'' (as used for equational reasoning) can be modeled, understood, studied, proved and generalized. This framework---based on a well-founded ordering on proofs---allows us to derive saturation processes and redundancy criteria abstractly.
Fichier principal
Vignette du fichier
A02-R-501.pdf (162.13 Ko) Télécharger le fichier

Dates et versions

inria-00107627 , version 1 (19-10-2006)

Identifiants

  • HAL Id : inria-00107627 , version 1

Citer

Nachum Dershowitz, Claude Kirchner. Abstract Canonical Inference Systems. 16th International Workshop on Unification - UNIF'2002, Jul 2002, Copenhagen, Denmark, 20 p. ⟨inria-00107627⟩
141 Consultations
23 Téléchargements

Partager

Gmail Facebook X LinkedIn More