Skip to main content

Properties of the \(\mathcal{KRA }\) Model

  • Chapter
  • First Online:
Abstraction in Artificial Intelligence and Complex Systems

Abstract

In the KRA model approximation and reformulation are never abstractions, but all three are mechanisms aiming in real-world applications at effectively simplifying solving a problem. This chapter provides a definition of abstraction, approximation, and reformulation as well as their relationships with the key notion of information. In our view, abstraction reduces the information, while approximation modifies it, and reformulation leaves it unchanged, only modifying its format. We also explain why and how these three representation changes are used in synergy. Even though the KRA model is primarily thought for a bottom-up use, it can also be used top-down, by inverting the abstraction operators. Another property of abstraction is that it may generate inconsistencies in the abstract space. We show that the only important thing is whether the given problem can or cannot be solved in the abstract space. The unification power of the KRA model concludes this chapter, showing how other models of abstraction nicely fit into it.

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 159.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.

    This is a choice that we have done for the sake of simplicity. It is easy to envisage, however, that combination can be defined on other descriptors or values.

  2. 2.

    A conservative attitude would assign to all existing attributes an NA value for the new object.

  3. 3.

    We recall that operators that build up equivalence classes and denote them by generic names are abstraction operators, instead.

  4. 4.

    This justifies the name of the model \(\mathcal{KRA }\) as Knowledge Reformulation and Abstraction.

  5. 5.

    There are actually alternative ways to represent this example in the \(\mathcal{KRA }\) model. We have chosen the one that gives the closest results to Tenenberg’s.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lorenza Saitta .

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Saitta, L., Zucker, JD. (2013). Properties of the \(\mathcal{KRA }\) Model. In: Abstraction in Artificial Intelligence and Complex Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7052-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7052-6_8

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7051-9

  • Online ISBN: 978-1-4614-7052-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics