Computing horn strong backdoor sets thanks to local search

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2006, Pages 139-143

  Paris, Lionel ^a   Ostrowski, Richard ^a   Siegel, Pierre ^a   Saïs, Lakhdar ^b  

^a AIX MARSEILLE UNIV   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA;

CONJUNCTIVE NORMAL FORM (CNF); NON HORN CLAUSES;

COMPUTATION THEORY;

EID: 38149013263     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2006.43     Document Type: Conference Paper

References (14)

1. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, 1962.
2. E. Grégoire, B. Mazure, R. Ostrowski, and L. Sais. Automatic extraction of functional dependencies. In proc. of SAT, volume 3542 of LNCS, pages 122-132, 2005.
3. E. A. Hirsch. A new algorithm for MAX-2-SAT. Lecture Notes in Computer Science, 1770:65-73, 2000.
4. P. Kilby, J. Slaney, S. Thiebaux, and T. Walsh. Backbones and backdoors in satisfiability. In AAAI'2005, 2005.
5. H. V. Maaren and L. V. Norden. Correlations between horn fractions, satisfiability and solver performance for fixed density random 3-cnf instances. Annals of Mathematics and Artificial Intelligence, 44:157-177, 2005.
6. B. Mazure, L. Saïs, and E. Grégoire. Tabu search for SAT. In Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97/IAAI-97), pages 281-285. AAAI Press, July 27-31 1997.
7. N. Nishimura, P. Ragde, and S. Szieder. Detecting backdoor sets with respect to horn and binary clauses. In 7th International Conference on theory and Application of Satisfiability Testing, 2004.
8. C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
9. Sat 2002 : Fifth international symposium on theory and applications of satisfiability testing, May 2002. http://gauss.ececs.uc.edu/Conferences/SAT2002/ .
10. Sat 2003 : Sixth international symposium on theory and applications of satisfiability testing, May 2003. http://www.mrg.dist.unige.it/events/sat03/.
11. B. Selman and H. A. Kautz. An empirical study of greedy local search for satisfiability testing. 1993.
12. G. Tseitin. On the complexity of derivations in the propositional calculus. In H. Slesenko, editor, Structures in Constrictives Mathematics and Mathematical Logic, Part II, pages 115-125, 1968.
13. R. Williams, C. Gomes, and bart Selman. Backdoors to typical case complexity. In Proceeding of Intenrational Joint Conference on Artificial Intelligence (IJCAI'2003), 2003.
14. R. Williams, C. Gomes, and B. Selman. On the connections between heavy-tails, backdoors, and restarts in combinatorial search. In International Conference on Theory and Applications of Satisfiability Testing (SAT'2003), 2003.