Sciweavers

60 search results - page 2 / 12
» On the Complexity of Hybrid Logics with Binders
Sort
View
LOGCOM
2006
101views more  LOGCOM 2006»
13 years 5 months ago
Tableau-based Decision Procedures for Hybrid Logic
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision p...
Thomas Bolander, Torben Braüner
ENTCS
2007
109views more  ENTCS 2007»
13 years 5 months ago
Hybrid Logics and Ontology Languages
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...
Ian Horrocks, Birte Glimm, Ulrike Sattler
DLOG
2006
13 years 6 months ago
Conjunctive Query Answering for Description Logics with Transitive Roles
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present algorithms for conjunctive query answerin...
Birte Glimm, Ian Horrocks, Ulrike Sattler
CSL
1999
Springer
13 years 9 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
CORR
2007
Springer
78views Education» more  CORR 2007»
13 years 5 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber