A new approach on solving 3-satisfiability

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

Volumn 1138, Issue , 1996, Pages 197-212

  Rodošek, Robert ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ALGORITHM FOR SOLVING; NEW APPROACHES; SPECIAL PROPERTIES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84867551436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61732-9_59     Document Type: Conference Paper

References (15)

1. n): A No-MIS Algorithm. In Technical Report ECCC TR95-33 (1995)
2. Biggs, N. L.: Discrete Mathematics. Oxford Science Publications, New York (1994)
3. Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery 7(3) (1960) 201-215
4. Fikes, R. E.: REF-ARF: A System for Solving Problems Stated as Procedures. Artificial Intelligence 1 (1970) 27-120
5. Garey, M. R., Johnson, D. S.: Computers and Intractability. W. H. Freeman and Company, San Francisco (1979)
6. Haken, A.: The Intractability of Resolution. Theoretical Computer Science 39 (1985) 297-308
7. Jeavons, P. G.: The Expressive Power of Constraint Networks. In Technical Report CSD-TR-640, Royal Holloway and Bedford New College, University of London (1990)
8. Lawler, E. L.: A Note on the Complexity of the Chromatic Number Problem. Inf. Proc. Lett. 5 (1976) 66-67.
9. Mayer, J., Mitterreiter, I., Radermacher, F. J.: Running Time Experiments on some Algorithms for Solving Propositional Satisfiability Problems. In Technical Report, Forschungsinstitut für anwendungsorientierte Wissensverarbeitung, Ulm (1994)
10. n Steps. Discrete Appl. Math. 10 (1985) 287-295
11. Rodošek, R.: Combining Heuristics for Constraint Satisfaction Problems. Proceedings of the CP’95 Workshop on Studying and Solving Really Hard Problems, Cassis (1995) 147-156
12. n Steps. 6th Workshop Computer Science Logic, Spring-Verlag (1993) 379-394
13. n) Steps. 19th Int. Workshop Graph-Theoretic Concepts in Computer Science, Spring-Verlag (1994) 177-182
14. Trümper, K., Radermacher, F. J.: Analyse der Leistungsfähigkeit eines neuen Systems zur Auswertung aussagenlogischer Probleme. In Technical Report FAW-TR- 90003 (1990)
15. Urquhart, A.: Hard Examples for Resolution. JACM 34 (1987) 209-219