Solving the satisfiability problem through boolean networks

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

Volumn 1792, Issue , 2000, Pages 72-83

  Milano, Michela ^a   Roli, Andrea ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; MAPPING;

BOOLEAN NETWORK; BOOLEAN NETWORKS; FIXED POINTS; LOCAL SEARCH ALGORITHM; NEW APPROACHES; SAT INSTANCES; SATISFIABILITY PROBLEMS; SOLVE THE SATISFIABILITY;

PROBLEM SOLVING;

EID: 1642398876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (10)

1. G.A. Cowan, D. Pines, D. Meltzer eds. Complexity: metaphors, models, andreality. Addison-Wesley Publishing Company, Redwood City, CA, 1994.
2. M. Davis, H. Putnam. A computing procedure for quantification theory. JACMJ:201-215, 1960.
3. M. Dorigo. Learning by Probabilistic Boolean Networks. Proceedings ofWorld Congress on Computationallntelligence - IEEE International Conference on Neural Networks, 887-891, 1994.
4. W. Feller. An Introduction to Probability Theory and its Applications. Third Edition, John Wiley.
5. M. R. Garey, D. S. Johnson. Computers and intractability. Freeman, 1979.
6. H. H. Hoos. On the Run-time Behaviour of Stochastic Local Search Al- gortihms for SAT. Proceedings of AAAI-99, p.661-666, MIT Press, 1999.
7. S. A. Kauffman. The Origins of Order. Oxford University Press, New York, 1993.
8. D. Liang, W. Li. Multi-strategy local search for SAT problem. ProceedingECAI98, H. Prade ed. John Whiley & sons. 1998.
9. D. McAllester, B. Selman, H. Kautz. Evidence for invariants in local search. Proceedings of AAAI-97, 1997.
10. B. Selman, H. Levesque, D. Mitchell. A new method for solving hard satisfiability problems. Proceedings ofAAAI-92, 440-446, San Jose, CA, 1992.