Advertisement

Unsolvable decision problems for PROLOG programs

  • Egon Börger
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)

Abstract

The paper presents a general method by which various natural decision problems for programs in PROLOG and extensions of PROLOG can easily be shown to be recursively unsolvable. A particularly interesting application of this method gives an affirmative answer to Flannagan's [1985] conjecture that the floundering property for queries with respect to MU-PROLOG programs is undecidable.

Keywords

Logic Program Selection Rule Atomic Formula Deductive Database Prolog Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aquilano C. & Barbuti R. & Bocchetti P. & Martelli M. [1986]: Negation as Failure:Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions. Journal of Automated Reasoning 2,155–170.Google Scholar
  2. Barbuti R. & Martelli M. [1986]: Completeness of SLDNF-resolution for a Class of Logic Programs. Proc. 3rd Int.Conf. on Logic Programming, Springer LNCS 225, 600–614.Google Scholar
  3. Clark K.L. [1978]: Negation as Failure. Logic and Data Bases (Gallaire H. & Minker J., Eds.), Plenum Press, New York, 293–322.Google Scholar
  4. Codd E.F.[1972]: Relational Completeness of Data Base Sublanguages. Data Bases Systems (Rustin R.,Ed.), Prentice Hall, 65–98.Google Scholar
  5. Flannagan T.[1985]: Some metatheorems (about negation) in logic programming. Summer Meeting of the Association for Symbolic Logic, Stanford 8.-19.7.Google Scholar
  6. Flannagan T.[1986]: The Consistency of Negation as Failure. Journal of Logic Programming.Google Scholar
  7. Lloyd J.W. & Topor R.W. [1985]: A Basis for Deductive Database Systems II. TR 85/6, Departement of Computer Science, University of Melbourne.Google Scholar
  8. Minsky M.L.[1961]: Recursive unsolvability of Post's problem of ‘tag’ and other topics in the theory of Turing machines. Ann. of Math. 74, 437–455Google Scholar
  9. Neish L.[1985]: MU-Prolog 3.2. Reference Manual. TR 85/11, Departement of Computer Science, University of Melbourne.Google Scholar
  10. Shepherdson J.C.[1984]: Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. Journal of Logic Programming, 51–79.Google Scholar
  11. Shepherdson J.C.[1985]: Negation as Failure ll. Journal of Logic Programming, 185–202.Google Scholar
  12. Shepherdson J.C. & Sturgis H.E.[1963]: Computability of recursive functions. J.Ass.Comp.Mach. 10,217–255.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Egon Börger
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItalia

Personalised recommendations