The Abstraction/Implementation Model of Problem Reformulation
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Reasoning. Pages 1004-1009.
Abstract
A good problem repre,entation incorporate" important problem con,traint, while hiding "uperftuou" detail. This paper presents methods for abstracting a problem representation by making implicit problem properties into explicit properties of the representation. The mathematics of the abstraction search space are given in terms of model theory and universal algebra. The Behavioral Abstraction method uses predefined representation maps to lift a problem representation to an abstract theory. The Behavioral Congruence method generate" abstract theories and representation maps which incorporate problem constraints expressed as Behavioral Equivalences. Two meta-level methods for generating Behavioral Equivalence theorems are given. The STRATA automatic programming system described in this paper is currently being implemented.
@inproceedings{ijcai1987p207,
title = {The Abstraction/Implementation Model of Problem Reformulation},
author = {Lowry, Michael R.},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {1004--1009},
year = {1987},
note = {Reasoning},
url = {https://ijcai.org/proceedings/1987/207},
}
TY - CPAPER TI - The Abstraction/Implementation Model of Problem Reformulation AU - Lowry, Michael R. T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 1004 EP - 1009 UR - https://ijcai.org/proceedings/1987/207 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
