Pointwise circumscription is equivalent to predicate completion (sometimes)

Yves Moinard 1
1 DREAM - Diagnosing, Recommending Actions and Modelling
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : Two ways of minimizing positive information are predicate completion, which comes from logic programming theory, and circumscription, which is one of the best known methods of non-monotonic reasoning. Here, it is shown that, under certain hypothesis, there is equivalence between predicate completion and a special kind of circumscription.
Type de document :
Communication dans un congrès
Robert A. Kowalski and Kenneth A. Bowen. Fifth International Conference of Logic Programming (ICLP 88), Aug 1988, Seattle, United States. MIT Press, 2, 1988, Logic Programming (Proceedings of the Fifth International Conference of Logic Programming). 〈https://mitpress.mit.edu/〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01162532
Contributeur : Yves Moinard <>
Soumis le : mercredi 10 juin 2015 - 17:08:53
Dernière modification le : jeudi 15 novembre 2018 - 11:57:04
Document(s) archivé(s) le : vendredi 11 septembre 2015 - 13:41:07

Identifiants

  • HAL Id : hal-01162532, version 1

Citation

Yves Moinard. Pointwise circumscription is equivalent to predicate completion (sometimes). Robert A. Kowalski and Kenneth A. Bowen. Fifth International Conference of Logic Programming (ICLP 88), Aug 1988, Seattle, United States. MIT Press, 2, 1988, Logic Programming (Proceedings of the Fifth International Conference of Logic Programming). 〈https://mitpress.mit.edu/〉. 〈hal-01162532〉

Partager

Métriques

Consultations de la notice

353

Téléchargements de fichiers

92