Boolean Reasoning with Graphs of Partitions

Abstract : This paper presents an implemented architecture for easy learning, reorganizing and navigation into a Boolean knowledge base. As the base grows with new definitions and constraints, it is normalized by the closure of a completion operator. This normalization allows arbitrary formats for Boolean expressions. It ensures basic reasoning abilities and spontaneously organizes intermingled taxonomies of concepts. User interaction is done with three operators~: activation, inhibition and forced contradiction. Complex constraints, such as instantiations of first-order expressions, may be programmatically added. A complete illustrative scenario is developed around a knowledge base on elementary school geometry and the approach is situated in the AI field.
Type de document :
Pré-publication, Document de travail
version longue du papier court "A Dynamic Boolean Knowledge Base" accepté à ICTAI 2010. 2010
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00508299
Contributeur : Daniel Goossens <>
Soumis le : lundi 2 août 2010 - 19:10:25
Dernière modification le : mardi 22 mai 2018 - 20:40:06
Document(s) archivé(s) le : mardi 23 octobre 2012 - 11:57:23

Fichier

GP.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00508299, version 1

Collections

Citation

Daniel Goossens. Boolean Reasoning with Graphs of Partitions. version longue du papier court "A Dynamic Boolean Knowledge Base" accepté à ICTAI 2010. 2010. 〈inria-00508299〉

Partager

Métriques

Consultations de la notice

199

Téléchargements de fichiers

124