14 search results - page 3 / 3 » On the Complexity of Axiom Pinpointing in the EL Family of D... |
JAPLL
2010
13 years 3 months ago
2010
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 ...
IJCAI
2003
13 years 6 months ago
2003
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
KR
2010
Springer
13 years 10 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
WWW
2011
ACM
13 years 5 days ago
2011
ACM
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...