A grounded theory of abstraction in artificial intelligence

被引:25
作者
Zucker, JD
机构
[1] Univ Paris 13, LIM&BIO, EPML, CNRS,IAPuces, F-93017 Bobigny, France
[2] Univ Paris 06, LIP6, Dept 1A, F-75252 Paris, France
关键词
artificial intelligence; abstraction; reformulation; representation change; machine learning;
D O I
10.1098/rstb.2003.1308
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
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.
引用
收藏
页码:1293 / 1309
页数:17
相关论文
共 85 条
[1]   TOWARDS A GENERAL-THEORY OF ACTION AND TIME [J].
ALLEN, JF .
ARTIFICIAL INTELLIGENCE, 1984, 23 (02) :123-154
[2]  
Amarel S., 1968, Machine Intelligence, P131
[3]  
AMAREL S, 1983, METHODS HEURISTICS, P245
[4]  
[Anonymous], ENCY STAT SCI
[5]  
[Anonymous], P 13 INT C MACH LEAR
[6]  
Armstrong M. P., 1991, Map Generalization: Making Rules for Knowledge Representation, P86
[7]   DOWNWARD REFINEMENT AND THE EFFICIENCY OF HIERARCHICAL PROBLEM-SOLVING [J].
BACCHUS, F ;
YANG, Q .
ARTIFICIAL INTELLIGENCE, 1994, 71 (01) :43-100
[8]  
BACKSTROM C, 1995, P 14 INT JOINT C ART, P1599
[9]  
BENJAMIN DP, 1990, P AAAI WORKSH AUT GE, P47
[10]  
Bentley P, 1999, GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P35