{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:10Z","timestamp":1725566350514},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232421"},{"type":"electronic","value":"9783540302278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_52","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:34:52Z","timestamp":1284860092000},"page":"628-640","source":"Crossref","is-referenced-by-count":6,"title":["Exploiting Functional Dependencies in Declarative Problem Specifications"],"prefix":"10.1007","author":[{"given":"Marco","family":"Cadoli","sequence":"first","affiliation":[]},{"given":"Toni","family":"Mancini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-51083-4_51","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"C.A. Brown","year":"1989","unstructured":"Brown, C.A., Finkelstein, L., Purdom, P.W.: Backtrack searching in the presence of symmetry. In: Mora, T. (ed.) AAECC 1988. LNCS, vol.\u00a0357, pp. 99\u2013110. Springer, Heidelberg (1989)"},{"key":"52_CR2","unstructured":"Cadoli, M., Mancini, T.: Detecting and breaking symmetries on specifications. In: Proc. of the CP 2003 Int. Workshop on Symmetry in CSPs, pp. 13\u201326 (2003)"},{"key":"52_CR3","first-page":"388","volume-title":"Proc. of KR 2004","author":"M. Cadoli","year":"2004","unstructured":"Cadoli, M., Mancini, T.: Automated reformulation of specifications by safe delay of constraints. In: Proc. of KR 2004, pp. 388\u2013398. AAAI Press, Menlo Park (2004)"},{"key":"52_CR4","unstructured":"Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. In: Proc. of the ETAPS 2004 CP+CV Int. Workshop, pp. 17\u201331 (2004)"},{"key":"52_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-45309-1_26","volume-title":"Programming Languages and Systems","author":"M. Cadoli","year":"2001","unstructured":"Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 387\u2013401. Springer, Heidelberg (2001)"},{"key":"52_CR6","volume-title":"Model Theory","author":"C.C. Chang","year":"1990","unstructured":"Chang, C.C., Keisler, H.J.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)","edition":"3"},{"issue":"2","key":"52_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1009894810205","volume":"4","author":"B.M.W. Cheng","year":"1999","unstructured":"Cheng, B.M.W., Choi, K.M.F., Lee, J.H.-M., Wu, J.C.K.: Increasing constraint propagation by redundant modeling: an experience report. Constraints\u00a04(2), 167\u2013192 (1999)","journal-title":"Constraints"},{"key":"52_CR8","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proc. of KR 1996, pp. 148\u2013159 (1996)"},{"issue":"3","key":"52_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1089\/cmb.1998.5.423","volume":"5","author":"P. Crescenzi","year":"1998","unstructured":"Crescenzi, P., Goldman, D., Papadimitriou, C.H., Piccolboni, A., Yannakakis, M.: On the complexity of protein folding. J. of Comp. Biology\u00a05(3), 423\u2013466 (1998)","journal-title":"J. of Comp. Biology"},{"key":"52_CR10","first-page":"276","volume-title":"Encyclopedia of Artificial Intelligence","author":"R. Dechter","year":"1992","unstructured":"Dechter, R.: Constraint networks (survey). In: Encyclopedia of Artificial Intelligence, 2nd edn., pp. 276\u2013285. John Wiley & Sons, Inc., Chichester (1992)","edition":"2"},{"key":"52_CR11","volume-title":"Finite Model Theory","author":"H.D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1999)"},{"key":"52_CR12","unstructured":"Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR system dlv: Progress report, Comparisons and Benchmarks. In: Proc. of KR 1998, pp. 406\u2013417 (1998)"},{"key":"52_CR13","unstructured":"Fagin, R.: Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In: Karp, R.M. (ed.) Complexity of Computation, pp. 43\u201374. AMS (1974)"},{"key":"52_CR14","unstructured":"Fourer, R., Gay, D.M., Kernigham, B.W.: AMPL: A Modeling Language for Mathematical Programming. International Thomson Publishing (1993)"},{"key":"52_CR15","volume-title":"Computers and Intractability\u2014A guide to NPcompleteness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability\u2014A guide to NPcompleteness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"52_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-46238-4_8","volume-title":"AI*IA 99:Advances in Artificial Intelligence","author":"E. Giunchiglia","year":"2000","unstructured":"Giunchiglia, E., Sebastiani, R.: Applying the davis-putnam procedure to non-clausal formulas. In: Lamma, E., Mello, P. (eds.) AI*IA 1999. LNCS (LNAI), vol.\u00a01792, pp. 84\u201394. Springer, Heidelberg (2000)"},{"key":"52_CR17","unstructured":"Hart, W., Istrail, S.: HP Benchmarks, Available at \n                    \n                      http:\/\/www.cs.sandia.gov\/tech_reports\/compbio\/tortilla-hp-benchmarks.html"},{"key":"52_CR18","unstructured":"Hnich, T., Walsh, T.: Why Channel? Multiple viewpoints for branching heuristics. In: Proc. of the CP 2003 Int. Workshop on Modelling and Reformulating CSPs: Towards Systematisation and Automation (2003)"},{"key":"52_CR19","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proc. of AAAI 1996, pp. 1194\u20131201 (1996)"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"3986","DOI":"10.1021\/ma00200a030","volume":"22","author":"K.F. Lau","year":"1989","unstructured":"Lau, K.F., Dill, K.A.: A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules\u00a022, 3986\u20133997 (1989)","journal-title":"Macromolecules"},{"key":"52_CR21","unstructured":"Li, C.M.: Integrating equivalency reasoning into Davis-Putnam procedure. In: Proc. of AAAI 2000, AAAI\/MIT Press (2000)"},{"issue":"3,4","key":"52_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. of Mathematics and Artificial Intelligence\u00a025(3,4), 241\u2013273 (1999)","journal-title":"Ann. of Mathematics and Artificial Intelligence"},{"key":"52_CR23","unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Co. (1980)"},{"key":"52_CR24","unstructured":"Smith, B.M., Stergiou, K., Walsh, T.: Using auxiliary variables and implied constraints to model non-binary problems. In: Proc. of AAAI 2000, pp. 182\u2013187 (2000)"},{"key":"52_CR25","volume-title":"The OPL Optimization Programming Language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P.: The OPL Optimization Programming Language. The MIT Press, Cambridge (1999)"},{"key":"52_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45653-8_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Walsh","year":"2001","unstructured":"Walsh, T.: Permutation Problems and Channelling Constraints. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 377\u2013391. Springer, Heidelberg (2001)"},{"key":"52_CR27","unstructured":"Warren, D.H.D.: Extract from Kluzniak and Szapowicz APIC studies in data processing, no. 24, 1974. In: Readings in Planning, pp. 140\u2013153. Morgan Kaufman, San Francisco (1990)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:58:12Z","timestamp":1620014292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}