Preference-Based argumentation handling dynamic preferences built on prioritized logic programming

Authors:
Toshiko Wakaki
Affiliations:
Shibaura Institute of Technology, Saitama-city, Saitama, Japan
Venue:
PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
Year:
2011

Citing 14
Cited 0

An argumentation semantics for logic programming with explicit negation

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Preferred answer sets for extended logic programs

Artificial Intelligence
Prioritized logic programming and its application to commonsense reasoning

Artificial Intelligence
A Reasoning Model Based on the Production of Acceptable Arguments

Annals of Mathematics and Artificial Intelligence
Computing preferred answer sets by meta-interpretation in Answer Set Programming

Theory and Practice of Logic Programming
A framework for compiling preferences in logic programs

Theory and Practice of Logic Programming
A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics

Theory and Practice of Logic Programming
On the evaluation of argumentation formalisms

Artificial Intelligence
Reasoning about preferences in argumentation frameworks

Artificial Intelligence
Well-founded semantics for extended logic programs with dynamic preferences

Journal of Artificial Intelligence Research
Repairing preference-based argumentation frameworks

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reasoning about Preferences in Structured Extended Argumentation Frameworks

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Preference-Based argumentation capturing prioritized logic programming

ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

To treat dynamic preferences correctly is crucially required in the fields of argumentation as well as nonmonotonic reasoning. To meet such requirements, first, we propose a hierarchical Prioritized Logic Program (or a hierarchical PLP, for short), which enhances the formalism of Sakama and Inoue's PLP so that it can represent and reason about dynamic preferences. Second, using such a hierarchical PLP as the underlying language, the proposed method defines the preference-based argumentation framework (called the dynamic PAF) built from it. This enables us to argue and reason about dynamic preferences in argumentation. Finally we show the interesting relationship between semantics of a hierarchical PLP given by preferred answer sets and semantics of the dynamic PAF given by ${\cal P}$-extensions.