skip to main content
10.1145/323706.323708acmconferencesArticle/Chapter ViewAbstractPublication PagesicailConference Proceedingsconference-collections
Article
Free Access

A generative model of narrative cases

Authors Info & Claims
Published:14 June 1999Publication History

ABSTRACT

Effective case-based reasoning in complex domains requires a representation that strikes a balance between expressiveness and tractability. For cases in temporal domains, formalization of event transitions in a narrative grammar can simplify both the user's task of problem formulation and the system's indexing, matching, and adaptation tasks without compromising expressiveness. This paper sets forth a model of temporal cases based on narrative grammars, demonstrates its applicability to several different domains, distinguishes two different similarity metrics—sequence overlap and tree overlap—and shows how the choice between these metrics depends on whether nonterminals in the narrative grammar correspond to abstract domain states or merely represent constraints on event transitions. The paper shows basic-level and legal-event narrative grammars can be used together to model how human lawyers interleave fact elicitation and analysis.

References

  1. AS90.Sandra Andersen and Brian M. Slator. Requiem for a theory: the story grammar story. Journal of Experimental and Theoretical ArtiJicial intelligence (JE- TAI), 2(3):253-275, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ash90.K. Ashley. Modelling Legal Argument: Reasoning with Cusrs and Hypothetic&. MIT Press, Cambridge, Massachusetts. 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. BMPS+91.R. Brachman, D. McGuinness, P. Patel-Schneider, L. Resnick, and A. Borgida. Living with classic: When and how to use a KL-ONE-like language. In John Sowa, editor. Principles of Semantic Networks: %/orcltior,s in the representation of knowle&e, pages 401-456. Morgan-Kaufmann: San Mateo. California. I99 1.Google ScholarGoogle Scholar
  4. Bra91a.K. Branting. Building explanations from rules and structured cases. internationul Journul of Mun- Muchine Studies. 34:797X$37. 199 I. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Bra91b.K. Branting. Integrating Rules and Precedents for Classi$ication and Explanation: Automating Legal Anulysis. PhD thesis, University of Texas at Austin, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Bra92.K. Branting. A model of the role of expertise in analog retrieval. In Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, Bloomington, Indiana, July 29-August I 1992.Google ScholarGoogle Scholar
  7. BS85.R. J. Brachman and J. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2). 1985.Google ScholarGoogle Scholar
  8. BS98.R. Bergmann and A. Stahl. Similarity measures for object-oriented case representations. In B. Smyth and P Cunningham, editors, Lecture Notes in Artijciul intelligence, volume 1488. pages 25-36, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Coo89.D. Cook. ANAGRAM: An analogical planning system. Technical report, Department of Computer Science, University of Illinois, 1989.Google ScholarGoogle Scholar
  10. Dav90.E. Davis. Representations of Commonsense KJZOIVI- edge. Morgan Kaufmann Publishers, Inc., Palo Alto. 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Fil68.C. Fillmore. The case for case. In Universals in Linguistic Theory, pages l-90. Holt, Rinehart & Winston, New York, 1968.Google ScholarGoogle Scholar
  12. Gar87.A. Gardner. An Artificial Intelligence Approach to Legal Reasoning. Bradford Books/MIT Press, Cambridge, MA, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. GJ79.M. R. Garey and D. S. Johnson. Computers and Intractability. Freman, New York, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Hat81.C. Hafner. An Inform&ion Retrieval System Bused on u Computer Model of Legal Knowledge. UMI Research Press. 1981.Google ScholarGoogle Scholar
  15. HT89.K. Holyoak and P. Thagard. Analogical mapping by constraint satisfaction. Cognitive Science, 13(3), 1989.Google ScholarGoogle Scholar
  16. Kol84.J. Kolodner. Retrieval and Organizational Strutegies in Conceptual Memory: a Computer Model. Lawrence Erlbaum Associates, Hillsdale, NJ, 1984.Google ScholarGoogle Scholar
  17. Lak87.G. Lakoff. Women, Fire, and Dangerous Things. University of Chicago Press, Chicago and London, 1987.Google ScholarGoogle Scholar
  18. MB98.B.T. Messmer and H. Bunke. A new algorithm for error tolerant subgraph isomorphism detection. PAMI, 20(5):493-504, May 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. McC89.L. T. McCarty. A language for legal discourse I. Basic features. In Proceedings of the Second Interncltional Conference on ArtiJcial Intelligence and Lcw. Vancouver, B.C., June 13-16 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. McC95.T. McCarty. An implementation of Eisner v. Macomber. In Fifth lnternational Conference on Artijicial Intelligence and Luw, pages 276-286, College Park, MD, May 2 l-24, 1995. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Pal97.J. Palmer. Legal merit arguments, legal semiotics, and the design of legal knowledge-based systems. In Proceedings of the Sixth International Conference oi Artificial Intelligence and Luw (ICAIL-97). pages 198-206, University of Melbourne, Melbourne, Australia. June 30-July 3 1997. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. RMG+76.E.H. Rosch, C.B. Mervis, W.D. Gray, D.M. Johnson. and P. Boyes-Braem. Basic objects in natural categories. Cognitive Psychology. 8:382439, 1976.Google ScholarGoogle ScholarCross RefCross Ref
  23. SA77.R. Schank and R. Abelson. Scripts, Pluns. Couls. and Understanding. Lawrence Erlbaum Associates, 1977.Google ScholarGoogle Scholar
  24. Sch82.R. C. Schank. Dynamic Memory, A Theory of Reminding and Learning in Computers and People. Cambridge University Press, Cambridge. England. 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Sch95.J. Schaaf. Fish and sink: An anytime-algorithm to retrieve adequate cases. In Lecture Notes in Artijcial Intelligence, pages 538-547. Sesimbra, Portugal, October 1995. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. SM97.J. Setubal and J. Meidanis. Introductiol to Compututionul Moleculcrr Biology. PWS Publishing Co., 1997.Google ScholarGoogle Scholar
  27. SR92.D. Skalak and E. R&land. Arguments and cases: An inevitable intertwining. Law and Artificial fntelligence, l(l), 1992.Google ScholarGoogle Scholar
  28. ZWA93.R. Zito-Wolf and R. Alterman. A framework and an analysis of current proposals for the case-based organization and representation of procedural knowledge. in Proceedings qf the Eleventh National Conference on Artijicial Intelligence. 1993.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A generative model of narrative cases

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ICAIL '99: Proceedings of the 7th international conference on Artificial intelligence and law
        June 1999
        220 pages
        ISBN:1581131658
        DOI:10.1145/323706

        Copyright © 1999 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 14 June 1999

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate69of169submissions,41%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader