Conflict-driven answer set solving: From theory to practice

Artificial Intelligence

Volumn 187-188, Issue , 2012, Pages 52-89

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

^a UNIVERSITY OF POTSDAM   (Germany)

^b GRIFFITH UNIVERSITY   (Australia)

Author keywords

Answer set programming; Logic programming; Nonmonotonic reasoning

Indexed keywords

ALGORITHMIC FRAMEWORK; ANSWER SET; ANSWER SET PROGRAMMING; ANSWER SET SOLVING; CONSTRAINT-BASED; LOGIC PROGRAMS; NON-MONOTONIC REASONING; SATISFIABILITY; UNIT PROPAGATION;

COMPETITION;

LOGIC PROGRAMMING;

EID: 84860213954     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2012.04.001     Document Type: Article

References (128)

1. C. Anger, M. Gebser, T. Linke, A. Neumann, and T. Schaub The nomore++ approach to answer set solving G. Sutcliffe, A. Voronkov, Proceedings of the Twelfth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05) Lecture Notes in Artificial Intelligence vol. 3835 2005 Springer-Verlag 95 109 (Pubitemid 43955308)
2. C. Anger, M. Gebser, T. Schaub, Approaching the core of unfounded sets, in: J. Dix, A. Hunter (Eds.), Proceedings of the Eleventh International Workshop on Nonmonotonic Reasoning (NMR'06), number IFI-06-04, Institute for Informatics, Clausthal University of Technology, Technical Report Series, 2006, pp. 58-66.
3. K. Apt, H. Blair, and A. Walker Towards a theory of declarative knowledge J. Minker, Foundations of Deductive Databases and Logic Programming 1987 Morgan Kaufmann Publishers 89 148 Chapter 2
4. G. Audemard, L. Simon, Predicting learnt clauses quality in modern SAT solvers, in Boutilier (2009) [14, pp. 399-404].
5. Y. Babovich, and V. Lifschitz Computing answer sets using program completion http://www.cs.utexas.edu/users/tag/cmodels/cmodels-1.ps 2003
6. C. Baral Knowledge Representation, Reasoning and Declarative Problem Solving 2003 Cambridge University Press
7. C. Baral, G. Brewka, and J. Schlipf Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07) Lecture Notes in Artificial Intelligence vol. 4483 2007 Springer-Verlag
8. C. Baral, G. Greco, N. Leone, and G. Terracina Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05) Lecture Notes in Artificial Intelligence vol. 3662 2005 Springer-Verlag
9. P. Beame, H. Kautz, and A. Sabharwal Towards understanding and harnessing the potential of clause learning Journal of Artificial Intelligence Research 22 2004 319 351 (Pubitemid 41525889)
10. C. Barrett, R. Sebastiani, S. Seshia, and C. Tinelli Satisfiability modulo theories A. Biere, Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications vol. 185 2009 IOS Press 825 885 Chapter 26
11. A. Biere PicoSAT essentials Journal on Satisfiability, Boolean Modeling and Computation 4 2008 75 97
12. A. Biere, M. Heule, H. van Maaren, and T. Walsh Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications vol. 185 2009 IOS Press
13. G. Boenn, M. Brain, M. De Vos, J. Fitch, Automatic composition of melodic and harmonic music by answer set programming, in Garcia de la Banda and Pontelli (2008) [43, pp. 160-174].
14. C. Boutilier Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI'09) 2009 AAAI Press/MIT Press
15. M. Brain, and M. De Vos The significance of memory costs in answer set solver implementation Journal of Logic and Computation 19 4 2009 615 641
16. G. Brewka, and J. Lang Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR'08) 2008 AAAI Press
17. F. Calimeri, W. Faber, G. Pfeifer, and N. Leone Pruning operators for disjunctive logic programming systems Fundamenta Informaticae 71 2-3 2006 183 214 (Pubitemid 43893779)
18. X. Chen, J. Ji, F. Lin, Computing loops with at most one external support rule, in Brewka and Lang (2008) [16, pp. 401-410].
19. X. Chen, J. Ji, F. Lin, Computing loops with at most one external support rule for disjunctive logic programs, in Erdem et al. (2009) [38, pp. 130-144].
20. K. Claessen, N. Sörensson, New techniques that improve MACE-style finite model finding, in: P. Baumgartner, C. Fermüller (Eds.), Proceedings of the Workshop on Model Computation - Principles, Algorithms, Applications (MODEL'03), 2003.
21. K. Clark Negation as failure H. Gallaire, J. Minker, Logic and Data Bases 1978 Plenum Press 293 322
22. clasp http://www.cs.uni-potsdam.de/clasp
23. A. Darwiche, and K. Pipatsrisawat Complete algorithms A. Biere, Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications vol. 185 2009 IOS Press 99 130 Chapter 3
24. M. Davis, G. Logemann, and D. Loveland A machine program for theorem-proving Communications of the ACM 5 1962 394 397
25. M. Davis, and H. Putnam A computing procedure for quantification theory Journal of the ACM 7 1960 201 215
26. R. Dechter Constraint Processing 2003 Morgan Kaufmann Publishers
27. J. Delgrande, and W. Faber Proceedings of the Eleventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11) Lecture Notes in Artificial Intelligence vol. 6645 2011 Springer-Verlag
28. M. Denecker, J. Vennekens, S. Bond, M. Gebser, M. Truszczyński, The second answer set programming competition, in Erdem et al. (2009) [38, pp. 637-654].
29. N. Dershowitz, Z. Hanna, A. Nadel, Towards a better understanding of the functionality of a conflict-driven SAT solver, in Marques-Silva and Sakallah (2007) [98, pp. 287-293].
30. W. Dowling, and J. Gallier Linear-time algorithms for testing the satisfiability of propositional Horn formulae Journal of Logic Programming 1 1984 267 284 (Pubitemid 15564552)
31. C. Drescher, M. Gebser, T. Grote, B. Kaufmann, A. König, M. Ostrowski, T. Schaub, Conflict-driven disjunctive answer set solving, in Brewka and Lang (2008) [16, pp. 422-432].
32. C. Drescher, M. Gebser, B. Kaufmann, T. Schaub, Heuristics in conflict resolution, in: M. Pagnucco, M. Thielscher (Eds.), Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (NMR'08), number UNSW-CSE-TR-0819, School of Computer Science and Engineering, The University of New South Wales, Technical Report Series, 2008, pp. 141-149.
33. N. Eén, and A. Biere Effective preprocessing in SAT through variable and clause elimination F. Bacchus, T. Walsh, Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT'05) Lecture Notes in Computer Science vol. 3569 2005 Springer-Verlag 61 75 (Pubitemid 41425497)
34. N. Eén, and N. Sörensson Temporal induction by incremental SAT solving Electronic Notes in Theoretical Computer Science 89 4 2003
35. N. Eén, N. Sörensson, An extensible SAT-solver, in: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), 2003, pp. 502-518.
36. N. Eén, and N. Sörensson Translating pseudo-Boolean constraints into SAT Journal on Satisfiability, Boolean Modeling and Computation 2 2006 1 26
37. E. Ellguth, M. Gebser, M. Gusowski, R. Kaminski, B. Kaufmann, S. Liske, T. Schaub, L. Schneidenbach, B. Schnor, A simple distributed conflict-driven answer set solver, in Erdem et al. (2009) [38, pp. 490-495].
38. E. Erdem, F. Lin, and T. Schaub Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'09) Lecture Notes in Artificial Intelligence vol. 5753 2009 Springer-Verlag
39. W. Faber, G. Pfeifer, and N. Leone Semantics and complexity of recursive aggregates in answer set programming Artificial Intelligence 175 1 2011 278 298
40. F. Fages Consistency of Clark's completion and the existence of stable models Journal of Methods of Logic in Computer Science 1 1994 51 60
41. P. Ferraris, Answer sets for propositional theories, in Baral et al. (2005) [8, pp. 119-131].
42. J. Freeman, Improvements to propositional satisfiability search algorithms, PhD thesis, University of Pennsylvania, 1995.
43. M. Garcia de la Banda, and E. Pontelli Proceedings of the Twenty-Fourth International Conference on Logic Programming (ICLP'08) Lecture Notes in Computer Science vol. 5366 2008 Springer-Verlag
44. M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and M. Schneider Potassco: The Potsdam answer set solving collection AI Communications 24 2 2011 105 124
45. M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, A user's guide to gringo, clasp, clingo, and iclingo, available at: http://potassco.sourceforge.net.
46. M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, S. Thiele, Engineering an incremental ASP solver, in Garcia de la Banda and Pontelli (2008) [43, pp. 190-205].
47. M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, On the implementation of weight constraint rules in conflict-driven ASP solvers, in Hill and Warren (2009) [73, pp. 250-264].
48. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub Multi-criteria optimization in answer set programming J. Gallagher, M. Gelfond, Technical Communications of the Twenty-Seventh International Conference on Logic Programming (ICLP'11) Leibniz International Proceedings in Informatics (LIPIcs) vol. 11 2011 Dagstuhl Publishing 1 10
49. M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, M. Schneider, S. Ziller, A portfolio solver for answer set programming: Preliminary report, in Delgrande and Faber (2011) [27, pp. 352-357].
50. M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, B. Schnor, Cluster-based ASP solving with claspar, in Delgrande and Faber (2011) [27, pp. 364-369].
51. M. Gebser, R. Kaminski, A. König, T. Schaub, Advances in gringo series 3, in Delgrande and Faber (2011) [27, pp. 345-351].
52. M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, clasp: A conflict-driven answer set solver, in Baral et al. (2007) [7, pp. 260-265].
53. M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, Conflict-driven answer set enumeration, in Baral et al. (2007) [7, pp. 136-148].
54. M. Gebser, B. Kaufmann, A. Neumann, T. Schaub, Conflict-driven answer set solving, in Veloso (2007) [125, pp. 386-392].
55. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub Advanced preprocessing for answer set solving M. Ghallab, C. Spyropoulos, N. Fakotakis, N. Avouris, Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI'08) 2008 IOS Press 15 19
56. M. Gebser, B. Kaufmann, T. Schaub, The conflict-driven answer set solver clasp: Progress report, in Erdem et al. (2009) [38, pp. 509-514].
57. M. Gebser, B. Kaufmann, and T. Schaub Solution enumeration for projected Boolean search problems W. van Hoeve, J. Hooker, Proceedings of the Sixth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09) Lecture Notes in Computer Science vol. 5547 2009 Springer-Verlag 71 86
58. M. Gebser, J. Lee, Y. Lierler, Elementary sets for logic programs, in Gil and Mooney (2006) [69, pp. 244-249]. (Pubitemid 44705292)
59. M. Gebser, J. Lee, Y. Lierler, Head-elementary-set-free logic programs, in Baral et al. (2007) [7, pp. 149-161].
60. M. Gebser, M. Ostrowski, T. Schaub, Constraint answer set solving, in Hill and Warren (2009) [73, pp. 235-249].
61. M. Gebser, T. Schaub, Loops: Relevant or redundant?, in Baral et al. (2005) [8, pp. 53-65].
62. M. Gebser, T. Schaub, Characterizing ASP inferences by unit propagation, in: E. Giunchiglia, V. Marek, D. Mitchell, E. Ternovska (Eds.), Proceedings of the First International Workshop on Search and Logic: Answer Set Programming and SAT (LaSh'06), 2006, pp. 41-56.
63. M. Gebser, and T. Schaub Tableau calculi for answer set programming S. Etalle, M. Truszczyński, Proceedings of the Twenty-Second International Conference on Logic Programming (ICLP'06) Lecture Notes in Computer Science vol. 4079 2006 Springer-Verlag 11 25 (Pubitemid 44492579)
64. 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 2011 323 360
65. M. Gelfond Answer sets V. Lifschitz, F. van Harmelen, B. Porter, Handbook of Knowledge Representation 2008 Elsevier 285 316 Chapter 7
66. M. Gelfond, and N. Leone Logic programming and knowledge representation - The A-Prolog perspective Artificial Intelligence 138 1-2 2002 3 38
67. M. Gelfond, and V. Lifschitz The stable model semantics for logic programming R. Kowalski, K. Bowen, Proceedings of the Fifth International Conference and Symposium on Logic Programming (ICLP'88) 1988 MIT Press 1070 1080
68. M. Gelfond, and V. Lifschitz Classical negation in logic programs and disjunctive databases New Generation Computing 9 1991 365 385
69. Y. Gil, and R. Mooney Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAA'06) 2006 AAAI Press
70. E. Giunchiglia, N. Leone, and M. Maratea On the relation among answer set solvers Annals of Mathematics and Artificial Intelligence 53 1-4 2008 169 204
71. E. Giunchiglia, Y. Lierler, and M. Maratea Answer set programming based on propositional satisfiability Journal of Automated Reasoning 36 4 2006 345 377 (Pubitemid 46046675)
72. E. Goldberg, and Y. Novikov BerkMin: A fast and robust SAT solver Proceedings of the Fifth Conference on Design, Automation and Test in Europe (DATE'02) 2002 IEEE Press 142 149
73. P. Hill, and D. Warren Proceedings of the Twenty-Fifth International Conference on Logic Programming (ICLP'09) Lecture Notes in Computer Science vol. 5649 2009 Springer-Verlag
74. J. Huang, The effect of restarts on the efficiency of clause learning, in Veloso (2007) [125, pp. 2318-2323].
75. 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 http://www.hindawi.com/journals/ijrc/2009/863630.html
76. T. Janhunen Some (in)translatability results for normal logic programs and propositional theories Journal of Applied Non-Classical Logics 16 1-2 2006 35 86
77. T. Janhunen, and I. Niemelä Compact translations of non-disjunctive answer set programs to propositional clauses M. Balduccini, T. Son, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday Lecture Notes in Computer Science vol. 6565 2011 Springer-Verlag 111 130
78. T. Janhunen, I. Niemelä, M. Sevalnev, Computing stable models via reductions to difference logic, in Erdem et al. (2009) [38, pp. 142-154].
79. 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 2008 691 716
80. T. Kim, J. Lee, R. Palla, Circumscriptive event calculus as answer set programming, in Boutilier (2009) [14, pp. 823-829].
81. H. Kleine Büning, and X. Zhao Proceedings of the Eleventh International Conference on Theory and Applications of Satisfiability Testing (SAT'08) Lecture Notes in Computer Science vol. 4996 2008 Springer-Verlag
82. J. Lee A model-theoretic counterpart of loop formulas L. Kaelbling, A. Saffiotti, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCA'05) 2005 Professional Book Center 503 508
83. 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 2006 499 562 (Pubitemid 44330485)
84. N. Leone, P. Rullo, and F. Scarcello Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation Information and Computation 135 2 1997 69 112 (Pubitemid 127452754)
85. C. Li, and F. Manyà MaxSAT A. Biere, Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications vol. 185 2009 IOS Press 613 631 Chapter 19
86. Y. Lierler Abstract answer set solvers with learning Theory and Practice of Logic Programming 11 2-3 2011 135 169
87. V. Lifschitz Answer set programming and plan generation Artificial Intelligence 138 1-2 2002 39 54
88. V. Lifschitz, and A. Razborov Why are there so many loop formulas? ACM Transactions on Computational Logic 7 2 2006 261 268
89. V. Lifschitz, L. Tang, and H. Turner Nested expressions in logic programs Annals of Mathematics and Artificial Intelligence 25 3-4 1999 369 389
90. F. Lin, and Y. Zhao ASSAT: Computing answer sets of a logic program by SAT solvers Artificial Intelligence 157 1-2 2004 115 137
91. Z. Lin, Y. Zhang, H. Hernandez, Fast SAT-based answer set solver, in Gil and Mooney (2006) [69, pp. 92-97]. (Pubitemid 44705269)
92. M. Luby, A. Sinclair, and D. Zuckerman Optimal speedup of Las Vegas algorithms Information Processing Letters 47 4 1993 173 180
93. V. Marek, and V. Subrahmanian The relationship between stable, supported, default and autoepistemic semantics for general logic programs Theoretical Computer Science 103 2 1992 365 386
94. V. Marek, and M. Truszczyński Stable models and an alternative logic programming paradigm K. Apt, V. Marek, M. Truszczyński, D. Warren, The Logic Programming Paradigm: A 25-Year Perspective 1999 Springer-Verlag 375 398
95. M. Mariën, J. Wittocx, M. Denecker, M. Bruynooghe, SAT(ID): Satisfiability of propositional logic extended with inductive definitions, in Kleine Büning and Zhao (2008) [81, pp. 211-224]. (Pubitemid 351775512)
96. J. Marques-Silva, I. Lynce, and S. Malik Conflict-driven clause learning SAT solvers A. Biere, Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications vol. 185 2009 IOS Press 131 153 Chapter 4
97. J. Marques-Silva, and K. Sakallah GRASP: A search algorithm for propositional satisfiability IEEE Transactions on Computers 48 5 1999 506 521
98. J. Marques-Silva, and K. Sakallah Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT'07) Lecture Notes in Computer Science vol. 4501 2007 Springer-Verlag
99. A. Mileo, D. Merico, R. Bisiani, A logic programming approach to home monitoring for risk prevention in assisted living, in Garcia de la Banda and Pontelli (2008) [43, pp. 145-159].
100. D. Mitchell A SAT solver primer Bulletin of the European Association for Theoretical Computer Science 85 2005 112 133
101. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik Chaff: Engineering an efficient SAT solver Proceedings of the Thirty-Eighth Conference on Design Automation (DAC'01) 2001 ACM Press 530 535 (Pubitemid 32841010)
102. I. Niemelä Logic programs with stable model semantics as a constraint programming paradigm Annals of Mathematics and Artificial Intelligence 25 3-4 1999 241 273
103. I. Niemelä Stable models and difference logic Annals of Mathematics and Artificial Intelligence 53 1-4 2008 313 329
104. 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 2006 937 977 (Pubitemid 46276962)
105. S. Perri, F. Scarcello, G. Catalano, and N. Leone Enhancing DLV instantiator by backjumping techniques Annals of Mathematics and Artificial Intelligence 51 2-4 2007 195 228
106. D. Pearce A new logical characterisation of stable models and answer sets J. Dix, L. Pereira, T. Przymusinski, Proceedings of the Sixth Workshop on Non-Monotonic Extensions of Logic Programming (NMELP'96) Lecture Notes in Computer Science vol. 1216 1996 Springer-Verlag 57 70
107. K. Pipatsrisawat, A. Darwiche, A lightweight component caching scheme for satisfiability solvers, in Marques-Silva and Sakallah (2007) [98, pp. 294-299].
108. K. Pipatsrisawat, and A. Darwiche A new clause learning scheme for efficient unsatisfiability proofs D. Fox, C. Gomes, Proceedings of the Twenty-Third National Conference on Artificial Intelligence (AAA'08) 2008 AAAI Press 1481 1484
109. K. Pipatsrisawat, and A. Darwiche On the power of clause-learning SAT solvers as resolution engines Artificial Intelligence 175 2 2011 512 525
110. Potassco http://potassco.sourceforge.net
111. P. Purdom A transitive closure algorithm BIT Numerical Mathematics 10 1970 76 94
112. F. Ricca, W. Faber, and N. Leone A backjumping technique for disjunctive logic programming AI Communications 19 2 2006 155 172 (Pubitemid 43848926)
113. F. Rossi, P. van Beek, and T. Walsh Handbook of Constraint Programming 2006 Elsevier
114. O. Roussel, and V. Manquinho Pseudo-Boolean and cardinality constraints A. Biere, Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications vol. 185 2009 IOS Press 695 733 Chapter 22
115. L. Ryan, Efficient algorithms for clause-learning SAT solvers, Master's thesis, Simon Fraser University, 2004.
116. V. Ryvchin, O. Strichman, Local restarts, in Kleine Büning and Zhao (2008) [81, pp. 271-276]. (Pubitemid 351775516)
117. J. Schlipf The expressive powers of the logic programming semantics Journal of Computer and System Sciences 51 1995 64 86
118. L. Schneidenbach, B. Schnor, M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub Experiences running a parallel answer set solver on Blue Gene M. Ropo, J. Westerholm, J. Dongarra, Proceedings of the Sixteenth European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (PVM/MP'09) Lecture Notes in Computer Science vol. 5759 2009 Springer-Verlag 64 72
119. P. Simons, I. Niemelä, and T. Soininen Extending and implementing the stable model semantics Artificial Intelligence 138 1-2 2002 181 234
120. T. Syrjänen Lparse 1.0 user's manual http://www.tcs.hut.fi/Software/ smodels/lparse.ps.gz
121. R. Tarjan Depth-first search and linear graph algorithms SIAM Journal on Computing 1 2 1972 146 160
122. M. Thielscher, Answer set programming for single-player games in general game playing, in Hill and Warren (2009) [73, pp. 327-341].
123. G. Tseitin On the complexity of derivation in propositional calculus A. Slisenko, Structures in Constructive Mathematics and Mathematical Logic, part 2 1970 Consultants Bureau 115 125
124. A. Van Gelder, K. Ross, and J. Schlipf The well-founded semantics for general logic programs Journal of the ACM 38 3 1991 620 650
125. M. Veloso Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCA'07) 2007 AAAI Press/MIT Press
126. J. Ward, and J. Schlipf Answer set programming with clause learning V. Lifschitz, I. Niemelä, Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04) Lecture Notes in Artificial Intelligence vol. 2923 2004 Springer-Verlag 302 313 (Pubitemid 38050686)
127. L. Zhang, C. Madigan, M. Moskewicz, S. Malik, Efficient conflict driven learning in a Boolean satisfiability solver, in: Proceedings of the International Conference on Computer-Aided Design (ICCAD'01), 2001, pp. 279-285. (Pubitemid 33148971)
128. L. Zhang, and S. Malik Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications Proceedings of the Sixth Conference on Design, Automation and Test in Europe (DATE'03) 2003 IEEE Press 10880 10885