2214 search results - page 13 / 443 » Complexity of Reasoning |
105
Voted
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...
103
click to vote
DLOG
2009
14 years 7 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...
71
Voted
CADE
1992
Springer
15 years 1 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
104
Voted
ESSLLI
2009
Springer
14 years 7 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
CI
1998
14 years 9 months ago
1998
A rational agent (artificial or otherwise) residing in a complex changing environment must gather information perceptually, update that information as the world changes, and combi...