Argument-based extended logic programming with defeasible priorities
作者:
Henry Prakken,
Giovanni Sartor,
期刊:
Journal of Applied Non-Classical Logics
(Taylor Available online 1997)
卷期:
Volume 7,
issue 1-2
页码: 25-75
ISSN:1166-3081
年代: 1997
DOI:10.1080/11663081.1997.10510900
出版商: Taylor & Francis Group
关键词: argumentation;nonmonotonic reasoning;extended logic programming;legal reasoning;defeasible priorities
数据来源: Taylor
摘要:
Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logic-programming language with both weak and strong negation, conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled. The semantics of the system is given with a fixpoint definition, while its proof theory is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument: an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks.
点击下载:
PDF (2535KB)
返 回