Boots – shoes – and leggings
Patent
1988-10-19
1995-08-01
Huntley, David M.
Boots, shoes, and leggings
395 10, 395 60, G06F 1720
Patent
active
054385113
ABSTRACT:
Unification of a disjunctive system is performed based on context identifiers within data structures that correspond to disjunctions. Each context identifier is a logical combination of choices, with each choice identifying one of the disjuncts of a disjunction in the system. Each choice can include a disjunction identifier and a choice identifier identifying one of the disjuncts of the identified disjunction. The logical combination of choices in a context identifier thus corresponds to a combination of disjuncts, all of which could be from different disjunctions. If two data units have context identifiers identifying contexts that are genuine alternatives, those data units are not unified. Data units that have context identifiers that are not genuine alternatives are unified. A set of context-value pairs, referred to as a disjunctive value, can be unified with another disjunctive value by considering all combinations of pairs of context identifiers that include one context identifier from each disjunctive value. The number of combinations of context identifiers in each disjunctive value is reduced by combining context-value pairs: Pairs with equal value tokens are combined by merging their context identifiers and unifying the value tokens. Pairs with f-structures as values are combined by merging context identifiers and unifying the f-structures. If it is necessary to insert a pointer, the pointer is inserted so that it initially leads to a disjunctive value, with the source of the pointer indicating which of the context-value pairs in the disjunctive value is to be accessed.
REFERENCES:
patent: 4803642 (1988-02-01), Muranaga
patent: 4868745 (1989-09-01), Pathoa et al.
patent: 4918621 (1990-04-01), Nado et al.
patent: 5047918 (1991-09-01), Schwartz
patent: 5083268 (1992-01-01), Hemphill et al.
patent: 5088048 (1992-02-01), Dixon et al.
Shieber, "An Introduction to Unification-Based Approaches to Grammar", 1986, Published by Leland Stanford Jr. Univ., pp. 1-105.
Discrete Mathematics in Computer Science, Stanat et al., 1977, Prentice-Hall Inc., N.J.
Kattunen, L., "Features and Values," Proceedings of the Tenth International Conference on Computational Linguistics, Stanford University, Stanford, Calif., Jul. 2-7, 1984, pp. 28-33.
Kasper, R. T. and Rounds, W. C., "A Logical Semantics for Feature Structures," Proceedings of the 24th Annual Meeting of the ACL, Columbia University, New York, N.Y., 1986, pp. 257-266.
Kasper, R. T., "A Unification Method for Disjunctive Feature Descriptions," Proceedings of the 25th Annual Meeting of the ACL, Stanford University, Stanford, Calif., 1987, pp. 235-242.
Kasper, R. T., "Feature Structures: A Logical Theory with Application to Language Analysis," PhD Dissertation, University of Michigan, 1987, pp. 80-111.
Bear, J., "Feature-Value Unification with Disjunctions," SRI International, 1987.
Kaplan, R. M. and Bresnan, J., "Lexical-Functional Grammar: A Formal System for Grammatical Representation," in Bresnan, J., (Ed.), The Mental Representation of Grammatical Relations, MIT Press, Cambridge, Mass., 1982, pp. 173-281.
De Kleer, J., "Extending the ATMS," Artifical Intelligence, vol. 28, (1986), pp. 163-196.
jMackworth, A., "Constraint Satisfaction," in Shapiro, S. C. and Eckroth, D., eds., Encyclopedia of Artifical Intelligence, New York: Wiley, 1987, pp. 205-211.
Eisele, A. and Dorre, J., "Unification of Disjunctive Feature Description," Proceedings of the 26th Annual Meeting of the ACL, Buffalo, N.Y., 1988, pp. 286-2945.
Johnson, M., "Determining Satisfiability of Quantifier-Free Formulae without Expansion to DNF," unpublished manuscript of Jun. 6, 1988.
European Search Report for Application No. EP 89 31 0723.
Vadera, S. "A theory of unification" Software Engineering Journal, vol. 3, No. 5, Sep. 1988, pp. 149-160.
Conery, J. S. and Kibler, D. F., "Parallel Interpretation of Logic Programs," ACM Proceedings of 1981 Conference on Functional Programming Languages and Computer Architecture, Oct. 1981, New York, pp. 163-170.
Hillis, W. D. and Steele, Jr., G. L., "Data Parallel Algorithms," Communications of the ACM, vol. 29, No. 12, Dec. 1986, pp. 1170-1183.
Ke, G. Y., Li, D. X., Guo, F. J., Xing, W. D., and Min, Z. W., "Design Considerations of a Distributed Parallel Reduction Architecture," IEEE Second International Conference on Computers and Applications, Jun. 1987, Peking, China, pp. 809-816.
Kaplan Ronald M.
Maxwell, III John T.
Huntley David M.
Xerox Corporation
LandOfFree
Disjunctive unification does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Disjunctive unification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Disjunctive unification will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-737724