|
|
Eingang zum VolltextHome | Suche | Browsen |
|||||||||||||||||||||||||||||||||
|
Lizenz
Bitte beziehen Sie sich beim Zitieren dieses Dokumentes immer auf folgende URN: urn:nbn:de:kobv:517-opus-41496 URL: http://opus.kobv.de/ubp/volltexte/2010/4149/ Herre, Heinrich ; Hummel, Axel Gesellschaft für Logische Programmierung e.V.
A paraconsistent semantics for generalized logic programs
Kurzfassung auf EnglischWe 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].
| ||||||||||||||||||||||||||||||||||
|
Home | Leitlinien | Impressum | Haftungsausschluss | Statistik | Universitätsverlag | Universitätsbibliothek
| ||||||||||||||||||||||||||||||||||