Knowledge base reuse through constraint relaxation

Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Constraint Satisfaction to enable more rapid identification of incompatible KBs, leaving fewer combinations on which to conduct a thorough investigation. In this paper, we describe our investigation process, its tools, and the latest empirical results applied to non-binary problems that demonstrate our relaxation approach is an effective method for plausibility testing. Categories and Subject Descriptors I.2.1 Applications and Expert Systems—Industrial automation. I.2.8 Problem Solving, Control Methods, and Search—Graph and tree search strategies. Keywords Knowledge Base Reuse, Constraint Satisfaction Problem, Relaxation Techniques, Scheduling.

• Type: Conference
• Year: 2005
• Where: KCAP
• Authors: Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Brown
• Keywords: Constraint Satisfaction, Constraint Satisfaction Problem, KCAP 2005, Knowledge Base