Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theorem-proving program, thereby making it unnecessary to resolve directly upon axioms of the theory.
During the years 1971 and 1972, there has been a remarkable amount of activity and interest in automated language processing–so much so, that it is difficult to know precisely where to begin in order to convey the implications of this observation to the reader.
This article provides an overview of the issues involved in drawing conclusions by means of deductive inference from bodies of commonsense knowledge represented by logical formulas.
Over the past five years the Artificial Intelligence Center at SRI has been developing a new technology to address the problem of automated information management within real-world contexts.
This paper constitutes an investigation into the generative capabilities of two-level phonology with respect to unilevel generative phonological rules.
This report discusses a new approach to the specification of properties of multiagent environment and the generation of plans for such domains. The ideas presented elaborate previous work on a formal, behavioral model of concurrent action, called GEM (the Group Element Model).
This bibliography and topical index lists more than 200 references, almost all published since 1965, in Computer Semantics: a growing research area that lies at the boundaries of Linguistics, Psychology, and Artificial Intelligence.
