Argumentation in Multi-Agent Systems: Fifth International by Thomas L. van der Weide, Frank Dignum, John-Jules Ch. Meyer,

By Thomas L. van der Weide, Frank Dignum, John-Jules Ch. Meyer, Henry Prakken (auth.), Iyad Rahwan, Pavlos Moraitis (eds.)

During the decade Argumentation has been gaining importance

within Artificial

Intelligence in particular in multi agent platforms. Argumentation is a

powerful mechanism for modelling the inner reasoning of an agent.

It additionally offers instruments for analysing, designing and

implementing subtle different types of interplay between rational agents,

thus making vital contributions to the idea and perform of

multiagent dialogues.

Application domain names contain: nonmonotonic reasoning, criminal disputes,

business negotiation, hard work disputes, staff formation, scientific

inquiry, deliberative democracy, ontology reconciliation, risk

analysis, scheduling, and logistics.

This quantity provides the most recent advancements during this zone on the interface of

argumentation thought and multi agent platforms. the ten revised full

papers presented

together with three invited papers from the AAMAS 2008 convention have been carefully

reviewed and chosen from a number of submissions. The papers are equipped in

topical sections on argument-based reasoning, argumentation and

dialogue, to boot as

strategic and pragmatic issues.

Show description

Read Online or Download Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers PDF

Similar international books

Silver, Trade, and War: Spain and America in the Making of Early Modern Europe

The 250 years lined by means of Silver, alternate, and warfare marked the period of business capitalism, that bridge among overdue medieval and sleek occasions. Spain, peripheral to western Europe in 1500, produced American treasure in silver, which Spanish convoys bore from Portobelo and Veracruz at the Carribbean coast around the Atlantic to Spain in alternate for ecu items shipped from Sevilla (later, Cadiz).

Mobile Multimedia Communications: 7th International ICST Conference, MOBIMEDIA 2011, Cagliari, Italy, September 5-7, 2011, Revised Selected Papers

This e-book constitutes the completely refereed post-conference lawsuits of the seventh overseas ICST convention on cellular Multimedia Communications (MOBIMEDIA 2011) held in Cagliari, Italy, in September 2011 The 26 revised complete papers awarded have been rigorously chosen from a variety of submissions and concentration subject matters resembling caliber of expertise, dynamic spectrum entry instant networks within the television white areas, media streaming, cellular visible seek, photograph processing and transmission, and cellular functions.

Principles and Practice of Constraint Programming: 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings

This ebook constitutes the refereed lawsuits of the 14th foreign convention on ideas and perform of Constraint Programming, CP 2008, Sydney, Australia, September, 2008. The 27 revised complete papers and 23 revised brief papers awarded including 6 software papers and the abstracts of 1 invited lecture have been rigorously reviewed and chosen from a hundred and twenty submissions.

Additional info for Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers

Example text

An ALP-DP theory’s arguments are defined as sequences of chained rules. Some rules can express priorities on other rules, so that one can construct priority arguments whose claims determine preferences between other mutually attacking arguments. Preferences between priority arguments can also be established on the basis of other priority arguments. [14] then defines the justified arguments of a theory under Dung’s grounded semantics. In [12,13] the arguments and attacks defined by an ALP-DP theory instantiate an EAF, and an equivalence result with the EAF’s justified arguments (under the grounded semantics) is shown.

For instance, one may want that the two arguments α and β belong to the same stable extension. These constraints are generally expressed in terms of a propositional formula built from a language using A as an alphabet. Definition 4. ([9] – Constraints on arguments, Completion of a set of arguments) Let A be a set of arguments and LA be a propositional language defined using A as the set of propositional variables. C is a constraint on A iff C is a formula of LA . The completion of a set E ⊆ A is: E = {α | α ∈ E} ∪ {¬α | α ∈ A \ E}.

22 S. Modgil and M. Luck Δ1 S1 Δ2 A B A1 A2 A3 B1 B2 B3 C C1 C2 B B1 B2 A B S2 C Δ3 A Δ4 D D S3 B A B C E A C A1 A2 A3 B1 B2 B3 a) B4 b) Fig. 1. , (A, B),(B, A) ∈ R. {A} and {B} are the preferred extensions, and so neither argument is justified. We then have argument C claiming that A is preferred to B. Hence B does not successfully attack (defeat) A, but A does defeat B. , C attacks B’s attack on A (Δ2 in Figure 1a)) so that B’s attack on A does not succeed as a defeat. B’s attack on A is, as it were, cancelled out, and we are left with A defeating B.

Download PDF sample

Rated 4.26 of 5 – based on 20 votes