Diagrammatic Reasoning and Cases
Abstract
We believe that many problem domains that lend themselves to a case-based reasoning solution can benefit from an diagrammatic implementation and propose a diagrammatic case-based solution to what we term the n-queens best solution problem where the best solution is defined as that which solves the probfem moving the fewest queens. A working system, based on a novel combination of diagrammatic and case-based reasoning, is described.
Cite
Text
Anderson and McCartney. "Diagrammatic Reasoning and Cases." AAAI Conference on Artificial Intelligence, 1996.Markdown
[Anderson and McCartney. "Diagrammatic Reasoning and Cases." AAAI Conference on Artificial Intelligence, 1996.](https://mlanthology.org/aaai/1996/anderson1996aaai-diagrammatic/)BibTeX
@inproceedings{anderson1996aaai-diagrammatic,
title = {{Diagrammatic Reasoning and Cases}},
author = {Anderson, Michael and McCartney, Robert},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1996},
pages = {1004-1009},
url = {https://mlanthology.org/aaai/1996/anderson1996aaai-diagrammatic/}
}