1086 search results - page 4 / 218 » Knowledge-based part correspondence |
108
click to vote
WLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The maintenance of large knowledge systems usually is a rather complex task. In this paper we will show that extensions or modifications of a knowledge base can be suppo...
ACG
2009
Springer
15 years 1 months ago
2009
Springer
Endgame heuristics are often incorperated as part of the evaluation function used in Chinese chess programs. In our program, Contemplation, we have proposed an automatic strategy t...
91
Voted
KES
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
IJCAI
1993
14 years 11 months ago
1993
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
AI
2003
Springer
15 years 2 months ago
2003
Springer
This paper introduces a formal theory for describing actions in terminological knowledge bases, closely related to description logics. It deals in particular with the problem of ad...