冒失
发表于 2025-4-2 22:47:36
The Hardness of Revising Defeasible Preferencesionships among elements. Lastly, an ordering among the rules, in the form of a ., establishes the relative strength of rules. To revise a non-monotonic theory, we can change either one of these three elements. We prove that the problem of revising a non-monotonic theory by only changing the superiority relation is a NP-complete problem.
adroit
发表于 2025-4-3 01:50:58
http://reply.papertrans.cn/84/8321/832080/832080_72.png
sorbitol
发表于 2025-4-3 04:45:29
http://reply.papertrans.cn/84/8321/832080/832080_73.png