Skip to main content
SpringerLink
Log in
Book cover

Computation Theory and Logic pp 37–48Cite as

Unsolvable decision problems for PROLOG programs

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • 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 

  • Clark K.L. [1978]: Negation as Failure. Logic and Data Bases (Gallaire H. & Minker J., Eds.), Plenum Press, New York, 293–322.

    Google Scholar 

  • Codd E.F.[1972]: Relational Completeness of Data Base Sublanguages. Data Bases Systems (Rustin R.,Ed.), Prentice Hall, 65–98.

    Google Scholar 

  • Flannagan T.[1985]: Some metatheorems (about negation) in logic programming. Summer Meeting of the Association for Symbolic Logic, Stanford 8.-19.7.

    Google Scholar 

  • Flannagan T.[1986]: The Consistency of Negation as Failure. Journal of Logic Programming.

    Google Scholar 

  • 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 

  • 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–455

    Google Scholar 

  • Neish L.[1985]: MU-Prolog 3.2. Reference Manual. TR 85/11, Departement of Computer Science, University of Melbourne.

    Google Scholar 

  • 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 

  • Shepherdson J.C.[1985]: Negation as Failure ll. Journal of Logic Programming, 185–202.

    Google Scholar 

  • Shepherdson J.C. & Sturgis H.E.[1963]: Computability of recursive functions. J.Ass.Comp.Mach. 10,217–255.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56100, Pisa, Italia

    Egon Börger

Authors
  1. Egon Börger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Börger, E. (1987). Unsolvable decision problems for PROLOG programs. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_152

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18170-5

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation