Abstract
Theoretical foundations and practical realizations of answer set solving techniques are vital research issues. The challenge lies in combining the elevated modeling capacities of answer set programming with advanced solving strategies for combinatorial search problems. My research shall contribute to bridging the gap between high-level knowledge representation and efficient low-level reasoning, in order to bring out the best of both worlds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM TOCL 7(3), 499–562 (2006)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)
Mitchell, D.: A SAT solver primer. Bulletin of the EATCS 85, 112–133 (2005)
Gebser, M.: Backjumping and learning in answer set programming. Diploma thesis (2005)
Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 95–109. Springer, Heidelberg (2005)
Gebser, M., Schaub, T.: Loops: Relevant or redundant? In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 53–65. Springer, Heidelberg (2005)
Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 11–25. Springer, Heidelberg (2006)
Anger, C., Gebser, M., Janhunen, T., Schaub, T.: What’s a head without a body? In: Proceedings of ECAI 2006, pp. 769–770. IOS Press, Amsterdam (2006)
Gebser, M., Lee, J., Lierler, Y.: Elementary sets for logic programs. In: Proceedings of AAAI 2006, AAAI Press, Stanford (2006)
Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In: Proceedings of NMR 2006, pp. 58–66 (2006)
Gebser, M., Lee, J., Lierler, Y.: Head-elementary-set-free logic programs. [18], pp. 149–161
Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proceedings of IJCAI 2007. AAAI Press/MIT Press, pp. 386–392 (2007)
Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: A conflict-driven answer set solver. [18], pp. 260–265
Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. [18], pp. 136–148
Gebser, M., Schaub, T., Thiele, S.: Gringo: A new grounder for answer set programming. [18], pp. 266–271
Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., Woltran, S.: Debugging ASP programs by means of ASP. [18], pp. 31–43
Baral, C., Brewka, G., Schlipf, J.: LPNMR 2007. LNCS, vol. 4483. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gebser, M. (2007). Advanced Techniques for Answer Set Programming. In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-74610-2_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74608-9
Online ISBN: 978-3-540-74610-2
eBook Packages: Computer ScienceComputer Science (R0)