Boolean Reasoning with Graphs of Partitions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2010

Boolean Reasoning with Graphs of Partitions


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.
Fichier principal
Vignette du fichier
GP.pdf (173.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00508299 , version 1 (02-08-2010)


  • HAL Id : inria-00508299 , version 1


Daniel Goossens. Boolean Reasoning with Graphs of Partitions. 2010. ⟨inria-00508299⟩
212 View
163 Download


Gmail Facebook X LinkedIn More