Basic Completion with E-cycle Simplification

• Autorzy: Lynch Ch. , Scharff Ch.
• Języki publikacji: EN

Abstrakty

EN

We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic Simplification is a derivation involving E-cycle Simplification, but not vice versa. E-cycle Simplification is simple to perform, and does not use the reducibility-relative-to condition. ECC implements our method.

Słowa kluczowe

EN

equational constraints; Basic Completion; Simplification Strategies

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 1999
• Tom: Vol. 39, Nr 1,2
• Strony: 145--165
• Opis fizyczny: bibliogr. 20 poz.

Twórcy

autor

Lynch Ch.

autor

Scharff Ch.

• Department of Mathematics and Computer Science, Clarkson University, Box 5815, Potsdam, NY 13699-5815, USA,