Abstract Saturation-based Inference

Nachum Dershowitz 1 Claude Kirchner 2
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Type de document :
Communication dans un congrès
Eighteenth Annual IEEE Symposium on Logic in Computer Science - LICS'2003), Jun 2003, Ottawa, Canada, 10 p, 2003
Liste complète des métadonnées

Littérature citée [34 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00099466
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 09:14:31
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : mercredi 29 mars 2017 - 12:38:51

Fichiers

Identifiants

  • HAL Id : inria-00099466, version 1

Collections

Citation

Nachum Dershowitz, Claude Kirchner. Abstract Saturation-based Inference. Eighteenth Annual IEEE Symposium on Logic in Computer Science - LICS'2003), Jun 2003, Ottawa, Canada, 10 p, 2003. 〈inria-00099466〉

Partager

Métriques

Consultations de la notice

79

Téléchargements de fichiers

34