Clause counter map inference engine

US5230061A · kind A · utility

Assignee

• THE UNIVERSITY OF AKRON · US

Inventor

• John T. Welch · Akron, US

Key dates

• Filing date: Jan 2, 1992
• Grant date: Jul 20, 1993
• Expiry date: Jan 2, 2012

Classification

• Technology area (CPC Y): Emerging Cross-Sectional Technologies
• CPC primary: Y10S706/906
• WIPO field: Control
• WIPO sector: Instruments

Abstract

The invention describes a clause counter map inference engine which is an interpreter method based upon the Boolean form, in which Boolean inference is directly assisted by a programmable data structure. The system provides a translation of a series of Boolean logic functions into a compact map representation, which may then be used for Boolean inference by means of an interpreter algorithm or inference engine adapted to update function values based upon any changed input value. The invention provides a rule-based model for logical control systems having an imbeddable, event-chaining inference engine which is independent of the rule-based model. The time to complete a scan cycle of the system depends directly upon the number of inferences in an up-date interval between input and output variable changes, and the lengths of inference chains of events in the logic. The clause counter map inference engine generally provides a method of implementing logical functions where inferencing is at an optimum, thereby reducing inference processing time and providing a system which may take the place of other on-line control methods for implementation of a PLC, and also may be applied to expert …