91 search results - page 7 / 19 » The Complexity of Reasoning for Fragments of Default Logic |
105
click to vote
JAR
2007
14 years 9 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 2 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...
ECAI
1998
Springer
15 years 1 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
71
Voted
LPAR
2007
Springer
15 years 3 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...
59
Voted
CSL
2001
Springer
15 years 2 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 ...