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].

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • Export XML

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Heinrich Herre, Axel Hummel
URN:urn:nbn:de:kobv:517-opus-41496
Document Type:Conference Proceeding
Language:English
Date of Publication (online):2010/03/04
Year of Completion:2010
Publishing Institution:Universität Potsdam
Contributing Corporation:Gesellschaft für Logische Programmierung e.V.
Release Date:2010/03/04
Tag:generalized logic programs; multi-valued logic; paraconsistency
Source:Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 81 - 94
Organizational units:Extern / Extern
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Collections:Universität Potsdam / Tagungen / Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Theory of Logic Programming
Licence (German):License LogoKeine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht