Abstract
We present a new forgetting method in logic programs with ordered disjunction (LPODs). To forget a literal means to give it up from the answer sets of the program. There is a known method for doing this in an extended logic program (ELP) by transforming it into another such program whose answer sets have only lost the forgotten literal. However, a naive application of it to an LPOD can produce undesirable results. Our new method avoids these, and ensures that the answer sets of the LPOD, as specified by its so-called split programs, only lose as few literals as are necessary. To achieve this we introduce two new literals \(``\top"\) and \(``\bot"\) into the syntax of LPODs and extend the definition of an answer set accordingly.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brewka, G., Niemelá, I., Syrjánen, T.: Logic Programs with Ordered Disjunction. Computational Intelligence 20(2), 335–357 (2004)
Eiter, T., Wang, K.: Forgetting and conflict resolving in disjunctive logic programming. In: AAAI 2006. Proceedings of the 21st National Conference on Artificial Intelligence, AAAI Press, Stanford (2006)
Foo, N., Meyer, T., Zhang, Y., Zhang, D.: Negotiating logic programs. In: Proceedings of NRAC05, Sixth Workshop on Nonmonotonic Reasoning, Action and Change, Edinburgh (2005)
Foo, N., Meyer, T., Brewka, G.: LPOD Answer Sets and Nash Equilibria. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 343–351. Springer, Heidelberg (2004)
Gelfond, Lifschitz, V.: Classical negation in logic programs and disjunctive databases, New Generation Computing, pp. 365–385 (1991)
Lang, J., Marquis, P.: Resolving inconsistencies by variable forgetting. In: Proceedings of KR2002, pp. 239–250 (2002)
Lang, J., Liberatore, P., Marquis, P.: Propositional independence - formula-variable independence and forgetting. Journal of Artificial Intelligence Research 18, 391–443 (2003)
Lifschitz, V.: Foundations of logic programming, in Principles of Knowledge Representation, pp. 69–127. CSLI Publications (1996)
Lin, F., Reiter, R.: Forget it! In Working Notes of AAAI Fall Symposium on Relevance, pp. 154–159 (1994)
Lloyd, J.W.: Foundation of logic programming, 2nd edn. Springer, New York (1987)
Wang, K., Sattar, A., Su, K.: A theory of forgetting in logic programming. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), pp. 682–687. AAAI Press, Stanford, California, USA (2005)
Zhang, Y., Foo, N., Wang, K.: Solving logic program conflicts through strong and weak forgettings. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-2005), Edinburgh, pp. 627–632 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, W., Foo, N., Zhang, M. (2007). Forgetting in Logic Programs with Ordered Disjunction. In: Orgun, M.A., Thornton, J. (eds) AI 2007: Advances in Artificial Intelligence. AI 2007. Lecture Notes in Computer Science(), vol 4830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76928-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-76928-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76926-2
Online ISBN: 978-3-540-76928-6
eBook Packages: Computer ScienceComputer Science (R0)