Sciweavers

88 search results - page 7 / 18
» A Completeness Result for Reasoning with Incomplete First-Or...
Sort
View
IEEECIT
2006
IEEE
14 years 22 days ago
A Service Retrieval Model with Enhanced Dominance-Based Rough Sets
As an important part of service-oriented software engineering, service retrieval receives much attention from industry and academia, but which still leaves much to be expected: ho...
Bin Tang, Leqiu Qian, Ruzhi Xu, Yunjiao Xue, Hui T...
DLOG
2007
13 years 9 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
JAR
2007
142views more  JAR 2007»
13 years 6 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
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...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
AAAI
2000
13 years 8 months ago
Dynamic Case Creation and Expansion for Analogical Reasoning
Most CBR systems rely on a fixed library of cases, where each case consists of a set of facts specified in advance. This paper describes techniques for dynamically extracting case...
Thomas Mostek, Kenneth D. Forbus, Cara Meverden
DALT
2005
Springer
14 years 7 days ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki