Foundations of Simplified Integrity Checking Reviewed

  • M. Celma
  • L. Mota
Conference paper


We review some fundamental concepts of simplified integrity checking in deductive databases. This is done on a sufficiently abstract level such that we do not have to depend on any particular method. Our main focus is on concepts of soundness and completeness of simplified integrity checking. These two concepts relates the declarative and procedural concepts of satisfaction. The former defined by well-established views of integrity satisfaction and the later by the methods. Also, we distinguish between generation and evaluation phases of integrity checking, and apply the concepts of soundness and completeness to each of the two phases.


Generation Phase Constraint Violation Integrity Constraint Evaluation Phase Database State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Apt, K. J; Blair, H. A; Walker, A. “Towards a Theory of Declarative Knowledge”, in Minker, J. (ed. ) Foundations of Deductive Databases and Logic Programming, Morgan Kaufman. 1988.Google Scholar
  2. [2]
    Bry, F.; Decker, H.; Manthey, R. “A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases” in Schmidt, J. et al (eds.), Proc. of 1st International Conference Extending Data Base Technology, Springer Verlag LNCS 303, 488-505. 1988.Google Scholar
  3. [3]
    Barbuti, R.; Martelli, M. “Completeness of the SLDNF-Resolution for a Class of Logic Programs” in Shapiro, E. (ed.), Proc. of 3rd International Conference on Logic Programming, Springer-Verlag, LNCS 225, 600-614. 1986.Google Scholar
  4. [4]
    Cavedon, L. “Acyclic Logic Programs and the Completeness of SLDNF-Resolution” in Theoretical Computer Sciencie №86, pg. 81–92. 1991.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    Celma, M.; Casamayor, J; Mota, L.; Pastor, M. A; Marques, F. “A Derivation Path Recording Method for Integrity Checking in Deductive Databases” in Proc. of 2nd Workshop on the Deductive Approach to Information Systems and Databases. 1991.Google Scholar
  6. [6]
    Cavedon, L; Decker, H. “A Weak Allowedness Condition that Ensures Completeness of SLDNF-Resolution” in Olive, A. (ed.), Proc. of 1st International Workshop on the Deductive Approach to Information Systems and Databases. Internal report LSI90/30, U. P. C. (Barcelona). 1990.Google Scholar
  7. [7]
    Celma, M.; Decker, H. “Completeness of Integrity Checking Revisited”. Internal Document, Siemens AG, ZFE IS INF 3, Munich. 1991.Google Scholar
  8. [8]
    Clark, P. “Negation as Failure” in H. Gallaire&J. Minker (eds) Logic and Databases. Plenum. 1978.Google Scholar
  9. [9]
    Decker, H; Cavedon, L. “Generalizing Allowedness while Retaining Completeness of SLDNF-Resolution”. in Börger, E. et al. (eds. ), Proc. 3rd Workshop on Computer Science Logic, 98-115, Springer-Verlag, LNCS 440. 1990Google Scholar
  10. [10]
    Decker, H. “Integrity enforcement on deductive databases” in KerschbergX. (ed) Proc. of 1st Int. Conf Expert Database Systems. 1986.Google Scholar
  11. [11]
    Decker, H. “On Generalized Cover Axioms” in Furukawa, F. (ed.), Proc. of the 8th International Conference and Symposium on Logic Programming, 693-707, MIT Press. 1991.Google Scholar
  12. [12]
    Das, S. K.; Williams, M. H. “A Path Finding Method for Constraint Checking in Deductive Databases” in Data & Knowledge Engineering,: 4: 233–244. 1989.CrossRefGoogle Scholar
  13. [13]
    Gelfond, M.; Lifschitz, V. “The Stable Model Semantics For Logic Programs” in Proc. of 5th International Conference on Logic Programming. 1984.Google Scholar
  14. [14]
    Gallaire, H.; Minker, J.; Nicolas, J. M. “Logic and Databases: A Deductive Approach” in Computing Surveys,:16: 2: 153–185. 1984.MathSciNetMATHCrossRefGoogle Scholar
  15. [15]
    Jaffar, J.; Lassez, J. L.; Lloyd, J. W. “Completeness of the Negation as Failure Rule” in Proc. of IJCAI-83, 500-506. 1983.Google Scholar
  16. [16]
    Kunen, K. “Signed Data Dependencies in Logic Programs” in Journal of Logic Programming,:7: 231–245. 1989.MathSciNetCrossRefGoogle Scholar
  17. [17]
    Lloyd, J. W. “Foundations of Logic Programming” (2nd edition). Springer Verlag. 1987.Google Scholar
  18. [18]
    Lloyd, J. W; Sonenberg, E. A.; Topor, R. W. “Integrity Constraint Checking in Stratified Databases” in Journal of Logic Programming,: 4: 331–343. 1987.MathSciNetMATHCrossRefGoogle Scholar
  19. [19]
    Nicolas, J. M. “Logic for Improving Integrity Checking” in Acta Informatica,:18: 221–253. 1982.MathSciNetCrossRefGoogle Scholar
  20. [20]
    Nüssel, G. “Integritätstests in Deduktiven Datenbanken“ Diploma Thesis, Mathematische Fakultät, LMU, Munich. 1991.Google Scholar
  21. [21]
    Olivé, A. “Integrity Checking in Deductive Databases” in Proc. of the 17th Vety Large Data Bases. 1991.Google Scholar
  22. [22]
    Przymusinski, T. C. “On the Declarative Semantics of Logic Programs with Negation” in Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufman. 1988.Google Scholar
  23. [23]
    Reiter, R. “On Closed World Data Bases” in H. Gallaire&J. Minker (eds) Logic and Databases, Plenum. 1978.Google Scholar
  24. [24]
    Reiter, R. “Towards a Logical Reconstruction of Relational Database Theory” in M. L. Brodie, J. L. Mylopoulos y J. W. Schmit (eds.) On conceptual Modelling, Springer-Verlag. 1984.Google Scholar
  25. [25]
    Reiter, R. “On Asking what a Database Knows” in J. W. Lloyd (ed. ) Computational Logic, Springer-Verlag. 1990.Google Scholar
  26. [26]
    Shepherdson, J. C. “Negation as Failure: A Comparison of Clark’s Completed Data Base and Reiter’s Closed World Assumption” in Journal of Logic Programming,:1:51-79. 19484.Google Scholar
  27. [27]
    Shepherdson, J. C. “Negation as Failure II” in Journal of Logic Programming,:3: 185–202. 1985.MathSciNetCrossRefGoogle Scholar
  28. [28]
    Sadri, F.; Kowalski, R. “A Theorem-Proving Approach to Database Integrity” in Proc. of the Workshop on Foundations of Deductive Databases and Logic Programming. 1987.Google Scholar
  29. [29]
    Sacca, D.; Zaniolo, C. “Stable Models and Non-Determinism for Logic Programs with Negation” in Proc. of the ACM S1GMOD-SIGACT Symposium on Principles of Database Systems. 1990.Google Scholar
  30. [30]
    van Gelder, A.; Ross, K. A.; Schilip, J. S. “The Well-Founded Semantics for General Logic Programs” in Journal of ACM,: 38: 620–650. 1991.MATHGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • M. Celma
    • 1
  • L. Mota
    • 1
  1. 1.DSICUniversidad Politécnica de ValenciaSpain

Personalised recommendations