Logical Foundations of Well-Founded Semantics
نویسندگان
چکیده
We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The problem addressed is this: which (non-modal) logic can be considered adequate for well-founded semantics in the sense that its minimal models (appropriately defined) coincide with the partial stable models of a logic program? We approach this problem by identifying the HT 2 frames previously proposed by Cabalar to capture WFS as structures of a kind used by Došen to characterise a family of logics weaker than intuitionistic and minimal logic. We define a notion of minimal, total HT 2 model which we call partial equilibrium model. Since for normal logic programs these models coincide with partial stable models, we propose the resulting partial equilibrium logic as a logical foundation for well-founded semantics. In addition we axiomatise the logic of HT -models and prove that it captures the strong equivalence of theories in partial equilibrium logic.
منابع مشابه
Ideal extensions as logical programming models
We show that the ideal sets of an argumentation framework can be characterized by two kinds of logical models: ideal models (2-valued logical models) and p-stable models (2-valued logical models). We also show that the maximal ideal set of an argumentation framework can be characterized by the well-founded+ model (a 3-valued logical model). These results argue for the logical foundations of the...
متن کاملA Logic for Reasoning about Well-Founded Semantics: Preliminary Report
The paper presents a preliminary solution to a long-standing problem in the foundations of well-founded semantics for logic programs. The problem addressed is this: which logic can be considered adequate for well-founded semantics (WFS) in the sense that its minimal models (appropriately defined) coincide with the partial stable models of a logic program? We approach this problem by identifying...
متن کاملA Logical Encoding of Well-Founded Semantics with Explicit Negation
In this work we revisit a previously obtained logical characterization of Well-Founded Semantics (WFS) and show now its application to Alferes and Pereira’s WFS variant (WFSX) for programs with explicit negation. In a previous work, we presented a full logical treatment of program connectives by interpreting them in an intermediate logic (we called two-dimensional here-and-there, HT ). This log...
متن کامل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...
متن کاملCharacterizations and Implementation of Static Semantics of Disjunctive Programs
In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programs and Disjunctive Deductive Databases. While the semantics of non-disjunctive programs is fairly well understood and there exist several implementations of the best known semantics (well-founded semantics and stable semantics), the declarative and computational foundations of disjunctive p...
متن کامل