| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Abstract Saturation-based Inference
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.
Cited literature [34 references]
https://hal.inria.fr/inria-00099466
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:14:31 AM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Document(s) archivé(s) le : Wednesday, March 29, 2017 - 12:38:51 PM
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:14:31 AM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Document(s) archivé(s) le : Wednesday, March 29, 2017 - 12:38:51 PM