Skip to main content
SpringerLink
Log in

On local stratifiability of logic programs and databases

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, we deal with the problem of verifying local strabfiability of logic programs and databases presented by Przymusinski. 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 databaseDB containing clauses with disjunctive consequents can be easily converted into a logic programP such thatDB is locally stratified iffP 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. Loveland, D. B.,Automated Theorem Proving: A Logic Basis. North-Holland, 1978.

  2. Clark, K. L., Negation as Failure. InLogic and Databases (H. Gallaire and J. Minker, Eds.), Plenum, New York, 1978, pp. 293–322.

    Google Scholar 

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

  4. 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, 1988, pp. 89–148.

    Google Scholar 

  5. 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, 1988, pp. 149–176.

    Google Scholar 

  6. 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, 1988, pp. 193–216.

    Google Scholar 

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

    Google Scholar 

  8. McCarthy, J., Applications of circumscription to formalizing common sense knowledge.Artificial Intelligence, 1986, 28 (1), 89–116.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Chongqing University, 630044, Chongqing

    Shen Yidong, Tong Fu & Cheng Daijie

Authors
  1. Shen Yidong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tong Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cheng Daijie
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yidong, S., Fu, T. & Daijie, C. On local stratifiability of logic programs and databases. J. of Compt. Sci. & Technol. 8, 97–107 (1993). https://doi.org/10.1007/BF02939472

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation