Compiling problem specifications into SAT

Artificial Intelligence

Volumn 162, Issue 1-2, 2005, Pages 89-120

  Cadoli, Marco ^a   Schaerf, Andrea ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Automatic generation of problem reformulation; Executable specifications; NP complete problems; SAT problem

Indexed keywords

AUTOMATIC GENERATION OF PROBLEM REFORMULATION; EXECUTABLE SPECIFICATIONS; NP-COMPLETE PROBLEM; SAT PROBLEM;

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FORMAL LOGIC; HAMILTONIANS; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

PROGRAM COMPILERS;

EID: 11144320708     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.01.006     Document Type: Article

References (36)

1. M.H. van Emden, and R.A. Kowalski The semantics of predicate logic as a programming language J. ACM 23 4 1976 733 742
2. M.R. Garey, and D.S. Johnson Computers and Intractability - A Guide to NP-Completeness 1979 W.H. Freeman San Francisco, CA
3. D.S. Johnson M.A. Trick Cliques, Coloring, and Satisfiability. Second DIMACS Implementation Challenge DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 1996 American Mathematical Society Providence, RI
4. H.A. Kautz, and B. Selman Planning as satisfiability Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92) 1992 359 363
5. H.A. Kautz, and B. Selman Pushing the envelope: planning, propositional logic, and stochastic search Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), Portland, OR 1996 1194 1201
6. H.A. Kautz, D. McAllester, and B. Selman Encoding plans in propositional logic Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR'96) 1996 374 384
7. J.M. Crawford, and A.B. Baker Experimental results on the application of satisfiability algorithms to scheduling problems Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), Seattle, WA 1994 1092 1097
8. M. Fujita, J. Slaney, and F. Bennett Automatic generation of some results in finite algebra Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI'93), Chambéry, France 1993 52 57
9. T. Larrabee Test pattern generation using Boolean satisfiability IEEE Trans. Computer-Aided Design 1992 4 15
10. F. Massacci, and L. Marraro Logical cryptanalysis as a SAT-problem: encoding and analysis of the US Data Encryption Standard J Automat. Reason. 24 1-2 2000 165 203
11. M. Cadoli, G. Ianni, L. Palopoli, A. Schaerf, and D. Vasile np-spec: an executable specification language for solving all problems in NP Computer Languages 26 2000 165 195
12. K.R. Apt, H.A. Blair, and A. Walker Towards a theory of declarative knowledge J. Minker Foundations of Deductive Databases and Logic Programming 1988 Morgan Kaufmann Los Altos, CA 89 142
13. V. Lifschitz Computing circumscription Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'85), Los Angeles, CA 1985 121 127
14. R. Fagin Generalized first-order spectra and polynomial-time recognizable sets R.M. Karp Complexity of Computation 1974 American Mathematical Society Providence, RI 43 74
15. e User Manual (Version 4.0) July 1998 IC-Parc London, UK
16. M. Davis, and H. Putnam A computing procedure for quantification theory J. ACM 7 1960 201 215
17. M. Davis, G. Logemann, and D.W. Loveland A machine program for theorem proving Comm. ACM 5 7 1962 394 397
18. B. Selman, D. Mitchell, and H. Levesque Generating hard satisfiability problems Artificial Intelligence 81 1996 17 29
19. B. Selman, H. Kautz, and B. Cohen Noise strategies for improving local search Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), Seattle, WA 1994 337 343
20. SATLIB, The Satisfiability Library http://www.satlib.org
21. C. Li Anbulagan, Heuristics based on unit propagation for satisfiability problems Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), Nagoya, Japan 1997 366 371
22. M. Cadoli, and L. Palopoli Circumscribing datalog: expressive power and complexity Theoret. Comput. Sci. 193 1998 215 244
23. E. Horowitz, and S. Sahni Fundamentals of Data Structures 1976 Pitman London
24. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning Oper. Res. 39 3 1991 378 406
25. P. Cheeseman, B. Kanefski, and W.M. Taylor Where the really hard problem are Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI'91), Sydney, Australia 1991 163 169
26. B. Vandegriend, Hamiltonian cycles: algorithms, graphs and performance, MSc Thesis, University of Alberta, Edmonton, AB, February 1998
27. A. Schaerf Scheduling sport tournaments using constraint logic programming CONSTRAINTS 4 1 1999 43 65
28. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello The KR system dlv: progress report, comparisons and benchmarks Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Trento, Italy 1998 406 417
29. I. Niemelä Logic programs with stable model semantics as a constraint programming paradigm Ann. Math. Artificial Intelligence 25 3-4 1999 241 273
30. D. Jackson Automating first-order relational logic Proc. of ACM SIGSOFT'00: 8th SIGSOFT Symposium on Foundations of Software Engineering 2000 130 139
31. N. Sadeh Look-ahead techniques for micro-opportunistic job shop scheduling Tech. Rept. CMU-CS-91-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, available at http://www.cs.cmu.edu/~sadeh 1992
32. K. Iwana, and S. Miyazaki SAT-variable complexity of hard combinatorial problems Proc. of the World Computer Congress of the IFIP, vol. 1 1994 Elsevier Science Amsterdam 253 258
33. H.H. Hoos Solving hard combinatorial problems with GSAT - a case study Proceedings of the Twentieth German Annual Conference on Artificial Intelligence (KI'96) Lecture Notes in Computer Science vol. 1138 1996 Springer Berlin 197 212
34. B.M. Smith Dual model of permutation problems Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP 2001) Lecture Notes in Computer Science vol. 2239 2001 Springer Berlin 615 619
35. T. Walsh Permutation problems and channelling constraints Proceedings of the Eighth International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001) 2001 Springer Berlin 377 391
36. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi An algorithm to evaluate quantified boolean formulae and its experimental evaluation J. Automat. Reason. 28 2002 101 142