Semi-negative normal programs based on p-stable semantics
نویسندگان
چکیده
We introduce three different formats for normal programs with constraints. These forms help to simplify the search of p-stable models of the original program. In this way we further the study of the p-stable semantics. In this paper we indicate that the p-stable semantics for one of the normal forms proposed agrees with the Comp semantics.
منابع مشابه
P-stable models of strong kernel programs
Currently non-monotonic reasoning (NMR) is a promising approach to model features of common sense reasoning. In order to formalize NMR the research community has applied monotonic logics. The present paper furthers the study of one of the semantics useful in this formalization called p-stable. We introduce three different formats for normal programs: Negative normal programs, Restricted negativ...
متن کاملPossibilistic and Extended Logic Programs
Based on our earlier work on partial logics and extended logic programs Wag91, Wag94, HJW96], and on the possibilistic logic of DLP94], we deene a compositional possibilistic rst-order logic with two kinds of negation as the logical basis of semi-possibilistic and possibilis-tic logic programs. We show that in the same way as the minimal model semantics of relational databases can be reened to ...
متن کاملAn Abductive Framework for Generalized Logic Programs: Preliminary Report
We present an abductive semantics for generalized propositional logic programs which deenes the meaning of a logic program in terms of its extensions. This approach extends the stable model semantics for normal logic programs in a natural way. The new semantics is equivalent to stable semantics for a logic program P whenever P is normal and has a stable model. The existence of extensions is gua...
متن کاملWell-Founded Inference and 3-Valued Logics
We deene a simple logical semantics based on minimal models in Lukasiewicz's 3-valued logic, L 3. On normal logic programs it is equivalent to the well-founded semantics (WFS), and on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusinski's 3-valued stable semantics. One advantage is that it is char-acterised by simple conditions on mo...
متن کاملAn Abductive Framework for General Logic Programs and other Nonmonotonic Systems
We present an abductive semantics for general propositional logic programs which defines the meaning of a logic program in terms of its extensions. This approach extends the stable model semantics for normal logic programs in a natural way. The new semantics is equivalent to stable semantics for a logic program P whenever P is normal and has a stable model. The abductive semantics can also be a...
متن کامل