Analyzing the structure of argumentative discourse
Computational Linguistics
Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
Semantical considerations on nonmonotonic logic
Readings in nonmonotonic reasoning
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Signed data dependencies in logic programs
Journal of Logic Programming
Completed logic programs and their consistency
Journal of Logic Programming
Artificial Intelligence - Special issue on knowledge representation
Cumulative default logic: in defense of nonmonotonic inference rules
Artificial Intelligence
A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
On the relations between stable and well-founded semantics of logic programs
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
An argumentation semantics for logic programming with explicit negation
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
An assumption-based framework for non-monotonic reasoning
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reasoning with Incomplete Information
Reasoning with Incomplete Information
A clash of intuitions: the current state of nonmonotonic multiple inheritance systems
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
From logic to dialectics in legal argument
ICAIL '95 Proceedings of the 5th international conference on Artificial intelligence and law
Argumentation and Qualitative Decision Making
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Argumentation and Qualitative Probabilistic Reasoning Using the Kappa Calculus
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Translating the Japanese Presupposed Ultimate Fact Theory into Logic Programming
Proceedings of the 2009 conference on Legal Knowledge and Information Systems: JURIX 2009: The Twenty-Second Annual Conference
On defense strength of blocking defeaters in admissible sets
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Pitfalls in Practical Open Multi Agent Argumentation Systems: Malicious Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Argumentation-based fault diagnosis for home networks
Proceedings of the 2nd ACM SIGCOMM workshop on Home networks
On the acceptability of arguments in preference-based argumentation
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Progressive defeat paths in abstract argumentation frameworks
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Open texture and argumentation: what makes an argument persuasive?
Logic Programs, Norms and Action
Irrationality in persuasive argumentation
Logic Programs, Norms and Action
An argumentation framework for non-monotonic reasoning in description logic
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
| Hi-index | 0.00 |
The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments is precisely defined. We show that logic programming and nonmonotonic reasoning in AI are different forms of argumentation. We show that argumentation can be viewed as a special form of logic programming with negation as failure. This result introduces a general method for generating metainterpreters for argumentation systems.