The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Well founded semantics for logic programs with explicit negation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A characterization of the partial stable models for disjunctive deductive databases
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Expressive power and complexity of partial models for disjunctive deductive databases
Theoretical Computer Science
Three-valued formalization of logic programming: is it needed?
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
On the partial semantics for disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
ICLP '94/NMELP '94 Selected papers from the Workshop on Non-Monotonic Extensions of Logic Programming
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Comparisons and computation of well-founded semantics for disjunctive logic programs
ACM Transactions on Computational Logic (TOCL)
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
Annals of Mathematics and Artificial Intelligence
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
Well-Founded and Partial Stable Semantics Logical Aspects
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Hyperequivalence of logic programs with respect to supported models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Relativized hyperequivalence of logic programs for modular programming
Theory and Practice of Logic Programming
A purely model-theoretic semantics for disjunctive logic programs with negation
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
On the logic and computation of partial equilibrium models
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In [4] a nonmonotonic formalism called partial equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in defining a class of minimal models, called partial equilibrium (p-equilibrium), inside a non-classical logic called HT2. In [4] it was shown that, on normal logic programs, p-equilibrium models coincide with Przymusinki’s partial stable (p-stable) models. This paper begins showing that this coincidence still holds for the more general class of disjunctive programs, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We also study here the problem of strong equivalence for various subclasses of p-equilibrium models, investigate transformation rules and nonmonotonic inference, and consider a reduction of PEL to equilibrium logic. In addition we examine the behaviour of PEL on nested logic programs and its complexity in the general case.