Filtern
Volltext vorhanden
- ja (1)
Erscheinungsjahr
- 2010 (1) (entfernen)
Dokumenttyp
- Konferenzveröffentlichung (1) (entfernen)
Sprache
- Englisch (1) (entfernen)
Gehört zur Bibliographie
- nein (1)
Schlagworte
- generalized logic programs (1) (entfernen)
Institut
- Extern (1)
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].