{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:50Z","timestamp":1725516050290},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540690450"},{"type":"electronic","value":"9783540690528"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69052-8_70","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:38:03Z","timestamp":1217471883000},"page":"669-676","source":"Crossref","is-referenced-by-count":10,"title":["Solving SQL Constraints by Incremental Translation to SAT"],"prefix":"10.1007","author":[{"given":"Robin","family":"Lohfert","sequence":"first","affiliation":[]},{"given":"James J.","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Dongfang","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"70_CR1","doi-asserted-by":"crossref","unstructured":"Amir, E., McIlraith, S.: Solving Satisfiability using Decomposition and the Most Constrained Subproblem. In: Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (2001)","DOI":"10.1016\/S1571-0653(04)00331-2"},{"key":"70_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/11814948_2","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"F. Bacchus","year":"2006","unstructured":"Bacchus, F.: CSPs: Adding Structure to SAT. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, p. 10. Springer, Heidelberg (2006)"},{"key":"70_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-45657-0_18","volume-title":"Computer Aided Verification","author":"C.W. Barrett","year":"2002","unstructured":"Barrett, C.W., Dill, D.L., Stump, A.: Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 236\u2013249. Springer, Heidelberg (2002)"},{"key":"70_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-540-24605-3_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"P. Bjesse","year":"2004","unstructured":"Bjesse, P., Kukula, J.H., Damiano, R.F., Stanion, T., Zhu, Y.: Guiding SAT Diagnosis with Tree Decompositions. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 315\u2013329. Springer, Heidelberg (2004)"},{"key":"70_CR5","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional Satisfiability and Constraint Programming: A comparative survey. ACM Computing Survey\u00a038(4) (2006)","DOI":"10.1145\/1177352.1177354"},{"issue":"1\u20132","key":"70_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1017\/S1471068406002857","volume":"7","author":"M. Cadoli","year":"2007","unstructured":"Cadoli, M., Mancini, T.: Combining relational algebra, SQL, constraint modelling, and local search. Theory Pract. Log. Program.\u00a07(1\u20132), 37\u201365 (2007)","journal-title":"Theory Pract. Log. Program."},{"key":"70_CR7","series-title":"Lecture Notes in Computer Science","first-page":"180","volume-title":"Constraint Databases and Applications","author":"M. Cai","year":"2004","unstructured":"Cai, M.: Integrating Constraint and Relational Database Systems. In: Kuijpers, B., Revesz, P.Z. (eds.) CDB 2004. LNCS, vol.\u00a03074, pp. 180\u2013188. Springer, Heidelberg (2004)"},{"key":"70_CR8","unstructured":"Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 2nd edn. Benjamin\/Cummings (1994)"},{"key":"70_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming\u00a019\/20, 503\u2013581 (1994)","journal-title":"Journal of Logic Programming"},{"key":"70_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-57887-0_92","volume-title":"Theoretical Aspects of Computer Software","author":"P.C. Kanellakis","year":"1994","unstructured":"Kanellakis, P.C., Goldin, D.Q.: Constraint Programming and Database Query Languages. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 96\u2013120. Springer, Heidelberg (1994)"},{"key":"70_CR11","first-page":"542","volume-title":"Proceedings of ICTAI","author":"W. Li","year":"2004","unstructured":"Li, W., van Beek, P.: Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition. In: Proceedings of ICTAI, pp. 542\u2013548. IEEE Computer Society, Los Alamitos (2004)"},{"key":"70_CR12","volume-title":"Database Management Systems","author":"R. Ramakrishnan","year":"2000","unstructured":"Ramakrishnan, R., Gehrke, J.: Database Management Systems. McGraw-Hill Higher Education, New York (2000)"},{"key":"70_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0022160","volume-title":"Advances in Database Technology - EDBT \u201990","author":"C. Zaniolo","year":"1990","unstructured":"Zaniolo, C.: Deductive databases - theory meets practice. In: Bancilhon, F., Tsichritzis, D.C., Thanos, C. (eds.) EDBT 1990. LNCS, vol.\u00a0416, pp. 1\u201315. Springer, Heidelberg (1990)"},{"key":"70_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1006351428454","volume":"24","author":"H. Zhang","year":"2000","unstructured":"Zhang, H., Stickel, M.: Implementing the Davis-Putnam Procedure. Journal of Automated Reasoning\u00a024, 277\u2013296 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"70_CR15","unstructured":"Zhao, D.: Analyzing SQL Constraints. Master\u2019s thesis, Emory University (August 2008)"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69052-8_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:23:36Z","timestamp":1620001416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69052-8_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540690450","9783540690528"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69052-8_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}