Skip to main content
SpringerLink
Log in

Dialogue Game Tree with Nondeterministic Additive Consolidation

  • Conference paper
Computational Logic in Multi-Agent Systems (CLIMA 2006)

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

Included in the following conference series:

  • 314 Accesses

Abstract

In this paper, we will show that theory-based legal argumentation can be formalized as a dialogue game tree. In [37], a variation of Olsson’s additive consolidation [29] is used for the formalization, but this dialogue game was not treed, because, in each move on the dialogue, the consolidation must construct a unique coherent theory, but not several coherent theories. Therefore, we abandon the requirement that rational consolidation must be unique, and we allow the consolidation to generate plural outputs. Such an operator will be applied for a dialogue game tree with Bench-Capon and Sartor’s example.

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

Access this chapter

Log in via an institution
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. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arrow, K.J.: Social Choice and Individual Values, 2nd edn. Yale University Press, Yale (1963)

    Google Scholar 

  3. Ashley, K.D.: Modeling Legal Argument. The MIT Press, Cambridge (1990)

    Google Scholar 

  4. Bench-Capon, T., Sartor, G.: Theory Based Explanation of Case Law Domains. In: Proceedings of The Eighth International Conference on Artificial Intelligence and Law (ICAIL’01), pp. 12–21. ACM, New York (2001)

    Google Scholar 

  5. Bench-Capon, T., Sartor, G.: A model of legal reasoning with cases incorporating theories and values. Artificial Intelligence 150(1-2), 97–143 (2003)

    Article  MATH  Google Scholar 

  6. Berman, D.H., Hafner, C.D.: Representing Teleological Structure in Case Based Reasoning. In: The Fourth International Conference on Artificial Intelligence and Law (ICAIL’93), pp. 50–59. ACM, New York (1993)

    Chapter  Google Scholar 

  7. Brewka, G.: Dynamic argument systems: a formal model of argumentation processes based on situation calculus. Journal of Logic and Computation 11, 257–282 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chorley, A., Bench-Capon, T.: AGATHA: Automated Construction of Case Law Theories Through Heuristic Search. In: Proceedings of The Tenth International Conference on Artificial Intelligence and Law (ICAIL’05), pp. 45–54. ACM, New York (2005)

    Chapter  Google Scholar 

  9. Doyle, J.: “Rational Belief Revision (Preliminary Report),”. In: Allen, J., Fikes, R., Sandewall, E. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference (KR’91), pp. 163–174. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  10. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and n-person games. Artificial Intelligence 77(2), 321–357 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gärdenfors, P.: Knowledge in Flux: Modeling the Dynamics of Epistemic States. MIT Press, Cambridge (1988)

    Google Scholar 

  12. Gärdenfors, P.: The dynamics of belief systems: Foundations vs. coherence theories. Revue International de Philosopie 44, 24–46 (1990)

    Google Scholar 

  13. Geffner, H., Pearl, J.: Conditional Entailment: Bridging Two Approaches to Default Reasoning. Artificial Intelligence 53(2-3), 209–244 (1992)

    Article  MathSciNet  Google Scholar 

  14. Giusto, P.D., Governatori, G.: A New Approach to Base Revision. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol. 1695, pp. 327–341. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  15. Gordon, T.F.: The Pleadings Game. An Artificial Intelligence Model of Procedural Justice. Kluwer Academic Publishers, Dordrecht (1995)

    Google Scholar 

  16. Grove, A.: Two modelings for theory change. Journal of Philosophical Logic 17, 157–170 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  17. Hage, J.C.: Reasoning With Rules. An Essay on Legal Reasoning and Its Underlying Logic. Kluwer Academic Publishers, Dordrecht (1997)

    Google Scholar 

  18. Hamfelt, A., Eriksson, J., Nilsson, J.F.: A Metalogical Formalization of Legal Argumentation as Game Trees with Defeasible Reasoning. In: Proceedings of The Tenth International Conference on Artificial Intelligence and Law (ICAIL’05), pp. 250–251. ACM, New York (2005)

    Chapter  Google Scholar 

  19. Hansson, S.O.: Taking belief bases seriously. In: Prawitz, D., Westerstahl, D. (eds.) Logic and Philosophy of Science in Uppsala, pp. 13–28. Kluwer Academic Publishers, Dordrecht (1994)

    Google Scholar 

  20. Hansson, S.O., Textbook, A.: A Textbook of Belief Dynamics. Theory Change and Database Updating. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  21. Hansson, S.O.: Coherentist Contraction. Journal of Philosophical Logic 29, 315–330 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Katsuno, H., Mendelzon, A.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52, 263–294 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  23. Klein, P., Warfield, T.A.: What price coherence? Analysis 54, 129–132 (1994)

    Article  Google Scholar 

  24. Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 41, 167–207 (1990)

    Article  MathSciNet  Google Scholar 

  25. Kraus, S., Sycara, K., Evenchik, A.: Reaching agreements through argumentation: a logical model and implementation. Artificial Intelligence 104, 1–69 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  26. Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artificial Intelligence 55, 1–60 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  27. Makinson, D.: General Patterns in Nonmonotonic Reasoning. In: Gabbay, D., Hogger, C.J., Robinson, J.A. (eds.) Nonmonotonic Reasoning and Uncertain Reasoning. Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 35–110. Oxford University Press, Oxford (1994)

    Google Scholar 

  28. Maranhão, J.: Refinement. A tool to deal with inconsistencies. In: Proceedings of The Eighth International Conference on Artificial Intelligence and Law (ICAIL’01), pp. 52–59. ACM, New York (2001)

    Google Scholar 

  29. Olsson, E.J.: Making Beliefs Coherent. Journal of Logic, Language, and Information 7, 143–163 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  30. Prakken, H.: Logical Tools for Modelling Legal Argument. A Study of Defeasible Reasoning in Law. Kluwer Academic Publishers, Dordrecht (1997)

    Google Scholar 

  31. Prakken, H.: A study of Accrual of Arguments, with Applications to Evidential Reasoning. In: Proceedings of The Tenth International Conference on Artificial Intelligence and Law (ICAIL’05), pp. 85–94. ACM, New York (2005)

    Chapter  Google Scholar 

  32. Prakken, H., Sartor, G.: A dialectical model of assessing conflicting arguments in legal reasoning. In: Artificial Intelligence and Law 4, pp. 331–368 (1996)

    Google Scholar 

  33. Prakken, H., Sartor, G.: The role of logic in computational models of legal argument: a critical survey. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 342–380. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  34. Prakken, H., Sartor, G.: The three faces of defeasibility in the law. Ratio Juris 17(1), 118–139 (2004)

    Article  Google Scholar 

  35. Rott, H.: Change, choice and inference: a study of belief revision and nonmonotonic reasoning. Oxford University Press, Oxford (2001)

    MATH  Google Scholar 

  36. Sartor, G.: Teleological Arguments and Theory-based Dialectics. Artificial Intelligence and Law 10, 95–112 (2002)

    Article  Google Scholar 

  37. Suzuki, Y., Tojo, S.: Additive Consolidation for Dialogue Game. In: Proceedings of The Tenth International Conference on Artificial Intelligence and Law (ICAIL’05), pp. 105–114. ACM, New York (2005)

    Chapter  Google Scholar 

  38. Suzuki, Y.: Additive Consolidation with Maximal Change. In: The 13th Workshop on Logic, Language, Information and Computation (WoLLIC’06) (to appear, 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Center for Trustworthy e-Society, Japan Advanced Institute of Science and Technology,  

    Yoshitaka Suzuki

Authors
  1. Yoshitaka Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Katsumi Inoue Ken Satoh Francesca Toni

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Suzuki, Y. (2007). Dialogue Game Tree with Nondeterministic Additive Consolidation. In: Inoue, K., Satoh, K., Toni, F. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2006. Lecture Notes in Computer Science(), vol 4371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69619-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69619-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69618-6

  • Online ISBN: 978-3-540-69619-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation