DURAL: an extended Prolog language

  • Shigeki Goto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 147)


This paper proposes a new programming language DURAL which is an extension of the Prolog language. DURAL takes advantage of modal logic to classify clauses. The main features of DURAL are the following:
  1. 1)

    Modal symbols are introduced to discriminate between clauses.

  2. 2)

    The relative Horn clause represents the clause containing executable predicates.

  3. 3)

    The unit resolution as well as input resolution is adopted to facilitate debugging.


Key words & Phrases

DURAL extensional database intensional database modal logic predicate calculus program synthesis programming language Prolog query language relative Horn clause resolution principle 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A.Colmerauer, H.Kanoui, R.Pasero & P.Roussel, Un systeme de Communication Homme-machine en Francais, Rapport de recherche, Groupe d'Intelligence Artificielle, UER de Luminy, Universite d'Aix Marseille, 1973.Google Scholar
  2. [2]
    G.Battani & H.Meloni, Interpreteur du langage de programmation PROLOG, Rapport de DEA, Groupe d'informatique appliquee, Groupe d'intelligence Artificielle, UER de Luminy, Universite d'Aix-Marseille, 1973.Google Scholar
  3. [3]
    L.M.Pereira, F.C.N.Pereira & D.H.D.Warren, User's Guide to DEC System-10 PROLOG, Department of Artificial Intelligence, University of Edinburgh, 1978.Google Scholar
  4. [4]
    M.H. van Emden, Programming with resolution logic, Machine Intelligence 8, pp.266–299, 1977.Google Scholar
  5. [5]
    C-L.Chang and R.C-T.Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.Google Scholar
  6. [6]
    G.E.Hughes & M.J.Cresswell, An Introduction to Modal Logic, Methuen and Co., 1968.Google Scholar
  7. [7]
    K.Fuchi, Predicate Logic Programming — A Proposal of EPILOG, SM-1-2, Information Processing Society of Japan, 1977.Google Scholar
  8. [8]
    I.Futo, F.Darvas and P.Szeredi, The Application of PROLOG to the Development of QA and DBM Systems, in LOGIC and DATABASES, pp.347–376, Plenum Press, 1978.Google Scholar
  9. [9]
    D.W.Loveland, Automated Theorem Proving: A logical Basis, North-Holland, 1978.Google Scholar
  10. [10]
    Z. Manna and R.J. Waldinger, Toward Automatic Program Synthesis, Comm. ACM, vol.14, no.3, pp.151–165, 1971.Google Scholar
  11. [11]
    S.Goto, Program Synthesis from Natural Deduction Proofs, IJCAI-79, pp.339–341.Google Scholar
  12. [12]
    M.Sato, Towards a Mathematical Theory of Program Synthesis, IJCAI-79, pp.757–762.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Shigeki Goto
    • 1
  1. 1.Yokosuka Electrical Communication LaboratoryNippon Telegraph and Telephone Public CorporationYokosuka-shi KanagawaJapan

Personalised recommendations