Skip to main content

Characterizing Implications of Injective Partial Orders

  • Conference paper
Conceptual Structures: Knowledge Architectures for Smart Applications (ICCS 2007)

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

Included in the following conference series:

  • 728 Accesses

Abstract

It is known that implications in powerset-based closure systems correspond to Horn approximations in propositional logic frameworks. Here we focus on the problem of implications between injective partial orders. We set up the definitions that allow one to apply standard constructions of implications, and formally characterize the propositional theory obtained. We describe also some experimental applications of our development.

This work is supported in part by MCYT TIC (MOISES-TA TIN2005-08832-C03,Trangram TIC2004-07925-C03-02) and by the IST Programme of the European Community, under the PASCAL Network of Excellence, IST-2002-506778.

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

Access this chapter

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. Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD Int. Conference on Management of Data, pp. 207–216. ACM Press, New York (1993)

    Chapter  Google Scholar 

  2. Balcázar, J.L., Garriga, G.C.: On Horn axiomatizations for sequential data. Theoretical Computer Science 371(3), 247–264 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1998)

    Google Scholar 

  4. Garriga, G.C., Balcázar, J.L.: Coproduct transformations on lattices of closed partial orders. In: Proceedings of 2nd. Int. Conference on Graph Transformation, pp. 336–351 (2004)

    Google Scholar 

  5. Kautz, H., Kearns, M., Selman, B.: Horn approximations of empirical data. Artificial Intelligence 74(1), 129–145 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Luxenburger, M.: Implications partielles dans un contexte. Math. Inf. Sci. hum. 29(113), 35–55 (1991)

    MathSciNet  Google Scholar 

  7. Pfaltz, J.L., Taylor, C.M.: Scientific knowledge discovery through iterative transformations of concept lattices. In: SIAM Int. Workshop on Discrete Mathematics and Data Mining, pp. 65–74 (2002)

    Google Scholar 

  8. Wild, M.: A theory of finite closure spaces based on implications. Advances in Mathematics 108, 118–139 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Uta Priss Simon Polovina Richard Hill

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balcázar, J.L., Garriga, G.C. (2007). Characterizing Implications of Injective Partial Orders. In: Priss, U., Polovina, S., Hill, R. (eds) Conceptual Structures: Knowledge Architectures for Smart Applications. ICCS 2007. Lecture Notes in Computer Science(), vol 4604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73681-3_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73681-3_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73680-6

  • Online ISBN: 978-3-540-73681-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics