Abstraction and reformulation in artificial intelligence-Reference-Cited by-同舟云学术

Abstraction and reformulation in artificial intelligence

Published:2003-07-29 Issue:1435 Volume:358 Page:1197-1204
ISSN:0962-8436
Container-title:Philosophical Transactions of the Royal Society of London. Series B: Biological Sciences
language:en
Short-container-title:Phil. Trans. R. Soc. Lond. B

Author:

Holte Robert C.¹,Choueiry Berthe Y.²

Affiliation:

1. Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada

2. Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE 685 88-0115, USA ()

Abstract

This paper contributes in two ways to the aims of this special issue on abstraction. The first is to show that there are compelling reasons motivating the use of abstraction in the purely computational realm of artificial intelligence. The second is to contribute to the overall discussion of the nature of abstraction by providing examples of the abstraction processes currently used in artificial intelligence. Although each type of abstraction is specific to a somewhat narrow context, it is hoped that collectively they illustrate the richness and variety of abstraction in its fullest sense.

Publisher

The Royal Society

Subject

General Agricultural and Biological Sciences,General Biochemistry, Genetics and Molecular Biology

Link

https://royalsocietypublishing.org/doi/pdf/10.1098/rstb.2003.1317

Reference70 articles.

1. Downward refinement and the efficiency of hierarchical problem solving

2. Backofen R. & Will S. 1999 Excluding symmetries in constraint-based research. In 5th Int. Conf. Principles and practice of constraint programming CP '99 Alexandria VA USA October 1999. Lecture notes in artificial intelligence 1713 (ed. J. Jaffar) pp. 73-87. Springer.

3. Bistarelli S. Codognet P. & Rossi F. 2000 An abstraction framework for soft constraints and its relationship with constraint propagation. In 4th Int. Symp. on Abstraction Reformulation and Approximation SARA 2000 Horseshoe Bay USA 26-29 July 2000. Lecture notes in artificial intelligence 1864 (ed. B. Y. Choueiry & T. Walsh) pp. 71-86. Springer.

4. Brown C. A. Finkelstein L. & Purdom Jr P. W. 1988 Backtrack searching in the presence of symmetry. In Applied algebra algebraic algorithms and error-correcting codes (ed. T. Mora) pp. 99-110. Springer.

5. Choueiry B. Y. & Davis A. M. 2002 Dynamic bundling: less effort for more solutions. In 5th Int. Symp. on Abstraction Reformulation and Approximation SARA 2002 Kananaskis Alberta Canada 2-4 August 2002. Lecture notes in artificial intelligence 2371 (ed. S. Koenig & R. Holte) pp. 64-82. Springer.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Information-theoretic Abstraction of Semantic Octree Models for Integrated Perception and Planning;2023 IEEE International Conference on Robotics and Automation (ICRA);2023-05-29

2. A Linear Programming Approach for Resource-Aware Information-Theoretic Tree Abstractions;Systems & Control: Foundations & Applications;2023

3. A Generalized Information-Theoretic Framework for the Emergence of Hierarchical Abstractions in Resource-Limited Systems;Entropy;2022-06-09

4. A framework for analysing state-abstraction methods;Artificial Intelligence;2022-01

5. Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational Limitations;IEEE Transactions on Robotics;2020-12