Basic Completion with E-cycle Simplification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Basic Completion with E-cycle Simplification

Abstract

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, andq does not use the reducibility-relative-to condition. ECC implements our method.
No file

Dates and versions

inria-00098482 , version 1 (25-09-2006)

Identifiers

  • HAL Id : inria-00098482 , version 1

Cite

Christopher Lynch, Christelle Scharff. Basic Completion with E-cycle Simplification. International Conference on Artificial Intelligence & Symbolic Computation - AISC'98, 1998, Plattsburgh, NY, USA, pp.209-221. ⟨inria-00098482⟩
56 View
0 Download

Share

Gmail Facebook X LinkedIn More