Basic Completion with E-cycle Simplification

Christopher Lynch 1 Christelle Scharff 2
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Type de document :
Communication dans un congrès
Jacques Calmet et Jan Plaza. International Conference on Artificial Intelligence & Symbolic Computation - AISC'98, 1998, Plattsburgh, NY, USA, Springer Verlag, 1476, pp.209-221, 1998, Lecture Notes in Artificial Intelligence
Liste complète des métadonnées

https://hal.inria.fr/inria-00098482
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:01:58
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58

Identifiants

  • HAL Id : inria-00098482, version 1

Collections

Citation

Christopher Lynch, Christelle Scharff. Basic Completion with E-cycle Simplification. Jacques Calmet et Jan Plaza. International Conference on Artificial Intelligence & Symbolic Computation - AISC'98, 1998, Plattsburgh, NY, USA, Springer Verlag, 1476, pp.209-221, 1998, Lecture Notes in Artificial Intelligence. 〈inria-00098482〉

Partager

Métriques

Consultations de la notice

50