The conflict-driven answer set solver clasp: Progress report

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

Volumn 5753 LNAI, Issue , 2009, Pages 509-514

  Gebser, Martin ^a   Kaufmann, Benjamin ^a   Schaub, Torsten ^a,b,c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; INCREMENTAL SOLVING; PROGRESS REPORT; SALIENT FEATURES;

SCHEDULING;

LOGIC PROGRAMMING;

EID: 70349876575     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04238-6_50     Document Type: Conference Paper

References (30)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
2. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M. (ed.) Proc. of IJCAI 2007, pp. 386-392. AAAI Press, Menlo Park (2007)
3. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. In: [28], pp. 136-148
4. http://potassco.sourceforge.net/
5. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: A conflict-driven answer set solver. In: [28], pp. 260-265
6. Syrjänen, T.: Lparse 1.0 user's manual
7. Gebser, M., Schaub, T., Thiele, S.: GrinGo: A new grounder for answer set programming. In: [28], pp. 266-271
8. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Advanced preprocessing for answer set solving. In: Ghallab, M., Spyropoulos, C., Fakotakis, N., Avouris, N. (eds.) Proc. of ECAI 2008, pp. 15-19. IOS Press, Amsterdam (2008)
9. Babovich, Y., Lifschitz, V.: Computing answer sets using program completion (2003)
10. Éen, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F.,Walsh, T. (eds.) SAT 2005. LNCS, vol.3569, pp. 61-75. Springer, Heidelberg (2005)
11. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: On the implementation of weight constraint rules in conflict-driven ASP solvers. In: [29], pp. 250-264
12. Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected Boolean search problems. In: van Hoeve, W., Hooker, J. (eds.) Proc. of CPAIOR 2009, pp. 71-86. Springer, Heidelberg (2009)
13. Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation 4, 75-97 (2008)
14. Ryvchin, V., Strichman, O.: Local restarts. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.4996, pp. 271-276. Springer, Heidelberg (2008)
15. Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.4501, pp. 294- 299. Springer, Heidelberg (2007)
16. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an incremental ASP solver. In: [30], pp. 190-205
17. Éen, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4) (2003)
18. Ellguth, E., Gebser, M., Gusowski, M., Kaminski, R., Kaufmann, B., Liske, S., Schaub, T., Schneidenbach, L., Schnor, B.: A simple distributed conflict-driven answer set solver. In: Erdem, E., Lin, F., Schaub, T. (eds.) Proc. of LPNMR 2009. Springer, Heidelberg (to appear, 2009)
19. Janhunen, T., Niemelä, I., Sevalnev, M.: Computing stable models via reductions to Boolean circuits and difference logic. In: Denecker, M. (ed.) Proc. of LaSh 2008, pp. 16-30 (2008)
20. Mileo, A., Merico, D., Bisiani, R.: A logic programming approach to home monitoring for risk prevention in assisted living. In: [30], pp. 145-159
21. Boenn, G., Brain, M., de Vos, M., Fitch, J.: Automatic composition of melodic and harmonic music by answer set programming. In: [30], pp. 160-174
22. Gebser, M., Schaub, T., Thiele, S., Usadel, B., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. In: [30], pp. 130-144
23. Ishebabi, H., Mahr, P., Bobda, C., Gebser, M., Schaub, T.: Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs. Journal of Reconfigurable Computing (to appear, 2009)
24. Kim, T., Lee, J., Palla, R.: Circumscriptive event calculus as answer set programming. In: Boutilier, C. (ed.) Proc. IJCA 2009. AAAI Press, Menlo Park (to appear, 2009)
25. Thielscher, M.: Answer set programming for single-player games in general game playing. In: [29] (to appear)
26. Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., Schaub, T.: Conflict-driven disjunctive answer set solving. In: Brewka, G., Lang, J. (eds.) Proc. KR 2008, pp. 422-432. AAAI Press, Menlo Park (2008)
27. Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: [29], pp. 235-249
28. Baral, C., Brewka, G., Schlipf, J. (eds.): LPNMR 2007. LNCS (LNAI), vol.4483. Springer, Heidelberg (2007)
29. Hill, P., Warren, D. (eds.): Proc. of ICLP 2009. Springer, Heidelberg (2009)
30. Garcia de la Banda, M., Pontelli, E. (eds.): Proc. ICLP 2008. Springer, Heidelberg (2008)