Abstract
In this paper the problems of design of complete knowledge-based control systems are considered. The main goal of this paper is to present logical bases for a methodology for systematic design of rule-based control systems capable of control for a prespecified set of input situations. Such systems are complete with respect to the prespecified control area. A definition of generalized backward dual resolvent - a basic logical tool for completeness verification - is given and a definition of completeness is presented. An idea of a special semantic tree for representing various branching possibilities for formulae being components of rule preconditions is proposed. Such a tree constitute a basic scheme guiding the design of rule preconditions. A definition and criteria for such a tree to be complete are proposed. The criteria assure completeness of the designed set of rules. Further, an approach to design complete rule-based systems with use of such a tree as a basic design supporting tool is outlined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
