Elementary formal system as a logic programming language

  • Akihiro Yamamoto
Logic Programming Language

DOI: 10.1007/3-540-53919-0_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 485)
Cite this paper as:
Yamamoto A. (1991) Elementary formal system as a logic programming language. In: Furukawa K., Tanaka H., Fujisaki T. (eds) Logic Programming '89. LP 1989. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 485. Springer, Berlin, Heidelberg

Abstract

In this paper, we give a theoretical foundation of EFS (elementary formal system) as a logic programming language. We show that the set of all the unifiers of two atoms is finite and computable by restricting the form of axioms and goals without losing generality. The restriction makes the negation as failure rule complete. We give two conditions of EFS's such that the negation as failure rule is identical to the closed world assumption. We also give a subclass of EFS's where a procedure of CWA is given as bounding the length of derivations We compare these classes with the Chomsky hierarchy.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Akihiro Yamamoto
    • 1
  1. 1.Department of Information SystemsKyushu University 39KasugaJapan
  2. 2.Research Institute of Fundamental Information ScienceKyushu University 33FukuokaJapan

Personalised recommendations