skip to main content
10.1145/1047788.1047791acmconferencesArticle/Chapter ViewAbstractPublication PagesicailConference Proceedingsconference-collections
Article

Prevarication in dispute protocols

Published:24 June 2003Publication History

ABSTRACT

Models of persuasion, argument, and reasoning motivated by analogies from Law and legal process are now accepted formalisms supporting multi-agent discourse in applications such as contract negotiation and resolving disputed claims. A number of non-classical Logics and proof theories within these have been proposed specifically to deal with the special circumstances wherein propositional theories are not best suited to address modeling issues arising in legal contexts: e.g. exceptions and defaults are treated in a variety of so-called non-monotonic logics; similarly concepts of credulous, cautious and sceptical belief have been developed, partly to reflect differing forms of 'burden of proof' that may apply in various judicial contexts. Our concern in this paper is to consider one aspect of legal argument that appears to have been largely neglected in existing work concerning agent discourse protocols - particularly so in the arenas of persuasion and dispute resolution - the use of legitimate procedural devices to defer 'undesirable' conclusions being finalised and the deployment of such techniques in seeking to have a decision over-ruled. Motivating our study is the contention that individual agents within an 'agent society' could (be programmed to) act in a 'non-cooperative' manner: thus, contesting policies/decisions accepted by other agents in the 'society' in order to improve some national 'individual' utility. Using Dung's argumentation framework, we present various settings in which the use of 'legitimate delay' can be rigorously modeled, formulate some natural decision questions respecting the existence and utility of 'prevaricatory tactics', and, finally, illustrate within a greatly simplified schema, how carefully-chosen devices may greatly increase the length of an apparently 'straightforward' dispute.

References

  1. A. Artikis, J. Pitt, and M. Sergot. Animated Specifications of Computational Societies In Proceedings of the first international joint conference on Autonomous agents and multiagent systems, pages 1053--1061. ACM Press, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. J. M. Bench-Capon. Specification and implementation of Toulmin dialogue game. In J. C. Hage et al., editor, Legal Knowledge Based Systems, pages 5--20. GNI, 1998.]]Google ScholarGoogle Scholar
  3. T. J. M. Bench-Capon, P. E. Dunne, and P. H. Leng. A dialogue game for dialectical interaction with expert systems. In Proc. 12th Annual Conference on Expert Systems and their applications, pages 105--113, 1992.]]Google ScholarGoogle Scholar
  4. C. Cayrol, S. Doutre, and J. Mengin. On decision problems related to the preferred semantics for argumentation frameworks. Technical report, I.R.I.T., Toulouse, (to appear, Jnl. of Logic and Computation), 2002.]]Google ScholarGoogle Scholar
  5. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170:209--244, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reason, logic programming, and N-person games. Artificial Intelligence, 77:321--357, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. E. Dunne and T.J.M. Bench-Capon. Two party immediate response disputes: Properties and efficiency. Technical Report ULCS-01--005, Dept. of Comp. Sci., Univ. of Liverpool, (to appear Artificial Intelligence, 2003)]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. E. Dunne and P. McBurney. Optimal Utterances in Dialogoue Protocols Technical report, ULCS-02-028, Dept. of Comp. Sci., Univ. of Liverpool, 2002. (to appear: Proc. Second International Joint. Conf. on Autonomous Agents and Multi-Aagent Systems, (AAMAS 2003), Melbourne, July 2003)]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. G. Fuller. The Day of St. Anthony's Fire. Hutchinson Publishing Group, London, 1969]]Google ScholarGoogle Scholar
  10. D. Gabbay and J. Woods. More on Non-Cooperation in Dialogue Logic Logic Jnl. of the IGPL, 9:305--323, 2001]]Google ScholarGoogle ScholarCross RefCross Ref
  11. T. F. Gordon. The Pleadings Game: An Artificial Intelligence Model of Procedural Justice. Kluwer Academic Publishers, Dordrecht, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Jakobovits. On the theory of argumentation frameworks. PhD thesis, Vrije Universiteit Brussels, April 2000.]]Google ScholarGoogle Scholar
  13. H. Jakobovits and D. Vermeir. Dialectic semantics for argumentation frameworks. In Proceedings of the Seventh International Conference on Artificial Intelligence and Law (ICAIL-99), ACM SIGART, pages 53--62, N. Y., June 1999. ACM Press.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. The Lawyer's Code of Professional Responsibility. New York State 2002]]Google ScholarGoogle Scholar
  15. A. R. Lodder. Dialaw: On legal justification and Dialogue Games. PhD thesis, Univ. of Maastricht, 1998.]]Google ScholarGoogle Scholar
  16. S. A. Matthews. Veto threats: rhetoric in a bargaining game The Quarterly Jnl. of Economics, May 1989, 347--369.]]Google ScholarGoogle Scholar
  17. P. McBurney and S. Parsons. Games that agents play: A formal framework for dialogues between autonomous agents. Journal of Logic, Language and Information, 11:315--334, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. P. McBurney, S. Parsons, and M. Wooldridge. Desiderata for agent argumentation protocols. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems, pages 402--409. ACM Press, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. When are two protocols the same? In M. P. Huget, F. Dignum and J. L. Koning, editors, Agent Communications Languages and Conversation Policies, Proc. AAMAS-02 Workshop, Bologna, Italy, 2002.]]Google ScholarGoogle Scholar
  20. S. Parsons, C. A. Sierra, and N. R. Jennings. Agents that reason and negotiate by arguing, Journal of Logic and Computation, 8(3):261--292, 1998.]]Google ScholarGoogle ScholarCross RefCross Ref
  21. H. Prakken. Logical Tools for Modelling Legal Argument. Kluwer Academic Publishers, 1997.]]Google ScholarGoogle ScholarCross RefCross Ref
  22. C. Reed. Dialogue frames in agent communications. In Y. Demazeau, editor, Proc. 3rd International Conference on Multi-agent systems (ICMAS-98), pages 246--253. IEEE Press, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Urquhart. The complexity of Gentzen systems for propositional logic. Theoretical Computer Science 66(1):87--97, 1989.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. G. Vreeswijk and H. Prakken. Credulous and sceptical argument games for preferred semantics. In Proceedings of JELIA '2000, The 7th European Workshop on Logic for Artificial Intelligence., pages 224--238, Berlin, 2000. Springer LNAI 1919, Springer Verlag.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. D. N. Walton and E. C. W. Krabbe. Committment in Dialogue: Basic Concepts of Interpersonal Reasoning. Univ. of New York Press, 1995.]]Google ScholarGoogle Scholar

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 '03: Proceedings of the 9th international conference on Artificial intelligence and law
    June 2003
    304 pages
    ISBN:1581137478
    DOI:10.1145/1047788
    • Conference Chair:
    • John Zeleznikow,
    • Program Chair:
    • Giovanni Sartor

    Copyright © 2003 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: 24 June 2003

    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