2012 | OriginalPaper | Buchkapitel
Boolean Formulas of Simple Conceptual Graphs ()
verfasst von : Olivier Carloni
Erschienen in: Graph Structures for Knowledge Representation and Reasoning
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.