Skip to main content
SpringerLink
Log in

On Horn envelopes and hypergraph transversals

Extended abstract

  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 1993)

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

Included in the following conference series:

Abstract

We study the problem of bounding from above and below a given set of bit vectors by the set of satisfying truth assignments of a Horn formula. We point out a rather unexpected connection between the upper bounding problem and the problem of generating all transversals of a hypergraph, and settle several related complexity questions.

Research partially supported by the Esprit project ALCOM.

Research partially supported by the National Sience Foundation.

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. D. Angluin, M. Frazier, L. Pitt “Learning conjunctions of Horn clauses,” 1990 FOCS pp. 186–192.

    Google Scholar 

  2. C. Berge Graphes et Hypergraphes, Dunod, 1980.

    Google Scholar 

  3. R. Dechter and J. Pearl “Structure identification in relational data,” Artificial Intelligence, 1993.

    Google Scholar 

  4. T. Eiter, G. Gottlob “Identifying the minimal transversals of a hypergraph and related problems,” SIAM J. Comp., to appear.

    Google Scholar 

  5. D. S. Johnson, M. Yannakakis, C. H. Papadimitriou “On generating all maximal independent sets,” IPL 27, 119–123, 1988.

    Article  Google Scholar 

  6. H. A. Kautz, M. J. Kearns, B. Selman “Horn approximations of empirical data,” to appear in Artificial Intelligence, 1993.

    Google Scholar 

  7. H. A. Kautz, M. J. Kearns, B. Selman “Reasoning with characteristic models,” to appear in AAAI, 1993.

    Google Scholar 

  8. C. H. Papadimitriou “On selecting a satsfying truth assignment,” Proc. 1991 FOCS.

    Google Scholar 

  9. B. Selman, H. A. Kautz “Knowledge compilation using Horn approximation,” Proc. AAAI 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Univ. of Patras, Patras, Greece

    Dimitris Kavvadias

  2. University of California at San Diego, 92093-0114, La Jolla, California, USA

    Christos H. Papadimitriou

  3. Athens University of Economics and Business, 10434, Athens, Greece

    Martha Sideri

Authors
  1. Dimitris Kavvadias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martha Sideri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kavvadias, D., Papadimitriou, C.H., Sideri, M. (1993). On Horn envelopes and hypergraph transversals. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_271

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_271

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation