Using stochastic local search to solve Quantified Boolean Formulae

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

Volumn 2833, Issue , 2003, Pages 348-362

  Gent, Ian P ^a   Hoos, Holger H ^b   Rowley, Andrew G D ^a   Smyth, Kevin ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LOCAL SEARCH (OPTIMIZATION); STOCHASTIC SYSTEMS;

EFFICIENT IMPLEMENTATION; OPTIMISATIONS; QUANTIFIED BOOLEAN FORMULAS; RUNTIME DISTRIBUTIONS; SAT INSTANCES; SEARCH PROCESS; STATE OF THE ART; STOCHASTIC LOCAL SEARCHES;

BOOLEAN ALGEBRA;

EID: 33646181229     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_24     Document Type: Article

References (15)

1. Guinchiglia, E., Narizzano, M., Tacchella, A.: Backjumping for quantified Boolean logic satisfiability. In: IJCAI-01. (2001) 275-281
2. Selman, B., Kautz, H.: Domain-independent extensions to GSAT: solving large structured satisfiability problems. In: IJCAI-93. (1993) 290-295
3. McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: AAAI'97. (1997) 321-326
4. Guinchiglia, E., Narizzano, M., Tacchella, A.: An analysis of backjumping and trivial truth in quantified Boolean formulas satisfiability. In: AI*IA-01, Springer (2001) 111-122
5. Zhang, L., Malik, S.: Towards a symmetric treatment of satisfaction and conflicts in quantified boolean formula evaluation. In: CP-2002, Springer (2002) 200-215
6. Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified Boolean formulae. In: AAAI-98. (1998) 262-267
7. Hoos, H.: Stochastic Local Search - Methods, Models, Applications. PhD thesis (1998)
8. Hoos, H., Stützle, T.: Local search algorithms for SAT: An empirical evaluation. J. of Automated Reasoning 24 (2000) 421-481
9. Gent, I., Walsh, T.: Beyond NP: the QSAT phase transition. In: AAAI-99. (1999) 648-653
10. Rintanen, J.: Improvements to the evaluation of quantified boolean formulae. In: IJCAI-99. (1999) 1192-1197
11. Guinchiglia, E., Narizzano, M., Tacchella, A.: Learning for quantified boolean logic satisfiability. In: AAAI-2002. (2002) 649-654
12. Letz, R.: Lemma and model caching in decision procedures for quantified boolean formulas. In: TABLEAUX 2002. (2002) 160-175
13. Plaisted, D., Biere, A., Zhu, Y.: A satisfiability procedure for quantified boolean formulae. Discrete Applied Mathematics (2003) To appear.
14. Rintanen, J.: Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In: LPAR-01, Springer (2001) 362-376
15. Schiex, T., Verfaillie, G.: Stubbornness: a possible enhancement for backjumping and no-good recording. In: ECAI-94. (1994) 165-169