Skip to main content
SpringerLink
Log in

On the Hardness of Learning Acyclic Conjunctive Queries

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 2000)

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

Included in the following conference series:

Abstract

A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tuple and a conjunctive query are regarded as a ground atom and a nonrecursive function-free definite clause, respectively. While the conjunctive query problem is NP-complete in general, it becomes efficiently solvable if a conjunctive query is acyclic. Concerned with this problem, we investigate the learnability of acyclic conjunctive queries from an instance with a j-database which is a finite set of ground unit clauses containing at most j-ary predicate symbols. We deal with two kinds of instances, a simple instance as a set of ground atoms and an extended instance as a set of pairs of a ground atom and a description. Then, we show that, for each j ≥ 3, there exist a j-database such that acyclic conjunctive queries are not polynomially predictable from an extended instance under the cryptographic assumptions. Also we show that, for each n > 0 and a polynomial p, there exists a p(n)- database of size O(2p(n)) such that predicting Boolean formulae of size p(n) over n variables reduces to predicting acyclic conjunctive queries from a simple instance. This result implies that, if we can ignore the size of a database, then acyclic conjunctive queries are not polynomially predictable from a simple instance under the cryptographic assumptions. Finally, we show that, if either j = 1, or j = 2 and the number of element of a database is at most l (≥ 0), then acyclic conjunctive queries are paclearnable from a simple instance with j-databases.

This workis partially supported by Japan Society for the Promotion of Science, Grants-in-Aid for Encouragement of Young Scientists (A) 11780284.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arimura, H.: Learning acyclic first-order Horn sentences from entailment, Proc. 8th ALT, LNAI 1316, 432–445, 1997.

    Google Scholar 

  2. Beeri, C., Fagin, R., Maier, D. and Yannakakis, M.: On the desirability of acyclic database schemes, Journal of the ACM 30, 479–513, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  3. Baxter, L. D.: The complexity of unification, Doctoral Thesis, Department of Computer Science, University of Waterloo, 1977.

    Google Scholar 

  4. Chekuri, C. and Rajaraman, A.: Conjunctive query containment revisited, Theoretical Computer Science 239, 211–229, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  5. Cohen, W. W.: Pac-learning recursive logic programs: Efficient algorithms, Journal of Artificial Intelligence Research 2, 501–539, 1995.

    MATH  Google Scholar 

  6. Cohen, W. W.: Pac-learning recursive logic programs: Negative results, Journal of Artificial Intelligence Research 2, 541–573, 1995.

    MATH  Google Scholar 

  7. Cohen, W. W.: Pac-learning non-recursive Prolog clauses, Artificial Intelligence 79, 1–38, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  8. Cohen, W. W.: The dual DFA learning problem: Hardness results for programming by demonstration and learning first-order representations, Proc. 9th COLT, 29–40, 1996.

    Google Scholar 

  9. Cohen, W. W. and Page Jr., C. D.: Polynomial learnability and inductive logic programming: Methods and results, New Generation Computing 13, 369–409, 1995.

    Article  Google Scholar 

  10. De Raedt, L. and Džeroski, S.: First-order jk-clausal theories are PAC-learnable, Artificial Intelligence 70, 375–392, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  11. Džeroski, S., Muggleton, S. and Russell, S.: PAC-learnability of determinate logic programs, Proc. 5th COLT, 128–135, 1992.

    Google Scholar 

  12. Džeroski, S., Muggleton, S. and Russell, S.: Learnability of constrained logic programs, Proc. 6th ECML, LNAI 667, 342–347, 1993.

    Google Scholar 

  13. Eiter, T. and Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal of Computing 24, 1278–1304, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  14. Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes, Journal of the ACM 30, 514–550, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  15. Garey, M. R. and Johnson, D. S.: Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, 1979.

    Google Scholar 

  16. Gottlob, G., Leone, N. and Scarcello, F.: The complexity of acyclic conjunctive queries, Proc. 39th FOCS, 706–715, 1998.

    Google Scholar 

  17. Hirata, K.: Flattening and implication, Proc. 10th ALT, LNAI 1720, 157–168, 1999.

    Google Scholar 

  18. Horváth, T. and Turán, G.: Learning logic programs with structured background knowledge, in De Raedt, L. (ed.): Advances in inductive logic programming, 172–191, 1996.

    Google Scholar 

  19. Kearns, M. and Valiant, L.: Cryptographic limitations on learning Boolean formulae and finite automata, Journal of the ACM 41, 67–95, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  20. Kietz, J.-U.: Some lower bounds for the computational complexity of inductive logic programming, Proc. 6th ECML, LNAI 667, 115–123, 1993.

    Google Scholar 

  21. Kietz, J.-U. and Džeroski, S.: Inductive logic programming and learnability, SIGART Bulletin 5, 22–32, 1994.

    Article  Google Scholar 

  22. Kietz, J.-U. and Lübbe, M: An efficient subsumption algorithm for inductive logic programming, Proc. 11th ICML, 130–138, 1994.

    Google Scholar 

  23. Khardon, R.: Learning function-free Horn expressions, Proc. 11th COLT, 154–165, 1998.

    Google Scholar 

  24. Khardon, R.: Learning range-restricted Horn expressions, Proc. EuroCOLT99, LNAI 1572, 111–125, 1999.

    Google Scholar 

  25. Muggleton, S. (ed.): Inductive logic programming, Academic Press, 1992.

    Google Scholar 

  26. Page Jr., C. D. and Frisch, A. M: Generalization and learnability: A study of constrained atoms, in [25], l29–161.

    Google Scholar 

  27. Pitt, L. and Warmuth, M. K.: Prediction preserving reduction, Journal of Computer System and Science 41, 430–467, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  28. Quinlan, J. R.: Learning logical definitions from relations, Machine Learning 5, 239–266, 1990.

    Google Scholar 

  29. Reddy, C. and Tadepalli, P.: Learning first-order acyclic Horn programs from entailment, Proc. 8th ILP, LNAI 1446, 23–37, 1998.

    Google Scholar 

  30. Reddy, C. and Tadepalli, P.: Learning Horn definitions: Theory and application to planning, New Generation Computing 17, 77–98, 1999.

    Google Scholar 

  31. Rouveirol, C.: Extensions of inversion of resolution applied to theory completion, in [25], 63–92.

    Google Scholar 

  32. Schapire, E.: The strength of weak learning, Machine Learning 5, 197–227, 1990.

    Google Scholar 

  33. Valiant, L.: A theory of learnable, Communications of the ACM 27, 1134–1142, 1984.

    Article  MATH  Google Scholar 

  34. Yannakakis, M.: Algorithms for acyclic database schemes, Proc. 7th VLDB, 82–94,1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, Kyushu Institute of Technology, Kawazu 680-4, 820-8502, Iizuka, Japan

    Kouichi Hirata

Authors
  1. Kouichi Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Kyushu University, Hakozaki 6-10-1, 812-8581, Fukuoka, Japan

    Hiroki Arimura

  2. School of Computing, National University of Singapore, 3 Science Drive 2, 117543, Singapore, Singapore

    Sanjay Jain

  3. School of Computer Science and Engineering, The University of New South Wales, 2052, Sydney, Australia

    Arun Sharma

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirata, K. (2000). On the Hardness of Learning Acyclic Conjunctive Queries. In: Arimura, H., Jain, S., Sharma, A. (eds) Algorithmic Learning Theory. ALT 2000. Lecture Notes in Computer Science(), vol 1968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40992-0_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-40992-0_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41237-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation