3965
2010
eng
conferenceobject
Gesellschaft für Logische Programmierung e.V.
0
2010-03-04
--
--
A paraconsistent semantics for generalized logic programs
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].
urn:nbn:de:kobv:517-opus-41496
4149
Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 81 - 94
Keine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht
Heinrich Herre
Axel Hummel
eng
uncontrolled
paraconsistency
eng
uncontrolled
generalized logic programs
eng
uncontrolled
multi-valued logic
Datenverarbeitung; Informatik
open_access
Theory of Logic Programming
Extern
Universität Potsdam
https://publishup.uni-potsdam.de/files/3965/wlp09_S81_94.pdf
3966
2010
eng
conferenceobject
Gesellschaft für Logische Programmierung e.V.
0
2010-03-04
--
--
Stationary generated models of generalized logic programs
The interest in extensions of the logic programming paradigm beyond the class of normal logic programs is motivated by the need of an adequate representation and processing of knowledge. One of the most difficult problems in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the ‘intended’ partial models of generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [Prz91]. The presented preference criterion defines a partial model of a generalized logic program as intended if it is generated by a stationary chain. It turns out that the stationary generated models coincide with the stationary models on the class of normal logic programs. The general wellfounded semantics of such a program is defined as the set-theoretical intersection of its stationary generated models. For normal logic programs the general wellfounded semantics equals the wellfounded semantics.
urn:nbn:de:kobv:517-opus-41501
4150
Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 95 - 108
Keine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht
Heinrich Herre
Axel Hummel
eng
uncontrolled
extensions of logic programs
eng
uncontrolled
semantics
eng
uncontrolled
knowledge representation
Datenverarbeitung; Informatik
open_access
Theory of Logic Programming
Extern
Universität Potsdam
https://publishup.uni-potsdam.de/files/3966/wlp09_S95_108.pdf