{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:13Z","timestamp":1750307593628,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,22]]},"DOI":"10.1145\/1774088.1774522","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"2066-2070","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Constraint processing in relational database systems"],"prefix":"10.1145","author":[{"given":"James J.","family":"Lu","sequence":"first","affiliation":[{"name":"Emory University"}]},{"given":"Sebastien","family":"Siva","sequence":"additional","affiliation":[{"name":"Emory University"}]},{"given":"Ojas","family":"Parekh","sequence":"additional","affiliation":[{"name":"Emory University"}]},{"given":"George H. L.","family":"Fletcher","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology"}]},{"given":"Hantao","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Iowa"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701390859"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1230960.1230966"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.01.006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.776041"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622467.1622474"},{"key":"e_1_3_2_1_7_1","first-page":"502","volume-title":"SAT","author":"E\u00e9n N.","year":"2003","unstructured":"N. E\u00e9n and N. S\u00f6rensson . An Extensible SAT-solver . In SAT , pp. 502 -- 518 , 2003 . N. E\u00e9n and N. S\u00f6rensson. An Extensible SAT-solver. In SAT, pp. 502--518, 2003."},{"key":"e_1_3_2_1_8_1","volume-title":"Translating Pseudo-Boolean Constraints into SAT. JSAT, 2(1--4):1--26","author":"E\u00e9n N.","year":"2006","unstructured":"N. E\u00e9n and N. S\u00f6rensson . Translating Pseudo-Boolean Constraints into SAT. JSAT, 2(1--4):1--26 , 2006 . N. E\u00e9n and N. S\u00f6rensson. Translating Pseudo-Boolean Constraints into SAT. JSAT, 2(1--4):1--26, 2006."},{"key":"e_1_3_2_1_9_1","first-page":"43","article-title":"Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Complexity of Computation","volume":"7","author":"Fagin R.","year":"1974","unstructured":"R. Fagin . Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Complexity of Computation , SIAM-AMS Proc. 7 , pp. 43 -- 73 , 1974 . R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Complexity of Computation, SIAM-AMS Proc. 7, pp. 43--73, 1974.","journal-title":"SIAM-AMS Proc."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366103"},{"key":"e_1_3_2_1_11_1","first-page":"109","volume-title":"IJCAI","author":"Frisch A. M.","year":"2005","unstructured":"A. M. Frisch The Rules of Constraint Modeling . IJCAI , pp. 109 -- 116 , 2005 . A. M. Frisch et al. The Rules of Constraint Modeling. IJCAI, pp. 109--116, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758481.1758508"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/581339.581451"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9033-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00143878"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_18_1","first-page":"1594","volume-title":"AAAI","author":"Lifschitz V.","year":"2008","unstructured":"V. Lifschitz . What Is Answer Set Programming ? In AAAI , pages 1594 -- 1597 , 2008 . V. Lifschitz. What Is Answer Set Programming? In AAAI, pages 1594--1597, 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.1.1"},{"key":"e_1_3_2_1_20_1","volume-title":"Smodels: A System for Answer Set Programming. CoRR, cs.AI\/0003033","author":"Niemel\u00e4 I.","year":"2000","unstructured":"I. Niemel\u00e4 , P. Simons , and T. Syrj\u00e4nen . Smodels: A System for Answer Set Programming. CoRR, cs.AI\/0003033 , 2000 . I. Niemel\u00e4, P. Simons, and T. Syrj\u00e4nen. Smodels: A System for Answer Set Programming. CoRR, cs.AI\/0003033, 2000."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:CONS.0000049262.04178.a8"},{"key":"e_1_3_2_1_22_1","first-page":"161","volume-title":"IJCAI","author":"Patterson M.","year":"2007","unstructured":"M. Patterson Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions . In IJCAI , pp. 161 -- 166 , 2007 . M. Patterson et al. Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. In IJCAI, pp. 161--166, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_75"},{"key":"e_1_3_2_1_24_1","first-page":"272","volume-title":"CADE","author":"Zhang H.","year":"1997","unstructured":"H. Zhang . SATO : An Efficient Propositional Prover . CADE , pp. 272 -- 275 , 1997 . H. Zhang. SATO: An Efficient Propositional Prover. CADE, pp. 272--275, 1997."}],"event":{"name":"SAC'10: The 2010 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Sierre Switzerland","acronym":"SAC'10"},"container-title":["Proceedings of the 2010 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774522","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1774088.1774522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:34Z","timestamp":1750250494000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774522"}},"subtitle":["from theory to implementation"],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":23,"alternative-id":["10.1145\/1774088.1774522","10.1145\/1774088"],"URL":"https:\/\/doi.org\/10.1145\/1774088.1774522","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}