TY  - CONF
A1  - Herre, Heinrich
A1  - Hummel, Axel
T1  - A paraconsistent semantics for generalized logic programs
N2  - We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].
KW  - paraconsistency
KW  - generalized logic programs
KW  - multi-valued logic
Y1  - 2010
UR  - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/3965
UR  - https://nbn-resolving.org/urn:nbn:de:kobv:517-opus-41496
ER  -