Generality Relations in Answer Set Programming
This paper studies generality relations on logic programs. Intuitively, a program P 1 is more general than another program P 2 if P 1 gives us more information than P 2. In this paper, we define various kinds of generality relations over nonmonotonic programs in the context of answer set programming. The semantic properties of generality relations are investigated based on domain theory, and both a minimal upper bound and a maximal lower bound are constructed for any pair of logic programs. We also introduce the concept of strong generality between logic programs and investigate its relationships to strong equivalence. These results provide a basic theory to compare the degree of incompleteness between nonmonotonic logic programs, and also have important applications to inductive logic programming and multi-agent systems.
KeywordsLogic Program Conjunctive Normal Form Inductive Logic Programming Domain Theory Disjunctive Normal Form
Unable to display preview. Download preview PDF.
- 2.Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 97–102 (2005)Google Scholar
- 4.Gunter, C.A., Scott, D.S.: Semantic Domains. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 633–674. North-Holland, Amsterdam (1990)Google Scholar
- 7.Maher, M.J.: Equivalence of logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 627–658. Morgan Kaufmann, San Francisco (1988)Google Scholar
- 8.Niblett, T.: A study of generalization in logic programs. In: Proceedings of the 3rd European Working Sessions on Learning (EWSL 1988), pp. 131–138. Pitman (1988)Google Scholar
- 9.Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol. 1228. Springer, Heidelberg (1997)Google Scholar
- 10.Plotkin, G.D.: A note on inductive generalization. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 5, pp. 153–163. Edinburgh University Press (1970)Google Scholar
- 15.Sakama, C., Inoue, K.: Constructing consensus logic programs (submitted for publication, 2006)Google Scholar
- 17.Zhang, G.Q., Rounds, W.C.: Semantics of logic programs and representation of Smyth powerdomain. In: Keimel, K., et al. (eds.) Proceedings of the 1st International Symposium on Domain Theory, pp. 151–181. Kluwer, Dordrecht (2001)Google Scholar