Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas knowledge-poor domains contain implicit knowledge. Logical methods are more suitable for the first type. Neural networks and case-based reasoning (CBR) are more suitable for the second type. This project combines the inferencing power of epistemic logic (type 1) in the adaptation phase of CBR with the performance of case-based planning (type 2). This method is proved to be more efficient then using planning algorithms alone. Planning algorithms are computationally expensive. CBR, using a nearest neighbor algorithm (KNN) is used to make the process faster. A STRIPS planner creates plans for the case-base of a robot that delivers parts in a factory. The manager defines the problem, KNN extracts a plan and a logic sub-system adapts it according to belief revision theorems to resolve the plan inconsistencies.
[1]
W. van der Hoek,et al.
Epistemic logic for AI and computer science
,
1995,
Cambridge tracts in theoretical computer science.
[2]
Peter Norvig,et al.
Artificial Intelligence: A Modern Approach
,
1995
.
[3]
Agnar Aamodt,et al.
Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches
,
1994,
AI Commun..
[4]
Frédéric Cuppens.
An Epistemic and Deontic Logic for Reasoning about Computer Security
,
1990,
ESORICS.
[5]
N. Nilsson.
STUART RUSSELL AND PETER NORVIG, ARTIFICIAL INTELLIGENCE: A MODERN APPROACH
,
1996
.
[6]
Agnar Aamodt,et al.
CASE-BASED REASONING: FOUNDATIONAL ISSUES, METHODOLOGICAL VARIATIONS, AND SYSTEM APPROACHES AICOM - ARTIFICIAL INTELLIGENCE COMMUNICATIONS
,
1994
.