{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:01Z","timestamp":1750220941170,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"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":[[2019,6,23]]},"DOI":"10.1145\/3315507.3330195","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"18-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Detecting unsatisfiable CSS rules in the presence of DTDs"],"prefix":"10.1145","author":[{"given":"Nobutaka","family":"Suzuki","sequence":"first","affiliation":[{"name":"University of Tsukuba, Japan"}]},{"given":"Takuya","family":"Okada","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Japan"}]},{"given":"Yeondae","family":"Kwon","sequence":"additional","affiliation":[{"name":"University of Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346333"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2644866.2644885"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90287-4"},{"key":"e_1_3_2_1_4_1","unstructured":"M.R. Garey and D.S. Johnson. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H. Freeman.   M.R. Garey and D.S. Johnson. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H. Freeman."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187946"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1961v016n05ABEH004112"},{"key":"e_1_3_2_1_7_1","first-page":"10","article-title":"Detecting Redundant CSS Rules in HTML5 Applications","volume":"50","author":"Hague Matthew","year":"2015","unstructured":"Matthew Hague , Anthony W. Lin , and C.-H. Luke Ong . 2015 . Detecting Redundant CSS Rules in HTML5 Applications : A Tree Rewriting Approach. SIGPLAN Not. 50 , 10 (Oct. 2015), 1\u201319. Matthew Hague, Anthony W. Lin, and C.-H. Luke Ong. 2015. Detecting Redundant CSS Rules in HTML5 Applications: A Tree Rewriting Approach. SIGPLAN Not. 50, 10 (Oct. 2015), 1\u201319.","journal-title":"A Tree Rewriting Approach. SIGPLAN Not."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 14th International Symposium on Database Programming Languages (DBPL 2013)","author":"Ishihara Yasunori","year":"2013","unstructured":"Yasunori Ishihara , Nobutaka Suzuki , Kenji Hashimoto , Shougo Shimizu , and Toru Fujiwara . 2013 . XPath Satisfiability with Parent Axes or Qualifiers Is Tractable under Many of Real-World DTDs . In Proceedings of the 14th International Symposium on Database Programming Languages (DBPL 2013) , August 30, 2013, Riva del Garda, Trento, Italy. Yasunori Ishihara, Nobutaka Suzuki, Kenji Hashimoto, Shougo Shimizu, and Toru Fujiwara. 2013. XPath Satisfiability with Parent Axes or Qualifiers Is Tractable under Many of Real-World DTDs. In Proceedings of the 14th International Symposium on Database Programming Languages (DBPL 2013), August 30, 2013, Riva del Garda, Trento, Italy."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970348"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635879"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2337223.2337272"},{"volume-title":"Proceedings of the 5th International Conference on Database and XML Technologies (XSym\u201907)","author":"Montazerian Manizheh","key":"e_1_3_2_1_12_1","unstructured":"Manizheh Montazerian , Peter T. Wood , and Seyed R. Mousavi . 2007. XPath Query Satisfiability is in PTIME for Real-world DTDs . In Proceedings of the 5th International Conference on Database and XML Technologies (XSym\u201907) . 17\u201330. Manizheh Montazerian, Peter T. Wood, and Seyed R. Mousavi. 2007. XPath Query Satisfiability is in PTIME for Real-world DTDs. In Proceedings of the 5th International Conference on Database and XML Technologies (XSym\u201907). 17\u201330."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5221603"},{"volume-title":"Proceedings of the Fifth Annual ACM Symposium on Theory of Computing (STOC \u201973)","author":"Stockmeyer L. J.","key":"e_1_3_2_1_14_1","unstructured":"L. J. Stockmeyer and A. R. Meyer . 1973. Word Problems Requiring Exponential Time(Preliminary Report) . In Proceedings of the Fifth Annual ACM Symposium on Theory of Computing (STOC \u201973) . 1\u20139. L. J. Stockmeyer and A. R. Meyer. 1973. Word Problems Requiring Exponential Time(Preliminary Report). In Proceedings of the Fifth Annual ACM Symposium on Theory of Computing (STOC \u201973). 1\u20139."},{"key":"e_1_3_2_1_15_1","volume-title":"Satisfiability of Simple XPath Fragments under Duplicate-Free DTDs. IEICE Transactions 96-D, 5","author":"Suzuki Nobutaka","year":"2013","unstructured":"Nobutaka Suzuki , Yuji Fukushima , and Kosetsu Ikeda . 2013. Satisfiability of Simple XPath Fragments under Duplicate-Free DTDs. IEICE Transactions 96-D, 5 ( 2013 ), 1029\u20131042. Nobutaka Suzuki, Yuji Fukushima, and Kosetsu Ikeda. 2013. Satisfiability of Simple XPath Fragments under Duplicate-Free DTDs. IEICE Transactions 96-D, 5 (2013), 1029\u20131042."}],"event":{"name":"PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Phoenix AZ USA","acronym":"PLDI '19"},"container-title":["Proceedings of the 17th ACM SIGPLAN International Symposium on Database Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3315507.3330195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3315507.3330195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:33Z","timestamp":1750204413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3315507.3330195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":15,"alternative-id":["10.1145\/3315507.3330195","10.1145\/3315507"],"URL":"https:\/\/doi.org\/10.1145\/3315507.3330195","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}