Answer set solving in practice

Synthesis Lectures on Artificial Intelligence and Machine Learning

Volumn 19, Issue , 2012, Pages 1-240

  Gebser, Martin ^a   Kaminski, Roland ^a   Kaufmann, Benjamin ^a   Schaub, Torsten ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

answer set programming; declarative problem solving; logic programming

Indexed keywords

ANSWER SET PROGRAMMING; ANSWER SET SOLVING; APPLICATION PROBLEMS; FORMAL FOUNDATION; KNOWLEDGE REPRESENTATION AND REASONING; LANGUAGES AND SYSTEMS; MODELING LANGUAGES; MODELING PROBLEMS; PRACTICAL INTRODUCTION; SIMPLE MODELING;

LOGIC PROGRAMMING; PROBLEM SOLVING;

KNOWLEDGE REPRESENTATION;

EID: 84872075045     PISSN: 19394608     EISSN: 19394616     Source Type: Book Series    
DOI: 10.2200/S00457ED1V01Y201211AIM019     Document Type: Article

References (275)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. 66
2. J. Alferes and J. Leite, editors. Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA'04), volume 3229 of Lecture Notes in Computer Science, 2004. Springer-Verlag. 185, 190, 199, 204
3. J. Alferes, L. Pereira, H. Przymusinska, and T. Przymusinski. LUPS: A language for updating logic programs. Artificial Intelligence, 138(1-2):87-116, 2002. DOI: 10.1016/S0004-3702(02)00183-2 176
4. M. Alviano, F. Calimeri, W. Faber, N. Leone, and S. Perri. Unfounded sets and well-founded semantics of answer set programs with aggregates. Journal of Artificial Intelligence Research, 42: 487-527, 2011. DOI: 10.1613/jair.3432 89
5. B. Andres, B. Kaufmann, O. Matheis, and T. Schaub. Unsatisfiability-based optimization in clasp. In A. Dovier andV. Santos Costa, editors, Technical Communications of theTwenty-eighth International Conference on Logic Programming (ICLP'12), volume 17, pages 212-221. Leibniz International Proceedings in Informatics (LIPIcs), 2012. 150
6. C. Anger, K. Konczak, and T. Linke. noMoRe: A system for non-monotonic reasoning under answer set semantics. In Eiter et al. (2001), pages 406-410. 150
7. C. Anger, M. Gebser, T. Linke, A. Neumann, and T. Schaub. The nomore++ approach to answer set solving. In G. Sutcliffe and A. Voronkov, editors, Proceedings of the Twelfth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05), volume 3835 of Lecture Notes in Artificial Intelligence, pages 95-109. Springer-Verlag, 2005. DOI: 10.1007/11591191 150 (Pubitemid 43955308)
8. C. Anger, M. Gebser, and T. Schaub. Approaching the core of unfounded sets. In Dix and Hunter (2006), pages 58-66. 110
9. G. Audemard and L. Simon. Predicting learnt clauses quality in modern SAT solvers. In C. Boutilier, editor, Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJ-CAI'09), pages 399-404. AAAI/MIT Press, 2009. 110, 151
10. M. Balduccini. Representing constraint satisfaction problems in answer set programming. In W. Faber and J. Lee, editors, Proceedings of the Second Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'09), pages 16-30, 2009. 151
11. M. Balduccini, E. Pontelli, O. El-Khatib, and H. Le. Issues in parallel execution of non-monotonic reasoning systems. Parallel Computing, 31(6):608-647, 2005. DOI: 10.1016/j.parco.2005.03.004 150 (Pubitemid 40891707)
12. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, 2003. DOI: 10.1017/CBO9780511543357 9, 49
13. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 12:1-80, 1994. DOI: 10.1016/0743-1066(94)90025-6 49
14. C. Baral, G. Greco, N. Leone, and G. Terracina, editors. Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), volume 3662 of Lecture Notes in Artificial Intelligence, 2005. Springer-Verlag. DOI: 10.1007/11546207 191, 195
15. C. Baral, G. Brewka, and J. Schlipf, editors. Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), volume 4483 of Lecture Notes in Artificial Intelligence, 2007. Springer-Verlag. 185, 188, 192
16. C. Barrett, R. Sebastiani, S. Seshia, and C. Tinelli. Satisfiability modulo theories. In Biere et al. (2009), chapter 26, pages 825-885. DOI: 10.1007/11513988-4 151
17. D. Basak, S. Pal, and D. Patranabis. Support vector regression. Neural Information Processing-Letters and Reviews, 11(10):203-224, 2007. 150
18. S. Baselice, P. Bonatti, and M. Gelfond. Towards an integration of answer set and constraint solving. In M. Gabbrielli and G. Gupta, editors, Proceedings of the Twenty-first International Conference on Logic Programming (ICLP'05), volume 3668 of Lecture Notes in Computer Science, pages 52-66. Springer-Verlag, 2005. 151 (Pubitemid 41491593)
19. R. Bayardo and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pages 203-208. AAAI/MIT Press, 1997. 110
20. P. Beame and T. Pitassi. Propositional proof complexity: Past, present, and future. Bulletin of the European Association for Theoretical Computer Science, 65:66-89, 1998. DOI: 10.1145/602382.602406 90, 110
21. P. Beame, H. Kautz, and A. Sabharwal. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research, 22:319-351, 2004. DOI: 10.1613/jair.1410 90, 110 (Pubitemid 41525889)
22. P. Besnard. An Introduction to Default Logic. Symbolic Computation-Artifical Intelligence. Springer-Verlag, 1989. 10
23. N. Bidoit and C. Froidevaux. Minimalism subsumes default logic and circumscription in stratified logic programming. In Proceedings of the Second Annual Symposium on Logic in Computer Science (LICS'87), pages 89-97. IEEE Computer Society, 1987. 10 (Pubitemid 17613616)
24. A. Biere. PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation, 4:75-97, 2008. 151
25. A. Biere. Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT race 2010. Technical Report 10/1, Institute for Formal Models and Verification. Johannes Kepler University, 2010. 151
26. A. Biere, M. Heule, H. van Maaren, and T. Walsh, editors. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2009. 9, 90, 110, 184, 187, 198, 199, 202, 203
27. R. Bihlmeyer, W. Faber, G. Ielpa, V. Lio, and G. Pfeifer. DLV-user manual. URL http://www.dlvsystem.com/man. 149
28. G. Boenn, M. Brain, M. de Vos, and J. Fitch. Automatic composition of melodic and harmonic music by answer set programming. In Garcia de la Banda and Pontelli (2008), pages 160-174. DOI: 10.1007/978-3-540-89982-2-21 175
29. A. Bösel, T. Linke, and T. Schaub. Profiling answer set programming: The visualization component of the noMoRe system. In Alferes and Leite (2004), pages 702-705. DOI: 10.1007/978-3-540-30227-8-61 176 (Pubitemid 41049978)
30. M. Brain and M. de Vos. Debugging logic programs under the answer set semantics. In M. de Vos and A. Provetti, editors, Proceedings of the Third International Workshop on Answer Set Programming (ASP'05), volume 142, pages 141-152. CEUR Workshop Proceedings (CEUR-WS.org), 2005. URL http://ceur-ws.org/ Vol-142. 177
31. M. Brain and M. de Vos. The significance of memory costs in answer set solver implementation. Journal of Logic and Computation, 19(4):615-641, 2009. DOI: 10.1093/logcom/exn038 150
32. M. Brain, T. Crick, M. de Vos, and J. Fitch. TOAST: Applying answer set programming to superoptimisation. In Etalle and Truszczyński (2006), pages 270-284. DOI: 10.1007/11799573-21 175 (Pubitemid 44492596)
33. M. Brain, M. Gebser, J. Pührer, T. Schaub, H. Tompits, and S. Woltran. Debugging ASP programs by means of ASP. In Baral et al. (2007), pages 31-43. DOI: 10.1007/978-3-540-72200-7-5 177
34. M. Brain, O. Cliffe, and M. de Vos. A pragmatic programmer's guide to answer set programming. In de Vos and Schaub (2009), pages 49-63. URL http://ceur-ws.org/Vol-546. 49
35. G. Brewka. Logic programming with ordered disjunction. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 100-105. AAAI Press, 2002. 176
36. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artificial Intelligence, 109(1-2):297-356, 1999. DOI: 10.1016/S0004-3702(99)00015-6 176
37. G. Brewka, S. Coradeschi, A. Perini, and P. Traverso, editors. Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI'06), 2006. IOS Press. 195, 201
38. G. Brewka, T. Eiter, and M. Truszczyński. Answer set programming at a glance. Communications of the ACM, 54(12):92-103, 2011. DOI: 10.1145/2043174.2043195 9
39. G. Brewka, T. Eiter, and S. McIlraith, editors. Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR'12), 2012. AAAI Press. 194, 199
40. P. Cabalar and P. Ferraris. Propositional theories are strongly equivalent to logic programs. Theory and Practice of Logic Programming, 7(6):745-759, 2007. DOI: 10.1017/S1471068407003110 33 (Pubitemid 47631198)
41. M. Cadoli and A. Schaerf. Compiling problem specifications into SAT. Artificial Intelligence, 162 (1-2):89-120, 2005. DOI: 10.1016/j.artint.2004.01. 006 10 (Pubitemid 40034595)
42. F. Calimeri, W. Faber, G. Pfeifer, and N. Leone. Pruning operators for disjunctive logic programming systems. Fundamenta Informaticae, 71(2-3):183-214, 2006. 110 (Pubitemid 43893779)
43. F. Calimeri, S. Cozza, G. Ianni, and N. Leone. Computable functions in ASP: Theory and implementation. In Garcia de la Banda and Pontelli (2008), pages 407-424. DOI: 10.1007/978-3-540-89982-2-37 67
44. F. Calimeri, G. Ianni, F. Ricca, M. Alviano, A. Bria, G. Catalano, S. Cozza, W. Faber, O. Febbraro, N. Leone, M. Manna, A. Martello, C. Panetta, S. Perri, K. Reale, M. Santoro, M. Sirianni, G. Terracina, and P. Veltri. The third answer set programming competition: Preliminary report of the system competition track. In Delgrande and Faber (2011), pages 388-403. DOI: 10.1007/978-3-642-20895-9-46 150
45. F. Calimeri, W. Faber, M. Gebser, G. Ianni, R. Kaminski, T. Krennwallner, N. Leone, F. Ricca, and T. Schaub. ASP-Core-2: Input language format. Available at https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.0.pdf, 2012. 151
46. X. Chen, J. Jiang, J. Ji, G. Jin, and F. Wang. Integrating NLP with reasoning about actions for autonomous agents communicating with humans. In Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'09), pages 137-140. IEEE, 2009. DOI: 10.1109/WI-IAT.2009.142 175
47. X. Chen, J. Ji, J. Jiang, G. Jin, F. Wang, and J. Xie. Developing high-level cognitive functions for service robots. In W. van der Hoek, G. Kaminka, Y. Lespérance, M. Luck, and S. Sen, editors, Proceedings of the Ninth International Conference on Autonomous Agents and Multiagent Systems (AAMAS'10), pages 989-996. IFAAMAS, 2010. 175
48. K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, 1978. DOI: 10.1007/978-1-4684-3384-5 69, 89
49. E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1):7-34, 2001. DOI: 10.1023/A:1011276507260 177 (Pubitemid 32697641)
50. O. Cliffe, M. de Vos, M. Brain, and J. Padget. ASPVIZ: Declarative visualisation and animation using answer set programming. In Garcia de la Banda and Pontelli (2008), pages 724-728. DOI: 10.1007/978-3-540-89982-2-65 176
51. S. Cook and R. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 44(1):36-50, 1979. DOI: 10.2307/2273702 90
52. M. D'Agostino and M. Mondadori. The taming of the cut. classical refutations with analytic cut. Journal of Logic and Computation, 4(3):285-319, 1994. DOI: 10.1093/logcom/4.3.285 90
53. M. D'Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors. Handbook of Tableau Methods. Kluwer Academic Publishers, 1999. 89, 201
54. A. Dal Palù, A. Dovier, E. Pontelli, and G. Rossi. Answer set programming with constraints using lazy grounding. In Hill and Warren (2009), pages 115-129. DOI: 10.1007/978-3-642-02846-5-14 150
55. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. In Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity (CCC'97), pages82-101.IEEEComputer SocietyPress, 1997.DOI: 10.1109/CCC.1997.612304 33
56. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. ACM Computing Surveys, 33(3):374-425, 2001. DOI: 10.1145/502807.502810 10 (Pubitemid 33768487)
57. A. Darwiche and K. Pipatsrisawat. Complete algorithms. In Biere et al. (2009), chapter 3, pages 99-130. 110
58. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7: 201-215, 1960. DOI: 10.1145/321033.321034 32, 110
59. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394-397, 1962. DOI: 10.1145/368273.368557 32, 110
60. M. de Vos and T. Schaub, editors. Proceedings of the First Workshop on Software Engineering for Answer Set Programming (SEA'07), volume 281, 2007. CEUR Workshop Proceedings. URL http://ceur-ws.org/Vol-281. 177, 196
61. M. de Vos and T. Schaub, editors. Proceedings of the Second Workshop on Software Engineering for Answer Set Programming (SEA'09), volume 546, 2009. CEUR Workshop Proceedings. URL http://ceur-ws.org/Vol-546. 177, 185
62. R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, 2003. 90, 151
63. J. Delgrande and W. Faber, editors. Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), volume 6645 of Lecture Notes in Artificial Intelligence, 2011. Springer-Verlag. DOI: 10.1007/978-3-642-20895-9 186, 191, 193, 194, 201
64. J. Delgrande, T. Schaub, and H. Tompits. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming, 3(2):129-187, 2003. DOI: 10.1017/S1471068402001539 176
65. J. Delgrande, T. Schaub, H. Tompits, and K. Wang. A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence, 20(2):308-334, 2004. DOI: 10.1111/j.0824-7935.2004. 00240.x 33, 176
66. J. Delgrande, T. Schaub, and H. Tompits. A preference-based framework for updating logic programs. In Baral et al. (2007), pages 71-83. DOI: 10.1007/978-3-540-72200-7-8 176
67. J. Delgrande, T. Schaub, H. Tompits, and S. Woltran. A model-theoretic approach to belief change in answer set programming. ACM Transactions on Computational Logic, 2012. To appear. 176
68. M. Denecker and E. Ternovska. A logic of nonmonotone inductive definitions. ACM Transactions on Computational Logic, 9(2):14:1-14:52, 2008. DOI: 10.1145/1342991.1342998 10 (Pubitemid 351531329)
69. M. Denecker, J. Vennekens, S. Bond, M. Gebser, and M. Truszczyński. The second answer set programming competition. In Erdem et al. (2009), pages 637-654. DOI: 10.1007/978-3-642-04238-6-75 150
70. N. Dershowitz, Z. Hanna, and A. Nadel. Towards a better understanding of the functionality of a conflict-driven SAT solver. In Marques-Silva and Sakallah (2007), pages 287-293. DOI: 10.1007/978-3-540-72788-0-27 110
71. Y. Dimopoulos, B. Nebel, and J. Köhler. Encoding planning problems in nonmonotonic logic programs. In S. Steel and R. Alami, editors, Proceedings of the Fourth European Conference on Planning, volume 1348 of Lecture Notes in Artificial Intelligence, pages 169-181. Springer-Verlag, 1997. URL citeseer.nj.nec.com/dimopoulos97encoding.html. 175
72. J. Dix and A. Hunter, editors. Proceedings of the Eleventh International Workshop on Nonmonotonic Reasoning (NMR'06), number IFI-06-04 in Technical Report Series, 2006. Clausthal University of Technology, Institute for Informatics. 183, 204
73. J. Dix, U. Furbach, and I. Niemelä. Nonmonotonic reasoning: Towards efficient calculi and implementations. In Robinson and Voronkov (2001), pages 1241-1354. 90
74. C. Drescher, M. Gebser, T. Grote, B. Kaufmann, A. König, M. Ostrowski, and T. Schaub. Conflict-driven disjunctive answer set solving. In G. Brewka and J. Lang, editors, Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR'08), pages 422-432. AAAI Press, 2008. 90, 110, 149, 150
75. N. Eén and A. Biere. Effective preprocessing in SAT through variable and clause elimination. In F. Bacchus and T. Walsh, editors, Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT'05), volume 3569 of Lecture Notes in Computer Science, pages 61-75. Springer-Verlag, 2005. 151 (Pubitemid 41425497)
76. N. Eén and N. Sörensson. Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science, 89(4), 2003. DOI: 10.1016/S1571-0661(05)82542-3 151, 177 (Pubitemid 40673164)
77. N. Eén and N. Sörensson. An extensible SAT-solver. In E. Giunchiglia and A. Tacchella, editors, Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), volume 2919 of Lecture Notes in Computer Science, pages 502-518. Springer-Verlag, 2004. 110, 151
78. T. Eiter and M. Fink. Uniform equivalence of logic programs under the stable model semantics. In C. Palamidessi, editor, Proceedings of the Nineteenth International Conference on Logic Programming (ICLP'03), volume 2916 of Lecture Notes in Computer Science, pages 224-238. Springer-Verlag, 2003. 176
79. T. Eiter and A. Polleres. 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, 2006. DOI: 10.1017/S1471068405002577 67 (Pubitemid 43170521)
80. T. Eiter, W. Faber, and M. Truszczyński, editors. Proceedings of the Sixth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), volume 2173 of Lecture Notes in Computer Science, 2001. Springer-Verlag. 183, 196, 204
81. T. Eiter, M. Fink, G. Sabbatini, and H. Tompits. On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming, 2(6):711-767, 2002. DOI: 10.1017/S1471068401001247 176 (Pubitemid 135712036)
82. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice of Logic Programming, 3(4-5):463-498, 2003. DOI: 10.1017/S1471068403001753 67, 178
83. T. Eiter, G. Ianni, R. Schindlauer, and H. Tompits. DLVHEX: A prover for semantic-web reasoning under the answer-set semantics. In Proceedings of the International Conference on Web Intelligence (WI'06), pages 1073-1074. IEEE Computer Society, 2006. DOI: 10.1109/WI.2006.64 176 (Pubitemid 351577000)
84. T. Eiter, G. Ianni, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining answer set programming with description logics for the semantic web. Artificial Intelligence, 172(12-13):1495-1539, 2008. DOI: 10.1016/j.artint.2008. 04.002 176
85. T. Eiter, G. Ianni, and T. Krennwallner. Answer Set Programming: A Primer. In S. Tessaris, E. Franconi, T. Eiter, C. Gutierrez, S. Handschuh, M. Rousset, and R. Schmidt, editors, Fifth International Reasoning Web Summer School (RW'09), volume 5689 of Lecture Notes in Computer Science, pages 40-110. Springer-Verlag, 2009. URL http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/ rw2009-asp.pdf. 9, 32, 49
86. E. Ellguth, M. Gebser, M. Gusowski, R. Kaminski, B. Kaufmann, S. Liske, T. Schaub, L. Schneidenbach, and B. Schnor. A simple distributed conflict-driven answer set solver. In Erdem et al. (2009), pages 490-495. DOI: 10.1007/978-3-642-04238-6-47 150
87. H. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972. 31
88. E. Erdem and F. Türe. Efficient haplotype inference with answer set programming. In Fox and Gomes (2008), pages 436-441. 175
89. E. Erdem, F. Lin, and T. Schaub, editors. Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), volume 5753 of Lecture Notes in Artificial Intelligence, 2009. Springer-Verlag. DOI: 10.1007/978-3-642-04238-6 188, 190, 192, 193, 196, 197
90. E. Erdem, K. Haspalamutgil, C. Palaz, V. Patoglu, and T. Uras. Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA'11), pages 4575-4581. IEEE, 2011. DOI: 10.1109/ICRA.2011.5980160 175
91. S. Etalle and M. Truszczyński, editors. Proceedings of the Twenty-second International Conference on Logic Programming (ICLP'06), volume 4079 of Lecture Notes in Computer Science, 2006. SpringerVerlag. 185, 191, 202
92. W. Faber, N. Leone, C. Mateis, and G. Pfeifer. Using database optimization techniques for nonmonotonic reasoning. In Proceedings of the Seventh International Workshop on Deductive Databases and Logic Programming (DDLP'99), pages 135-139, 1999. 178
93. W. Faber, N. Leone, and G. Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Alferes and Leite (2004), pages 200-212. DOI: 10.1007/978-3-540-30227-8-19 31 (Pubitemid 41049936)
94. F. Fages. Consistency of Clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994. 89
95. O. Febbraro, K. Reale, and F. Ricca. ASPIDE: Integrated development environment for answer set programming. In Delgrande and Faber (2011), pages 317-330. DOI: 10.1007/978-3-642-20895-9-37 176
96. P. Ferraris. Answer sets for propositional theories. In Baral et al. (2005), pages 119-131. DOI: 10.1007/11546207-10 32, 33
97. P. Ferraris and V. Lifschitz. Mathematical foundations of answer set programming. In S. Artëmov, H. Barringer, A. d'Avila Garcez, L. Lamb, and J. Woods, editors, We Will Show Them! Essays in Honour of Dov Gabbay, volume 1, pages 615-664. College Publications, 2005. 9
98. P. Ferraris, J. Lee, and V. Lifschitz. A new perspective on stable models. In Veloso (2007), pages 372-379. 177
99. M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4): 295-312, 1985. DOI: 10.1016/S0743-1066(85)80005-4 89
100. D. Fox and C. Gomes, editors. Proceedings of the Twenty-third National Conference on Artificial Intelligence (AAAI'08), 2008. AAAI Press. 190, 192
101. J. Freeman. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, 1995. 151
102. J. Gallier. Logic for Computer Science: Foundations of Automated Theorem Proving. Harper and Row, New York, 1986. 31
103. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1994. 151
104. M. Garcia de la Banda and E. Pontelli, editors. Proceedings of the Twenty-fourth International Conference on Logic Programming (ICLP'08), volume 5366 of Lecture Notes in Computer Science, 2008. Springer-Verlag. 185, 186, 187, 192, 198
105. M. Gebser and T. Schaub. Loops: Relevant or redundant? In Baral et al. (2005), pages 53-65. DOI: 10.1007/11546207-5 89
106. M. Gebser and T. Schaub. Tableau calculi for answer set programming. In Etalle and Truszczyński (2006), pages 11-25. DOI: 10.1007/11799573-4 89 (Pubitemid 44492579)
107. M. Gebser and T. Schaub. Characterizing ASP inferences by unit propagation. In E. Giunchiglia, V. Marek, D. Mitchell, and E. Ternovska, editors, Proceedings of the First International Workshop on Search and Logic: Answer Set Programming and SAT (LaSh'06), pages 41-56, 2006b. 90
108. M. Gebser and T. Schaub. Generic tableaux for answer set programming. In V. Dahl and I. Niemelä, editors, Proceedings of the Twenty-third International Conference on Logic Programming (ICLP'07), volume 4670 of Lecture Notes in Computer Science, pages 119-133. Springer-Verlag, 2007. 89
109. M. Gebser and T. Schaub. Tableau calculi for logic programs under answer set semantics. ACM Transactions on Computational Logic, 2012. To appear. 89
110. M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and S. Thiele. A user's guide to gringo, clasp, clingo, and iclingo. URL http://potassco.sourceforge.net. 32, 49, 149
111. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Conflict-driven answer set solving. In Veloso (2007), pages 386-392. DOI: 10.1016/j.artint.2012.04.001 90, 110, 149
112. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Conflict-driven answer set enumeration. In Baral et al. (2007), pages 136-148. DOI: 10.1007/978-3-540-72200-7-13 111, 149
113. M. Gebser, L. Liu, G. Namasivayam, A. Neumann, T. Schaub, and M. Truszczyński. The first answer set programming system competition. In Baral et al. (2007), pages 3-17. DOI: 10.1007/978-3-540-72200-7-3 150
114. M. Gebser, T. Schaub, and S. Thiele. Gringo: A new grounder for answer set programming. In Baral et al. (2007), pages 266-271. DOI: 10.1007/978-3-540-72200-7-24 67, 149
115. M. Gebser, T. Janhunen, M. Ostrowski, T. Schaub, and S. Thiele. A versatile intermediate language for answer set programming: Syntax proposal. Unpublished draft, 2008a. URL http://www.cs.uni-potsdam.de/wv/pdfformat/ gejaosscth08a.pdf. 149
116. M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and S. Thiele. Engineering an incremental ASP solver. In Garcia de la Banda and Pontelli (2008), pages 190-205. DOI: 10.1007/978-3-540-89982-2-23 151, 176
117. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Advanced preprocessing for answer set solving. In M. Ghallab, C. Spyropoulos, N. Fakotakis, and N. Avouris, editors, Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI'08), pages 15-19. IOS Press, 2008c. 149
118. M. Gebser, J. Pührer, T. Schaub, and H. Tompits. A meta-programming technique for debugging answer-set programs. In Fox and Gomes (2008), pages 448-453. 67, 177
119. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. On the implementation of weight constraint rules in conflict-driven ASP solvers. In Hill and Warren (2009), pages 250-264. DOI: 10.1007/978-3-642-02846-5-23 90, 110, 149
120. M. Gebser, R. Kaminski, M. Ostrowski, T. Schaub, and S. Thiele. On the input language of ASP grounder gringo. In Erdem et al. (2009), pages 502-508. DOI: 10.1007/978-3-642-04238-6-49 149
121. M. Gebser, B. Kaufmann, and T. Schaub. Solution enumeration for projected Boolean search problems. In W. van Hoeve and J. Hooker, editors, Proceedings of the Sixth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), volume 5547 of Lecture Notes in Computer Science, pages 71-86. SpringerVerlag, 2009c. 111, 149
122. M. Gebser, B. Kaufmann, and T. Schaub. The conflict-driven answer set solver clasp: Progress report. In Erdem et al. (2009), pages 509-514. DOI: 10.1007/978-3-642-04238-6-50 149
123. M. Gebser, M. Ostrowski, and T. Schaub. Constraint answer set solving. In Hill and Warren (2009), pages 235-249. DOI: 10.1007/978-3-642-02846-5-22 151
124. M. Gebser, T. Grote, and T. Schaub. Coala: A compiler from action languages to ASP. In T. Jan-hunen and I. Niemelä, editors, Proceedings of the Twelfth European Conference on Logics in Artificial Intelligence (JELIA'10), volume 6341 of Lecture Notes in Artificial Intelligence, pages 360-364. Springer-Verlag, 2010a. 151
125. M. Gebser, C. Guziolowski, M. Ivanchev, T. Schaub, A. Siegel, S. Thiele, and P. Veber. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In F. Lin and U. Sattler, editors, Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR'10), pages 497-507. AAAI Press, 2010b. 175
126. M. Gebser, T. Grote, R. Kaminski, and T. Schaub. Reactive answer set programming. In Delgrande and Faber (2011), pages 54-66. DOI: 10.1007/978-3-642-20895-9-7 151, 176, 177
127. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. Challenges in answer set solving. In M. Balduccini and T. Son, editors, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, volume 6565 of Lecture Notes in Computer Science, pages 74-90. Springer-Verlag, 2011b. 178
128. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. Multi-criteria optimization in answer set programming. In J. Gallagher and M. Gelfond, editors, Technical Communications of the Twenty-seventh International Conference on Logic Programming (ICLP'11), volume 11, pages 1-10. Leibniz International Proceedings in Informatics (LIPIcs), 2011c. 149
129. M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, M. Schneider, and S. Ziller. A portfolio solver for answer set programming: Preliminary report. In Delgrande and Faber (2011), pages 352-357. DOI: 10.1007/978-3-642-20895-9-40 150
130. M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, and B. Schnor. Cluster-based ASP solving with claspar. In Delgrande and Faber (2011), pages 364-369. DOI: 10.1007/978-3-642-20895-9-42 150
131. M. Gebser, R. Kaminski, M. Knecht, and T. Schaub. plasp: A prototype for PDDL-based planning in ASP. In Delgrande and Faber (2011), pages 358-363. DOI: 10.1007/978-3-642-20895-9-41 151
132. M. Gebser, R. Kaminski, A. König, and T. Schaub. Advances in gringo series 3. In Delgrande and Faber (2011), pages 345-351. DOI: 10.1007/978-3-642-20895-9-39 149
133. M. Gebser, R. Kaminski, and T. Schaub. Complex optimization in answer set programming. Theory and Practice of Logic Programming, 11(4-5):821-839, 2011h. DOI: 10.1017/S1471068411000329 33, 67, 176, 178
134. M. Gebser, J. Lee, and Y. Lierler. On elementary loops of logic programs. Theory and Practice of Logic Programming, 11(6):953-988, 2011i. DOI: 10.1017/S1471068411000019 89
135. M. Gebser, O. Sabuncu, and T. Schaub. An incremental answer set programming based system for finite model computation. AI Communications, 24(2):195-212, 2011j. DOI: 10.3233/AIC-2011-0496 151
136. M. Gebser, T. Schaub, S. Thiele, and P. Veber. Detecting inconsistencies in large biological networks with answer set programming. Theory and Practice of Logic Programming, 11(2-3):323-360, 2011k. DOI: 10.1017/S1471068410000554 175
137. M. Gebser, T. Grote, R. Kaminski, P. Obermeier, O. Sabuncu, and T. Schaub. Stream reasoning with answer set programming: Preliminary report. In Brewka et al. (2012), pages 613-617. 151, 177
138. M. Gebser, B. Kaufmann, andT. Schaub. Conflict-driven answer set solving:From theory to practice. Artificial Intelligence, 187:52-89, 2012b. DOI: 10.1016/j.artint.2012.04.001 90, 149
139. M. Gebser, B. Kaufmann, and T. Schaub. Multi-threaded ASP solving with clasp. Theory and Practice of Logic Programming, 12(4-5):525-545, 2012c. DOI: 10.1017/S1471068412000166 149 gecode. URL http://www.gecode.org. 151
140. M. Gelfond. On stratified autoepistemic theories. In K. Forbus and H. Shrobe, editors, Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI'87), pages 207-211. Morgan Kaufmann Publishers, 1987. 10
141. M. Gelfond. Representing knowledge in A-prolog. In A. Kakas and F. Sadri, editors, Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert Kowalski, volume 2408 of Lecture Notes in Computer Science, pages 413-451. Springer-Verlag, 2002. 9
142. M. Gelfond. Answer sets. In Lifschitz et al. (2008), chapter 7, pages 285-316. DOI: 10.1016/S1574-6526(07)03007-6 9
143. M. Gelfond and N. Leone. Logic programming and knowledge representation-the A-Prolog perspective. Artificial Intelligence, 138(1-2):3-38, 2002. DOI: 10.1016/S0004-3702(02)00206-0 9
144. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP'88), pages 1070-1080. MIT Press, 1988. 10, 13, 31
145. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming (ICLP'90), pages 579-597. MIT Press, 1990. 31
146. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991. DOI: 10.1007/BF03037169 10, 31, 33
147. M. Ginsberg, editor. Readings in Nonmonotonic Reasoning. Morgan Kaufmann Publishers, 1987. 10
148. E. Giunchiglia, Y. Lierler, and M. Maratea. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning, 36(4):345-377, 2006. DOI: 10.1007/s10817-006-9033-2 110, 150 (Pubitemid 46046675)
149. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT solver. In Proceedings of the Fifth Conference on Design, Automation and Test in Europe (DATE'02), pages 142-149. IEEE Computer Society Press, 2002. DOI: 10.1016/j.dam.2006.10.007 151
150. G. Grasso, S. Iiritano, N. Leone, V. Lio, F. Ricca, and F. Scalise. An ASP-based system for team-building in the Gioia-Tauro seaport. In M. Carro and R. Peña, editors, Proceedings of the Twelfth International Symposium on Practical Aspects of Declarative Languages (PADL'10), volume 5937 of Lecture Notes in Computer Science, pages 40-42. Springer-Verlag, 2010. DOI: 10.1007/978-3-642-11503-5 175
151. J. Gressmann, T. Janhunen, R. Mercer, T. Schaub, S. Thiele, and R. Tichy. Platypus: A platform for distributed answer set solving. In Baral et al.(2005), pages 227-239.DOI: 10.1007/11546207-18 150
152. J. Gressmann, T. Janhunen, R. Mercer, T. Schaub, S. Thiele, and R. Tichy. On probing and multithreading in platypus. In Brewka et al. (2006), pages 392-396. 150
153. W. Gropp, E. Lusk, and R. Thakur. Using MPI-2: Advanced Features of the Message-Passing Interface. MIT Press, 1999. 150
154. K. Gödel. Zum intuitionistischen Aussagenkalkül. In Anzeiger der Akademie der Wissenschaften in Wien, page 65-66. 1932. 10
155. R. Hähnle. Tableaux and related methods. In Robinson and Voronkov (2001), pages 100-178. DOI: 10.1016/B978-044450813-3/50005-9 89
156. K. Heljanko and I. Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming, 3(4-5):519-550, 2003. 175
157. A. Heyting. Die formalen Regeln der intuitionistischen Logik. In
158. P. Hill and D. Warren, editors. Proceedings of the Twenty-fifth International Conference on Logic Programming (ICLP'09), volume 5649 of Lecture Notes in Computer Science, 2009. Springer-Verlag. 187, 192, 193, 198
159. J. Huang. The effect of restarts on the efficiency of clause learning. In Veloso (2007), pages 2318-2323. 151
160. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 400-415. Springer-Verlag, 1992. 110, 150
161. H. Ishebabi, P. Mahr, C. Bobda, M. Gebser, and T. Schaub. Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs. Journal of Reconfigurable Computing, 2009. URL http://www.hindawi.com/journals/ijrc/2009/863630.html. Article ID 863630. DOI: 10.1155/2009/863630 175
162. T. Janhunen. URL http://www.tcs.hut.fi/Software/asptools. 151
163. T. Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Eiter et al. (2001), pages 93-106. DOI: 10.1007/3-540-45402-0-7 33
164. T. Janhunen. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics, 16(1-2):35-86, 2006. DOI: 10.3166/jancl.16.35-86 150
165. T. Janhunen. Intermediate languages of ASP systems and tools. In de Vos and Schaub (2007), pages 12-25. URL http://ceur-ws.org/Vol-281. 149
166. T. Janhunen, I. Niemelä, D. Seipel, P. Simons, and J. You. Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic, 7(1):1-37, 2006. DOI: 10.1145/1119439.1119440 110, 150 (Pubitemid 43924967)
167. T. Janhunen, I. Niemelä, and M. Sevalnev. Computing stable models via reductions to difference logic. In Erdem et al. (2009), pages 142-154. DOI: 10.1007/978-3-642-04238-6-14 150
168. M. Järvisalo and E. Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. Theory and Practice of Logic Programming, 8(5-6):691-716, 2008. DOI: 10.1017/S1471068408003578 89
169. M. Järvisalo, A. Biere, and M. Heule. Blocked clause elimination. In J. Esparza and R. Majumdar, editors, Proceedings of the Sixteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'10), volume 6015 of Lecture Notes in Computer Science, pages 129-144. Springer-Verlag, 2010. DOI: 10.1007/978-3-642-12002-2 151
170. H. Kautz and B. Selman. Planning as satisfiability. In B. Neumann, editor, Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92), pages 359-363. John Wiley & sons, 1992. 177
171. K. Konczak, T. Linke, and T. Schaub. Graphs and colorings for answer set programming. Theory and Practice of Logic Programming, 6(1-2):61-106, 2006. DOI: 10.1017/S1471068405002528 110, 150 (Pubitemid 43170522)
172. R. Kowalski. Algorithm = logic + control. Communications of the ACM, 22(7):424-436, 1979. DOI: 10.1145/359131.359136 10
173. J. Lee. A model-theoretic counterpart of loop formulas. In L. Kaelbling and A. Saffiotti, editors, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), pages 503-508. Professional Book Center, 2005. 89
174. C. Lefèvre and P. Nicolas. The first version of a new ASP solver : ASPeRiX. In Erdem et al. (2009), pages 522-527. DOI: 10.1007/978-3-642-04238-6- 52 150
175. J. Leite. Evolving Knowledge Bases, volume 81 of Frontiers of Artificial Intelligence and Applications. IOS Press, 2003. 176
176. N. Leone, P. Rullo, and F. Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2):69-112, 1997. DOI: 10.1006/inco.1997.2630 89, 110 (Pubitemid 127452754)
177. N. Leone, G. Greco, G. Ianni, V. Lio, G. Terracina, T. Eiter, W. Faber, M. Fink, G. Gottlob, R. Rosati, D. Lembo, M. Lenzerini, M. Ruzzi, E. Kalka, B. Nowicki, and W. Staniszkis. The INFOMIX system for advanced integration of incomplete and inconsistent data. In F. Özcan, editor, Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'05), pages 915-917. ACM Press, 2005. DOI: 10.1145/1066157 175 (Pubitemid 43039008)
178. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3): 499-562, 2006. DOI: 10.1145/1149114.1149117 32, 33, 49, 67, 110, 149, 150 (Pubitemid 44330485)
179. C. Li and F. Manyà. MaxSAT. In Biere et al. (2009), chapter 19, pages 613-631. DOI: 10.1007/s10601-010-9097-9 150
180. Y. Lierler. Abstract answer set solvers with learning. Theory and Practice of Logic Programming, 11 (2-3):135-169, 2011. DOI: 10.1017/ S1471068410000578 90, 150
181. Y. Lierler and V. Lifschitz. One more decidable class of finitely ground programs. In Hill and Warren (2009), pages 489-493. DOI: 10.1007/978-3-642- 02846-5-40 67
182. V. Lifschitz. Foundations of logic programming. In G. Brewka, editor, Principles of Knowledge Representation, pages 69-127. CSLI Publications, 1996. 9, 89
183. V. Lifschitz. Answer set planning. In D. de Schreye, editor, Proceedings of the International Conference on Logic Programming (ICLP'99), pages 23-37. MIT Press, 1999. 9, 174
184. V. Lifschitz. Answer set programming and plan generation. Artificial Intelligence, 138(1-2):39-54, 2002. DOI: 10.1016/S0004-3702(02)00186-8 49, 174
185. V. Lifschitz. Introduction to answer set programming. Unpublished draft, 2004. URL http://www.cs.utexas.edu/users/vl/papers/esslli.ps. DOI: 10.1007/s10472-007-9080-3 9, 31, 32
186. V. Lifschitz. Twelve definitions of a stable model. In Garcia de la Banda and Pontelli (2008), pages 37-51. DOI: 10.1007/978-3-540-89982-2-8 90
187. V. Lifschitz and A. Razborov. Why are there so many loop formulas? ACM Transactions on Computational Logic, 7(2):261-268, 2006. DOI: 10.1145/1131313.1131316 10
188. V. Lifschitz and H. Turner. Splitting a logic program. In Proceedings of the Eleventh International Conference on Logic Programming, pages 23-37. MIT Press, 1994. 176
189. V. Lifschitz and T. Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In B. Nebel, C. Rich, and W. Swartout, editors, Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR'92), pages 603-614. Morgan Kaufmann Publishers, 1992. 33
190. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001. DOI: 10.1145/383779.383783 176
191. V. Lifschitz, F. van Harmelen, and B. Porter, editors. Handbook of Knowledge Representation. Elsevier Science, 2008. 9, 194
192. F. Lin. A Study of Nonmonotonic Reasoning. PhD thesis, Stanford University, 1991. 89
193. F. Lin and Y. Zhao. ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 157(1-2):115-137, 2004. DOI: 10.1016/j.artint.2004.04.004 89, 110, 150
194. Z. Lin, Y. Zhang, and H. Hernandez. Fast SAT-based answer set solver. In Y. Gil and R. Mooney, editors, P roceedings of theTwenty-first National Conference on Artificial Intelligence (AAAI'06), pages 92-97. AAAI Press, 2006. 110, 150 (Pubitemid 44705269)
195. T. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), pages 641-645. Morgan Kaufmann Publishers, 2001. 31, 110
196. G. Liu, T. Janhunen, and I. Niemelä. Answer set programming via mixed integer programming. In Brewka et al. (2012), pages 32-42. 150
197. L. Liu and M. Truszczyński. Properties of programs with monotone and convex constraints. In Veloso and Kambhampati (2005), pages 701-706. DOI: 10.1613/jair.2009 150 (Pubitemid 43006691)
198. X. Liu, C. Ramakrishnan, and S. Smolka. Fully local and efficient evaluation of alternating fixed points (extended abstract). In B. Steffen, editor, TA CAS, volume 1384 of Lecture Notes in Computer Science, pages 5-19. Springer-Verlag, 1998. 175 (Pubitemid 128055533)
199. J. Lloyd. Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, 1987. DOI: 10.1007/978-3-642-83189-8 9, 10, 31, 32
200. V. Marek and M. Truszczyński. Nonmonotonic logic: context-dependent reasoning. Artifical Intelligence. Springer-Verlag, 1993. 10
201. V. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In K. Apt, V. Marek, M. Truszczyński, and D. Warren, editors, The Logic Programming Paradigm: a 25-Year Perspective, pages 375-398. Springer-Verlag, 1999. 9, 49
202. M. Mariën, D. Gilis, and M. Denecker. On the relation between ID-logic and answer set programming. In Alferes and Leite (2004), pages 108-120. DOI: 10.1007/978-3-540-30227-8-12 10 (Pubitemid 41049929)
203. J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999. DOI: 10.1109/12.769433 110, 151
204. J. Marques-Silva and K. Sakallah, editors. Proceedings of the Tenth International Conference on Theory and Applications of SatisfiabilityTesting (SAT'07), volume 4501 of Lecture Notes in Computer Science, 2007. Springer-Verlag. DOI: 10.1007/978-3-540-72788-0 188, 202
205. J. Marques-Silva, I. Lynce, and S. Malik. Conflict-driven clause learning SAT solvers. In Biere et al. (2009), chapter 4, pages 131-153. DOI: 10.3233/978-1-58603-929-5-131 110
206. J. McCarthy. Circumscription-a form of nonmonotonic reasoning. Artificial Intelligence, 13(1-2): 27-39, 1980. DOI: 10.1016/0004-3702(80)90011-9 89
207. J. McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28:89-116, 1986. DOI: 10.1016/0004-3702(86) 90032-9 89 (Pubitemid 16503926)
208. J. McCarthy. Elaboration tolerance, 1998. URL http://www-formal.stanford. edu/jmc/elaboration.html. 9
209. V. Mellarkod and M. Gelfond. Integrating answer set reasoning with constraint solving techniques. In J. Garrigue and M. Hermenegildo, editors, Proceedings of the Ninth International Symposium on Functional and Logic Programming (FLOPS'08), volume 4989 of Lecture Notes in Computer Science, pages 15-31. Springer-Verlag, 2008. 151 (Pubitemid 351642017)
210. V. Mellarkod, M. Gelfond, and Y. Zhang. Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligence, 53(1-4):251-287, 2008. DOI: 10.1007/s10472-009-9116-y 151
211. J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, 1988. 10
212. R. Moore. Semantical considerations on nonmonotonic logics. Artificial Intelligence, 25:75-94, 1985. DOI: 10.1016/0004-3702(85)90042-6 10, 89 (Pubitemid 15488898)
213. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Thirty-eighth Conference on Design Automation (DAC'01), pages 530-535. ACM Press, 2001. DOI: 10.1145/378239.379017 110, 151 (Pubitemid 32841010)
214. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-4):241-273, 1999. DOI: 10.1023/A:1018930122475 9, 10, 49
215. I. Niemelä and P. Simons. Evaluating an algorithm for default reasoning. In Working Notes of the IJCAI'95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, pages 66-72, 1995. 32
216. I. Niemelä and P. Simons. Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In J. Dix, U. Furbach, and A. Nerode, editors, Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning (LP-NMR'97), volume 1265 of Lecture Notes in Artificial Intelligence, pages 420-429. Springer-Verlag, 1997. DOI: 10.1007/3-540-63255-7 32 (Pubitemid 127100754)
217. R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM, 53(6): 937-977, 2006. DOI: 10.1145/1217856.1217859 90, 151 (Pubitemid 46276962)
218. M. Nogueira, M. Balduccini, M. Gelfond, R. Watson, and M. Barry. An A-prolog decision support system for the space shuttle. In I. Ramakrishnan, editor, Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages (PADL'01), volume 1990 of Lecture Notes in Computer Science, pages 169-183. Springer-Verlag, 2001. 175
219. J. Oetsch, J. Pührer, and H. Tompits. Catching the ouroboros: On debugging non-ground answer-set programs. In Theory and Practice of Logic Programming. Twenty-sixth International Conference on LogicProgramming (ICLP'10) Special Issue, volume 10(4-6), pages 513-529.Cambridge University Press, 2010. DOI: 10.1017/S1471068410000256 67
220. J. Oetsch, J. Pührer, M. Seidl, H. Tompits, and P. Zwickl. VIDEAS: A development tool for answer-set programs based on model-driven engineering technology. In Delgrande and Faber (2011), pages 382-387. DOI: 10.1007/978-3-642-20895-9-45 176
221. E. Oikarinen and T. Janhunen. Modular equivalence for normal logic programs. In Brewka et al. (2006), pages 412-416. 176
222. N. Olivetti. Tableaux for nonmonotonic logics. In D'Agostino et al. (1999), pages 469-528. 90
223. M. Ostrowski and T. Schaub. ASP modulo CSP: The clingcon system. Theory and Practice of Logic Programming, 12(4-5):485-503, 2012. DOI: 10.1017/S1471068412000142 151
224. D. Pearce. Default logic and constructive logic. In B. Neumann, editor, Proceedings of the European Conference on Artificial Intelligence, pages 309-313. John Wiley & sons, 1994. 175
225. D. Pearce. A new logical characterisation of stable models and answer sets. In J. Dix, L. Pereira, and T. Przymusinski, editors, Proceedings of the Sixth Workshop on Non-Monotonic Extensions of Logic Programming (NMELP'96), volume 1216 of Lecture Notes in Computer Science, pages 57-70. Springer-Verlag, 1996. 10, 175
226. D. Pearce. Equilibrium logic. Annals of Mathematics and Artificial Intelligence, 47(1-2):3-41, 2006. DOI: 10.1007/s10472-006-9028-z 10, 175, 177 (Pubitemid 44746067)
227. D. Pearce, I. de Guzmán, and A. Valverde. A tableau calculus for equilibrium entailment. In R. Dyckhoff, editor, Proceedings of the Ninth International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'00), volume 1847 of Lecture Notes in Computer Science, pages 352-367. Springer-Verlag, 2000. DOI: 10.1007/10722086 90
228. D. Pearce, H. Tompits, and S. Woltran. Characterising equilibrium logic and nested logic programs: Reductions and complexity. Theory and Practice of Logic Programming, 9(5):565-616, 2009. DOI: 10.1017/S147106840999010X 89
229. S. Perri, F. Scarcello, G. Catalano, and N. Leone. Enhancing DLV instantiator by back-jumping techniques. Annals of Mathematics and Artificial Intelligence, 51(2-4):195-228, 2007. DOI: 10.1007/s10472-008-9090-9 67
230. K. Pipatsrisawat and A. Darwiche. A lightweight component caching scheme for satisfiability solvers. In Marques-Silva and Sakallah (2007), pages 294-299. DOI: 10.1007/978-3-540-72788-0-28 151
231. K. Pipatsrisawat and A. Darwiche. On the power of clause-learning SAT solvers as resolution engines. Artificial Intelligence, 175(2):512-525, 2011. DOI: 10.1016/j.artint.2010.10.00290, 110
232. E. Pontelli and T. Son. Justifications for logic programs under answer set semantics. In Etalle and Truszczyński (2006). DOI: 10.1017/S1471068408003633177
233. E. Pontelli, M. Balduccini, and F. Bermudez. Non-monotonic reasoning on Beowulf platforms. In V. Dahl and P. Wadler, editors, Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL'03), volume 2562 of Lecture Notes in Artificial Intelligence, pages 37-57. Springer-Verlag, 2003. DOI: 10.1007/3-540-36388-2150 (Pubitemid 137629996)
234. potassco. URL http://potassco.sourceforge.net. DOI: 10.1007/s10992-011- 9215-1 150
235. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 55-76. Plenum Press, New York, 1978. 10
236. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1-2):81-132, 1980. DOI: 10.1016/0004-3702(80)90014-4 10, 31, 89
237. F. Ricca. A java wrapper for DLV. In M. de Vos and A. Provetti, editors, Proceedings of the Second International Workshop on Answer Set Programming (ASP'03), volume 78.CEUR Workshop Proceedings (CEUR-WS.org), 2003. URL http://ceur-ws.org/Vol-78. 176
238. F. Ricca, W. Faber, and N. Leone. A backjumping technique for disjunctive logic programming. AI Communications, 19(2):155-172, 2006. 150 (Pubitemid 43848926)
239. F. Ricca, L. Gallucci, R. Schindlauer, T. Dell'Armi, G. Grasso, and N. Leone. OntoDLV: An ASP-based system for enterprise ontologies. Journal of Logic and Computation, 19(4):643-670, 2009. DOI: 10.1093/logcom/exn042 176
240. J. Rintanen. Planning and SAT. In Biere et al. (2009), chapter 15, pages 483-504. DOI: 10.1007/978-3-642-15396-9-34 177
241. J. Rintanen, K. Heljanko, and I. Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence, 170(12-13):1031-1080, 2006. DOI: 10.1016/j.artint.2006.08.002 174 (Pubitemid 44537214)
242. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier and MIT Press, 2001. 189, 196
243. F. Rossi, P. van Beek, and T. Walsh, editors. Handbook of Constraint Programming. Elsevier Science, 2006. 9, 90, 151
244. O. Roussel and V. Manquinho. Pseudo-Boolean and cardinality constraints. In Biere et al. (2009), chapter 22, pages 695-733. DOI: 10.3233/978-1-58603-929- 5-695 150
245. L. Ryan. Efficient algorithms for clause-learning SAT solvers. Master's thesis, Simon Fraser University, 2004. 110, 151
246. C. Sakama and K. Inoue. Updating extended logic programs through abduction. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), volume 1730 of Lecture Notes in Artificial Intelligence, pages 147-161. Springer-Verlag, 1999. DOI: 10.1007/3-540-46767-X 176
247. C. Sakama and K. Inoue. Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence, 123(1-2):185-222, 2000. DOI: 10.1016/S0004-3702(00)00054-0 176
248. T. Schaub and K. Wang. A semantic framework for preference handling in answer set programming. Theory and Practice of Logic Programming, 3(4-5):569-607, 2003. DOI: 10.1017/S1471068403001844 176
249. J. Schlipf. The expressive powers of the logic programming semantics. Journal of Computer and System Sciences, 51:64-86, 1995. DOI: 10.1006/jcss.1995.1053 10
250. L. Schneidenbach, B. Schnor, M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. Experiences running a parallel answer set solver on Blue Gene. In M. Ropo, J. Westerholm, and J. Dongarra, editors, Proceedings of the Sixteenth European PVM/MPI Users'Group Meeting on Recent Advances in ParallelVirtual Machine and Message Passing Interface (PVM/MPI'09), volume 5759 ofLecture Notes in Computer Science, pages 64-72. Springer-Verlag, 2009. DOI: 10.1007/978-3-642-03770-2 150
251. C. Schwind. A tableaux-based theorem prover for a decidable subset of default logic. In M. Stickel, editor, Proceedings of the Tenth International Conference on Automated Deduction (CADE'90), volume 449 of Lecture Notes in Computer Science, pages 528-542. Springer-Verlag, 1990. DOI: 10.1007/3-540-52885-7 89
252. P. Simons. Extending and Implementing the Stable Model Semantics. Dissertation, Helsinki University of Technology, 2000. 32
253. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002. DOI: 10.1016/S0004-3702(02)00187-X 32, 33, 110, 150
254. J. Slaney and S. Thiébaux. Blocks world revisited. Artificial Intelligence, 125(1-2):119-153, 2001. DOI: 10.1016/S0004-3702(00)00079-5 174 (Pubitemid 32130121)
255. M. Slota and J. Leite. On semantic update operators for answer-set programs. In H. Coelho, R. Studer, and M. Wooldridge, editors, Proceedings of the Nineteenth European Conference on Artificial Intelligence (ECAI'10), pages 957-962. IOS Press, 2010. 176
256. T. Soininen and I. Niemelä. Developing a declarative rule language for applications in product configuration. In G. Gupta, editor, Proceedings of the First International Workshop on Practical Aspects of Declarative Languages (PADL'99), volume 1551 of Lecture Notes in Computer Science, pages 305-319. Springer-Verlag, 1999. 175
257. T. Syrjänen. Lparse 1.0 user's manual. URL http://www.tcs.hut.fi/ Software/smodels/lparse.ps.gz. 32, 33, 66, 149
258. T. Syrjänen. Omega-restricted logic programs. In Eiter et al. (2001), pages 267-279. DOI: 10.1007/3-540-45402-0-20 66, 67
259. T. Syrjänen. Cardinality constraint programs. In Alferes and Leite (2004), pages 187-199. DOI: 10.1007/978-3-540-30227-8-18 33 (Pubitemid 41049935)
260. T. Syrjänen. Debugging inconsistent answer set programs. In Dix and Hunter (2006), 177 pages 77-83.
261. T. Syrjänen. Logic Programs and Cardinality Constraints: Theory and Practice. Dissertation, Aalto University, 2009. 66
262. A. Tarski. A lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955. DOI: 10.2140/pjm.1955.5.285 32
263. G. Terracina, E. De Francesco, C. Panetta, and N. Leone. Enhancing a DLP system for advanced database applications. In D. Calvanese and G. Lausen, editors, Proceedings of the Second International Conference on Web Reasoning and Rule Systems (RR'08), volume 5341 of Lecture Notes in Computer Science, pages 119-134.Springer-Verlag, 2008. DOI: 10.1007/978-3-540-88737-9 176
264. E. Torlak and D. Jackson. Kodkod: a relational model finder. In Proceedings of the Thirteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'07), pages 632-647. Springer-Verlag, 2007. DOI: 10.1007/978-3-540-71209-1-49 10 (Pubitemid 350259325)
265. M. Truszczynski. Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs. Theory and Practice of Logic Programming, 11(6):881-904, 2011. DOI: 10.1017/S1471068410000463 33
266. J. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, 1988. 9, 66
267. A. Van Gelder. The alternating fixpoint of logic programs with negation. Journal of Computer and System Science, 47:185-221, 1993. DOI: 10.1145/73721.73722 89
268. A. Van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991. DOI: 10.1145/116825.116838 89
269. M. Veloso, editor. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), 2007. AAAI/MIT Press. 191, 192, 196
270. M. Veloso and S. Kambhampati, editors. Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI'05), 2005. AAAI Press. 199, 205
271. J. Ward and J. Schlipf. Answer set programming with clause learning. In V. Lifschitz and I. Niemelä, editors, Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), volume 2923 of Lecture Notes in Artificial Intelligence, pages 302-313. Springer-Verlag, 2004. DOI: 10.1007/b94792 150 (Pubitemid 38050686)
272. S. Woltran. Equivalence between extended datalog programs-a brief survey. In O. de Moor, G. Gottlob, T. Furche, and Sellers A, editors, First International Workshop on Datalog, volume 6702 of Lecture Notes in Computer Science, pages 106-119. Springer-Verlag, 2011. 176
273. L. Xu, F. Hutter, H. Hoos, and K. Leyton-Brown. SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research, 32:565-606, 2008. DOI: 10.1613/jair.2490 150
274. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design (IC-CAD'01), pages 279-285, 2001. DOI: 10.1109/ICCAD.2001.968634 110 (Pubitemid 33148971)
275. Y. Zhang and N. Foo. A unified framework for representing logic program updates. In Veloso and Kambhampati (2005), pages 707-713. 176