Exploiting functional dependencies in declarative problem specifications

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 628-640

  Cadoli, Marco ^a   Mancini, Toni ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ECONOMICS; SEMANTICS; CHARACTERIZATION; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; SPECIFICATIONS;

AUTOMATIC RECOGNITION; CONSTRAINT PROBLEMS; FUNCTIONAL DEPENDENCY; INTERMEDIATE RESULTS; MULTIPLE VIEWPOINTS; PROBLEM SPECIFICATION; SEARCH PROCEDURES; SEMANTIC PROPERTIES;

SPECIFICATIONS; FORMAL LOGIC;

CONSTRAINT PROBLEMS; FUNCTIONAL DEPENDENCIES; PROBLEM SPECIFICATION; SEARCH PROCEDURES;

EID: 22944489903     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_52     Document Type: Conference Paper

References (27)

1. C. A. Brown, L. Finkelstein, and P. W. Purdom. Backtrack searching in the presence of symmetry. In T. Mora, editor, Proc. of 6th Intl. Conf. on Applied Algebra, Algebraic Algorithms and Error Correcting codes, pages 99-110. Springer, 1988.
2. M. Cadoli and T. Mancini. Detecting and breaking symmetries on specifications. In Proc. of the CP'03 Int. Workshop on Symmetry in CSPs, pages 13-26, 2003.
3. M. Cadoli and T. Mancini. Automated reformulation of specifications by safe delay of constraints. In Proc. of KR'04, pages 388-398. AAAI Press, 2004.
4. M. Cadoli and T. Mancini. Using a theorem prover for reasoning on constraint problems. In Proc. of the ETAPS'04 CP+CV Int. Workshop, pages 17-31, 2004.
5. M. Cadoli and A. Schaerf. Compiling problem specifications into SAT. In Proc. of ESOP'01, volume 2028 of LNCS, pages 387-401. Springer, 2001.
6. C. C. Chang and H. J. Keisler. Model Theory, 3rd ed. North-Holland, 1990.
7. B. M. W. Cheng, K. M. F. Choi, J. H.-M. Lee, and J. C. K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 4(2):167-192, 1999.
8. J. M. Crawford, M. L. Ginsberg, E. M. Luks, and A. Roy. Symmetry-breaking predicates for search problems. In Proc. of KR'96, pages 148-159, 1996.
9. P. Crescenzi, D. Goldman, C. H. Papadimitriou, A. Piccolboni, and M. Yannakakis. On the complexity of protein folding. J. of Comp. Biology, 5(3):423-466, 1998.
10. R. Dechter. Constraint networks (survey). In Encyclopedia of Artificial Intelligence, 2nd edition, pages 276-285. John Wiley & Sons, Inc., 1992.
11. H. D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1999.
12. 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.
13. R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M. Karp, editor, Complexity of Computation, pages 43-74. AMS, 1974.
14. R. Fourer, D. M. Gay, and B. W. Kernigham. AMPL: A Modeling Language for Mathematical Programming. International Thomson Publishing, 1993.
15. M. R. Garey and D. S. Johnson. Computers and Intractability - A guide to NP-completeness. W. H. Freeman and Company, San Francisco, 1979.
16. E. Giunchiglia and R. Sebastiani. Applying the Davis-Putnam procedure to nonclausal formulas. In Proc. of AI∗IA'99, volume 1792 of LNAI, pages 84-94. Springer, 2000.
17. W. Hart and S. Istrail. HP Benchmarks. Available at http://www.cs.sandia.gov/tech-reports/compbio/tortilla-hp-benchmarks.html.
18. T. Hnich and T. Walsh. Why Channel? Multiple viewpoints for branching heuristics. In Proc. of the CP'03 Int. Workshop on Modelling and Reformulating CSPs: Towards Systematisation and Automation, 2003.
19. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. of AAAI'96, pages 1194-1201, 1996.
20. K. F. Lau and K. A. Dill. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules, 22:3986-3997, 1989.
21. C. M. Li. Integrating equivalency reasoning into Davis-Putnam procedure. In Proc. of AAAI'00. AAAI/MIT Press, 2000.
22. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. of Mathematics and Artificial Intelligence, 25(3, 4):241-273, 1999.
23. N. J. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Co., 1980.
24. B. M. Smith, K. Stergiou, and T. Walsh. Using auxiliary variables and implied constraints to model non-binary problems. In Proc. of AAAI'00, pages 182-187, 2000.
25. P. Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999.
26. T. Walsh. Permutation Problems and Channelling Constraints. In R. Nieuwenhuis and A. Voronkov, editors, Proc. of LPAR'01, volume 2250 of LNAI, pages 377-391. Springer, 2001.
27. D. H. D. Warren. Extract from Kluzniak and Szapowicz APIC studies in data processing, no. 24, 1974. In Readings in Planning, pages 140-153. Morgan Kaufman, 1990.