Skip to main content

On Experimental Efficiency for Retraction Operator to Stem Basis

  • Chapter
  • First Online:
Trends in Mathematics and Computational Intelligence

Abstract

In this paper, we introduce an implementation of an inference rule called “Independence Rule” which lets us reduce the size of knowledge basis based on the retraction problem. This implementation is made in a functional language, Scala, and specialized on attribute implications. We evaluate its efficiency related to the Stem Base generation.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    http://protosmart.uhu.es/retraction/ImplicationRetractor.jar.

References

  1. Alonso-Jiménez, J.A., Aranda-Corral, G.A., Borrego-Díaz, J., Fernández-Lebrón, M.M., Hidalgo-Doblado, M.J.: Extending attribute exploration by means of boolean derivatives. In: Proceedings of 6th International Conference on Concept Lattices and Their Applications (CLA2008), pp. 121–132 (2008)

    Google Scholar 

  2. Aranda-Corral, G.A., Borrego-Díaz, J., Fernández-Lebrón, M.M.: Conservative retractions of propositional logic theories by means of boolean derivatives: theoretical foundations. In Proceedings of 16th CALCULEMUS Congress. Lecture Notes in Artificial Intelligence, vol. 5625, pp. 45–58. Springer, Berlin (2009)

    Google Scholar 

  3. Borrego-Díaz, J., Fernández-Lebrón, M.: Theoretical Foundations of a Specialised Polynomial-Based Calculus for Computing Conservative Retractions in Propositional Logic (2008)

    Google Scholar 

  4. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151–158. ACM, New York, USA (1971)

    Google Scholar 

  5. Ganter, B., Wille, R.: Formal Concepts Analysis. Mathematical Foundations. Springer, Berlin (1999)

    Book  Google Scholar 

  6. Guigues, J.-L., Duquenne, V.: Familles minimales d’ implications informatives resultant d’un tableau de donnees binaires. Math. Sci. Hum. 95, 5–18 (1986)

    Google Scholar 

  7. Papadimitriou, C.: Computational Complexity. Addison-Wesley, New York (1994)

    MATH  Google Scholar 

  8. Taouil, R., Bastide, Y.: Computing proper implications. In: Mephu et al., E. (eds.) Proceedings of Workshop on Concept Lattices-based Theory, Methods and Tools for Knowledge Discovery in Databases, pp. 49–61 (2001)

    Google Scholar 

  9. Yevtushenko, S.A.: System of data analysis “Concept Explorer”. In: Proceedings of the 7th National Conference on Artificial Intelligence KI–2000, pp. 127–134 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gonzalo A. Aranda-Corral .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Aranda-Corral, G.A., Borrego-Díaz, J., Galán-Páez, J., Caballero, A.T. (2019). On Experimental Efficiency for Retraction Operator to Stem Basis. In: Cornejo, M., Kóczy, L., Medina, J., De Barros Ruano, A. (eds) Trends in Mathematics and Computational Intelligence. Studies in Computational Intelligence, vol 796. Springer, Cham. https://doi.org/10.1007/978-3-030-00485-9_8

Download citation

Publish with us

Policies and ethics