Properties and Complexity of Some Formal Inter-agent Dialogues
From MaRDI portal
Publication:4444965
DOI10.1093/logcom/13.3.347zbMath1038.03037OpenAlexW1979394595MaRDI QIDQ4444965
Michael Wooldridge, Leila Amgoud, Simon Parsons
Publication date: 28 January 2004
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/13.3.347
Related Items
Backdoors to Satisfaction, Logical limits of abstract argumentation frameworks, Complexity Classifications for Logic-Based Argumentation, Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework, Argumentation Framework Based on Evidence Theory, Instantiating abstract argumentation with classical logic arguments: postulates and properties, Algorithms and complexity results for persuasive argumentation, Algorithms for generating arguments and counterarguments in propositional logic, A general framework for sound assumption-based argumentation dialogues, A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments, A Persuasion Dialog for Gaining Access to Information, Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems, Approximating agreements in formal argumentation dialogues1, Computational complexity of flat and generic assumption-based argumentation, with and without probabilities, A characterization of types of support between structured arguments and their relationship with support in abstract argumentation, How to deal with unbelievable assertions, Augmenting tractable fragments of abstract argumentation, Towards Verification of Dialogue Protocols: A Mathematical Model, Argumentation in artificial intelligence, An executable specification of a formal argumentation protocol, The carneades model of argument and burden of proof, Encoding deductive argumentation in quantified Boolean formulae
