Sciweavers

1435 search results - page 87 / 287
» E-connections of Description Logics
Sort
View
CSL
2000
Springer
15 years 5 months ago
Bounded Arithmetic and Descriptive Complexity
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Achim Blumensath
AMW
2010
15 years 2 months ago
Updating ABoxes in DL-Lite
Abstract. We study the problem of instance level (ABox) updates for Knowledge Bases (KBs) represented in Description Logics of the DL-Lite family. DLLite is at the basis of OWL 2 Q...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
PSSS
2003
15 years 2 months ago
DLDB: Extending Relational Databases to Support Semantic Web Queries
Abstract: We present DLDB, a knowledge base system that extends a relational database management system with additional capabilities for DAML+OIL inference. We discuss a number of ...
Zhengxiang Pan, Jeff Heflin
DLOG
2011
14 years 4 months ago
Relaxed Abduction: Robust Information Interpretation for Incomplete Models
This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been ap...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
IFM
2010
Springer
159views Formal Methods» more  IFM 2010»
14 years 11 months ago
A Logical Framework to Deal with Variability
We present a logical framework that is able to deal with variability in product family descriptions. The temporal logic MHML is based on the classical Hennessy–Milner logic with ...
Patrizia Asirelli, Maurice H. ter Beek, Alessandro...