Sciweavers

346 search results - page 20 / 70
» Logical omniscience as a computational complexity problem
Sort
View
145
Voted
DLOG
2001
15 years 4 months ago
On Expressive Number Restrictions in Description Logics
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
Fabio Grandi
163
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 5 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
WOLLIC
2009
Springer
15 years 10 months ago
Query Answering in Description Logics: The Knots Approach
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...
143
Voted
MST
2011
207views Hardware» more  MST 2011»
14 years 10 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
116
Voted
TARK
2007
Springer
15 years 9 months ago
Alternating-time temporal logic with explicit strategies
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...
Dirk Walther, Wiebe van der Hoek, Michael Wooldrid...