Open AccessProceedings Article
D-SCRIPT: a computational theory of descriptions
Robert C. Moore
- pp 223-229
Reads0
Chats0
TLDR
D-Script contains a powerful formalism for descriptions, which permits the representation of statements that are problematical for other systems, including opaque contexts, time contexts, and knowledge about knowledge.Abstract:
This paper describes D-Script, a language for representing knowledge in artificial intelligence (AI) programs. D-Script contains a powerful formalism for descriptions, which permits the representation of statements that are problematical for other systems. Particular attention is paid to problems of opaque contexts, time contexts, and knowledge about knowledge. The design of a deductive system for this language is also considered.read more
Citations
More filters
Book ChapterDOI
Reasoning about knowledge and action
TL;DR: The importance of having systems that understand the concept of knowledge, and how knowledge is related to action, and a logic of knowledge based on the idea of possible worlds is presented.
Book
Readings in Artificial Intelligence
Bonnie Webber,Nils J. Nilsson +1 more
TL;DR: The selection first elaborates on representations of problems of reasoning about actions, a problem similarity approach to devising heuristics, and optimal search strategies for speech understanding control, and consistency in networks of relations, non-resolution theorem proving, using rewriting rules for connection graphs to prove theorems, and closed world data bases.
Proceedings Article
Prepositional attitudes: Fregean representation and simulative reasoning
TL;DR: A general notation that has been constructed for representing information about propositions! attitudes, and a method that is being developed for using this notation to reason about such Information, based on McCarthy's first-order theory of individual concepts and propositions.
Journal ArticleDOI
A computational model of belief
TL;DR: A logic of belief is proposed in which the expansion of beliefs beyond what has been explicitly learned is modeled as a finite computational process and it is shown that as long as the mechanism meets a particular set of constraints, the resulting logic has certain desirable properties.
Proceedings Article
Extending the expressive power of semantic network
TL;DR: In this paper, the use of logical connectives, quantifiers, descriptions, and certain other constructions in semantic networks is discussed. But, the proposed solutions to these problems are in the form of extensions to a more or less conventorial network rotation.
References
More filters
Book
Programs with common sense
TL;DR: This paper discusses programs to manipulate in a suitable formal language (most likely a part of the predicate calculus) common instrumental statements, where the basic program will draw immediate conclusions from a list of premises.
Book
Procedures as a representation for data in a computer program for understanding natural language
TL;DR: A system for the computer understanding of English that combines a complete syntactic analysis of each sentence with a 'heuristic understander' which uses different kinds of information about a sentence, other parts of the discourse, and general information about the world in deciding what the sentence means.
Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot
TL;DR: PANNER is a formalism for proving theorems and manipulating models in a robot built out of a number of problem-solving primitives together with a hierarchical multiprocess backtrack control structure.
Proceedings ArticleDOI
From PLANNER to CONNIVER: a genetic approach
TL;DR: To be good, a higher level language must not only simplify the job of programming, by providing features which package programming structures commonly found in the domain for which the language was designed, it must also do its best to discourage the use of structures which lead to bad algorithms.
Journal ArticleDOI
Formal methods in the design of question-answering systems
TL;DR: This paper argues that predicate calculus has significant advantages above competing deep structures if the way of using it is carefully selected, and gives hints on how various natural-language constructions can be encoded in a consistent way.