Net list generation for a rule base

• US 5,638,493 A
• Filed: 09/14/1995
• Issued: 06/10/1997
• Est. Priority Date: 02/25/1993
• Status: Expired due to Fees

• Current Assignee: Reticular Systems Incorporated
• Original Assignee: Reticular Systems Incorporated
• Inventors: Ballard, Dan
• Primary Examiner(s): Downs, Robert W.
• Application Number:
  US08/528,299
• Time in Patent Office: 635 Days
• Field of Search: 395/51, 395/76, 395/52
• US Class Current: 706/46
• CPC Class Codes: G06F 30/30 Circuit design
• CPC Class Codes: G06N 5/04 Inference or reasoning models
• CPC Class Codes: G06N 5/046 Forward inferencing; Production systems
• CPC Class Codes: G06N 5/047 Pattern matching networks; Rete networks
• CPC Class Codes: Y10S 706/916 Electronic or computer, internal or network, circuit

Abstract

The system includes a rule compiler to convert rules in a rule base into a digital logic implementation and a net list generator. The compiler comprises a rule network input section, an antecedents storage table, a consequents storage table, a translated antecedents storage table, a conjunction formation table, a disjunction formation table, and a rule network logical formation section. Patterns from the left hand side of the rules are entered into the antecedents storage table. Patterns from the right hand side of the rules are entered into the consequents storage table. Patterns in the antecedents storage table are simplified using a translation function and stored in the translated antecedents storage table. Antecedents that pertain to the same rule are combined to form a logical conjunction and are stored in the conjunction formation table. All of the terms in the consequents storage table which effect a common outcome are collected and a disjunction is formed and stored in the disjunction formation table. Terms from the conjunction formation table are inserted into their respective table and are stored in the rule network logical formation section. The output of the compiler is the results stored in the rule network logical formation section which defines a logical equation. A net list generator builds a net list from the logical equation.

Claims

1. A process for generating a net list from a rule base, comprising the steps of:

scanning the rule base comprising a plurality of rules, each rule having an antecedent and a consequent;

building a table of antecedents from the scanned rules;

building a table of conjunctives from the antecedent table;

building a table of disjunctives from the consequents;

generating logical forms from the conjunctives and disjunctives tables; and

generating a net list from the logical forms.

2. The process defined in claim 1, additionally comprising the step of translating the antecedent table for use in the building of the conjunctives table.

3. The process defined in claim 1, additionally comprising the step of formatting the net list.

4. The process defined in claim 1, additionally comprising the steps of:

designing an integrated circuit from the net list; and

fabricating the integrated circuit.

5. The process defined in claim 4, wherein the integrated circuit is a single semiconductor chip.

6. A net list generator, comprising:

a rule base comprising a plurality of rules, each rule having an antecedent and a consequent;

a table of antecedents built from the rules;

a table of conjunctives built from the antecedent table;

a table of disjunctives built from the consequents;

a set of logical forms generated from the conjunctives and disjunctives tables; and

a net list generated from the logical forms.