74 search results - page 5 / 15 » The Complexity of Reasoning for Fragments of Autoepistemic L... |
117
click to vote
JAR
2007
14 years 11 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
KR
2010
Springer
15 years 4 months ago
2010
Springer
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
121
click to vote
DLOG
2009
14 years 9 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
74
Voted
CSL
2001
Springer
15 years 4 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...