Computing Defeasible Meta-logic
File version
Accepted Manuscript (AM)
Author(s)
Governatori, G
Cristani, M
Sattar, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Virtual
License
Abstract
The use of meta-rules, i.e., rules whose content includes other rules, has been advocated to model policies and the notion of power in legal reasoning, where an agent has the power to create new norms affecting other agents. The use of Defeasible Logic (DL) to model meta-rules in the application area we just alluded to has been investigated, but not from a computational viewpoint. Our aim is to fill this gap by introducing a variant of DL, Defeasible Meta-Logic, to represent defeasible meta-theories, by proposing efficient algorithms to compute the (meta-)extensions of such theories, and by proving their computational complexity.
Journal Title
Conference Title
Lecture Notes in Computer Science
Book Title
Edition
Volume
12678
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Item Access Status
Note
Access the data
Related item(s)
Subject
Artificial intelligence
Information systems
Persistent link to this record
Citation
Olivieri, F; Governatori, G; Cristani, M; Sattar, A, Computing Defeasible Meta-logic, Lecture Notes in Computer Science, 2021, 12678, pp. 69-84