Properties and Complexity of Some Formal Inter-agent Dialogues

DOI10.1093/LOGCOM/13.3.347zbMATH Open1038.03037OpenAlexW1979394595MaRDI QIDQ4444965FDOQ4444965

M. J. 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

Recommendations

• Argumentation in Multi-Agent Systems
• Argumentation Based Modelling of Embedded Agent Dialogues
• On the Relevance of Utterances in Formal Inter-agent Dialogues
• Towards an Extensible Argumentation System
• How Agents Alter Their Beliefs After an Argumentation-Based Dialogue

zbMATH Keywords

inconsistent knowledge baseinter-agent dialogue

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Cited In (24)

• Augmenting tractable fragments of abstract argumentation
• A Persuasion Dialog for Gaining Access to Information
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
• Argumentation in artificial intelligence
• A characterization of types of support between structured arguments and their relationship with support in abstract argumentation
• Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems
• Complexity Classifications for Logic-Based Argumentation
• Algorithms for generating arguments and counterarguments in propositional logic
• Approximating agreements in formal argumentation dialogues1
• A general framework for sound assumption-based argumentation dialogues
• Logical limits of abstract argumentation frameworks
• Towards Verification of Dialogue Protocols: A Mathematical Model
• A Formal General Setting for Dialogue Protocols
• An executable specification of a formal argumentation protocol
• New Types of Inter-agent Dialogues
• Backdoors to Satisfaction
• The carneades model of argument and burden of proof
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
• Algorithms and complexity results for persuasive argumentation
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• Encoding deductive argumentation in quantified Boolean formulae
• Argumentation Framework Based on Evidence Theory
• Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework
• How to deal with unbelievable assertions

This page was built for publication: Properties and Complexity of Some Formal Inter-agent Dialogues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4444965)