Collective Argumentation and Disjunctive Logic Programming

DOI10.1093/LOGCOM/13.3.405MaRDI QIDQ4444967zbMATH OpenOpenAlexFDO

Authors Alexander Bochman

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.405

zbMATH Keywords

artificial intelligenceknowledge representationlogic programming

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Review text

Disjunctive logic programming is a powerful general-purpose reasoning system for a broader range of problems in knowledge representation and artificial intelligence. The author presents an extension of the abstract argumentation theory for representing disjunctive logic programs and their semantics. The extension, called collective argumentation, is obtained by defining the attack relation directly among sets of arguments instead of individual arguments. In other words, a set of arguments ``collectively attacks another set of arguments in a way that is not reducible to attacks among particular arguments from these sets. The scope and importance of collective argumentation is much wider than logic programming. Collective argumentation is purported to describe reasoning situation in which the conflict between incompatible views or theories is global and cannot be reduced to particular claims made by these theories. The suggested collective argumentation theory is shown to be adequate for representing any ``well-behaved semantics for disjunctive logic programs. As an application of the general theory, the author considers two special kinds of collective argumentation: negative and positive argumentation. Negative argumentation will be shown to be especially appropriate for analysing stable sets of arguments. Positive argumentation also generalizes some known semantics suggested for logic programs.

Recommendations

• Argumentation-based abduction in disjunctive logic programming
• Abduction, argumentation and bi-disjunctive logic programs
• Argumentation in disjunctive logic programming
• Credolous argumentation with the disjunctive stable semantics
• Argumentation and answer set programming

Cited in

(17)

• Default logic generalized and simplified
• On the merging of Dung's argumentation systems
• Argumentation in disjunctive logic programming
• Credolous argumentation with the disjunctive stable semantics
• A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
• A logic of argumentation for specification and verification of abstract argumentation frameworks
• Meta-argumentation modelling. I: Methodology and techniques
• A comprehensive study of argumentation frameworks with sets of attacking arguments
• Coalitions of arguments: an approach with constraint programming
• Principles of Talmudic logic
• Towards an Extensible Argumentation System
• Norms in MAS: definitions and related concepts
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
• Coalitions of arguments: a tool for handling bipolar argumentation frameworks
• Collective argumentation with topological restrictions: the case of aggregating abstract argumentation frameworks
• Abstract argumentation and answer set programming: two faces of Nelson's logic
• Sets attacking sets in abstract argumentation -- redefining ABA^+ semantics via hyper argumentation frameworks

This page was built for publication: Collective Argumentation and Disjunctive Logic Programming

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