Abstract
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different methods of approximation and obtain results on the relationship between them. Since general logic programs with single literals as heads are equivalent to revision programs, we obtain results on approximations of justified revisions of databases by revision programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bondarenko, A., Toni, F., Kowalski, R.A.: An assumption-based framework for non-monotonic reasoning. In: Nerode, A., Pereira, L. (eds.) Logic programming and non-monotonic reasoning, Lisbon, pp. 171–189. MIT Press, Cambridge (1993)
Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Proceedings of the 5th International Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Lifschitz, V.: Foundations of logic programming. In: Principles of Knowledge Representation, pp. 69–127. CSLI Publications, Stanford (1996)
Lifschitz, V., Woo, T.Y.C.: Answer sets in general nonmonotonic reasoning. In: Proceedings of the 3rd international conference on principles of knowledge representation and reasoning, KR 1992, pp. 603–614. Morgan Kaufmann, San Mateo (1992)
Marek, V.W., Pivkina, I., Truszczyński, M.: Revision programming = logic programming + integrity constraints. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 73–89. Springer, Heidelberg (1999)
Marek, V.W., Pivkina, I., Truszczyński, M.: Annotated revision programs. Artificial Intelligence Journal 138, 149–180 (2002)
Marek, W., Truszczyński, M.: Revision programming. Theoretical Computer Science 190(2), 241–277 (1998)
Pivkina, I.: Revision programming: a knowledge representation formalism. PhD dissertation, University of Kentucky (2001)
Pivkina, I.: Defining well-founded semantics for revision programming Technical Report NMSU-CS-2005-001, New Mexico State University, Computer Science Department (2005)
Przymusiński, T.C., Turner, H.: Update by means of inference rules. In: Marek, V.W., Truszczyński, M., Nerode, A. (eds.) LPNMR 1995. LNCS, vol. 928, pp. 156–174. Springer, Heidelberg (1995)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181–234 (2002)
Subrahmanian, V.S., Nau, D., Vago, C.: WFS + branch bound = stable models. IEEE Transactions on Knowledge and Data Engineering 7, 362–377 (1995)
Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences 47(1), 185–221 (1993)
Van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: ACM Symposium on Principles of Database Systems, pp. 221–230 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marek, V.W., Pivkina, I., Truszczyński, M. (2005). Approximating Answer Sets of Unitary Lifschitz-Woo Programs. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_6
Download citation
DOI: https://doi.org/10.1007/11546207_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28538-0
Online ISBN: 978-3-540-31827-9
eBook Packages: Computer ScienceComputer Science (R0)