TY - GEN
T1 - Knowledge base reuse through constraint relaxation
AU - Nordlander, Tomas Eric
AU - Sleeman, Derek
AU - Brown, Ken N.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
KW - Constraint satisfaction problem
KW - Knowledge base reuse
KW - Relaxation techniques
KW - Scheduling
UR - https://www.scopus.com/pages/publications/77952394104
U2 - 10.1145/1088622.1088634
DO - 10.1145/1088622.1088634
M3 - Conference proceeding
AN - SCOPUS:77952394104
SN - 1595931635
SN - 9781595931634
T3 - Proceedings of the 3rd International Conference on Knowledge Capture, K-CAP'05
SP - 59
EP - 66
BT - Proceedings of the 3rd International Conference on Knowledge Capture, K-CAP'05
T2 - 3rd International Conference on Knowledge Capture, K-CAP'05
Y2 - 2 October 2005 through 5 October 2005
ER -