Abstract
Case-based reasoning involves reasoning from cases: specific pieces of experience, the reasoner's or another's, that can be used to solve problems. We use the term “graph-structured” for representations that (1) are capable of expressing the relations between any two objects in a case, (2) allow the set of relations used to vary from case to case, and (3) allow the set of possible relations to be expanded as necessary to describe new cases. Such representations can be implemented as, for example, semantic networks or lists of concrete propositions in some logic.
We believe that graph-structured representations offer significant advantages, and thus we are investigating ways to implement such representations efficiently. We make a “case-based argument” using examples from two systems, chiron and caper, to show how a graph-structured representation supports two different kinds of case-based planning in two different domains. We discuss the costs associated with graph-structured representations and describe an approach to reducing those costs, implemented in CAPER.
This work has benefited from the comments of Bill Anderson, Karl Branting, Janet Kolodner, Sean Luke, and Robert McCartney. Research was supported in part by grants to J. Hendler and T. Dean from NSF (IRI-8907890, IRI-8905436, IRI-8957601, ERI-8801253), ONR (N00014-J-91-1451, N00014-91-J-4052), AFOSR (F49620-93-1-0065), ARPA/ARPI (F30602-93-C-0039, F30602-91-C-0041), and IBM (17290066, 17291066, 17292066, 17293066).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alterman. Adaptive planning. Cognitive Science, 12:393–421, 1988.
W. A. Andersen, J. A. Hendler, M. P. Evett, and B. P. Kettler. Massively parallel matching of knowledge structures. In H. Kitano and J. Hendler, editors, Massively Parallel Artificial Intelligence, pages 52–73. AAAI Press/The MIT Press, Menlo Park, California, 1994.
K. D. Ashley. Modelling legal argument: reasoning with cases and hypotheticals. Technical Report 88–01, University of Massachusetts, Amherst, Department of Computer and Information Science, 1988. (PhD Thesis).
K. D. Ashley. Modelling legal argument: reasoning with cases and hypotheticals. MIT Press, 1991.
N. J. Belkin and W. B. Croft. Retrieval techniques. Annual Review of Information Science and Technology, 22:109–145, 1987.
L. K. Branting. Integrating rules and precedents for classification and explanation: automating legal analysis. Technical Report AI90-146, Artificial Intelligence Laboratory, Department of Computer Sciences, University of Texas at Austin, 1990. (PhD Thesis).
B. Cuthill and R. McCartney. Issue spotting in legal cases. In Proceedings of the Fourth International Conference on Artificial Intelligence and Law, Amsterdam, pages 245–253, 1993.
E. Domeshek. What Abby cares about. In Proceedings of the Workshop on Case-Based Reasoning, pages 13–24, 1991.
M. P. Evett, J. A. Hendler, and L. Spector. Parallel knowledge representation on the Connection Machine. Journal of Parallel and Distributed Computing, 22:168–184, 1994.
B. Falkenhainer, K. D. Forbus, and D. Gentner. The structure-mapping engine: Algorithm and examples. Artificial Intelligence, 41:1–63, 1990.
M. R. Garey and D. S. Johnson. Computers and intractability. W. H. Freeman and Company, New York, 1979.
K. J. Hammond. Case-based planning: A framework for planning from experience. Cognitive Science, 14:384–443, 1990.
K. J. Holyoak and P. R. Thagard. Analogical mapping by constraint satisfaction. Cognitive Science, pages 295–355, 1989.
S. Kambhampati and J. A. Hendler. A validation-structure-based theory of plan modification and reuse. Artificial Intelligence, 55:193–258, 1992.
B. P. Kettler. Case-based Planning with a High Performance Parallel Memory. Doctoral dissertation, University of Maryland at College Park, Dept. of Computer Science, November 1995. Technical Report CS-TR-3561.
B. P. Kettler, J. A. Hendler, W. A. Andersen, and M. P. Evett. Massively parallel support for case-based planning. IEEE Expert, pages 8–14, Feb. 1994.
J. L. Kolodner. Case-Based Reasoning. Morgan Kaufmann Publishers, San Mateo, California, 1993.
J. L. Kolodner and R. Thau. Design and implementation of a case memory. Technical Report RL88-1, Thinking Machines Corporation, Cambridge, Mass., Aug. 1988.
R. McCartney. Episodic cases and real-time performance in a case-based planning system. Expert Systems with Applications, 6:9–22, 1993.
R. McCartney and K. E. Sanders. The case for cases: a call for purity in case-based reasoning. In Proceedings of the AAAI Symposium on Case-based Reasoning, pages 12–16, 1990.
N. J. Nilsson. Principles of Artificial Intelligence. Morgan Kaufman, San Mateo, California, 1980.
K. E. Sanders. Chiron: planning in an open-textured domain. Technical Report 94–38, Computer Science Department, Brown University, 1994. (PhD Thesis).
K. Stoffel, M. G. Taylor, and J. A. Hendler. Efficient management for very large ontologies. In Fifteenth National Conference on Artificial Intelligence (AAAI 97), page (submitted), 1997.
P. R. Thagard, K. J. Holyoak, C. Nelson, and D. Gochfeld. Analog retrieval by constraint satisfaction. Artificial Intelligence, 46:259–310, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sanders, K.E., Kettler, B.P., Hendler, J.A. (1997). The case for graph-structured representations. In: Leake, D.B., Plaza, E. (eds) Case-Based Reasoning Research and Development. ICCBR 1997. Lecture Notes in Computer Science, vol 1266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63233-6_496
Download citation
DOI: https://doi.org/10.1007/3-540-63233-6_496
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63233-7
Online ISBN: 978-3-540-69238-6
eBook Packages: Springer Book Archive