{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:30:40Z","timestamp":1740547840955,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_27","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T23:35:03Z","timestamp":1283988903000},"page":"392-406","source":"Crossref","is-referenced-by-count":3,"title":["Tractability by Approximating Constraint Languages"],"prefix":"10.1007","author":[{"given":"Martin J.","family":"Green","sequence":"first","affiliation":[]},{"given":"David A.","family":"Cohen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters\u00a08, 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0196-6774(80)90007-3","volume":"1","author":"B. Aspvall","year":"1980","unstructured":"Aspvall, B.: Recognizing disguised NR(1) instances of the satisfiability problem. Journal of Algorithms\u00a01(1), 97\u2013103 (1980) (note)","journal-title":"Journal of Algorithms"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM\u00a030, 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"key":"27_CR4","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997, Nagoya, Japan, pp. 398\u2013404 (1997)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Boros, E.: Maximum renamable Horn sub-CNFs. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science \u00a096 (1999)","DOI":"10.1016\/S0166-218X(99)00031-1"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01531069","volume":"1","author":"V. Chandru","year":"1990","unstructured":"Chandru, V., Coullard, C., Hammer, P., Monta nez, M., Sun, X.: On renamable Horn and generalized Horn functions. Annals of Mathematics and Artificial Intelligence\u00a01, 33\u201348 (1990)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/102782.102789","volume":"38","author":"V. Chandru","year":"1991","unstructured":"Chandru, V., Hooker, J.N.: Extended Horn sets in propositional logic. Journal of the ACM\u00a038, 205\u2013221 (1991)","journal-title":"Journal of the ACM"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1006\/jcss.1995.1087","volume":"51","author":"N. Creignou","year":"1995","unstructured":"Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences\u00a051, 511\u2013522 (1995)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"Dechter, R., Pearl, J.: Network-based heuristics for constraint satisfaction problems. Artificial Intelligence\u00a034(1), 1\u201338 (1988)","journal-title":"Artificial Intelligence"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"27_CR11","unstructured":"del Val, A.: On 2-SAT and renamable Horn. In: AAAI: 17th National Conference on Artificial Intelligence. AAAI \/ MIT Press (2000)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM\u00a030, 514\u2013550 (1983)","journal-title":"Journal of the ACM"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and stability of marriage. Amer. Math. Monthly\u00a069(1), 9\u201315 (1962)","journal-title":"Amer. Math. Monthly"},{"key":"27_CR14","unstructured":"Gault, R.L.: Polyanna technical manual (version 1.00). Technical Report RR-01-20, Computing Laboratory. Oxford University (2001)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45578-7_16","volume-title":"Proceedings of CP 2001: the 7th International Conference on Principles and Practice of Constraint Programming","author":"I.P. Gent","year":"2001","unstructured":"Gent, I.P., Irving, R.W., Manlove, M.F., Prosser, P., Smith, B.M.: A constraint programming approach to the stable marriage problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 225\u2013239. Springer, Heidelberg (2001)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-44683-4_5","volume-title":"Mathematical Foundations of Computer Science 2001","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, L., Scarcello, F.: Hypertree decompositions: A survey. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 37\u201357. Springer, Heidelberg (2001)"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, L., Scarcello, F.: Hypertree decomposition and tractable queries. Journal of Computer and System Sciences\u00a064(3), 579\u2013627 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Green, M.J., Cohen, D.A.: Tractability by approximating constraint languages. Technical Report CSD-TR-03-01, Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK (2003)","DOI":"10.1007\/978-3-540-45193-8_27"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M. Gyssens","year":"1994","unstructured":"Gyssens, M., Jeavons, P.G., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence\u00a066(1), 57\u201389 (1994)","journal-title":"Artificial Intelligence"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P.G. Jeavons","year":"1997","unstructured":"Jeavons, P.G., Cohen, D.A., Gyssens, M.: Closure properties of constraints. Journal of the ACM\u00a044, 527\u2013548 (1997)","journal-title":"Journal of the ACM"},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"P.G. Jeavons","year":"1995","unstructured":"Jeavons, P.G., Cooper, M.C.: Tractable constraints on ordered domains. Artificial Intelligence\u00a079(2), 327\u2013339 (1995)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"27_CR22","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/322047.322059","volume":"25","author":"H.R. Lewis","year":"1978","unstructured":"Lewis, H.R.: Renaming a set of clauses as a Horn set. JACM\u00a025(1), 134\u2013135 (1978)","journal-title":"JACM"},{"key":"27_CR23","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":"27_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1145\/210346.210347","volume":"42","author":"P. Beek van","year":"1995","unstructured":"van Beek, P., Dechter, R.: On the minimality and decomposability of row-convex constraint networks. Journal of the ACM\u00a042, 543\u2013561 (1995)","journal-title":"Journal of the ACM"},{"key":"27_CR27","unstructured":"van Dongen, M.R.C.: From local closure properties to a global closure property. Personal communication (2002; The source of the SMP example"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:19:43Z","timestamp":1740503983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}