Muskrat-II The MUSKRAT (Multistrategy Knowledge Refinement and Acquisition Toolbox) framework aims to unify problem solving, knowledge acquisition and machine learning in a single computational framework [1](WHITE, SLEEMAN, 1998). Given a set of Knowledge Bases (KBs) and Problem Solvers (PSs), the system will try to identify which KBs could be combined with which PSs to solve a given task. References 1. http://www.csd.abdn.ac.uk/~sleeman/Abstracts98.html#abs111 Towards a Solution In this research, KBs with certain PSs will be represented as Constraint Satisfaction Problems (CSPs). By systematically relaxing each CSP by removing specific constraints we will produce a series of Cheaper Meta PSs ([1]see Figure 1). The idea is that instead of solving all the CSPs we only need to solve those that have a solution when relaxed. This approach would be beneficial if it saves time in identifying re-usable PS. To determine the best means to relax the CSPs we have proposed building a Case-library, which will suggest dropping specific constraints that correspond to the highest search effort [2](Nordlander, 2002). [3][muskrat.png] Figure 1: The process of creating the Cheaper Meta Problem Solvers Take a Guided Tour This Movie clip[4](AVI, 27.3 MB), [5](Flash, MB), [6](MOV, 88.7MB) shows a how the Cheaper Meta PSs are produced, solved and compared against the original CSP. Try a Demonstration Version 1.90 [7](ZIP, 19 KB), including full online documentation, downloadable. For installation instructions email [8]Tomas Eric Nordlander. Technical requirements: SICStus Prolog LINUX, UNIX or any Windows version. Further Reading Publication regarding MUSKRAT, [9]A Constraint-Based Approach to the Description & Detection of Fitness-for-Purpose., and [10]Exploration on Relaxation Strategies in Random Binary Constraint Satisfaction Problems together with other relevant documents can be accessed: [11]http://www.csd.abdn.ac.uk/~tnordlan/Publications.htm (Tomas Eric Nordlander) [12]http://www.csd.abdn.ac.uk/~sleeman/dhs-publications.html (Derek Sleeman) References 1. file://localhost/home/www.aktors/htdocs/dynamic-technology-pages/muskrat-II/details.html#_Figure_1:_The_process of creating t 2. http://www.csd.abdn.ac.uk/~tnordlan/Publications.htm 3. file://localhost/home/www.aktors/htdocs/dynamic-technology-pages/muskrat-II/muskrat.png 4. http://www.csd.abdn.ac.uk/~tnordlan/PhD_Timetable/Programs/CSPs Suite/CSP-Suite_Ver1.90.avi 5. http://www.csd.abdn.ac.uk/~tnordlan/PhD_Timetable/Programs/CSPs Suite/CSP-Suite_Ver1.90 6. http://www.csd.abdn.ac.uk/~tnordlan/PhD_Timetable/Programs/CSPs Suite/CSP-Suite_Ver1.90.mov 7. http://www.csd.abdn.ac.uk/~tnordlan/PhD_Timetable/Programs/CSPs Suite/CSP-Suite.zip 8. mailto:tnordlan@csd.abdn.ac.uk 9. http://www.csd.abdn.ac.uk/~sleeman/published-papers/p128-etai-final.pdf 10. http://www.csd.abdn.ac.uk/~tnordlan/PhD_Timetable/Programs/CSPs Suite/Exploring Relaxing Strategies on Random Binary Constraint Satisfaction Problems Version 3.6.doc 11. http://www.csd.abdn.ac.uk/~tnordlan/Publications.htm 12. http://www.csd.abdn.ac.uk/~sleeman/dhs-publications.html