4617 search results - page 377 / 924 » Automation of Diagrammatic Reasoning |
192
click to vote
DLOG
2008
15 years 9 months ago
2008
We have shown recently that, in extensions of ALC that involve inverse roles, conjunctive query answering is harder than satisfiability: it is 2-ExpTime-complete in general and NEx...
157
click to vote
DLOG
2008
15 years 9 months ago
2008
Abstract. We propose an approach for extending a tableau-based satisfiability algorithm by an arithmetic component. The result is a hybrid satisfiability algorithm for the Descript...
179
click to vote
DLOG
2008
15 years 9 months ago
2008
Many visualization frameworks for ontologies in general and for concept expressions in particular are too faithful to the syntax of the languages in which those objects are represe...
154
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
147
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...