Skip to main content

Constructing a Critical Casebase to Represent a Lattice-Based Relation

  • Chapter
  • First Online:
Progress in Discovery Science

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2281))

  • 502 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ashley, K. D.: Modeling Legal Argument: Reasoning with Cases and Hypotheticals MIT press (1990)

    Google Scholar 

  2. 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

    Google Scholar 

  3. Bshouty, N. H.: Exact Learning Boolean Functions via the Monotone Theory. Information and Computation 123 (1995) 146–153

    Article  MATH  MathSciNet  Google Scholar 

  4. 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

    Google Scholar 

  5. Khardon, R., and Roth, D.: Reasoning with Models. Artificial Intelligence 87 (1996) 187–213

    Article  MathSciNet  Google Scholar 

  6. Osborne, H. R., and Bridge, D. G.: A Case Base Similarity Framework. Advances in Case-Based Reasoning, LNAI 1168 (1996) 309–323

    Google Scholar 

  7. Satoh, K.: Analysis of Case-Based Representability of Boolean Functions by Monotone Theory. Proceedings of ALT’98 (1998) 179–190

    Google Scholar 

  8. 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)

  9. Satoh, K.: Learning Taxonomic Relation by Case-based Reasoning. Proceedings of ALT’00 (2000) 179–193

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics