Constraint Relaxation Techniques to Aid the Reuse of Knowledge Bases and Problem Solvers
Nordlander, Tomas and Brown, Ken and Sleeman, Derek (2003) Constraint Relaxation Techniques to Aid the Reuse of Knowledge Bases and Problem Solvers. Twenty-third SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, pp. 323-335, Cambridge.
Full text available as:
|PDF - Requires Adobe Acrobat Reader or other PDF viewer.|
Effective re-use of knowledge bases requires the identification of plausible combinations of both problem solvers and knowledge bases, which can be an expensive task. Can we identify impossible combinations quickly? The capabilities of combinations can be represented using constraints, and we propose using constraint relaxation to help eliminate impossible combinations. If a relaxed constraint representation of a combination is inconsistent then we know that the original combination is inconsistent as well. We examine different relaxation strategies based on constraint graph properties, and we show that removing constraints of low tightness is an efficient strategy which is also simple to implement.
|Subjects:||AKT Challenges > Knowledge reuse|
|Deposited By:||Ajit, Suraj|
|Deposited On:||17 June 2004|
Contact the site administrator at: firstname.lastname@example.org