TY - JOUR
T1 - The propositional normal default logic and the finite/infinite injury priority method
AU - Li, Wei
AU - Sui, Yuefei
AU - Wang, Yuhui
N1 - Publisher Copyright:
© 2017, Science China Press and Springer-Verlag Berlin Heidelberg.
PY - 2017/9/1
Y1 - 2017/9/1
N2 - In propositional normal default logic, given a default theory (Δ,D) and a well-defined ordering of D, there is a method to construct an extension of (Δ,D) without any injury. To construct a strong extension of (Δ,D) given a well-defined ordering of D, there may be finite injuries for a default δ ∈ D. With approximation deduction ⊢s in propositional logic, we will show that to construct an extension of (Δ,D) under a given welldefined ordering of D, there may be infinite injuries for some default δ ∈ D.
AB - In propositional normal default logic, given a default theory (Δ,D) and a well-defined ordering of D, there is a method to construct an extension of (Δ,D) without any injury. To construct a strong extension of (Δ,D) given a well-defined ordering of D, there may be finite injuries for a default δ ∈ D. With approximation deduction ⊢s in propositional logic, we will show that to construct an extension of (Δ,D) under a given welldefined ordering of D, there may be infinite injuries for some default δ ∈ D.
KW - default
KW - extension
KW - finite/infinite injury priority method
KW - recursively enumerablesets
KW - strong extension
UR - https://www.scopus.com/pages/publications/85018250216
U2 - 10.1007/s11432-016-0551-5
DO - 10.1007/s11432-016-0551-5
M3 - 文章
AN - SCOPUS:85018250216
SN - 1674-733X
VL - 60
JO - Science China Information Sciences
JF - Science China Information Sciences
IS - 9
M1 - 092107
ER -