Abstract
Constraint satisfaction and search problems generally fall into the class of problems for which a direct algorithmic solution does not exist. The solution of these problems requires the examination of state spaces. A problem solver (inference engine) alone is not able to organize and maintain state space consistently. For this purpose a so‐called truth maintenance system is required. Our truth maintenance system (MEKON) organizes data within a data abstraction called a context. Each context corresponds to one problem state and contains currently believed data. The truth maintenance system provides believed data retrieval, belief revision, contradiction handling and non‐monotonicity handling, the features that help a problem solver to examine state spaces. MEKON represents an ATMS‐like system implemented within BEST (Blackboard‐based Expert System Toolkit). However, some special MEKON features such as state variables, context sensitive generation of assumptions and explicit context generation, that are not present in standard ATMSs, facilitate not only the solution of constraint satisfaction problems, but also the solution of search problems (not provided by standard ATMSs). Being deeply integrated with Prolog/Rex, BEST’s knowledge representation language, and BEST’s inference engine, MEKON provides a simple and efficient means for the examination of state spaces. Facts, hypotheses (assumptions), and concepts (frames) are used to describe a problem state, contexts are used to represent points in the state spaces, while rules are used to perform state transitions. MEKON is the only truth maintenacne system that provides truth maintenance capabilities on local blackboards thus enabling the solution of complex problems which include different kinds of real constraint satisfaction and search problems concerning diagnosis, allocation tasks, classification tasks, planning or scenario making.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have