Sciweavers

1545 search results - page 60 / 309
» Defeasible Description Logics
Sort
View
IJCAI
1997
13 years 9 months ago
Reifying Concepts in Description Logics
Practical applications of description logics (DLs) in knowledge-based systems have forced us to introduce the following features which are absent from existing DLs: • allowing a...
Liviu Badea
JAPLL
2010
179views more  JAPLL 2010»
13 years 6 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
FCSC
2011
413views VLSI» more  FCSC 2011»
12 years 11 months ago
Type-2 fuzzy description logic
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...
Ruixuan Li, Kunmei Wen, Xiwu Gu, Yuhua Li, Xiaolin...
AAAI
2007
13 years 10 months ago
Complexity Boundaries for Horn Description Logics
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
Markus Krötzsch, Sebastian Rudolph, Pascal Hi...
DLOG
2007
13 years 10 months ago
Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
Vitaliy L. Khizder, David Toman, Grant E. Weddell