CLASP: Integrating Term Subsumption Systems and Production Systems

IEEE Transactions on Knowledge and Data Engineering

Volumn 3, Issue 1, 1991, Pages 25-32

  Yen, John ^a   Neches, Robert ^b   MacGregor, Robert ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

CLASP PRODUCTION SYSTEM; PATTERN CLASSIFICATION; PATTERN MATCHING; PRODUCTION SYSTEMS; RULE BASED SYSTEMS; TERM SUBSUMPTION SYSTEMS;

EXPERT SYSTEMS;

EID: 0026119261     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.75885     Document Type: Article

References (26)

1. R. M. Gregor and R. Bates, “The loom knowledge representation language,” Tech. Rep. ISI/RS-87-188, USC/Information Sciences Institute, 1987.
2. P.F. Patel-Schneider, B. Owsnicki-Klewe, A. Kobsa, N. Guarino, R. MacGregor, W. S. Mark, D. McGuinness, B. Nebel, A. Schmiedel, and J. Yen, “Term subsumption languages in knowledge representation,” AI Mag., vol. 11, pp. 16–23, 1990.
3. R. Brachman and J. Schmolze, “An overview of the kl-one knowledge representation system,” Cognitive Sci., pp. 171–216, Aug. 1985.
4. W.A. Woods, “What’s in a link: Foundations for semantic networks,” in Representation and Understanding: Studies in Cognitive Science, D. Bobrow and A. Collins, Eds. New York: Academic, 1975.
5. R. J. Brachman, “What is-a is and isn’t: An analysis of taxonomic links in semantic networks,” IEEE Comput. Mag., vol. 16, no. 10, pp. 30–36, Oct. 1983.
6. R. M. MacGregor, “A deductive pattern matcher,” in Proc. AAAI-88, 1988.
7. J. Schmolze and T. Lipkis, “Classification in the kl-one knowledge representation system,” in Proc. Eight Int. Joint Conf. Artif Intell, IJCAI, 1983
8. W. Swartout, “Xplain: A system for creating and explaining expert consulting systems,” Artif. Intell., vol. 21, no. 3, pp. 285–325, Sept. 1983.
9. R. Neches, W. Swartout, and J. Moore, “Enhanced maintenance and explanation of expert systems through explicit models of their development,” IEEE Trans. Software Eng., vol. SE-11, no. 11, pp. 1337–1351, Nov. 1985.
10. W. Clancey, “The epistemology of a rule-based expert system: A framework for explanation,” Artif. Intell., vol. 20, no. 3, pp. 215–251, May 1983.
11. J. S. Aikins, “Prototypes and production rules: A knowledge representation for computer consultations,” Tech. Rep. STAN-CS-80-814, Dep. Comput. Sci., Stanford Univ., 1980.
12. W. Swartout and R. Neches, “The shifting terminological space: An impediment to evolvability,” in AAAI-86, Proc. Nat. Conf. Artif. Intell., AAAI, Philadelphia, PA, Aug. 1986.
13. R. Fikes and T. Kehler, “The role of frame-based representation in reasoning,” Commun. ACM, vol. 28, no. 9, Sept. 1985.
14. M. Vilain, “Kl-two, a hybrid knowledge representation system,” Tech. Rep. 5694. Cambridge, MA: Bolt, Beranak, and Newman, Sept. 1984.
15. W. Mark, “Rule-based inference in large knowledge bases,” in Proc. Nat. Conf. Artif. Intell., AAAI, Aug. 1980.
16. —, “Representation and inference in the consul system,” in Proc. Seventh Int. Joint Conf. Artif. Intell., IJCAI. Los Altos, CA: Morgan Kaufman, 1981, pp. 375–381.
17. A. Kobsa, “The sb-one knowledge representation workbench,” in Proc. Workshop Formal Aspects Semantic Networks, Feb. 1989.
18. M. Moser, “An overview of nikl, the new implementation of kl-one,” in Research in Natural Language Understanding. Cambridge, MA: Bolt, Beranek, and Newman, 1983.
19. T. Daly, J. Kastner, and E. Mays, “Integrating rules and inheritance networks in a knowledge based financial marketing consultation system,” in Proc. Hawaii Int. Conf Syst. Sci., Jan. 1988.
20. C. L. Forgy, “Rete: A fast algorithm for the many pattern/many object pattern match problem,” Artif. Intell, vol. 19, pp. 17–37, 1982.
21. J. Yen, “A principled approach to reasoning about the specificity of rules,” in Proc. Nat. Conf Artif. Intell., Boston, MA, Aug. 1990, pp. 701–707.
22. J. McDermott and C. Forgy, “Production system conflict resolution strategies,” in Pattern-Directed Inference Systems, D. A. Waterman and F. Hayes-Roth, Eds. New York: Academic, 1978.
23. J. Yen, “Reasoning about the specificity of patterns in term subsumption-based systems,” Tech. Rep. TAMU 90–003, Dep. Comput. Sci., Texas A&M Univ., Feb. 1990.
24. R. J. Brachman and H. J. Levesque, “The tractability of subsumption in frame-based description languages,” in Proc. AAAI-84, Austin, TX, Aug. 1984, pp. 34–37.
25. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
26. B. Nebel, “Terminological reasoning is inherently intractable,” Tech. Rep. IWBS Rep. 82, IWBS, IBM Deutschland, W. Germany, Oct. 1989.