Abstract
In an important and much cited paper Vladimir Lifschitz and Hudson Turner have shown how, under certain conditions, logic programs under answer set semantics can be split into two disjoint parts, a “bottom” part and a “top” part. The bottom part can be evaluated independently of the top part. Results of the evaluation, i.e., answer sets of the bottom part, are then used to simplify the top part. To obtain answer sets of the original program one simply has to combine an answer set of the simplified top part with the answer set which was used to simplify this part. Similar splitting results were later proven for other nonmonotonic formalisms and also Dung style argumentation frameworks.
In this paper we show how the conditions under which splitting is possible can be relaxed. The main idea is to modify also the bottom part before the evaluation takes place. Additional atoms are used to encode conditions on answer sets of the top part that need to be fulfilled. This way we can split in cases where proper splitting is not possible. We demonstrate this idea for argumentation frameworks and logic programs.
This work has been funded by Vienna Science and Technology Fund (WWTF) through project ICT08-028.
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
Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowledge Eng. Review 26(4), 365–410 (2011)
Baroni, P., Giacomin, M.: Semantics of abstract argument systems. In: Rahwan, I., Simari, G.R. (eds.) Argumentation in Artificial Intelligence, pp. 25–44. Springer (2009)
Baumann, R.: Splitting an Argumentation Framework. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 40–53. Springer, Heidelberg (2011)
Baumann, R., Brewka, G., Wong, R.: Splitting Argumentation Frameworks: An Empirical Evaluation. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 17–31. Springer, Heidelberg (2012)
Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming: Proceedings of the Fifth International Conference and Symposium, pp. 1070–1080. MIT Press, Cambridge (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput. 9(3/4), 365–386 (1991)
Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17(3), 424–446 (1994)
Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. 35, 813–857 (2009)
Liao, B.S., Jin, L., Koons, R.C.: Dynamics of argumentation systems: A division-based method. Artif. Intell. 175(11), 1790–1814 (2011)
Lifschitz, V., Turner, H.: Splitting a logic program. In: Van Hentenryck, P. (ed.) Proceedings of the Eleventh International Conference on Logic Programming (ICLP 1994), pp. 23–27. MIT Press (1994)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)
Turner, H.: Splitting a default theory. In: Clancey, W.J., Weld, D.S. (eds.) Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference (AAAI/IAAI), vol. 1, pp. 645–651. AAAI Press / The MIT Press (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Baumann, R., Brewka, G., Dvořák, W., Woltran, S. (2012). Parameterized Splitting: A Simple Modification-Based Approach. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-30743-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30742-3
Online ISBN: 978-3-642-30743-0
eBook Packages: Computer ScienceComputer Science (R0)