778 search results - page 13 / 156 » Expressiveness and complexity of graph logic |
92
Voted
COLING
1990
15 years 1 months ago
1990
: 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...
103
Voted
STACS
1994
Springer
15 years 4 months ago
1994
Springer
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...
115
click to vote
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
111
Voted
CADE
2010
Springer
15 years 1 months ago
2010
Springer
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 ...
100
Voted
ITA
2007
15 years 9 days ago
2007
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...