Extended stable semantics for normal and disjunctive programs
Logic programming
Logic programs with classical negation
Logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
Well founded semantics for logic programs with explicit negation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
An argumentation semantics for logic programming with explicit negation
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Scenario semantics of extended logic programs
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
KQML as an agent communication language
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Abstract argumentation systems
Artificial Intelligence
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Reaching agreements through argumentation: a logical model and implementation
Artificial Intelligence
Dialectic semantics for argumentation frameworks
ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
ACM Computing Surveys (CSUR)
Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation
Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation
A study on the termination of negotiation dialogues
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Reasoning with Logic Programming
Reasoning with Logic Programming
Relating defeasible and normal logic programming through transformation properties
Theoretical Computer Science
Argumentative and Cooperative Multi-agent System for Extended Logic Programming
SBIA '98 Proceedings of the 14th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
REVISE: Logic Programming and Diagnosis
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A Framework for Argumentation-Based Negotiation
ATAL '97 Proceedings of the 4th International Workshop on Intelligent Agents IV, Agent Theories, Architectures, and Languages
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
Skepticism relations for comparing argumentation semantics
International Journal of Approximate Reasoning
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Computing abductive argumentation in answer set programming
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Preference-Based argumentation handling dynamic preferences built on prioritized logic programming
PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
Preference-Based argumentation capturing prioritized logic programming
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
Hi-index | 0.00 |
Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise) and rebuts (attack to an argument's conclusion). In this paper, we formulate a variety of notions of attack for extended logic programs from combinations of undercuts and rebuts and define a general hierarchy of argumentation semantics parameterised by the notions of attack chosen by proponent and opponent. We prove the equivalence and subset relationships between the semantics and examine some essential properties concerning consistency and the coherence principle, which relates default negation and explicit negation. Most significantly, we place existing semantics put forward in the literature in our hierarchy and identify a particular argumentation semantics for which we prove equivalence to the paraconsistent well-founded semantics with explicit negation, WFSX$_p$. Finally, we present a general proof theory, based on dialogue trees, and show that it is sound and complete with respect to the argumentation semantics.