Generality relations in answer set programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4079 LNCS, Issue , 2006, Pages 211-225

  Inoue, Katsumi ^a   Sakama, Chiaki ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MULTI AGENT SYSTEMS; SEMANTICS; SET THEORY;

ANSWER SET PROGRAMMING; LOGIC PROGRAMS; NONMONOTONIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 33749335258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799573_17     Document Type: Conference Paper

References (17)

1. R. Ben-Eliyahu and R. Dechter. Prepositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12(1):53-87, 1994.
2. T. Eiter, H. Tompits, and S. Woltran. On solution correspondences in answer-set programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 97-102, 2005.
3. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
4. C. A. Gunter and D.S. Scott. Semantic Domains. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 633-674, North-Holland, 1990.
5. K. Inoue and C. Sakama. Disjunctive explanations. In: Proceedings of the 18th International Conference on Logic Programming, Lecture Notes in Computer Science, 2401, pp. 317-332, Springer, 2002.
6. V. Lifschitz, D, Pearce and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
7. M. J. Maher. Equivalence of logic programs. In: J, Minker (ed.), Foundations of Deductive Databases and Logic Programming, pp. 627-658, Morgan Kaufmann, 1988.
8. T. Niblett. A study of generalization in logic programs. In: Proceedings of the 3rd European Working Sessions on Learning (EWSL-88), pp. 131-138, Pitman, 1988.
9. S.-H, Nienhuys-Cheng and R. de Wolf, Foundations of inductive logic programming. Lecture Notes in Artificial Intelligence, 1228, Springer, 1997.
10. G.D. Plotkin. A note on inductive generalization. In: B. Meltzer and D. Michie (eds.), Machine Intelligence 5, pp. 153-63, Edinburgh University Press, 1970.
11. G.D. Plotkin. A powerdomain construction. SIAM Journal of Computing, 5:452-287, 1976.
12. C. Sakama. Ordering default theories and nonmonotonic logic programs. Theoretical Computer Science, 338:127-152, 2005.
13. C. Sakama and K. Inoue. Coordination between logical agents. In: Post-proceedings of the 5th International Workshop on Computational Logic in Multi-Agent Systems, Lecture Notes in Artificial Intelligence, 3487, pp. 161-177, Springer, 2005.
14. C. Sakama and K. Inoue. Combining answer sets of nonmonotonic logic programs. In: Post-proceedings of the 6th International Workshop on Computational Logic in Multi-Agent Systems, Lecture Notes in Artificial Intelligence, 3900, pp. 320-339, Springer, 2006.
15. C. Sakama and K. Inoue. Constructing consensus logic programs. Submitted for publication, 2006.
16. M. B. Smyth, Power domains. Journal of Computer and System Sciences, 16:23-36, 1978.
17. G. Q. Zhang and W, C. Rounds. Semantics of logic programs and representation of Smyth powerdomain. In: K. Keimel et al (eds.), Proceedings of the 1st International Symposium on Domain Theory, pp. 151-181, Kluwer, 2001.