Complex optimization in answer set programming

Theory and Practice of Logic Programming

Volumn 11, Issue 4-5, 2011, Pages 821-839

  Gebser, Martin ^a   Kaminski, Roland ^a   Schaub, Torsten ^a,b,c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

Answer Set Programming; Complex optimization; Meta Programming; Preference Handling

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; COMPLEX OPTIMIZATION; IMPLEMENTATION TECHNIQUES; META-PROGRAMMING; MODELING TECHNIQUE; NONTRIVIAL APPLICATIONS; PARETO EFFICIENCY; PREFERENCE HANDLING;

COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING;

OPTIMIZATION;

EID: 80054965162     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068411000329     Document Type: Article

References (34)

1. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
2. BREWKA, G. 2004. Answer sets: From constraint programming towards qualitative optimization. In Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in Artificial Intelligence, vol. 2923. Springer-Verlag, 34-46.
3. BREWKA, G., NIEMELÄ, I. AND SYRJÄNEN, T. 2004. Logic programs with ordered disjunction. Computational Intelligence 20(2), 335-357.
4. BREWKA, G., NIEMELÄ, I. AND TRUSZCZYNSKI, M. 2003. Answer set optimization. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03), G. Gottlob and T. Walsh, Eds. Morgan Kaufmann Publishers, 867-872.
5. CHEVALEYRE, Y., ENDRISS, U., LANG, J. AND MAUDET, N. 2007. A short introduction to computational social choice. In Proceedings of the Thirty-third Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), J. van Leeuwen, G. Italiano, W. van der Hoek, C. Meinel, H. Sack and F. Plasil, Eds. Lecture Notes in Computer Science, vol. 4362. Springer-Verlag, 51-69.
6. DELGRANDE, J., SCHAUB, T. AND TOMPITS, H. 2003. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming 3(2), 129-187.
7. DRESCHER, C., GEBSER, M., GROTE, T., KAUFMANN, B., KÖNIG, A., OSTROWSKI, M. AND SCHAUB, T. 2008. Conflict-driven disjunctive answer set solving. In Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR'08), G. Brewka and J. Lang, Eds. AAAI, 422-432.
8. DUNG, P. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321-357.
9. EITER, T., FABER, W., LEONE, N. AND PFEIFER, G. 2003. Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice of Logic Programming 3(4-5), 463-498.
10. EITER, T. AND GOTTLOB, G. 1995. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15(3-4), 289-323.
11. EITER, T. AND POLLERES, A. 2006. Towards automated integration of guess and check programs in answer set programming: A meta-interpreter and applications. Theory and Practice of Logic Programming 6(1-2), 23-60.
12. FABER, W. AND WOLTRAN, S. 2009. Manifold answer-set programs for meta-reasoning. In Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), E. Erdem, F. Lin and T. Schaub, Eds. Lecture Notes in Artificial Intelligence, vol. 5753. Springer-Verlag, 115-128.
13. FAGES, F. 1994. Consistency of Clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
14. FERRARIS, P. 2005. Answer sets for propositional theories. In Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), C. Baral, G. Greco, N. Leone and G. Terracina, Eds. Lecture Notes in Artificial Intelligence, vol. 3662. Springer-Verlag, 119-131.
15. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. Freeman and Co.
16. GEBSER, M., GUZIOLOWSKI, C., IVANCHEV, M., SCHAUB, T., SIEGEL, A., THIELE, S. AND VEBER, P. 2010. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR'10), F. Lin and U. Sattler, Eds. AAAI, 497-507.
17. GEBSER, M., KAMINSKI, R., KAUFMANN, B., OSTROWSKI, M., SCHAUB, T., AND THIELE, S. 2010. A User's guide to gringo, clasp, clingo, and iclingo [online]. Accessed 9 June 2011. URL: http://potassco.sourceforge.net.
18. GEBSER, M., KAMINSKI, R. AND SCHAUB, T. 2011. Complex optimization in answer set programming: Extended version. Available at (metasp). (This is an extended version of the paper at hand.)
19. GEBSER, M., KAUFMANN, B., NEUMANN, A. AND SCHAUB, T. 2007. Conflict-driven answer set solving. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), M. Veloso, Ed. AAAI/The MIT, 386-392.
20. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
21. GRIES, M. 2004. Methods for evaluating and covering the design space during early design development. Integration 38(2), 131-183.
22. JANHUNEN, T. AND OIKARINEN, E. 2004. Capturing parallel circumscription with disjunctive logic programs. In Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA'04), J. Alferes and J. Leite, Eds. Lecture Notes in Computer Science, vol. 3229. Springer-Verlag, 134-146.
23. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S. AND SCARCELLO, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499-562.
24. LIFSCHITZ, V. 1985. Computing circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'85), A. Joshi, Ed. Morgan Kaufmann Publishers, 121-127.
25. LIU, G. AND YOU, J. 2010. Level mapping induced loop formulas for weight constraint and aggregate logic programs. Fundamenta Informaticae 101(3), 237-255.
26. LLOYD, J. 1987. Foundations of Logic Programming, 2nd ed. Symbolic Computation. Springer-Verlag.
27. MCCARTHY, J. 1980. Circumscription-A form of nonmonotonic reasoning. Artificial Intelligence 13(1-2), 27-39.
28. METASP. http://www.cs.uni-potsdam.de/wv/metasp.
29. OETSCH, J., PÜHRER, J., AND TOMPITS, H. 2010. Catching the ouroboros: On debugging non-ground answer-set programs. Theory and Practice of Logic Programming. Twenty-sixth International Conference on Logic Programming (ICLP'10) Special Issue 10(4-6), 513-529.
30. OIKARINEN, E. AND JANHUNEN, T. 2008. Implementing prioritized circumscription by computing disjunctive stable models. In Proceedings of the Thirteenth International Conference on Artificial Intelligence: Methodology, Systems, and Applications (AIMSA'08), D. Dochev, M. Pistore and P. Traverso, Eds. Lecture Notes in Artificial Intelligence, vol. 5253. Springer-Verlag, 167-180.
31. REITER, R. 1987. A theory of diagnosis from first principles. Artificial Intelligence 32(1), 57-96.
32. SAKAMA, C. AND INOUE, K. 2000. Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123(1-2), 185-222.
33. SIMONS, P., NIEMELÄ, I. AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234.
34. SYRJÄNEN, T. Lparse 1.0 user's manual [online]. Accessed 9 June 2011. URL: http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz.