Skip to main content
SpringerLink
Log in

Verifying local stratifiability of logic programs and databases

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

Abstract

In this paper, we deal with the problem of verifying local stratifiability of logic programs and databases presented by Przymusinski. The notion of dependency graphs is generalized from representing the priority relation between predicate symbols to representing the priority between atoms. Necessary and sufficient conditions for the local stratifiability of logic programs are presented and algorithms for performing the verification are developed. Finally, we prove that a database DB containing clauses with disjunctive consequents can easily be converted into a logic program P such that DB is locally stratified iff P is locally stratified.

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. Clark, K. L., “Negation as Failure,” inLogic and Databases (H. Gallaire and J. Minker, eds.), Plenum, New York, pp. 293–322, 1978.

    Google Scholar 

  3. Lifschitz, V., “On the Declarative Semantics of Logic Programs with Negation,” inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publishers, Los Altos, CA, pp. 177–192, 1988.

    Google Scholar 

  4. Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, 1984.

  5. Loveland, D. B.,Automated Theorem Proving: A Logic Basis, North-Holland, 1978.

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

    Article  MathSciNet  Google Scholar 

  7. Minker, J. (ed.),Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Los Altos, CA, 1988.

    Google Scholar 

  8. 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 

  9. 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, Dr.: Department of Computer Science, Chongqing University, Chongqing, 630044, P.R. China (Present Address) c/o Ping Ran, Department of Heat Power Engineering, Chongqing UniversityResearch interests: Artificial Intelligence, Deductive Databases, Logic Programming, Non-Monotonic Reasoning, Parallel Processing

About this article

Cite this article

Shen, YD. Verifying local stratifiability of logic programs and databases. New Gener Comput 11, 23–46 (1992). https://doi.org/10.1007/BF03037526

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation