Journal of Computer Science and Technology

, Volume 8, Issue 2, pp 97–107 | Cite as

On local stratifiability of logic programs and databases

  • Shen Yidong
  • Tong Fu
  • Cheng Daijie
Regular Papers
Received:
  • 19 Downloads

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.

Keywords

Deductive databases logic programs local stratifiability verification algorithms 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Loveland, D. B.,Automated Theorem Proving: A Logic Basis. North-Holland, 1978.Google Scholar
  2. [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. [3]
    Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag, 1984.Google Scholar
  4. [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. [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. [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. [7]
    Minker, J. (Ed.), Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, Los Altos, CA, 1988.Google Scholar
  8. [8]
    McCarthy, J., Applications of circumscription to formalizing common sense knowledge.Artificial Intelligence, 1986, 28 (1), 89–116.CrossRefMathSciNetGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1993

Authors and Affiliations

  • Shen Yidong
    • 1
  • Tong Fu
    • 1
  • Cheng Daijie
    • 1
  1. 1.Department of Computer ScienceChongqing UniversityChongqing

Personalised recommendations