Work

A Paraconsistent Semantics for Generalized Logic Programs

Year: 2009
Type: article
Abstract: . We propose a paraconsistent declarative semantics of pos-sibly 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].
Institution: Leipzig University
Language: English
Open Access status: green
OpenAlex ID: W2186041165
FWCI:
Cites: 13
Cited by:
Related to: 10