A Logic of Multiple-Valued Argumentation
Takehisa Takahashi,Hajime Sawamura +1 more
- pp 800-807
Reads0
Chats0
TLDR
This paper addresses ourselves to formalize an expressive logic of argumentation, called a Logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated Logic Programming (EALP).Abstract:
This paper provides a new departure from the traditional two-valued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a Logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated Logic Programming (EALP), and examine its logical properties in various ways. EALP allows us to represent different kinds of uncertainty such as vagueness and inconsistency (or paraconsistency) in terms of multi-valuedness, and incompleteness with the help of default negation. LMA is a full-dress logic of argumentation in which agents can argue with other contenders, using multiple-valued knowledge base in terms of EALP.read more
Citations
More filters
Book
Argumentation in Multi-Agent Systems
TL;DR: The feasibility of the approach is illustrated in an agent-based web linkage scenario, showing that its performance is comparable to that of simple proposal-based negotiation while accommodating much stricter constraints regarding “what can be said” like those used in argumentation.
Book ChapterDOI
A generalization of Dung's Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
TL;DR: In this paper, a generalization of the framework of Dung is proposed, which allows for sets of arguments to attack other arguments, and the semantics associated with the original framework are extended to this generalization, and all results in the paper by Dung have an equivalent in this more abstract framework.
Proceedings Article
Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles
TL;DR: This paper shows that the les and msc always exist and can be computed in polynomial time if the authors interpret cyclic definitions with greatest fixpoint semantics.
An argumentation semantics for logic programming with explicit negation
TL;DR: A simple framework for semantics of extended logic programming with explicit negation generalizing in a natural way the major approaches to semantics of normal logic programming.
Book ChapterDOI
Reasoning on the Web with Assumption-Based Argumentation
TL;DR: An overview of computational argumentation is provided, focusing on abstract argumentation and assumption-based argumentation, how they relate, as well as possible uses of the latter in Web contexts, and in particular the Semantic Web and Social Networks.
References
More filters
Journal ArticleDOI
Argument-based extended logic programming with defeasible priorities
Henry Prakken,Giovanni Sartor +1 more
TL;DR: A semantics and proof theory of a system for defeasible argumentation in a logic-programming language with both weak and strong negation, where an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks.
Journal ArticleDOI
Logical models of argument
TL;DR: The evolution of argumentation is traced from the mid-1980s to the present, as argument in embedded in different complex systems for real-world applications, and allow more formal work to be done in different areas, such as AI and Law, case-based reasoning and negotiation among intelligent agents.
Journal ArticleDOI
Theory of generalized annotated logic programming and its applications
Michael Kifer,V. S. Subrahmanian +1 more
TL;DR: A new semantics for multivalued logic programming is introduced: a model theory for Fitting's bilattice-based logic programming, which until now has not been characterized model-theoretically.
Book
Reasoning with Logic Programming
TL;DR: WFSX is a new semantics for extended logic programs that combines LP semantics with two negations, and autoepistemic logics to deal with contradiction.
Related Papers (5)
Argument-based extended logic programming with defeasible priorities
Henry Prakken,Giovanni Sartor +1 more