778 search results - page 35 / 156 » Expressiveness and complexity of graph logic |
AAAI
2010
15 years 1 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
103
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
102
Voted
IANDC
2006
15 years 15 days ago
2006
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
116
click to vote
PODS
2008
ACM
16 years 19 days ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...