Boolean formulas of simple conceptual graphs SGBF

  • Authors:
  • Olivier Carloni

  • Affiliations:
  • Mondeca, Paris, France

  • Venue:
  • GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a conceptual graph formalism called simple graph boolean formulas that extends the $\mathcal{SG}$ with boolean connectors. This formalism is used to define categories of objects in a classification service that can be turned into a legal content management system. We define the $\mathcal{SGBF}$ of graph boolean formulas, present two decidable fragments of this formalism (relying on the first order logic BSR and guarded fragments), and describe the functional architecture of a generic classification service that can be used in the legal domain.