Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

A Grounded Theory of Abstraction in Artificial Intelligence

Jean-Daniel Zucker
Philosophical Transactions: Biological Sciences
Vol. 358, No. 1435, The Abstraction Paths: From Experience to Concept (Jul. 29, 2003), pp. 1293-1309
Published by: Royal Society
Stable URL: http://www.jstor.org/stable/3558222
Page Count: 17
  • Read Online (Free)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A Grounded Theory of Abstraction in Artificial Intelligence
Preview not available

Abstract

In artificial intelligence, abstraction is commonly used to account for the use of various levels of details in a given representation language or the ability to change from one level to another while preserving useful properties. Abstraction has been mainly studied in problem solving, theorem proving, knowledge representation (in particular for spatial and temporal reasoning) and machine learning. In such contexts, abstraction is defined as a mapping between formalisms that reduces the computational complexity of the task at stake. By analysing the notion of abstraction from an information quantity point of view, we pinpoint the differences and the complementary role of reformulation and abstraction in any representation change. We contribute to extending the existing semantic theories of abstraction to be grounded on perception, where the notion of information quantity is easier to characterize formally. In the author's view, abstraction is best represented using abstraction operators, as they provide semantics for classifying different abstractions and support the automation of representation changes. The usefulness of a grounded theory of abstraction in the cartography domain is illustrated. Finally, the importance of explicitly representing abstraction for designing more autonomous and adaptive systems is discussed.

Page Thumbnails

  • Thumbnail: Page 
1293
    1293
  • Thumbnail: Page 
1294
    1294
  • Thumbnail: Page 
1295
    1295
  • Thumbnail: Page 
1296
    1296
  • Thumbnail: Page 
1297
    1297
  • Thumbnail: Page 
1298
    1298
  • Thumbnail: Page 
1299
    1299
  • Thumbnail: Page 
1300
    1300
  • Thumbnail: Page 
1301
    1301
  • Thumbnail: Page 
1302
    1302
  • Thumbnail: Page 
1303
    1303
  • Thumbnail: Page 
1304
    1304
  • Thumbnail: Page 
1305
    1305
  • Thumbnail: Page 
1306
    1306
  • Thumbnail: Page 
1307
    1307
  • Thumbnail: Page 
1308
    1308
  • Thumbnail: Page 
1309
    1309