A system for defeasible argumentation, with defeasible priorities

Authors:
Henry Prakken;Giovanni Sartor
Affiliations:
Computer/Law Institute, Free University, Amsterdam;CIRFID, University of Bologna, Bologna and IDG, CNR, Firenze
Venue:
Artificial intelligence today
Year:
1999

Citing 11
Cited 4

A mathematical treatment of defeasible reasoning and its implementation

Artificial Intelligence
Conditional entailment: bridging two approaches to default reasoning

Artificial Intelligence
Well founded semantics for logic programs with explicit negation

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A design for reasoning with policies, precedents, and rationales

ICAIL '93 Proceedings of the 4th international conference on Artificial intelligence and law
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
Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Reasoning about priorities in default logic

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
The Pleadings Game: an exercise in computational dialectics

Artificial Intelligence and Law
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
On the relation between legal language and legal argument: assumptions, applicability and dynamic priorities

ICAIL '95 Proceedings of the 5th international conference on Artificial intelligence and law

Production Systems with Negation as Failure

IEEE Transactions on Knowledge and Data Engineering
Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Using methods of declarative logic programming for intelligent information agents

Theory and Practice of Logic Programming
Approximating operators and semantics for abstract dialectical frameworks

Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

Inspired by legal reasoning, this paper presents an argument-based system for defeasible reasoning, with a logic-programming-like language, and based on Dung's argumentation-theoretic approach to the semantics of logic programming. The language of the system has both weak and explicit negation, and conflicts between arguments are decided with the help of priorities on the rules. These priorities are not fixed, but are themselves defeasibly derived as conclusions within the system.