Argumentation Semantics for Defeasible Logics | Zendy

Guido Governatori | Zendy; Michael J. Maher | Zendy; Grigoris Antoniou | Zendy; David P. Billington | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Argumentation Semantics for Defeasible Logics

Author(s) -

Guido Governatori,

Michael J. Maher,

Grigoris Antoniou,

David P. Billington

Publication year - 2000

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/3-540-44533-1_7

Subject(s) - defeasible estate , computer science , argumentation theory , logic programming , defeasible reasoning , programming language , higher order logic , well founded semantics , non monotonic logic , philosophy of logic , theoretical computer science , semantics (computer science) , multimodal logic , axiomatic semantics , artificial intelligence , description logic , operational semantics , epistemology , denotational semantics , philosophy

Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically. Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation-based semantics for defeasible logic. Recently it has been shown that a family of approaches can be built around defeasible logic, in which different intuitions can be followed. In this paper we present an argumentation-based semantics for an ambiguity propagating logic, too. Further defeasible logics can be characterised in a similar way.Griffith Sciences, School of Information and Communication TechnologyNo Full Tex

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research