{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:51:28Z","timestamp":1725573088873},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252368"},{"type":"electronic","value":"9783540322757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32275-7_19","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T21:14:41Z","timestamp":1292879681000},"page":"270-284","source":"Crossref","is-referenced-by-count":4,"title":["Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bordeaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Cadoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toni","family":"Mancini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-540-30227-8_52","volume-title":"Logics in Artificial Intelligence","author":"M. Cadoli","year":"2004","unstructured":"Cadoli, M., Mancini, T.: Exploiting functional dependencies in declarative problem specifications. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 628\u2013640. Springer, Heidelberg (2004)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. In: 3rd Int. CP Workshop on Modelling and Reformulating CSPs (2004)","DOI":"10.1007\/11558590_4"},{"key":"19_CR3","volume-title":"Int. Workshop on Constraint Solving and Constraint Logic Programming (CSCLP)","author":"B. Choueiry","year":"2004","unstructured":"Choueiry, B., Lal, A., Freuder, E.C.: Interchangeability and dynamic bundling for non-binary finite CSPs. In: Int. Workshop on Constraint Solving and Constraint Logic Programming (CSCLP), Springer, Heidelberg (2004) (page to appear)"},{"key":"19_CR4","first-page":"326","volume-title":"Nat. (US) Conf. on Artificial Intelligence (AAAI)","author":"B. Choueiry","year":"1998","unstructured":"Choueiry, B., Noubir, G.: On the computation of local interchangeability in discrete constraint satisfaction problems. In: Nat (US) Conf. on Artificial Intelligence (AAAI), pp. 326\u2013333. AAAI, Menlo Park (1998)"},{"key":"19_CR5","unstructured":"Crawford, J.M.: A theoretical analysis of reasoning by symmetry in first-order logic (extended abstract). In: AAAI Workshop on Tractable Reasoning (1992)"},{"key":"19_CR6","first-page":"148","volume-title":"Int. Conf. on Principles of Knowledge Representation and Reasoning (KR)","author":"J.M. Crawford","year":"1996","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Int. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 148\u2013159. Morgan Kaufmann, San Francisco (1996)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"J. of the ACM"},{"key":"19_CR8","unstructured":"Dechter, R.: Constraint networks (survey). In: Encyclopedia of Artificial Intelligence, 2nd edn., pp. 276\u2013285 (1992)"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"61","author":"S. Even","year":"1984","unstructured":"Even, S., Selman, A., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Information and Control\u00a061(2), 159\u2013173 (1984)","journal-title":"Information and Control"},{"issue":"11","key":"19_CR10","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E.C. Freuder","year":"1978","unstructured":"Freuder, E.C.: Synthesizing constraint expressions. Comm. of the ACM\u00a021(11), 958\u2013966 (1978)","journal-title":"Comm. of the ACM"},{"key":"19_CR11","first-page":"227","volume-title":"Nat. (US) Conf. on Artificial Intelligence (AAAI)","author":"E.C. Freuder","year":"1991","unstructured":"Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Nat (US) Conf. on Artificial Intelligence (AAAI), pp. 227\u2013233. AAAI Press, Menlo Park (1991)"},{"key":"19_CR12","first-page":"599","volume-title":"Euro. Conf. on Artificial Intelligence (ECAI)","author":"I.P. Gent","year":"2000","unstructured":"Gent, I.P., Smith, B.M.: Symmetry breaking in constraint programming. In: Euro. Conf. on Artificial Intelligence (ECAI), pp. 599\u2013603. IOS Press, Amsterdam (2000)"},{"key":"19_CR13","first-page":"948","volume-title":"Nat. (US) Conf. on Artificial Intelligence (AAAI)","author":"E. Giunchiglia","year":"1998","unstructured":"Giunchiglia, E., Massarotto, A., Sebastiani, R.: Act, and the rest will follow: Exploiting determinism in planning as satisfiability. In: Nat (US) Conf. on Artificial Intelligence (AAAI), pp. 948\u2013953. AAAI Press, Menlo Park (1998)"},{"key":"19_CR14","first-page":"1","volume-title":"Int. Conf. on Principles and Practice of Constraint Programming (CP)","author":"P. Jeavons","year":"1994","unstructured":"Jeavons, P., Cohen, D.A., Cooper, M.C.: A substitution operation for constraints. In: Int. Conf. on Principles and Practice of Constraint Programming (CP), pp. 1\u20139. Springer, Heidelberg (1994)"},{"issue":"1-3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2004.08.006","volume":"329","author":"P. Jonsson","year":"2004","unstructured":"Jonsson, P., Krokhin, A.: Recognizing frozen variables in constraint satisfaction problems. Theoretical Computer Science (TCS)\u00a0329(1-3), 93\u2013113 (2004)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"19_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The graph isomorphism problem: its computational complexitypp","author":"J. K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The graph isomorphism problem: its computational complexitypp. Birkh\u00e4user, Basel (1993)"},{"key":"19_CR17","series-title":"Algorithms and Complexity","volume-title":"The Handbook of Theoretical Computer Science","author":"A. Lenstra","year":"1990","unstructured":"Lenstra, A., Lenstra, H.W.: Algorithms in number theory. In: van Leeuwen, J. (ed.) The Handbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a01, MIT Press, Cambridge (1990)"},{"key":"19_CR18","first-page":"291","volume-title":"Nat. (US) Conf. on Artificial Intelligence (AAAI)","author":"C.M. Li","year":"2000","unstructured":"Li, C.M.: Integrating equivalency reasoning into Davis-Putnam procedure. In: Nat (US) Conf. on Artificial Intelligence (AAAI), pp. 291\u2013296. AAAI press, Menlo Park (2000)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature\u00a0400, 133\u2013137 (1999)","journal-title":"Nature"},{"issue":"2","key":"19_CR21","first-page":"85","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Science\u00a07(2), 85\u2013132 (1974)","journal-title":"Information Science"},{"key":"19_CR22","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"19_CR23","unstructured":"Pyh\u00e4l\u00e4, T.: Factoring benchmarks for SAT solvers. Technical report, Helsinki university of technology (2004)"},{"key":"19_CR24","first-page":"216","volume-title":"ACM Symp. on Theory of Computing (STOC)","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: ACM Symp. on Theory of Computing (STOC), pp. 216\u2013226. ACM, New York (1978)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32275-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T00:04:04Z","timestamp":1637021044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32275-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252368","9783540322757"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32275-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}