Patent
1994-01-21
1997-01-21
Downs, Robert W.
G06F 1518
Patent
active
055966829
ABSTRACT:
A method of automated theorem proving for information processing which can be highly efficient, irrespective of the set of clauses to be dealt with. The method includes the steps of: transforming the statement and the set of knowledge into expressions in terms of elements of a module; constructing a linear equation with the elements of the module as coefficients and the elements of a ring of scalars of the module as unknowns; checking the existence of a non-negative solution to the linear equation; and determining that the statement is provable when the non-negative solution exist, and not provable otherwise.
REFERENCES:
C. Lund et al., "Algebraic Methods for Interactive Proof Systems," 1990 31st Annual Symp. Foundations of Computer Science, Oct. 1990, 2-10.
R. Waldinger and M. Stickel, "Proving Properties of Rule-Based Systems," 1991 Conf. Artificial Intell. Appl., Feb. 1991, 81-88.
A. Sattar and R. Goebel, "Meta-reasoning: An Incremental Compilation Approach," 1991 7th Int'l. Conf. Data Engineering, Apr. 1991, 140-149.
Decision Analysis: A Progress Report; Kassirer; Annals of Internal Medicine; 1987; 106:275-291.
Expert Systems Technology: A Guide; Johnson; 1985; Abalus Press; Chapter 1; pp. 1-15.
Downs Robert W.
Kabushiki Kaisha Toshiba
LandOfFree
Method and apparatus of automated theorem proving for informatio does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus of automated theorem proving for informatio, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus of automated theorem proving for informatio will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2331208