778 search results - page 11 / 156 » Expressiveness and complexity of graph logic |
DLOG
1998
14 years 10 months ago
1998
This paper introduces YAYA1, a Description Logic system focused towards learning complex interrelations among objects. YAYA Concept Language (YCL) is quite restricted; although it...
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
KR
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
LMCS
2007
14 years 9 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...