Affiliation:
1. The University of Sussex, Brighton, England
Abstract
The goal of this investigation is to design and analyze efficient inference methods that arise when a representation language is augmented with restricted quantification and a taxonomic representation. These inference methods will be demonstrated by integrating them into the design of a logic-programming system and a knowledge retriever.
Publisher
Association for Computing Machinery (ACM)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An introduction to constraint logic programming;Advanced Topics in Artificial Intelligence;1992
2. Many-sorted inferences in automated theorem proving;Lecture Notes in Computer Science;1990
3. Many-sorted unification;Journal of the ACM;1988-01
4. Taxonomical Reasoning in Logic Programming;3. Österreichische Artificial-Intelligence-Tagung;1987
5. Inheritance hierarchy mechanism in prolog;Logic Programming '86;1987