Skip to main content
SpringerLink
Log in

Complexity and Algorithms for the Matching of Bag and Set Terms

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2424))

Included in the following conference series:

  • 806 Accesses

Abstract

Bounded bag and set terms are complex terms in which every element can be a constant or a variable. These types of complex terms have been introduced in several logic languages, such as LDL, Coral and Godel, in order to increase their expressive power, and they have been recently used to define logic languages for database integration. The paper addresses the problem of computing the set of matchers of two bag (or set) terms, by providing a general complexity analysis and a closed formula for determining the number of matchers for tractable cases. An algorithm for the general problem and optimal algorithms for tractable cases are also provided.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Arni, S. Greco and D. Saccà, Matching of Bounded Set Terms in the Logic Language LDL++, J. of Logic Programming 27(1): 73–87, 1996.

    Article  MATH  Google Scholar 

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

    Google Scholar 

  3. E. Dantsin and A. Voronkov, A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. Proc. Int. Conf. Foundations of Software Science and Computation Structures, 180–196, 1999.

    Google Scholar 

  4. G. Dowek, Higher-order unification and matching, A. Robinson and A. Voronkov (eds.), Handbook of Automated Reasoning, pp. 1009–106, Elsevier, 2001.

    Google Scholar 

  5. A. Dovier, E. G. Omodeo, E. Pontelli and G. F. Rossi,: A Logic Programming Language with Finite Sets, Proc. Int. Conf. on Logic Programming, 111–124, 1991.

    Google Scholar 

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

    Google Scholar 

  7. M.R. Garey and D.S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  8. S. Greco, Optimal Unification of Bounded Set Terms, Int. Conf. on Information and Knowledge Management, pp. 326–336, 1996.

    Google Scholar 

  9. G. Greco, S. Greco and E. Zumpano, A logical Framework for the Integration of Databases. Proc. Int. Symp. on Methodologies for Intelligent Sistems, 2002.

    Google Scholar 

  10. N. Immerman, S. Patnaik and D. Stemple, The Expressiveness of a Family of Finite Set Languages, Proc. PODS Conf., 37–52, 1991.

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  13. D. Kapur and P. Narendran, Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers, Proc. LICS Conf., 11–21, 1992.

    Google Scholar 

  14. K. Knight, Unification: A Multidisciplinary Survey, ACM Comp. Surveys, Vol. 21(1), pp. 93–124, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  15. G. M. Kuper, Logic Programming with Sets, Journal of Computer and System Science, No. 41(1), pp. 44–64, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  16. W. Ledermann and S. Vajda, Handbook of Applicable Mathematics, Vol. 5(B), 1985.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  19. C. Mateis, Unification of Simple Set Terms, Master Thesis (in Italian), 1996.

    Google Scholar 

  20. M. S. Paterson, Linear Unification, Journal of Computer and System Science, No. 16, pp. 158–167, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  21. O. Shmueli, S. Tsur and C. Zaniolo, Compilation of Set Terms in the Logic Data Language (LDL), J. of Logic Programming, Vol. 12(1) & 2, 89–119, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  22. J. Siekmann, Unification Theory, J. of Symbolic Computation, No. 7, 207–274, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  23. F. Stolzenburg, An Algorithm for General Set Unification and Its Complexity, Journal of Automated Reasoning, 22(1), pp. 45–63, 1999.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  25. R. M. Verma and I. V. Ramakrishnan, Tight Complexity Bounds for Term Matching Problems, Information and Computation, No. 101(1), 33–69, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  26. C. Zaniolo, N. Arni, K. Ong, Negation and Aggregates in Recursive Rules: the LDL++ Approach. DOOD Conf., pp. 204–221, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS, Università della Calabria, 87030, Rende, Italy

    Gianluigi Greco & Ester Zumpano

Authors
  1. Gianluigi Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ester Zumpano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DEIS, University of Calabria, P.te P. Bucci, Cubo 41C, 87036, Rende, CS, Italy

    Sergio Flesca  & Sergio Greco  & 

  2. Department of Mathematics, University of Calabria, P.te P. Bucci, Cubo 30B, 87036, Rende, CS, Italy

    Giovambattista Ianni  & Nicola Leone  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, G., Zumpano, E. (2002). Complexity and Algorithms for the Matching of Bag and Set Terms. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45757-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44190-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation