Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conf... View more
Baral, C.; Brewka, G.; and Schlipf, J., eds. 2007. Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07). Springer-Verlag.
Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
Bayardo, R., and Schrag, R. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), 203-208. AAAI Press/MIT Press.
Beame, P.; Kautz, H.; and Sabharwal, A. 2004. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research 22:319-351.
Clark, K. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases, 293-322. Plenum Press.
Dechter, R. 2003. Constraint Processing. Morgan Kaufmann Publishers.
Dershowitz, N.; Hanna, Z.; and Nadel, A. 2005. A clausebased heuristic for SAT solvers. In Bacchus, F., and Walsh, T., eds., Proceedings of the Eigth International Conference on Theory and Applications of Satisfiability Testing (SAT'05), 46-60. Springer-Verlag.
Ee´n, N., and So¨rensson, N. 2003. An extensible SATsolver. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), 502-518.
Erdem, E., and Lifschitz, V. 2003. Tight logic programs. Theory and Practice of Logic Programming 3(4-5):499- 518.
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.