Thumbnail
Access Restriction
Subscribed

Author Kowalski, Robert A. ♦ Deliyanni, Amaryllis
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Logic programming ♦ Semantic networks ♦ Deduction ♦ Theorem-proving ♦ Logic ♦ Indexing ♦ Resolution
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.
Description Affiliation: Univ. of London, London, England (Kowalski, Robert A.) || Univ. of Athens, Athens, Greece (Deliyanni, Amaryllis)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 3
Page Count 9
Starting Page 184
Ending Page 192


Open content in new tab

   Open content in new tab
Source: ACM Digital Library