Logic and semantic networks

ABSTRACT

An extended form of semantic network is defined, which can be regarded as a syntactic variant of the clausal form of logic. By virtue of its relationship with logic, the extended semantic network is provided with a precise semantics, inference rules, and a procedural interpretation. On the other hand, by regarding semantic networks as an abstract data structure for the representation of clauses, we provide a theorem-prover with a potentially useful indexing scheme and path-following strategy for guiding the search for a proof.

REFERENCES

• 1: Boyer, R.S., and Moore JS. The sharing of structure in theoremproving programs. In Machine Intelligence 7, B. Meltzer and D. Michie, Eds., Edinburgh University Press, 1972, pp. 101-16.
• 2: Deliyanni, A.J. A comparative study of semantic networks and predicate logic. M. Sc. Th., Dept. of Comptg. and Control, Imperial College, University of London, Sept. 1976.
• 3: Fikes, R.E., and Hendrix, G.G. A network-based knowledge representation and its natural deduction system. Proc. Fifth Int. Joint Conf. Artif. Intel., M.I.T., 1977, pp. 235-246.
• 4: Hayes, P.J. Computation and deduction. Proc. 2nd MFCS Symp., Czechoslovak Acad. Sciences, 1973, pp. 105-I 18.
• 5: Hendrix, G.G. Expanding the utility of semantic networks through partitioning. Proc. Fourth Int. Joint Conf. Artif. Intel., Tiblisi, Georgia, 1975, pp. 115-121.
• 6: Kowalski, R.A. Predicate logic as programming language. Information Processing 74, North Holland Pub. Co., Amsterdam, 1974, pp. 569-574.
• 7: Kowalski, R.A. Algorithm = logic + control. Res. Rep. 77/3, Dept. of Comptg. and Control, Imperial College, University of London, Nov. 1976; to appear in Comm. ACM.
• 8: D. W. Loveland, A Unifying View of Some Linear Herbrand Procedures, Journal of the ACM (JACM), v.19 n.2, p.366-384, April 1972 [doi>10.1145/321694.321706]
• 9: Luckham, D. Refinement theorems in resolution theory. Proc. IRIA Symp. on Automatic Demonstration, Versailles, France, 1970, pp. 162-90 (available from Springer-Verlag).
• 10: McSkim!n, J.R., and Minker, J. A predicate calculus based semantic network for question-answering systems. Tech. Rep. TR- 509, Dept. Cornptr. Sci., U. of Maryland, March 1977.
• 11: Mylopoulos, J., Cohen, P., Borgida, A., and Sugar, L. Semantic networks and the generation of context. Proc. Fourth Int. Joint Conf. Artif. Intel., Tiblisi, Georgia, 1975, pp. 134-142.
• 12: J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
• 13: Robinson, J.A. Automatic deduction with hyper-re,;olution. lnternat. .I. Comput. Math. 1, 1965, 227-34.
• 14: Robinson, J.A. Computational logic: The unification computation. In Machine Intelligence 6, B. Meltzer and D. Michie, Eds., Edinburgh University Press, 1971, pp. 63-72.
• 15: Schubert, L.K. Extending the expressive power of semantic networks. Proc. Fourth Int. Joint Conf. Artif. Intel., Tiblisi, Georgia, 1975, pp. 158-164.
• 16: Shapiro, S.C. A net structure for semantic information storage, deduction and retrieval. Proc. Sec. Int. Joint Conf. Artif. Intel., London, 1971, pp. 512-523.
• 17: Shapiro, S.C. Representing and locating deduction rules in a semantic network. Proc. of the Workshop on Pattern Directed Inference Systems, Sigart Newsletter (ACM), 63 (June 1977), pp. 14- 18.
• 18: Simmons, R.F., and Chester, D. Inferences on quantified semantic networks. Proc. Fifth Int. Joint Conf. Artif. Intel., M.I.T., 1977, pp. 267-273.
• 19: Woods, W.A. What's in a link. In Representation and Understanding, D. Bobrow and A. Collins, Eds., Academic Press, New York, 1975.

INDEX TERMS

Keywords:
deduction, indexing, logic, logic programming, resolution, semantic networks, theorem-proving