Skip to main content
SpringerLink
Log in

Verifying local stratifiability of logic programs and databases II

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

We continue investigating ways of verifying local stratifiability of logic programs and databases. In a previous paper, we established a necessary and sufficient condition for local stratifiability of logic programs and databases and proposed an interactive procedure for performing the verification. In this paper, we extend our earlier work. We present a characterization of an infinite extending path and develop a non-interactive procedure for testing for local stratifiability of logic programs and databases. Although the unerlying problem is undecidable in general, our method proves to be powerful to treat a majority of logic programs and databases.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apt, K. R., Blair, H. A., and Walker, A., “Towards a Theory of Declarative Knowledge,” inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 89–148, 1988.

    Google Scholar 

  2. Cholak, P., “Post Correspondence Problem and Prolog Programs,”Technical Report, University of Wisconsin, Madison, 1988.

    Google Scholar 

  3. McCarthy, J., “Applications of Circumscription to Formalizing Common Sense Knowledge,”Artificial Intelligence, 28, 1, pp. 89–116, 1986.

    Article  MathSciNet  Google Scholar 

  4. Palopoli, L., “Testing Logic Programs for Local Stratification,”Theoretical Computer Science, 103, pp. 205–234, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. Przymusinski, T., “On the Declarative Semantics of Deductive Databases and Logic Programs,” inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 193–216, 1988.

    Google Scholar 

  6. Shen, Y. D., “Verifying Local Stratifiability of Logic Programs and Databases,”New Generation Computing, 11, 1, Ohmsha, Ltd., Tokyo, pp. 23–46, 1992.

    Article  MATH  Google Scholar 

  7. Van Gelder, A., “Negation as Failure Using Tight Derivations for General Logic Programs,” inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 149–176, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Chongqing University, 630044, Chongqing, P. R. China

    Yi-Dong Shen

Authors
  1. Yi-Dong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Yi-Dong Shen, Ph.D: He is a professor of Computer Science at Chongqing University, China. He received the Ph.D degree in computer science from Chongqing University in 1991. He was a visiting researcher at the University of Valenciennes, France (1992–1993) and the University of Maryland Institute for Advanced Computer Studies, U.S.A. (1995–1996), respectively. His present interests include: Artificial Intelligence, Deductive Databases, Logic Programming and Parallel Processing.

About this article

Cite this article

Shen, YD. Verifying local stratifiability of logic programs and databases II. New Gener Comput 14, 317–341 (1996). https://doi.org/10.1007/BF03037486

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037486

Keywords

Search

Navigation