Revising non-monotonic theories with sufficient and necessary conditions: the case of Defeasible Logic
File version
Version of Record (VoR)
Author(s)
Cristani, Matteo
Governatori, Guido
Pasetto, Luca
Rotolo, Antonino
Scannapieco, Simone
Tomazzoli, Claudio
Workneh, Tewabe Chekole
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Abstract
In the setting of Defeasible Logic, we deal with the problem of revising and contracting a non-monotonic theory while minimizing the number of rules to be removed from the theory itself. The process is based on the notions of a set of rules being necessary and sufficient in order to prove a claim. The substantial difference among classical and non-monotonic reasoning processes makes this issue significant in order to achieve the correct revision processes. We show that the process is however computationally hard, and can be solved in polynomial time on non-deterministic machines.
Journal Title
Journal of Logic and Computation
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© The Author(s) 2018. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permission@oup.com. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.
Item Access Status
Note
This publication has been entered in Griffith Research Online as an advance online version.
Access the data
Related item(s)
Subject
Persistent link to this record
Citation
Olivieri, F; Cristani, M; Governatori, G; Pasetto, L; Rotolo, A; Scannapieco, S; Tomazzoli, C; Workneh, TC, Revising non-monotonic theories with sufficient and necessary conditions: the case of Defeasible Logic, Journal of Logic and Computation, 2024