Solution enumeration for projected boolean search problems

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

Volumn 5547 LNCS, Issue , 2009, Pages 71-86

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

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM COMPUTING; ANSWER SET PROGRAMMING; BOOLEAN CONSTRAINT; COMBINATORIAL SEARCH; POLYNOMIAL SPACE; REAL-WORLD PROBLEM; SEARCH PROBLEM;

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CONSTRAINED OPTIMIZATION;

EID: 69849090800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01929-6_7     Document Type: Conference Paper

References (16)

1. Marques-Silva, J., Sakallah, K.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5), 506-521 (1999)
2. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. DAC 2001, pp. 530-535. ACM Press, New York (2001)
3. Mitchell, D.: A SAT solver primer. Bulletin of the EATCS 85, 112-133 (2005)
4. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proc. IJCAI 2007, pp. 386-392. AAAI Press, Menlo Park (2007)
5. Davies, J., Bacchus, F.: Using more reasoning to improve #SAT solving. In: Proc. AAAI 2007, pp. 185-190. AAAI Press, Menlo Park (2007)
6. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
7. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
8. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201-215 (1960)
9. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394-397 (1962)
10. Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: Proc. ECAI 2006, pp. 377-381. IOS Press, Amsterdam (2006)
11. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol.4483, pp. 136-148. Springer, Heidelberg (2007)
12. Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: Proc. ICCAD 2001, pp. 279-285. IEEE Press, Los Alamitos (2001)
13. Ryan, L.: Efficient algorithms for clause-learning SAT solvers. MSc's thesis, SFU (2004)
14. Järvisalo, M., Junttila, T.: Limitations of restricted branching in clause learning. Constraints (to appear), http://www.tcs.hut.fi/mjj/
15. Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.4501, pp. 294-299. Springer, Heidelberg (2007)
16. Gebser, M., Schaub, T., Thiele, S., Usadel, B., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. In: Garcia De La Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.5366, pp. 130-144. Springer, Heidelberg (2008)