146 search results - page 6 / 30 » Data Complexity in the EL Family of Description Logics |
AAAI
2012
11 years 10 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from si...
DLOG
2011
12 years 11 months ago
2011
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rule...
IJCAI
2007
13 years 9 months ago
2007
Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so ...