Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Daniel Goossens Connect in order to contact the contributor
Submitted on : Monday, August 2, 2010 - 7:10:25 PM
Last modification on : Wednesday, April 28, 2021 - 6:39:03 PM
Long-term archiving on: : Tuesday, October 23, 2012 - 11:57:23 AM


Files produced by the author(s)


  • HAL Id : inria-00508299, version 1


Daniel Goossens. Boolean Reasoning with Graphs of Partitions. 2010. ⟨inria-00508299⟩



Record views


Files downloads