Access Restriction

Author VanderBrug, Gordon J. ♦ Minker, Jack
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Problem-reduction representation ♦ Theorem proving ♦ Artificial intelligence ♦ State-space representation ♦ Language recognition
Abstract This paper suggests a bidirectional relationship between state-space and problem-reduction representations. It presents a formalism based on multiple-input and multiple-output operators which provides a basis for viewing the two types of representations in this manner. A representation of the language recognition problem which is based on the Cocke parsing algorithm is used as an illustration. A method for representing problems in first-order logic in such a way that the inference system employed by a resolution-based theorem prover determines whether the set of clauses is interpreted in the state-space mode or in the problem-reduction mode is presented. The analogous concepts in problem-reduction and theorem proving, and the terminology used to refer to them, are noted. The relationship between problem-reduction, input resolution, and linear resolution is is discussed.
Description Affiliation: Univ. of Maryland, College Park (VanderBrug, Gordon J.; Minker, Jack)
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 18
Issue Number 2
Page Count 13
Starting Page 107
Ending Page 119

Open content in new tab

   Open content in new tab
Source: ACM Digital Library