Sciweavers

778 search results - page 13 / 156
» Expressiveness and complexity of graph logic
Sort
View
COLING
1990
14 years 10 months ago
CLG(n): Constraint Logic Grammars
: 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...
Sergio Balari, Giovanni B. Varile, Luís Dam...
STACS
1994
Springer
15 years 1 months ago
Reachability and the Power of Local Ordering
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...
Kousha Etessami, Neil Immerman
LICS
2005
IEEE
15 years 3 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
CADE
2010
Springer
14 years 10 months ago
An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
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 ...
Yevgeny Kazakov
78
Voted
ITA
2007
14 years 9 months ago
Three notes on the complexity of model checking fixpoint logic with chop
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...
Martin Lange