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

Abstract Saturation-based Inference

Nachum Dershowitz 1 Claude Kirchner 2
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 9:14:31 AM
Last modification on : Friday, February 4, 2022 - 3:31:27 AM
Long-term archiving on: : Wednesday, March 29, 2017 - 12:38:51 PM


  • 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⟩



Record views


Files downloads