P.E. Dunne and T.J.M. Bench-Capon. `Two party immediate response disputes: properties and efficiency', Artificial Intelligence, 149, 221--250, (2003).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....questions for dialogue game protocols for information seeking, inquiry and persuasion between agents with di erent degrees of scepticism regarding the information they receive. Dunne and McBurney [17] consider the rst question for general persuasion dialogue protocols, while Dunne and Bench Capon [15] consider the third question for a speci c two party, persuasion dialogue protocol. In addition, there has been related work by some of these authors, looking at the computational complexity of termination of general negotiation mechanisms (not only those involving dialogue game protocols) 69] ....

P. E. Dunne and T. J. M. Bench-Capon. Two party immediate response disputes: properties and eciency. Technical Report ULCS-01-005, Department of Computer Science, University of Liverpool, Liverpool, UK, 2001. 14

No context found.

P.E. Dunne and T.J.M. Bench-Capon. `Two party immediate response disputes: properties and efficiency', Artificial Intelligence, 149, 221--250, (2003).

No context found.

P.E. Dunne and T.J.M. Bench-Capon. Two party immediate response disputes: Properties and efficiency. Artificial Intelligence, 149(2):221--250, 2003.

No context found.

P.E. Dunne and T.J.M. Bench-Capon (2003). Two party immediate response disputes: Properties and Efficiency. Artificial Intelligence, Vol 149 No 2 pp 22150.

No context found.

P.E. Dunne and T.J.M. Bench-Capon, `Two party immediate response disputes: properties and efficiency', Artificial Intelligence, 149, 221--250, (2003).

.... [26, 28] and formalisms for describing and reasoning about protocols, e.g. 19, 21, 22] Among the many applications that have been considered are bargaining and negotiation processes, e.g. 14, 23, 17] legal reasoning, e.g. 13, 16, 1, 2, 25] persuasion in argumentation and other systems, e.g. [27, 11, 3, 8], and inquiry and information discovery, e.g. 18, 20] The collection of articles presented in [7] gives an an overview of various perspectives relating to multiagent discourse. While we present a general formal model for dialogue protocols below, informally we may view the core elements of such ....

....less well suited to fields such as persuasion, information gathering, etc. We may treat a persuasion protocol as one in which an agent seeks to convince others of the validity of a given proposition, and interpreting such persuasion protocols as proof mechanisms a view used in, among others, [27, 11] we contend that a more appropriate sense of an utterance being optimal , is that it allows the discussion to be concluded as quickly as possible . There are several reasons why such a measure is appropriate with respect to persuasion protocols. In practice, discussions in which one agent ....

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)

.... as [28, 26] and formalisms for describing and reasoning about protocols, e.g. 19, 22, 21] Among the many applications that have been considered are bargaining and negotiation processes, e.g. 23, 17] legal reasoning, e.g. 14, 16, 1, 2, 25] persuasion in argumentation and other systems, e.g. [27, 11, 12, 3, 7], and inquiry and information discovery, e.g. 18, 20] While we present a general formal model for dialogue protocols below, informally we may view the core elements of such as comprising a description of the locution types for the protocol ( what participants can say ) the topics of ....

....less well suited to fields such as persuasion, information gathering, etc. We may treat a persuasion protocol as one in which an agent seeks to convince others of the validity of a given proposition, and interpreting such persuasion protocols as proof mechanisms a view used in, among others, [27, 12, 11] we contend that a more appropriate sense of an utterance being optimal , is that it allows the discussion to be concluded as quickly as possible Concentrating on persuasion protocols we formulate the optimal utterance problem and establish lower bounds on its complexity. In the next ....

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, (submitted), October 2001.

....in legal reasoning[2, 3, 9, 12, 18] In [10, 11] dialogue formulations of argumentation in the setting of Dung s argumentation frameworks[6] are considered. Dung s formalism also underpins the credulous reasoning dialogue game tpi dispute advanced in [21] and extensively analysed in [7]. In particular we wish to consider strategies that seek to challenge positions seen as unfavourable in such a way that the process of negotiation and arbitration continues until such a time as one party is satis ed with an arbitrated decision or has no option but to accept the current ....

....argument put forward by P : in seeking to prolong the dispute, C tries to select attacks that present the greatest scope for P to make a mistake. Thus we have the following elements: 1. An argument system H(X ; A) and argument x 2 X . A full formal semantics for tpi disputes is given in [7]: this employs an optimisation to the form in [21] that has, independently, been noted by [4] This is proved in [7] formally if there is an admissible set of size k containing x then there is a tpi dispute won by P of length 2k 1 proving this. 2. A partial tpi dispute = a(x) 2 2k ....

[Article contains additional citation context not shown here]

P.E. Dunne and T.J.M. Bench-Capon. Two party immediate response disputes: Properties and eciency. Technical Report ULCS-01-005, Dept. of Comp. Sci., Univ. of Liverpool, (submitted), October 2001.

....problem SE(H) 6= is NP complete (notice that this is the special case of STAB EXT when S = Dunne and Bench Capon [7] proved that deciding coherence is (p) 2 complete, deducing the same complexity classification for sceptical acceptance as a consequence. Related work, described in [8], has shown that the sound and complete reasoning method for credulous argumentation introduced by Vreeswijk and Prakken [12] in which reasoning proceeds via a dialogue game requires an exponential number of moves to resolve some disputes. Suppose one is given a specific argument system H(X ; A) ....

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, (submitted), October 2001.

....disputed. It may be noted that this view makes apparent a computational difficulty arising in attempting to define similar Sceptical Games applicable to incoherent systems: the shortest certificate that CA(H; x) holds, is the size of the smallest admissible set containing x it is shown in [9] that there is always a strategy for D that can achieve this; it is also shown in [9] that TPI disputes won by C, i.e. certificates that :CA(H; x) can require exponentially many (in jX j) moves. 6 If we consider a sound and complete dialogue game for sceptical reasoning, then the moves of a ....

.... arising in attempting to define similar Sceptical Games applicable to incoherent systems: the shortest certificate that CA(H; x) holds, is the size of the smallest admissible set containing x it is shown in [9] that there is always a strategy for D that can achieve this; it is also shown in [9] that TPI disputes won by C, i.e. certificates that :CA(H; x) can require exponentially many (in jX j) moves. 6 If we consider a sound and complete dialogue game for sceptical reasoning, then the moves of a dispute won by D constitute a certificate of membership in a (p) 2 complete ....

[Article contains additional citation context not shown here]

P.E. Dunne and T.J.M. Bench-Capon. Two party immediate response disputes: Properties and efficiency. Technical report, Dept. of Comp. Sci., Univ. of Liverpool, http://www.csc.liv.ac.uk/ped/papers/tpi.ps (submitted), October 2001.

....Immediate Response Disputes (TPI disputes) One important advantage of dialogue style mechanisms is that the reasoning process by which a given argument is defended becomes transparent: hence the game protocol provides a formal semantics yielding proofs of acceptability and non acceptability. In [5] the concept of dispute complexity was introduced in order to study the efficiency of TPI disputes in terms of the following question: given a dispute instance i.e. an argument system H(X ; A) and argument x 2 X , how many moves may be needed to settle a dispute in both the cases when x is ....

.... of TPI disputes in terms of the following question: given a dispute instance i.e. an argument system H(X ; A) and argument x 2 X , how many moves may be needed to settle a dispute in both the cases when x is credulously accepted and when it is not For the case that x is credulously accepted, [5] prove that the minimum number of moves required is the size of the smallest admissible set containing x and that, furthermore, a dispute instance attaining this bound exists (of course, constructing such a minimal dispute is another issue) For the case when an argument is inadmissible, i.e. not ....

[Article contains additional citation context not shown here]

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, (submitted), October 2001.

....disputed. It may be noted that this view makes apparent a computational difficulty arising in attempting to define similar Sceptical Games applicable to incoherent systems: the shortest certificate that CA(H; x) holds, is the size of the smallest admissible set containing x it is shown in [9] that there is always a strategy for D that can achieve this; it is also shown in [9] that TPI disputes won by C, i.e. certificates that :CA(H; x) can require exponentially many (in jX j) moves. 6 If we consider a sound and complete dialogue game for sceptical reasoning, then the moves of a ....

.... arising in attempting to define similar Sceptical Games applicable to incoherent systems: the shortest certificate that CA(H; x) holds, is the size of the smallest admissible set containing x it is shown in [9] that there is always a strategy for D that can achieve this; it is also shown in [9] that TPI disputes won by C, i.e. certificates that :CA(H; x) can require exponentially many (in jX j) moves. 6 If we consider a sound and complete dialogue game for sceptical reasoning, then the moves of a dispute won by D constitute a certificate of membership in a (p) 2 complete ....

[Article contains additional citation context not shown here]

P.E. Dunne and T.J.M. Bench-Capon. Two party immediate response disputes: Properties and efficiency. Technical report, Dept. of Comp. Sci., Univ. of Liverpool, http://www.csc.liv.ac.uk/ped/papers/tpi.ps (submitted), October 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC