Abstract Saturation-based Inference - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Abstract Saturation-based Inference


Solving goals---like deciding word problems or resolving constraints---is much easier in some theory presentations than in others. What have been called ``completion processes'', in particular in the study of equational logic, involve finding appropriate presentations of a given theory to solve easily a given class of problems. We provide a general proof-theoretic setting within which completion-like processes can be modelled and studied. This framework centers around well-founded orderings of proofs. It allows for abstract definitions and very general characterizations of saturation processes and redundancy criteria.
Fichier principal
Vignette du fichier
A03-R-422.pdf (130.09 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00099466 , version 1


Nachum Dershowitz, Claude Kirchner. Abstract Saturation-based Inference. Eighteenth Annual IEEE Symposium on Logic in Computer Science - LICS'2003), Jun 2003, Ottawa, Canada, 10 p. ⟨inria-00099466⟩
101 View
78 Download


Gmail Facebook Twitter LinkedIn More