Automated Reformulation of Specifications by Safe Delay of Constraints

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 388-398

  Cadoli, Marco ^a   Mancini, Toni ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; JOB SHOP SCHEDULING;

COMBINATORIAL PROBLEM; DELAY CONSTRAINTS; GRAPH COLORINGS; JOB-SHOP SCHEDULING; SOUNDNESS PROOFS; STATE-OF-THE-ART SYSTEM;

SPECIFICATIONS;

EID: 22944479835     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Abiteboul, S.; Hull, R.; and Vianu, V. 1995. Foundations of Databases. Addison Wesley Publ. Co., Reading, Massachussetts.
2. Aho, A.V., S. Y., and Ullman, J. 1979. Equivalences among relational expressions. SIAM Journal on Computing 2(8):218-246.
3. Börger, E.; Gräedel, E.; and Gurevich, Y. 1997. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer.
4. Cadoli, M., and Mancini, T. 2004. Using a theorem prover for reasoning on constraint problems. In Proceedings of the International Workshop on Constraint Programming and Constraints for Verification (CP+CV'04), at the European Joint Conferences on Theory and Practice of Software (ETAPS'04).
5. Cadoli, M., and Schaerf, A. 2001. Compiling problem specifications into SAT. In Proceedings of the European Symposium On Programming (ESOP'01), volume 2028 of Lecture Notes in Computer Science, 387-401. Springer.
6. Chandra, A. K., and Merlin, P. M. 1977. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the Ninth ACM Symposium on Theory of Computing (STOC'77), 77-90. Boulder, CO, USA.
7. Cheeseman, P.; Kanefski, B.; and Taylor, W. M. 1991. Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI'91), 163-169.
8. Choueiry, B. Y., and Noubir, G. 1998. On the computation of local interchangeability in discrete constraint satisfaction problems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), 326-333.
9. Crawford, J. M., and Baker, A. B. 1994. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), 1092-1097.
10. Dechter, R. 1992. Constraint Networks (Survey). John Wiley & Sons, Inc. 276-285.
11. Eiter, T.; Leone, N.; Mateis, C.; Pfeifer, G.; and Scarcello, F. 1998. The KR system dlv: Progress report, Comparisons and Benchmarks. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 406-417.
12. Fagin, R. 1974. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Karp, R. M., ed., Complexity of Computation, 43-74. AMS.
13. Fourer, R.; Gay, D. M.; and Kernigham, B. W. 1993. AMPL: A Modeling Language for Mathematical Programming. International Thomson Publishing.
14. Freuder, E. C., and Sabin, D. 1997. Interchangeability supports abstraction and reformulation for multi-dimensional constraint satisfaction. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), 191-196.
15. Frisch, A. M., and Peugniez, T. J. 2001. Solving non-boolean satisfiability problems with stochastic local search. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), 282-290.
16. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability-A guide to NP-completeness. San Francisco: W.H. Freeman and Company.
17. Li, C., and Anbulagan. 1997. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), 366-371.
18. Mancini, T. 2003. Reformulation techniques for a class of permutation problems. In Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP'03), number 2833 in Lecture Notes in Computer Science, 984.
19. Martello, S., and Toth, P. 1990. Knapsack Problems: algorithms and computer implementation. John Wiley & Sons Ltd.
20. Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3,4):241-273.
21. Van Hentenryck, P. 1999. The OPL Optimization Programming Language. The MIT Press.
22. Walsh, T. 2001. Permutation problems and channelling constraints. In Proceedings of the Eighth International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'01), number 2250 in Lecture Notes in Computer Science, 377-391. Springer.
23. Weigel, R., and Bliek, C. 1998. On reformulation of constraint satisfaction problems. In Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI'98), 254-258.