NP-SPEC: an executable specification language for solving all problems in NP

Computer Languages - Tập 26 - Trang 165-195 - 2000
Marco Cadoli1, Giovambattista Ianni2, Luigi Palopoli3, Andrea Schaerf4, Domenico Vasile2
1Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, I-00198 Roma, Italy
2Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, I-87036 Rende (CS), Italy
3Dip. di Informatica, Matematica, Elettronica e Trasporti, Università di Reggio Calabria, Via Graziella, loc. Feo di Vito, I-89100 Reggio Calabria, Italy
4Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Via delle Scienze 208, I-33100 Udine, Italy

Tài liệu tham khảo

Cadoli M, Palopoli L, Schaerf A, Vasile D. NP-SPEC: An executable specification language for solving all problems in NP. Informal Proceedings of the Eigth International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR’98), 1998. Cadoli M, Palopoli L, Schaerf A, Vasile D. NP-SPEC: An executable specification language for solving all problems in NP. Proceedings of the First International Workshop on Practical Aspects of Declarative Languages (PADL’99), number 1551 in Lecture Notes in Artificial Intelligence. Berlin: Springer, 1999. p. 16–30. Eiter T, Leone N, Mateis C, Pfeifer G, Scarcello F. The KR system dlv: progress report, comparisons and benchmarks. Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), 1998. p. 406–17. Niemelä, 1999, Logic programs with stable model semantics as a constraint programming paradigm, Annals of Mathematics and Artificial Intelligence, 25, 241, 10.1023/A:1018930122475 Minton, 1996, Automatic configuring constraint satisfaction programs: A case study, Constraints, 1, 7, 10.1007/BF00143877 Smith, 1990, KIDS: a semi-automatic program development system, IEEE Transactions on Software Engineering, 16, 1024, 10.1109/32.58788 Kluz̀niak, 1997, Spill—a logic language for writing testable requirements specifications, Science of Computer Programming, 28, 193, 10.1016/S0167-6423(96)00021-4 Fraser, 1994, Strategies for incorporating formal specifications in software development, Communications of the ACM, 37, 74, 10.1145/194313.194399 Garey, 1979 Cadoli, 1998, Circumscribing DATALOG: expressive power and complexity, Theoretical Computer Science, 193, 215, 10.1016/S0304-3975(97)00108-4 Abiteboul, 1995 Papadimitriou, 1994 Chandra, 1980, Computable queries for relational databases, Journal of Computer and System Sciences, 21, 156, 10.1016/0022-0000(80)90032-X Chandra, 1982, Structure and complexity of relational queries, Journal of Computer and System Sciences, 25, 99, 10.1016/0022-0000(82)90012-5 Ullman, 1988 McCarthy, 1980, Circumscription—a form of non-monotonic reasoning, Artificial Intelligence, 13, 27, 10.1016/0004-3702(80)90011-9 Lifschitz V. Computing circumscription. Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI’85), 1985. p. 121–7. Apt KR, Blair HA, Walker A. Towards a theory of declarative knowledge. In: Minker J (Ed.), Foundations of deductive databases and logic programming. Los Altos: Morgan Kaufmann, 1988. p. 89–142. de Werra, 1985, An introduction to timetabling, European Journal of Operational Research, 19, 151, 10.1016/0377-2217(85)90167-5 Schaerf, 1999, A survey of automated timetabling, Artificial Intelligence Review, 13, 87, 10.1023/A:1006576209967 Aggoun A et al. ECLiPSe user manual (Version 4.0). IC-Parc, London (UK), July 1998. Cadoli M, Schaerf A. Compiling problem specifications into SAT. Proceedings of the European Symposium On Programming (ESOP 2001). Lecture Notes in Computer Science, Vol. 2028, Berlin: Springer, 2001. p. 387–401. David S, Johnson M, Trick A, editors, Cliques, coloring, and satisfiability. Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Providence RI: American Mathematical Society, 1996. Selman, 1996, Generating Hard Satisfiability Problems, Artificial Intelligence, 81, 17, 10.1016/0004-3702(95)00045-3 Crawford, 1996, Experimental results on the crossover point in random 3-SAT, Artificial Intelligence, 81, 31, 10.1016/0004-3702(95)00046-1 Davis, 1960, A computing procedure for quantification theory, Journal of the ACM, 7, 201, 10.1145/321033.321034 SATLIB—The Satisfiability Library. http://www.informatik.tu-darmstadt.de/AI/SATLIB. Gomes CP, Selman B, Kautz H. Boosting combinatorial search through randomization. Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 1998. p. 431–7. Li CM, Anbulagan. Heuristics based on unit propagation for satisfiability problems. Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), 1997. p. 366–71.