Skip to main content
SpringerLink
Log in

Set-term matching in logic programming

  • Conference paper
  • First Online:
Database Theory — ICDT '92 (ICDT 1992)

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

Included in the following conference series:

Abstract

This paper is concerned with the unification of set terms that differ from standard terms because of the commutative and idempotent properties. The main results are the detailed complexity analysis of the problem of set-term unification for the case that one of the terms is ground (set-term matching) and the invention of two improved matching algorithms.

Work done while visiting MCC. Work partially supported by the project ”Sistemi Informatici e Calcolo Parallelo” obiettivo ”Logidata+” of C.N.R. Italy.

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. 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 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. 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 

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

    Google Scholar 

  10. K. Knight, Unification: A Multidisciplinary Survey, ACM Computing Surveys, Vol. 21, No. 1, pages 93–124, March 1989.

    Google Scholar 

  11. G. M. Kuper, Logic Programming with Sets, Journal of Computer and System Science, No. 41, pages 44–64, 1990.

    Google Scholar 

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

    Google Scholar 

  13. The LVL + + users manual, MCC Technical Report, 1992.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  16. J. Lloyd, Foundation of Logic Programming, Second Edition, Spinger-Verlag, 1987.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  20. 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.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  23. K. Vadaparty, On the power of Rule-Based Languages with Sets, Proc. of the Tenth ACM Symposium on Principles of Database Systems, pages 26–36, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Balcones Center Dr., 3500, MCC, 78759, Austin, TX

    Natraj Arni

  2. DEIS, Università della Calabria, 87030, 2101, Rende, Italy

    Sergio Greco & Domenico Saccà

Authors
  1. Natraj Arni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Domenico Saccà
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joachim Biskup Richard Hull

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arni, N., Greco, S., Saccà, D. (1992). Set-term matching in logic programming. In: Biskup, J., Hull, R. (eds) Database Theory — ICDT '92. ICDT 1992. Lecture Notes in Computer Science, vol 646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56039-4_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-56039-4_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56039-5

  • Online ISBN: 978-3-540-47360-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation