Sciweavers

2214 search results - page 102 / 443
» Complexity of Reasoning
Sort
View
DLOG
2008
15 years 5 months ago
All Elephants are Bigger than All Mice
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
Sebastian Rudolph, Markus Krötzsch, Pascal Hi...
RSFDGRC
2005
Springer
127views Data Mining» more  RSFDGRC 2005»
15 years 8 months ago
Hierarchical Information Maps
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
Andrzej Skowron, Piotr Synak
ECAI
2004
Springer
15 years 8 months ago
Simplicity in Solving the Frame Problem
Abstract. This paper presents an approach for reasoning about action and change which appeals to the principle of Occam’s razor— roughly stating that the simplest explanations ...
Victor Jauregui, Maurice Pagnucco, Norman Y. Foo
153
Voted
AIIA
1991
Springer
15 years 6 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
109
Voted
DLOG
2007
15 years 5 months ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen