Knowledge Base Reuse Through Constraint Relaxation

Nordlander, Tomas E. and Sleeman, Derek and Brown, Ken N. (2005) Knowledge Base Reuse Through Constraint Relaxation. In Proceedings In the Proceedings of KCAP 05, pages pp. 59-66.

Full text available as:

PDF - Requires Adobe Acrobat Reader or other PDF viewer.

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.

Contact the site administrator at: hg@ecs.soton.ac.uk