Abstract
The nonmonotonic formalism of partial equilibrium logic (PEL) has recently been proposed as a logical foundation for the partial stable and well-founded semantics of logic programs [1,2]. We study certain logical properties of PEL and some techniques to compute partial equilibrium models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cabalar, P., Odintsov, S., Pearce, D.: Logical Foundations of Well-Founded Semantics. In: Proceedings KR 2006, pp. 25–35. AAAI, Menlo Park (2006)
Cabalar, P., Odintsov, S., Pearce, D.J., Valverde, A.: Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS (LNAI), vol. 4079, pp. 346–360. Springer, Heidelberg (to appear, 2006)
Erdogan, S.T., Lifschitz, V.: Definitions in Answer Set Programming. In: Lifschitz, V., Niemela, I. (eds.) Proc. ICLP 2004, vol. 2923, pp. 114–126. Springer, Heidelberg (2004)
Hähnle, R.: Automated Deduction in Multiple-Valued Logics. International Series of Monographs on Computer Science, vol. 10. Oxford University Press, Oxford (1994)
Lifschitz, V., Turner, H.: Splitting a Logic Program. In: van Hentenryck, P. (ed.) Proceedings ICLP 1994, pp. 23–37. MIT Press, Cambridge (1994)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)
Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25(3-4), 369–389 (1999)
Pearce, D.: A new logical characterisation of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol. 1216, pp. 57–70. Springer, Heidelberg (1997)
Pearce, D.: Equilibrium Logic. Ann. Math. & Artificial Int. (to appear, 2006)
Pearce, D., de Guzmán, I.P., Valverde, A.: A tableau calculus for equilibrium entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS (LNAI), vol. 1847, pp. 352–367. Springer, Heidelberg (2000)
Pearce, D.J., Valverde, A.: Uniform equivalence for equilibrium logic and logic programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 194–206. Springer, Heidelberg (2003)
Przymusinski, T.: Stable semantics for disjunctive programs. New Generation Computing 9, 401–424 (1991)
Przymusinski, T.: Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence 12, 141–187 (1994)
Routley, R., Routley, V.: The Semantics of First Degree Entailment. Noûs 6, 335–359 (1972)
Vakarelov, D.: Notes on constructive logic with strong negation. Studia Logica 36, 89–107 (1977)
van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cabalar, P., Odintsov, S., Pearce, D., Valverde, A. (2006). On the Logic and Computation of Partial Equilibrium Models. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds) Logics in Artificial Intelligence. JELIA 2006. Lecture Notes in Computer Science(), vol 4160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11853886_9
Download citation
DOI: https://doi.org/10.1007/11853886_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39625-3
Online ISBN: 978-3-540-39627-7
eBook Packages: Computer ScienceComputer Science (R0)