Abstract
This paper gives a general framework for analyzing casebased reasoning to represent a lattice-based relation. This is a generalization of our previous work to analyze case-based reasoning over a boolean domain [Satoh98],[Satoh00a] and a tree-structured domain [Satoh00b]. In these work, we use a set-inclusion based similarity which is a generalization of a similarity measure proposed in a legal domain [Ashley90],[Ashley94]. We show representability of a lattice-based relation, approximation method of constructing a minimal casebase to represent a relation and complexity analysis of the method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ashley, K. D.: Modeling Legal Argument: Reasoning with Cases and Hypotheticals MIT press (1990)
Ashley, K. D., and Aleven, V.: A Logical Representation for Relevance Criteria. S. Wess, K-D. Altho. and M. Richter (eds.) Topics in Case-Based Reasoning, LNAI 837 (1994) 338–352
Bshouty, N. H.: Exact Learning Boolean Functions via the Monotone Theory. Information and Computation 123 (1995) 146–153
Matuschek, D., and Jantke, K. P.: Axiomatic Characterizations of Structural Similarity for Case-Based Reasoning. Proc. of Florida AI Research Symposium (FLAIRS-97) (1997) 432–436
Khardon, R., and Roth, D.: Reasoning with Models. Artificial Intelligence 87 (1996) 187–213
Osborne, H. R., and Bridge, D. G.: A Case Base Similarity Framework. Advances in Case-Based Reasoning, LNAI 1168 (1996) 309–323
Satoh, K.: Analysis of Case-Based Representability of Boolean Functions by Monotone Theory. Proceedings of ALT’98 (1998) 179–190
Satoh, K., and Nakagawa, R.: Discovering Critical Cases in Case-Based Reasoning (Extended Abstract), Online Proceedings of 6th Symposium on AI and Math, http://rutcor.rutgers.edu/amai/AcceptedCont.htm (2000)
Satoh, K.: Learning Taxonomic Relation by Case-based Reasoning. Proceedings of ALT’00 (2000) 179–193
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Satoh, K. (2002). Constructing a Critical Casebase to Represent a Lattice-Based Relation. In: Arikawa, S., Shinohara, A. (eds) Progress in Discovery Science. Lecture Notes in Computer Science(), vol 2281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45884-0_13
Download citation
DOI: https://doi.org/10.1007/3-540-45884-0_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43338-5
Online ISBN: 978-3-540-45884-5
eBook Packages: Springer Book Archive