Sciweavers

54 search results - page 9 / 11
» Temporalising Tractable Description Logics
Sort
View
KES
2007
Springer
14 years 1 months ago
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
Nicola Fanizzi, Claudia d'Amato
DIMACS
1996
13 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
FM
1999
Springer
107views Formal Methods» more  FM 1999»
13 years 11 months ago
A Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
DLOG
2008
13 years 9 months ago
All Elephants are Bigger than All Mice
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
Sebastian Rudolph, Markus Krötzsch, Pascal Hi...
DLOG
2011
12 years 10 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan