Article

Free access

Optimal unification of bound simple set-terms

Author:

Sergio GrecoAuthors Info & Claims

CIKM '96: Proceedings of the fifth international conference on Information and knowledge management

Pages 326 - 336

https://doi.org/10.1145/238355.238575

Published: 12 November 1996 Publication History

PDF eReader

References

[1]

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

Digital Library

Google Scholar

[2]

S. Abiteboul and P. Kanellekis, Object Identity as a Query language primitive, Proc. A CM SIGMOD Conf. on Management of Da#a, 1989.

Digital Library

Google Scholar

[3]

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

Crossref

Google Scholar

[4]

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

Digital Library

Google Scholar

[5]

N. Arni, S. Greco and D. Sacch, Matching of Bounded Set Terms in the Logic Language LDL++, J. of Logic Programming, N. 4, 1996.

Google Scholar

[6]

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

Digital Library

Google Scholar

[7]

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

Digital Library

Google Scholar

[8]

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

Digital Library

Google Scholar

[9]

A. Dovier, E. G. Omodeo, E. Pontelli and G. F. Rossi, { log }: A Logic Programming Language with Finite Sets, Proe. 8th Int. Conj'. on Logic Programming, 199 I.

Google Scholar

[10]

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

Digital Library

Google Scholar

[11]

F. Fages, Associative-Commutative Unification, 8th int. Conf. on Automated Deduction, 1986.

Google Scholar

[12]

S. Greco, Optimal Unification of Bound Simple Set- Terms, DEIS Technical Report, 1995.

Google Scholar

[13]

N. immerman, S. Patnaik and D. Stemple, The Expressiveness of a Family of Finite Set Languages, Proc. Tenlh ACM PODS Conf., 1991, pages 37-52.

Digital Library

Google Scholar

[14]

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

Digital Library

Google Scholar

[15]

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

Digital Library

Google Scholar

[16]

Kapur, D., Narendran, P.: Double-Exponential Complexity of Computing a Complete Set of AC- Unifiers. Proc. 8th LICS Conf., 11-21, 1992.

Google Scholar

[17]

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

Digital Library

Google Scholar

[18]

Knight, K.: Unification: A Multidisciplinary Survey, A CM Comp. Surveys, Vol. 21, No. 1.

Digital Library

Google Scholar

[19]

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

Digital Library

Google Scholar

[20]

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

Digital Library

Google Scholar

[21]

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

Google Scholar

[22]

C. Lincoln and J. Christian, Adventures in Associative-Commutative Unification, Proc. 9th Int. Conf. on Automated Deduction, 1988.

Digital Library

Google Scholar

[23]

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

Google Scholar

[24]

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

Digital Library

Google Scholar

[25]

M. S. Paterson, Linear Unification, or. of Computer and System Science, No. 16, 1978, 158-167.

Google Scholar

[26]

J. Siekmann, Unification Theory, Journal of Symbolic Computation, No. 7, 1989, 207-274.

Digital Library

Google Scholar

[27]

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

Digital Library

Google Scholar

[28]

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

Digital Library

Google Scholar

[29]

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

Google Scholar

[30]

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

Digital Library

Google Scholar

[31]

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

Digital Library

Google Scholar

Cited By

View all

Greco SMateis CSpadafora E(2005)The complexity of weak unification of bounded simple set termsDatabase and Expert Systems Applications10.1007/BFb0034683(224-233)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0034683
Greco SMateis CSpadafora E(2005)Unification of bounded simple set terms in deductive databasesLogic in Databases10.1007/BFb0031755(435-453)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0031755
Greco GZumpano E(2002)Complexity and Algorithms for the Matching of Bag and Set TermsLogics in Artificial Intelligence10.1007/3-540-45757-7_12(137-148)Online publication date: 20-Sep-2002
https://doi.org/10.1007/3-540-45757-7_12

Index Terms

Optimal unification of bound simple set-terms
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
    2. Query languages
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query languages (principles)
      2. Database query processing and optimization (theory)

Recommendations

Unification, weak unification, upper bound, lower bound, and generalization problems
RTA-91: Proceedings of the 4th international conference on Rewriting techniques and applications
On unification: Equational theories are not bounded

We are interested in first-order unification problems and, more specifically, in the hierarchy of equational theories based on the cardinality of the set of most general unifiers. The following result is established in this paper: if T is a suitable ...
Cut-Set Bound is Loose for Gaussian Relay Networks

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity of the Gaussian primitive relay channel, which is tighter ...

Comments

Information & Contributors

Information

Published In

CIKM '96: Proceedings of the fifth international conference on Information and knowledge management

November 1996

344 pages

ISBN:0897918738

DOI:10.1145/238355

Chairmen:
Charles Nicholas
Univ. of Maryland, Baltimore County
,
Niki Pissinou
The Center for Advanced Computer Studies, USL
,
Editors:
M. Tamer Özsu
Univ. of Alberta, Edmonton, Alta., Canada
,
Ken Barker
Univ. of Manitoba, Winnipeg, Man., Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 November 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM96

Sponsor:

CIKM96: Conference on Information and Knowledge Management

November 12 - 16, 1996

Maryland, Rockville, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
203
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Greco SMateis CSpadafora E(2005)The complexity of weak unification of bounded simple set termsDatabase and Expert Systems Applications10.1007/BFb0034683(224-233)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0034683
Greco SMateis CSpadafora E(2005)Unification of bounded simple set terms in deductive databasesLogic in Databases10.1007/BFb0031755(435-453)Online publication date: 26-Jun-2005
https://doi.org/10.1007/BFb0031755
Greco GZumpano E(2002)Complexity and Algorithms for the Matching of Bag and Set TermsLogics in Artificial Intelligence10.1007/3-540-45757-7_12(137-148)Online publication date: 20-Sep-2002
https://doi.org/10.1007/3-540-45757-7_12

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Unification, weak unification, upper bound, lower bound, and generalization problems

On unification: Equational theories are not bounded

Cut-Set Bound is Loose for Gaussian Relay Networks