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.
|Number of pages||10|
|Journal||Proceedings - Symposium on Logic in Computer Science|
|State||Published - 2003|
|Event||18th Annual IEEE Symposium on Logic in Computer Science - Ottawa, Ont., Canada|
Duration: 22 Jun 2003 → 25 Jun 2003