Compiling problem speci cations into SAT

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

Volumn 2028, Issue , 2001, Pages 387-401

  Cadoli, Marco ^a   Schaerf, Andrea ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; GRAPH THEORY; JOB SHOP SCHEDULING; OPTIMIZATION; PROGRAM COMPILERS; SPECIFICATION LANGUAGES; SPECIFICATIONS;

CLASSICAL PROBLEMS; COMPUTATIONAL PROPERTIES; EXECUTABLE SPECIFICATION LANGUAGES; HAMILTONIAN CYCLE; LOGIC-BASED LANGUAGES; PROBLEM SPECIFICATION; PROPOSITIONAL SATISFIABILITY; STATE OF THE ART;

HAMILTONIANS;

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

References (26)

1. A. Aggoun ECL1 PS3 User Manual (Version 4-0). IC-Parc, London (UK), July 1998.
2. K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-142. Morgan Kaufmann, Los Altos, 1988.
3. M. Cadoli, G. Ianni, L. Palopoli, A. Schaerf, and D. Vasile. NP-SPEC: An executable specification language for solving all problems in NP. Technical Report 00-13, Dip. di Inf. e Sist., Univ. di Roma “La Sapienza”, 2000.
4. M. Cadoli and L. Palopoli. Circumscribing DATALOG: expressive power and com-plexity. Theor. Comp. Sci-, 193:215-244, 1998.
5. M. Cadoli, L. Palopoli, A. Schaerf, and D. Vasile. NP-SPEC: An executable specification language for solving all problems in NP. In Proc. of PADL’99, number 1551 in LNAI, pages 16-30. Springer-Verlag, 1999.
6. P. Cheeseman, B. Kanefski, and W. M. Taylor. Where the really hard problem are. In Proc. of IJCAI’91, pages 163-169, 1991.
7. J. M. Crawford and A. B. Baker. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proc. of AAAI’94, pages 1092-1097, 1994.
8. M. Davis, G. Logemann, and D. W. Loveland. A machine program for theorem proving. Comm. of the ACM, 5(7):394-397, 1962.
9. M. Davis and H. Putnam. A computing procedure for quantification theory. J. of the ACM, 7:201-215, 1960.
10. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR system dlv: Progress report, Comparisons and Benchmarks. In Proc. of KR’98, pages 406-417, 1998.
11. M. Fujita, J. Slaney, and F. Bennett. Automatic generation of some results in finite algebra. In Proc. of IJCAI’93, pages 52-57, 1993.
12. M. R. Garey and D. S. Johnson. Computers and Intractability—A guide to NP- completeness. W.H. Freeman and Company, San Francisco, 1979.
13. D. Jackson. Automating first-order relational logic. In Proc. of ACM SIGSOFT’00: 8th SIGSOFT Symposium on Foundation of Software Engineering, 2000.
14. D. S. Johnson, C. R. Aragon, L. A. Mc Geoch, and C. Schevon. Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39(3):378-406, 1991.
15. D. S. Johnson and M. A. Trick, eds. Cliques, Coloring, and Satisfiability. Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Math. Soc., 1996.
16. H. A. Kautz, D. Mc Allester, and B. Selman. Encoding plans in propositional logic. In Proc. of KR’96, pages 374-384, 1996.
17. H. A. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI’92, pages 359-363, 1992.
18. T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on Computer-Aided Design, pages 4-15, 1992.
19. C. Li and Anbulagan, H. Heuristics based on unit propagation for satisfiability pro¬blems. In Proc. of IJCAI’97, pages 366-371, 1997.
20. V. Lifschitz. Computing circumscription. In Proc. of IJCAI’85, pages 121-127, 1985.
21. F. Massacci and L. Marraro. Logical cryptanalysis as a SAT-problem: Encoding and analysis of the U.S. Data Encryption Standard. J. of Automated Reasoning, 24(1-2):165-203, 2000.
22. I. Niemela. Logic programs with stable model semantics as a constraint programming paradigm. Ann. of Mathematics and Artif. Intell., 25(3,4):241-273, 1999.
23. SATLIB - The Satisfiability Library. http://www.informatik.tu-darmstadt.de/AI/SATLIB.
24. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proc. of AAAI’94, pages 337-343, 1994.
25. B. Selman, D. Mitchell, and H. Levesque. Generating Hard Satisfiability Problems. Artificial Intelligence, 81:17-29, 1996.
26. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. J. of the ACM, 23(4):733-742, 1976.