Argumentation in Multi-Agent Systems: Third International by Nicolas Maudet, Simon D. Parsons, Iyad Rahwan

By Nicolas Maudet, Simon D. Parsons, Iyad Rahwan

Argumentation presents instruments for designing, imposing and reading subtle different types of interplay between rational agents. It has made a high-quality contribution to the perform of multiagent dialogues. program domain names comprise: criminal disputes, company negotiation, exertions disputes, crew formation, medical inquiry, deliberative democracy, ontology reconciliation, chance research, scheduling, and logistics.

This ebook constitutes the completely refereed post-proceedings of the 3rd overseas Workshop on Argumentation in Multi-Agent platforms held in Hakodate, Japan, in may perhaps 2006 as an linked occasion of AAMAS 2006, the most overseas convention on self reliant brokers and multi-agent systems.

The quantity opens with an unique cutting-edge survey paper offering the present examine and delivering a entire and up to date assessment of this swiftly evolving sector. The eleven revised articles that stick with have been conscientiously reviewed and chosen from the main major workshop contributions, augmented with papers from the AAMAS 2006 major convention, in addition to from ECAI 2006, the biennial ecu convention on man made Intelligence.

Show description

Read Online or Download Argumentation in Multi-Agent Systems: Third International Workshop, ArgMAS 2006, Hakodate, Japan, May 8, 2006, Revised Selected and Invited Papers PDF

Best machine theory books

Process Algebra for Parallel and Distributed Processing

Collects the newest learn related to the appliance of approach Algebra to Computing Exploring cutting-edge functions, strategy Algebra for Parallel and dispensed Processing indicates how one formal approach to reasoning—process algebra—has develop into a strong device for fixing layout and implementation demanding situations of concurrent structures.

Essential Discrete Math for Computer Science

This publication introduces readers to the math of computing device technology and prepares them for the mathematics they're going to come upon in different university classes. It comprises functions which are particular to machine technology, is helping beginners to enhance reasoning abilities, and offers the elemental arithmetic priceless for machine scientists.

How Noble in Reason

Synthetic Intelligence has already pervaded our lives in such a lot of refined methods, yet how will people react to the construction of a totally sentient great machine: a hyper-intelligent mind and not using a physique who's as omniscient and omnipresent because the net itself? How will humans method anything that's distinguishable from a human in simple terms in its visual appeal?

Pristine Perspectives on Logic, Language, and Computation: ESSLLI 2012 and ESSLLI 2013 Student Sessions. Selected Papers

The ecu summer season university in common sense, Language and data (ESSLLI) is equipped each year by means of the organization for common sense, Language and knowledge (FoLLI) in several websites round Europe. the main target of ESSLLI is at the interface among linguistics, good judgment and computation. ESSLLI bargains foundational, introductory and complicated classes, in addition to workshops, overlaying a large choice of subject matters in the 3 components of curiosity: Language and Computation, Language and common sense, and good judgment and Computation.

Extra info for Argumentation in Multi-Agent Systems: Third International Workshop, ArgMAS 2006, Hakodate, Japan, May 8, 2006, Revised Selected and Invited Papers

Example text

Definition 15 (acceptable and justified argument [4]). Suppose Arg1 ∈ Args and S ⊆ Args. Then Arg1 is acceptable wrt. S if for every Arg2 ∈ Args such that (Arg2 , Arg1 ) ∈ d there exists Arg3 ∈ S such that (Arg3 , Arg2 ) ∈ su. The function FArgs,d/su mapping from P(Args) to P(Args) is defined by FArgs,d/su (S) = {Arg ∈ Args | Arg is acceptable wrt. S}. We denote a least fixpoint of FArgs,d/su by JArgs,d/su . An argument Arg is justified if Arg ∈ Jd/su ; an argument is overruled if it is attacked by a justified argument; and an argument is defensible if it is neither justified nor overruled.

In our framework, a counterargument consists of a justified prediction Aj , P, S , D generated by an agent Aj with the intention to rebut an argument α generated by another agent Ai , that endorses a different solution class than α for the problem at hand and justifies this with a justification D . In the example depicted in Figure 1, if an agent generates the argument α = Ai , P, Walk, (Cars crossing = no) , an agent that thinks that the correct solution is Stop might answer with the counterargument β = Aj , P, Stop, (Cars crossing = no ∧ Traffic light = red) , meaning that while it is true that there are no cars crossing, the traffic light is red, and thus the street cannot be crossed.

The reason for adding one to the numerator and 2 to the 42 S. Onta˜ no ´n and E. Plaza a) b) α c) α + + β β - + α + β - ? ? P P P α = A1, P, +, D1 α = A1, P, +, D1 α = A1, P, +, D1 β = A2, P, −, D2 β = A2, P, +, D2 β = A2, P, −, D2 Fig. 3. Relation between arguments denominator is the Laplace correction to estimate probabilities. This prevents assigning excessively high confidences to justified predictions whose confidence has been computed using a small number of cases (in this way, a prediction endorsed by 2 cases and with no counterexamples has a lower confidence than a prediction endorsed by 10 cases with no counterexamples).

Download PDF sample

Rated 4.29 of 5 – based on 25 votes