Revising non-monotonic theories with sufficient and necessary conditions: the case of Defeasible Logic
Journal of Logic and Computation · 11.09.2025 · 35 (7)
DOI: 10.1093/logcom/exae044 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Logic and Computation, online erschienen am 06.09.2024. Verfasst von Francesco Olivieri und 7 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 61 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Olivieri, F., Cristani, M., Governatori, G., Pasetto, L., Rotolo, A., Scannapieco, S., Tomazzoli, C., & Workneh, T. C. (2025). Revising non-monotonic theories with sufficient and necessary conditions: the case of Defeasible Logic. Journal of Logic and Computation, 35(7). https://doi.org/10.1093/logcom/exae044
Vancouver
Olivieri F, Cristani M, Governatori G, Pasetto L, Rotolo A, Scannapieco S, et al. Revising non-monotonic theories with sufficient and necessary conditions: the case of Defeasible Logic. Journal of Logic and Computation. 2025;35(7). doi:10.1093/logcom/exae044
BibTeX
@article{Olivieri2025,
author = {Olivieri, Francesco and Cristani, Matteo and Governatori, Guido and Pasetto, Luca and Rotolo, Antonino and Scannapieco, Simone and Tomazzoli, Claudio and Workneh, Tewabe Chekole},
title = {Revising non-monotonic theories with sufficient and necessary conditions: the case of Defeasible Logic},
journal = {Journal of Logic and Computation},
year = {2025},
volume = {35},
number = {7},
doi = {10.1093/logcom/exae044}
}
EUVIMED