Principles of artificial intelligence
Principles of artificial intelligence
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Logic for Problem Solving
Associative Networks: The Representation and Use of Knowledge by Computers
Associative Networks: The Representation and Use of Knowledge by Computers
Knowledge Retrieval as Limited Inference
Proceedings of the 6th Conference on Automated Deduction
Language, computation, and reality
Language, computation, and reality
Mental states and mental actions in planning
Mental states and mental actions in planning
What's necessary to hide?: modeling action verbs
ACL '81 Proceedings of the 19th annual meeting on Association for Computational Linguistics
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
| Hi-index | 0.00 |
Ever since Wood's "What's in a Link" paper, there has been a growing concern for formalization in the study of knowledge representation. Several arguments have been made that frame representation languages and semantic-network languages are syntactic variants of the first-order predicate calculus (FOPC). The typical argument proceeds by showing how any given frame or network representation can be mapped to a logically isomorphic FOPC representation. For the past two years we have been studying the formalization of knowledge retrievers as well as the representation languages that they operate on. This paper presents a representation language in the notation of FOPC whose form facilitates the design of a semantic-network-like retriever.