Automated reformulation of specifications by safe delay of constraints

Artificial Intelligence

Volumn 170, Issue 8-9, 2006, Pages 779-801

  Cadoli, Marco ^a   Mancini, Toni ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Constraint satisfaction problems; Modelling; Propositional satisfiability; Reformulation; Second order logic

Indexed keywords

CONSTRAINT THEORY; FORMAL LOGIC; GRAPH THEORY; LINEAR SYSTEMS; LINEARIZATION; MATHEMATICAL MODELS; PROBLEM SOLVING;

CONSTRAINT SATISFACTION PROBLEMS; PROPOSITIONAL SATISFIABILITY; REFORMULATION; SECOND-ORDER LOGIC;

SPECIFICATIONS;

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

References (51)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison Wesley Publishing Company, Reading, MA
2. Aho A.V., Sagiv Y., and Ullman J.D. Equivalences among relational expressions. SIAM Journal on Computing 2 8 (1979) 218-246
3. Börger E., Gräedel E., and Gurevich Y. The Classical Decision Problem. Perspectives in Mathematical Logic (1997), Springer, Berlin
4. Brown C.A., Finkelstein L., and Purdom P.W. Backtrack searching in the presence of symmetry. In: Mora T. (Ed). Proceedings of the Sixth International Conference on Applied Algebra, Algebraic Algorithms and Error Correcting Codes. Rome, Italy. Lecture Notes in Computer Science vol. 357 (1988), Springer, Berlin 99-110
5. Cadoli M., and Mancini T. Exploiting functional dependencies in declarative problem specifications. Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA 2004). Lisbon, Portugal. Lecture Notes in Artificial Intelligence vol. 3229 (2004), Springer, Berlin
6. Cadoli M., and Mancini T. Using a theorem prover for reasoning on constraint problems. Proceedings of the Ninth Conference of the Italian Association for Artificial Intelligence (AI*IA 2005). Milano, Italy. Lecture Notes in Artificial Intelligence vol. 3673 (2005), Springer, Berlin 38-49
7. M. Cadoli, T. Mancini, F. Patrizi, SAT as an effective solving technology for constraint problems, in: Proceedings of the Twentieth Convegno Italiano di Logica Computazionale (CILC 2005), Roma, Italy, 2005
8. Cadoli M., and Schaerf A. Compiling problem specifications into SAT. Artificial Intelligence 162 (2005) 89-120
9. Castillo E., Conejo A.J., Pedregal P., García R., and Alguacil N. Building and Solving Mathematical Programming Models in Engineering and Science (2001), John Wiley & Sons
10. Chandra A.K., and Merlin P.M. Optimal implementation of conjunctive queries in relational databases. Proceedings of the Ninth ACM Symposium on Theory of Computing (STOC'77). Boulder, CO (1977), ACM Press 77-90
11. Cheeseman P., Kanefski B., and Taylor W.M. Where the really hard problem are. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI'91). Sydney, Australia (1991), Morgan Kaufmann, Los Altos, CA 163-169
12. Cheng B.M.W., Choi K.M.F., Lee J.H.-M., and Wu J.C.K. Increasing constraint propagation by redundant modeling: an experience report. Constraints 4 2 (1999) 167-192
13. Choueiry B.Y., and Noubir G. On the computation of local interchangeability in discrete constraint satisfaction problems. Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98). Madison, WI (1998), AAAI Press/The MIT Press 326-333
14. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), The MIT Press
15. Crawford J.M., and Baker A.B. 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), AAAI Press/The MIT Press 1092-1097
16. Crawford J.M., Ginsberg M.L., Luks E.M., and Roy A. Symmetry-breaking predicates for search problems. Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR'96). Cambridge, MA (1996), Morgan Kaufmann, Los Altos, CA 148-159
17. Dechter R. Constraint networks (survey). Encyclopedia of Artificial Intelligence. second ed. (1992), John Wiley & Sons 276-285
18. D. East, M. Truszczyǹski, Predicate-calculus based logics for modeling and solving search problems ACM Transactions on Computational Logic, 2004, submitted for publication
19. Fagin R. Generalized first-order spectra and polynomial-time recognizable sets. In: Karp R.M. (Ed). Complexity of Computation (1974), American Mathematical Society, Providence, RI 43-74
20. P. Flener, Towards relational modelling of combinatorial optimisation problems, in: C. Bessière (Ed.), Proceedings of the International Workshop on Modelling and Solving Problems with Constraints, in conjunction with the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA, 2001
21. Flener P., Pearson J., and Ågren M. Introducing esra, a relational language for modelling combinatorial problems. Proceedings of the Eighteenth IEEE Symposium on Logic in Computer Science (LICS 2004). Uppsala, Sweden (2003), Springer, Berlin 214-232
22. Fourer R., Gay D.M., and Kernigham B.W. AMPL: A Modeling Language for Mathematical Programming (1993), International Thomson Publishing
23. Freuder E.C., and Sabin D. Interchangeability supports abstraction and reformulation for multi-dimensional constraint satisfaction. Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97). Providence, RI (1997), AAAI Press/The MIT Press 191-196
24. Frisch A., Miguel I., and Walsh T. CGRASS: A system for transforming constraint satisfaction problems. Proceedings of the Joint Workshop of the ERCIM Working Group on Constraints and the CologNet area on Constraint and Logic Programming on Constraint Solving and Constraint Logic Programming (ERCIM 2002). Cork, Ireland. Lecture Notes in Artificial Intelligence vol. 2627 (2002), Springer, Berlin 15-30
25. Frisch A.M., and Peugniez T.J. Solving non-boolean satisfiability problems with stochastic local search. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001). Seattle, WA (2001), Morgan Kaufmann, Los Altos, CA 282-290
26. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, San Francisco, CA
27. Giunchiglia E., and Sebastiani R. Applying the Davis-Putnam procedure to non-clausal formulas. Proceedings of the Sixth Conference of the Italian Association for Artificial Intelligence (AI*IA'99). Bologna, Italy. Lecture Notes in Artificial Intelligence vol. 1792 (2000), Springer, Berlin 84-94
28. Giunchiglia F., and Walsh T. A theory of abstraction. Artificial Intelligence 57 (1992) 323-389
29. T. Hnich, T. Walsh, Why Channel? Multiple viewpoints for branching heuristics, in: Proceedings of the Second International Workshop on Modelling and Reformulating CSPs: Towards Systematisation and Automation, in conjunction with the Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland, 2003
30. Klug A. On conjunctive queries containing inequalities. Journal of the ACM 1 35 (1988) 146-160
31. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, F. Scarcello, The DLV System for knowledge representation and reasoning, in: ACM Transactions on Computational Logic, submitted for publication
32. Li C.M. Integrating equivalency reasoning into Davis-Putnam procedure. Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000). Austin, TX (2000), AAAI Press/The MIT Press 291-296
33. Li C.M., and Anbulagan. Heuristics based on unit propagation for satisfiability problems. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97). Nagoya, Japan (1997), Morgan Kaufmann, Los Altos, CA 366-371
34. Mancini T. Reformulation techniques for a class of permutation problems. Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003). Kinsale, Ireland. Lecture Notes in Computer Science vol. 2833 (2003), Springer, Berlin 984
35. Mancini T., and Cadoli M. Detecting and breaking symmetries by reasoning on problem specifications. Proceedings of the Sixth International Symposium on Abstraction, Reformulation and Approximation (SARA 2005). Airth Castle, Scotland, UK. Lecture Notes in Artificial Intelligence vol. 3607 (2005), Springer, Berlin 165-181
36. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementation (1990), John Wiley & Sons
37. McKay B.D. Nauty user's guide (version 2.2). Available at. http://cs.anu.edu.au/~bdm/nauty/nug.pdf 2003
38. Moskewicz M.W., Madigan C.F., Zhao Y., Zhang L., and Malik S. Chaff: Engineering an Efficient SAT Solver. Proceedings of the Thirty Eighth Conference on Design Automation (DAC 2001). Las Vegas, NV (2001), ACM Press 530-535
39. Niemelä I. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25 3,4 (1999) 241-273
40. Papadimitriou C.H. Computational Complexity (1994), Addison Wesley Publishing Company, Reading, MA
41. S.D. Prestwich, Supersymmetric modeling for local search, in: Proceedings of the Second International Workshop on Symmetry in Constraint Satisfaction Problems, in conjunction with the Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), Ithaca, NY, 2002
42. Prestwich S.D. Local search on SAT-encoded colouring problems. Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003). Santa Margherita Ligure, Genova, Italy. Lecture Notes in Computer Science vol. 2919 (2004), Springer, Berlin 105-119
43. Prestwich S.D., and Roli A. Symmetry breaking and local search spaces. In: Barták R., and Milano M. (Eds). Proceedings of the Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005). Prague, CZ. Lecture Notes in Computer Science vol. 3524 (2005), Springer, Berlin 273-287
44. Sagiv Y., and Yannakakis M. Equivalence among relational expressions with the union and difference operations. Journal of the ACM 4 27 (1980) 633-655
45. B. Selman, H.A. Kautz, B. Cohen, Local search strategies for satisfiability testing, in: M. Trick, D.S. Johnson (Eds.), Proceedings of the Second DIMACS Challenge on Cliques, Coloring, and Satisfiability, Providence, RI, 1993
46. Selman B., Levesque H., and Mitchell D. A new method for solving hard satisfiability instances. Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92). San Jose, CA (1992), AAAI Press/The MIT Press
47. Smith B.M., Stergiou K., and Walsh T. Using auxiliary variables and implied constraints to model non-binary problems. Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000). Austin, TX (2000), AAAI Press/The MIT Press 182-187
48. Van Hentenryck P. The OPL Optimization Programming Language (1999), The MIT Press
49. Walsh T. Permutation problems and channelling constraints. In: Nieuwenhuis R., and Voronkov A. (Eds). Proceedings of the Eighth International Conference on Logic for Programming and Automated Reasoning (LPAR 2001). Havana, Cuba. Lecture Notes in Computer Science vol. 2250 (2001), Springer, Berlin 377-391
50. Weigel R., and Bliek C. On reformulation of constraint satisfaction problems. Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI'98). Brighton, UK (1998), John Wiley & Sons 254-258
51. Zhang W., Rangan A., and Looks M. Backbone guided local search for maximum satisfiability. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003). Acapulco, Mexico (2003), Morgan Kaufmann, Los Altos, CA 1179-1186