: CLG(2) is the latest member of a family of grammar formalisms centered around the notion of complex constraint expression for describing phrasal and iexical information and princ...
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...