This paper presents a conceptual graph formalism called
simple graph boolean formulas
that extends the
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
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.