Building a knowledge base: an example

  • Authors:

  • Michael Gelfond;Alfredo Gabaldon

  • Affiliations:

  • Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA E-mail: mgelfond@cs.utep.edu;Department of Computer Science, University of Toronto, Toronto, Canada M5S 3G4 E-mail: alfredo@cs.toronto.edu

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The main goal of this paper is to illustrate applications of some recent developments in the theory of logic programming to knowledge representation and reasoning in common sense domains. We are especially interested in better understanding the process of development of such representations together with their specifications. We build on the previous work of Gelfond and Przymusinska in which the authors suggest that, at least in some cases, a formal specification of the domain can be obtained from specifications of its parts by applying certain operators on specifications called specification constructors and that a better understanding of these operators can substantially facilitate the programming process by providing the programmer with a useful heuristic guidance. We discuss some of these specification constructors and their realization theorems which allow us to transform specifications built by applying these constructors to declarative logic programs. Proofs of two such theorems, previously announced in a paper by Gelfond and Gabaldon, appear here for the first time. The method of specifying knowledge representation problems via specification constructors and of using these specifications for the development of their logic programming representations is illustrated by design of a simple, but fairly powerful program representing simple hierarchical domains.