← Back to Patent Explorer
US5179631A Expired / Lapsed US ⏱️ 0.0 years remaining

Neural network logic system

Assignee: Louisiana State University
•
Filing: 1990-09-27
•
Granted: 1993-01-12
•
Expires: 2010-09-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A novel neural network implementation for logic systems has been developed. The neural network can determine whether a particular logic system and knowledge base are self-consistent, which can be a difficult problem for more complex systems. Through neural network hardware using parallel computation, valid solutions may be found more rapidly than could be done with previous, software-based implementations. This neural network is particularly suited for use in large, real-time problems, such as in a real-time expert system for testing the consistency of a programmable process controller, for testing the consistency of an integrated circuit design, or for testing the consistency of an "expert system." This neural network may also be used as an "inference engine," i.e., to test the validity of a particular logical expression in the context of a given logic system and knowledge base, or to search for all valid solutions, or to search for valid solutions consistent with given truth values which have been "clamped" as true or false. The neural network may be used with many different types of logic systems: those based on conventional "truth table" logic, those based on a truth maintenance system, or many other types of logic systems. The "justifications" corresponding to a particular logic system and knowledge base may be permanently hard-wired by the manufacturer, or may be supplied by the user, either reversibly or irreversibly.

Inventors

  • 👤 Suresh Guddanti
  • 👤 William P. Mounfield, Jr.

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 10:05
CPC Classifications
H; H03; H03M; H03M1/00; H03M1/12; H03M1/34; H03M1/38; H03M1/42; G; G06; G06J; G06J1/00; G06N; G06N3/00; G06N3/02; G06N3/04; G06N3/042; G06N3/06; G06N3/063

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 166 words
A circuit which comprises: (a) a plurality of logic elements, each logic element comprising: (i) a first input; (ii) a memory element; (iii) means for selectively storing the value of said first input in said memory element; (b) a plurality of OR gates, at least one of said OR gates having at least one second input and having a first output, said first output being connected to at least one of said first inputs; (c) a plurality of AND gates, at least one of said AND gates having at least one third input, and having a second output, said second output being connected to at least one of said second inputs; (d) means for selectively connecting said memory elements to said third inputs; (e) means for selectively connecting the inverses of said memory elements to said third inputs; (f) means for selecting one of said logic elements; and (g) means responsive to said selecting means for activating said selective storing means of said selected logic element.
Claim 2
Dependent Claim 166 words
A circuit which comprises: (a) a plurality of logic elements, each logic element comprising: (i) a first input; (ii) a memory element; (iii) means for selectively storing the value of said first input in said memory element; (b) a plurality of OR gates, at least one of said OR gates having at least one second input and having a first output, said first output being connected to at least one of said first inputs; (c) a plurality of AND gates, at least one of said AND gates having at least one third input, and having a second output, said second output being connected to at least one of said second inputs; (d) means for selectively connecting said memory elements to said third inputs; (e) means for selectively connecting the inverses of said memory elements to said third inputs; (f) means for selecting one of said logic elements; and (g) means responsive to said selecting means for activating said selective storing means of said selected logic element.
Claim 3
Dependent Claim 66 words
A circuit as recited in claim 1, wherein said selecting means comprises: (a) a plurality of means, one associated with each of said logic elements, for comparing whether said first input is equal to the state of said memory element; (b) means for selecting one of said logic elements for which said comparing means indicates inequality, when at least one of said comparing means indicates inequality.
Claim 4
Dependent Claim 28 words
A circuit as recited in claim 2, wherein said comparing means comprises an EXCLUSIVE OR gate having inputs connected to said memory element and to said first input.
Claim 5
Dependent Claim 19 words
A circuit as recited in claim 2, wherein at least one of said logic elements comprises a D-type flip-flop.
Claim 6
Dependent Claim 19 words
A circuit as recited in claim 2, wherein at least one of said logic elements comprises a tap-delay line.
Claim 7
Dependent Claim 21 words
A circuit as recited in claim 2, wherein each of said first inputs is connected to one of said first outputs.
Claim 8
Dependent Claim 23 words
A circuit as recited in claim 2, wherein each of said second inputs is connected to at least one of said second outputs.
Claim 9
Dependent Claim 26 words
A circuit as recited in claim 2, wherein said selective connecting means corresponds to a set of rules for a knowledge base and a logic system.
Claim 10
Dependent Claim 15 words
A circuit as recited in claim 8, wherein said logic system is conventional truth-table logic.
Claim 11
Dependent Claim 16 words
A circuit as recited in claim 8, wherein said logic system is a truth maintenance system.
Claim 12
Dependent Claim 20 words
A circuit as recited in claim 2, additionally comprising means for outputting the values of each of said memory elements.
Claim 13
Dependent Claim 20 words
A circuit as recited in claim 2, additionally comprising means for outputting the values of each of said first inputs.
Claim 14
Dependent Claim 24 words
A circuit as recited in claim 2, additionally comprising means for selectively clamping at least one of said first inputs to a desired value.

References Cited (Backward Citations)

US4751666A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-01-12 1996-07-13 1997-01-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-01-12 2000-07-13 2001-01-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-01-12 2004-07-13 2005-01-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag