Skip to main content
SpringerLink
Log in
Book cover

International Conference on Deductive and Object-Oriented Databases

DOOD 1991: Deductive and Object-Oriented Databases pp 244–262Cite as

On testing effective computability of magic programs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 566))

Abstract

A sufficient condition is given for effective computability of a magic program, assuming that predicates satisfy some finiteness and monotonicity constraints. Effective computability means that a bottom-up evaluation is a finite process. This sufficient condition can show effective computability in cases that could not be handled by previous methods. Testing the condition is exponential in the arity of predicates.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afrati, F., Papadimitriou, C.H., Papageorgiou, G., Roussou, A., Sagiv, Y., Ullman, J.D.: On the convergence of query evaluation. J. of Computer and System Sciences, Vol. 38, No. 2 (April 1989), pp. 341–359.

    Google Scholar 

  2. Brodsky, A., Sagiv, Y.: Inference of monotonicity constraints in datalog programs. Proc. ACM SIGACT-SIGART-SIGMOD Symp. on Principles of Database Systems, Philadelphia, 1989, pp. 190–199.

    Google Scholar 

  3. Brodsky, A., Sagiv, Y.: On termination of datalog programs. Proc. 1st International Conference on Deductive and Object-Oriented Databases, Kyoto, Japan, 1989, pp. 95–112.

    Google Scholar 

  4. Brodsky, A., Sagiv, Y.: Inference of Inequality Constraints in Logic Programs. Proc. 10th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Denver, 1991.

    Google Scholar 

  5. Kifer, M., Lozinski, E.L.: SYGRAF-Implementing logic programs in a database style. IEEE Trans. on Software Eng., July 1988, pp. 922–935.

    Google Scholar 

  6. Kifer, M., Ramakrishnan, R., Silberschatz, A.: An axiomatic approach to deciding query safety in deductive databases. Proc. 7th ACM Symp. on Principles of Database Systems, Austin, 1988, pp. 52–60.

    Google Scholar 

  7. Krishnamurthy, R., Ramakrishnan, R., Shmueli, O.: A framework for testing safety and effective computability of extended datalog. Proc. ACM Symp. on Management of Data, Chicago, 1988, pp. 154–163.

    Google Scholar 

  8. Morris, K., Ullman, J.D., Van Gelder, A.: Design overview of the NAIL! system. Proc. Third Int. Conf. on Logic Programming, 1986, pp. 554–568.

    Google Scholar 

  9. Morris, K., Naughton, J.F., Saraiya, Y., Ullman, J.D., Van Gelder, A.: YAWN! (yet another window on NAIL!). Data Engineering, (C. Zaniolo, ed.), 10:4(1987), pp. 28–43.

    Google Scholar 

  10. Naqvi, S., Tsur, S.: A Logical Language for Data and Knowledge Bases. Computer Science Press, Rockville, Md., 1988.

    Google Scholar 

  11. Plümer, L.: Termination proofs for logic programs based on predicate inequalities. Proc. 7th International Conference on Logic Programming, Jerusalem, 1990, pp. 634–648.

    Google Scholar 

  12. Plümer, L.: Termination Proofs for Logic Programs. Lecture Notes in Artificial Intelligence 446, Springer-Verlag, Berlin, 1990.

    Google Scholar 

  13. Ramakrishnan, R., Bancilhon, F., Silberschatz, A.: Safety of recursive Horn clauses with infinite relations. Proc. 6th ACM Symp. on Principles of Database Systems, San Diego, 1987, pp. 328–339.

    Google Scholar 

  14. Sagiv, Y., Vardi, M.Y.: Safety of datalog queries over infinite databases. Proc. ACM SIGACT-SIGART-SIGMOD Symp. on Principles of Database Systems, Philadelphia, 1989, pp. 160–171.

    Google Scholar 

  15. Sagiv, Y.: A termination test for logic programs. To appear in Int. Logic Programming Symp., San Diego, 1991.

    Google Scholar 

  16. Shmueli, O.: Decidability and expressiveness aspects of logic queries. Proc. 6th ACM Symp. on Principles of Database Systems, San Diego, pp. 237–249.

    Google Scholar 

  17. Sohn, K., Van Gelder, A.: Termination detection in logic programs using argument sizes. Proc. 10th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Denver, 1991.

    Google Scholar 

  18. Ullman, J.D.: Principles of Database and Knowledge-Base System. Volume 2. Computer Science Press, 1989.

    Google Scholar 

  19. Ullman, J.D., Van Gelder, A.: Efficient tests for top-down termination of logical rules. JACM 35:2(1988), pp. 345–373.

    Google Scholar 

  20. Van Gelder, A.: Deriving constraints among argument sizes in logic programs. Proc. 9th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Nashville, 1990, pp. 47–60.

    Google Scholar 

  21. Zaniolo, C.: Design and implementation of a logic based language for data intensive applications. Proc. Fifth Intl. Symp. on Logic Programming, 1988, pp. 1666–1687.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hebrew University and IBM Almaden Research Center, Israel

    Yehoshua Sagiv

Authors
  1. Yehoshua Sagiv
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yehoshua Sagiv .

Editor information

C. Delobel M. Kifer Y. Masunaga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sagiv, Y. (1991). On testing effective computability of magic programs. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-55015-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55015-0

  • Online ISBN: 978-3-540-46646-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation