Exploiting functional dependencies in declarative problem specifications

Artificial Intelligence

Volumn 171, Issue 16-17, 2007, Pages 985-1010

  Mancini, Toni ^a   Cadoli, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Constraint satisfaction problems; Modeling; Reformulation; Second order logic

Indexed keywords

BIOINFORMATICS; CONSTRAINT THEORY; RESOURCE ALLOCATION; SEMANTICS;

CONSTRAINT SATISFACTION PROBLEMS; REFORMULATION; SECOND-ORDER LOGIC;

PROBLEM SOLVING;

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

References (45)

1. Bacchus F., and van Run P. Dynamic variable ordering in CSPs. Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95). Cassis, France. Lecture Notes in Computer Science vol. 976 (1995), Springer 258-275
2. Bibel W. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence 35 (1988) 401-413
3. Bistarelli S., Codognet P., and Rossi F. An abstraction framework for soft constraints and its relationship with constraint propagation. Proceedings of the Fourth International Symposium on Abstraction, Reformulation and Approximation (SARA 2000). Horseshoe Bay, TX, USA. Lecture Notes in Computer Science vol. 1864 (2000), Springer 71-86
4. Börger E., Gräedel E., and Gurevich Y. The Classical Decision Problem. Perspectives in Mathematical Logic (1997), Springer
5. 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 99-110
6. Cadoli M., and Mancini T. Automated reformulation of specifications by safe delay of constraints. Artificial Intelligence 170 8-9 (2006) 779-801
7. Cadoli M., and Mancini T. Using a theorem prover for reasoning on constraint problems. Applied Artificial Intelligence 21 3 (2007) Special issue on "Best papers from AI*IA 2005", in press
8. Cadoli M., and Schaerf A. Compiling problem specifications into SAT. Artificial Intelligence 162 (2005) 89-120
9. Calabro C., Impagliazzo R., Kabanets V., and Paturi R. The complexity of Unique k-SAT: An isolation lemma for k-CNFs. Proceedings of the Eighteenth IEEE Conference on Computational Complexity (CCC 2003). Aarhus, Denmark (2003), IEEE Computer Society Press p. 135 ff
10. Chang C.C., and Keisler H.J. Model Theory. third ed. (1990), North-Holland
11. 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
12. 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, USA (1996), Morgan Kaufmann, Los Altos, CA 148-159
13. Crescenzi P., Goldman D., Papadimitriou C.H., Piccolboni A., and Yannakakis M. On the complexity of protein folding. Journal of Computational Biology 5 3 (1998) 423-466
14. Dechter R. Constraint networks (survey). Encyclopedia of Artificial Intelligence. second ed. (1992), John Wiley & Sons 276-285
15. Ebbinghaus H.D., and Flum J. Finite Model Theory (1999), Springer
16. Ellman T. Abstraction via approximate symmetry. Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI'93). Chambéry, France (1993), Morgan Kaufmann, Los Altos, CA 916-921
17. Fagin R. Generalized first-order spectra and polynomial-time recognizable sets. In: Karp R.M. (Ed). Complexity of Computation (1974), American Mathematical Society 43-74
18. 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, USA, 2001
19. Fourer R., Gay D.M., and Kernigham B.W. AMPL: A Modeling Language for Mathematical Programming (1993), International Thomson Publishing
20. Freuder E.C. Eliminating interchangeable values in Constraint Satisfaction Problems. Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI'91). Anaheim, CA, USA (1991), AAAI Press/The MIT Press 227-233
21. 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, USA
22. 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 84-94
23. Giunchiglia F., and Walsh T. A theory of abstraction. Artificial Intelligence 57 (1992) 323-389
24. Hart W., and Istrail S. HP benchmarks. Available at. http://www.cs.sandia.gov/tech_reports/compbio/tortilla-hp-benchmarks.html (last accessed: end of 2004)
25. 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
26. Kautz H., and Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96). Portland, OR, USA (1996), AAAI Press/The MIT Press 1194-1201
27. Kolaitis P.G. Constraint satisfaction, databases, and logic. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003). Acapulco, Mexico (2003), Morgan Kaufmann, Los Altos, CA 1587-1595
28. Kumar V. Algorithms for constraint-satisfaction problems: A survey. AI Magazine 13 1 (1992) 32-44
29. Lau K.F., and Dill K.A. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules 22 (1989) 3986-3997
30. Lenstra A., and Lenstra H.W. Algorithms in number theory. In: van Leeuwen J. (Ed). The Handbook of Theoretical Computer Science, vol. 1, Algorithms and Complexity (1990), The MIT Press
31. Leone N., Pfeifer G., Faber W., Eiter T., Gottlob G., Perri S., and Scarcello F. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7 3 (2006) 499-562
32. C.M. Li, Integrating equivalency reasoning into Davis-Putnam procedure, in: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000) (1), pp. 291-296
33. T. Mancini, Declarative constraint modelling and specification-level reasoning, PhD thesis, Università degli Studi di Roma "La Sapienza", Roma, Italy, March 2005
34. 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 165-181
35. McCune W. Otter 3.3 reference manual. Technical Report ANL/MCS-TM-263, Argonne National Laboratory, Mathematics and Computer Science Division, August 2003. Available at. http://www-unix.mcs.anl.gov/AR/otter/
36. 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
37. Nilsson N.J. Principles of Artificial Intelligence (1980), Tioga Publishing Co.
38. Papadimitriou C.H. Computational Complexity (1994), Addison Wesley Publishing Company, Reading, MA
39. Prosser P. The dynamics of dynamic variable ordering heuristics. Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP'98). Pisa, Italy. Lecture Notes in Computer Science vol. 1520 (1998), Springer 17-23
40. T. Pyhälä, Factoring benchmarks for SAT solvers, Technical report, Helsinki University of Technology, 2004
41. B.M. Smith, K. Stergiou, T. Walsh, Using auxiliary variables and implied constraints to model non-binary problems, in: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000) (1), pp. 182-187
42. Valiant L.G., Vijay V.V., and Vazirani V. NP is as easy as detecting unique solutions. Theoretical Computer Science 47 3 (1986) 85-93
43. Van Hentenryck P. The OPL Optimization Programming Language (1999), The MIT Press
44. 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 377-391
45. Warren D.H.D. Extract from Kluzniak and Szapowicz APIC studies in data processing, no. 24, 1974. Readings in Planning (1990), Morgan Kaufmann, Los Altos, CA 140-153