Sciweavers

616 search results - page 9 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
AAAI
2007
13 years 11 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
GEOINFORMATICA
2011
13 years 3 months ago
Functional description of geoprocessing services as conjunctive datalog queries
Discovery of suitable web services is a crucial task in Spatial Data Infrastructures (SDI). In this work, we develop a novel approach to the discovery of geoprocessing services (WP...
Daniel Fitzner, Jörg Hoffmann, Eva Klien
CADE
2001
Springer
14 years 9 months ago
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed up TBox and ABox reasoning ...
Anni-Yasmin Turhan, Ralf Möller, Volker Haars...
CSL
2006
Springer
14 years 19 days ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
LPAR
2007
Springer
14 years 3 months ago
Data Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
Adila Krisnadhi, Carsten Lutz