Skip to main content
Springer Nature Link
Log in

Unification of bounded simple set terms in deductive databases

  • Conference paper
  • First Online:
Logic in Databases (LID 1996)

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

Included in the following conference series:

  • 127 Accesses

Abstract

In this paper we consider the problem of unification of bounded simple set terms in the field of deductive databases. Simple set terms are of the form {e1,..., en}, where e i is a constant or a variable and are much used in deductive database systems such as \(\mathcal{L}\mathcal{D}\mathcal{L}\) and Coral. In this paper we consider a restricted form of unification, called “weak unification”, which is mainly used in the field of deductive databases where the database may contain both constants and variables and the program is “safe”. The main results are: (a) the detailed complexity analysis of the weak unification problem by providing a formula for determining the number of weak unifiers, and (b) the invention of an optimal weak unification algorithm.

Work partially supported by a European Union grant under the EU-US project “DEUS EX MACHINA: non-determinism for deductive databases” and by a MURST project “Sistemi formali e strumenti per basi di dati evolute”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and S. Grumbach, COL: A logic-based language for complex objects, Proc. EDBT, pp. 271–293, 1988.

    Google Scholar 

  2. S. Abiteboul and P. Kanellekis, Object Identity as a Query language primitive, Proc. ACM SIGMOD Conf. on Management of Data, 1989.

    Google Scholar 

  3. P. Arenas-Sanchez, and A. Dovier, Minimal Set Unification, Proc. GULPPRODE'95 Joint Conf. on Declarative Programming, 1995, pages 447–458.

    Google Scholar 

  4. N. Arni, S. Greco and D. Saccà, Set-Term Matching in Logic Programming, Proc 4th Int. Conf. on Database Theory, 1992, pages. 436–449.

    Google Scholar 

  5. N. Arni, S. Greco and D. Saccà, Matching of Bounded Set Terms in the Logic Language LDL++, Journal of Logic Programming (to appear).

    Google Scholar 

  6. F. Baader and W. Buttner, Unification in Commutative Idempotent Monoids, Theoretical Computer Science, No. 56, 1988, pages. 345–353.

    Google Scholar 

  7. C. Beeri, S. Naqvi, O. Shmueli and S. Tsur, Set Constructors in a Logic Database Language, Journal of Logic Programming, Vol. 10, No 3 & 4, Apr. May, 1991.

    Google Scholar 

  8. W. Buttner, Unification in the Data Structure Sets, Proc. 8th Int. Conf. on Automated Deduction, 1986, pages 470–488.

    Google Scholar 

  9. A. Dovier, E. G. Omodeo, E. Pontelli and G. F. Rossi, {log } : A Logic Programming Language with Finite Sets, Proc. 8th Int. Conf. on Logic Programming, 1991.

    Google Scholar 

  10. C. Dwork, P. C. Kanellakis, and J. C. Mitchell, On the Sequential Nature of Unification, Proc. 8th Int. Conf. on Automated Deduction, 1986, pages. 416–430.

    Google Scholar 

  11. C. Dwork, P. C. Kanellakis, and J. C. Mitchell, Parallel Algorithm for Term Matching, Journal of Logic Programming, Vol. 11, No 1, Jan. 1985, pages. 35–50.

    Google Scholar 

  12. F. Fages, Associative-Commutative Unification, 8th Int. Conf. on Automated Deduction, 1986, 416–430.

    Google Scholar 

  13. S. Greco, Optimal Unification of Bounded Set Terms, Technical Report, 1996.

    Google Scholar 

  14. S. Greco, C. Mateis, E. Spadafora, Unification of Bounded Simple Set Terms in Deductive Databases, Technical Report ISI-CNR, 1996.

    Google Scholar 

  15. N. Immerman, S. Patnaik and D. Stemple, The Expressiveness of a Family of Finite Set Languages, Proc. of the Tenth ACM Symposium on Principles of Database Systems, pages 37–52, 1991.

    Google Scholar 

  16. Jayaraman, B.: Implementation of Subset-Equational Programs, Journal of Logic Programming, Vol. 12, 299–324, April 1992.

    Google Scholar 

  17. P. C. Kanellakis, G. M. Kuper, and P. Z. Revez: Constraint query languages, Proc. Int. Symp. on Princ. of Database Systems, 1990.

    Google Scholar 

  18. Kapur, D., Narendran, P.: NP-completeness of the Set Unification and Matching problems, Proc. 8th Int. Conf. on Automated Deduction, 489–495, 1986.

    Google Scholar 

  19. Kapur, D., Narendran, P.: Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers. Proc. 8th Int. Conf. on Logic in Computer Science, 11–21, 1992.

    Google Scholar 

  20. Kifer, M., Lausen, G.: F-Logic: A Higher-Order Language for Reasoning About Objects, Inheritance and Scheme, Proc. ACM SIGMOD Conference, 134–46, 1989.

    Google Scholar 

  21. Knight, K.: Unification: A Multidisciplinary Survey, ACM Comp. Surveys, Vol. 21, No. 1, 1989, 93–124.

    Google Scholar 

  22. Kuper, G. M.: Logic Programming with Sets, J. of Computer and System Science, No. 41, 1990, 44–64.

    Google Scholar 

  23. Lassez, J., Maher, M.J., and Marriot, K.: Unification Revisited, in Foundations of Deductive Databases and Logic Programming, (Minker ed.), Morgan-Kaufman, 1988.

    Google Scholar 

  24. Ledermann, W., Vajda, S. (Eds): Handbook of Applicable Mathematics, Vol. 5, Part B, 1985.

    Google Scholar 

  25. C. Lincoln and J. Christian, Adventures in Associative-Commutative Unification, Proc. 9th International Conference on Automated Deduction, 1988, pages. 358–367.

    Google Scholar 

  26. M Livesey and J.H. Siekmann, Unification of A+C-Terms (Bags) and A+C+I-Terms (Sets), Tech. Report, 5/67, Facultat fur Informatik, Univ. Karlruhe, 1976.

    Google Scholar 

  27. C. Mateis, Sets Unification: Theory and Algorithms, Master degree's Thesis, 1996.

    Google Scholar 

  28. S. Naqvi and S. Tsur, A logical Language for Data and Knowledge Bases, Comp. Science Press, 1989.

    Google Scholar 

  29. M. S. Paterson, Linear Unification, J. of Computer and System Science, No. 16, 1978, 158–167.

    Google Scholar 

  30. R. Ramakrisnhan, D. Srivastava, and S. Sudanshan. CORAL — Control, Relations and Logic. In Proc. of 18th VLDB Conference, 1992.

    Google Scholar 

  31. O. Shmueli, S. Tsur and C. Zaniolo, Compilation of Set Terms in the Logic Data Language (LDL), Journal of Logic Programming, Vol. 12, No 1 & 2, Jan. Feb., 1992, pages 89–119.

    Google Scholar 

  32. J. Siekmann, Unification Theory, Journal of Symbolic Computation, No. 7, 1989, pages 207–274.

    Google Scholar 

  33. M.E. Stickel, A Unification Algorithm for Associative-Commutative Functions, Journal of ACM Vol. 28, No. 3, 1981, pages. 423–434.

    Google Scholar 

  34. F. Stolzenburg, An Algorithm for general Set Unification and its Complexity, Proc. ICLP Workshop on Sets in Logic Programming 1994.

    Google Scholar 

  35. S. Tsur and C. Zaniolo, LDL: A Logic Based Data Language Proc. 12th Conference on Very Large Data Bases, 1986.

    Google Scholar 

  36. J.K. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 1, Computer Science Press, Rockville, Md., 1988.

    Google Scholar 

  37. R. M. Verma and I. V. Ramakrishnan, Tight Complexity Bound for Term Matching Problems, Information and Computation, No. 101, pages 33–69, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS, Univ. della Calabria, 87030, Rende, Italy

    Sergio Greco & Cristinel Mateis

  2. ISI-CNR, c/o DEIS, Univ. della Calabria, 87030, Rende, Italy

    Eugenio Spadafora

Authors
  1. Sergio Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cristinel Mateis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eugenio Spadafora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dino Pedreschi Carlo Zaniolo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, S., Mateis, C., Spadafora, E. (1996). Unification of bounded simple set terms in deductive databases. In: Pedreschi, D., Zaniolo, C. (eds) Logic in Databases. LID 1996. Lecture Notes in Computer Science, vol 1154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031755

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70683-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics