{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:45:19Z","timestamp":1760708719345},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,3,1]]},"DOI":"10.1109\/tkde.2014.2339816","type":"journal-article","created":{"date-parts":[[2014,7,17]],"date-time":"2014-07-17T18:39:03Z","timestamp":1405622343000},"page":"621-635","source":"Crossref","is-referenced-by-count":11,"title":["Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques"],"prefix":"10.1109","volume":"27","author":[{"given":"Sergio","family":"Greco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Spezzano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irina","family":"Trubitsyna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"1","article-title":"The chase procedure and its applications in data exchange","author":"onet","year":"2013","journal-title":"Data Exchange Inf Streams"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687737"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687737"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15918-3_23"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1093382.1093385"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2009.03.004"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1613\/jair.3873","article-title":"Taming the infinite chase: Query answering under expressive relational constraints","volume":"48","author":"cali","year":"2008","journal-title":"J Artif Intell Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920912"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.226"},{"key":"ref13","first-page":"1","article-title":"Consistent query answering: Five easy pieces","author":"chomicki","year":"0","journal-title":"Proc 14th Int'l Conf Database Theory"},{"key":"ref14","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref15","first-page":"133","article-title":"On reconciling data exchange, data integration, and peer data management","author":"de giacomo","year":"0","journal-title":"Proc 8th ACM SIGACT-SIGMOD-SIGART Symp Principles of Database Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376938"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1121995.1122010"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/322344.322347"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.033"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303983"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543644"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320091"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0213006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559799"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)90038-Q"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1147376.1147391"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01883-1","author":"bertossi","year":"2011","journal-title":"Database Repairing and Consistent Query Answering"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514899"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1938551.1938585"},{"key":"ref1","author":"abiteboul","year":"1995","journal-title":"Foundations of Databases"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061323"},{"key":"ref22","year":"0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346334"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01893-0","author":"greco","year":"2012","journal-title":"Incomplete Data and Data Dependencies in Relational Databases"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1245280"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1158","DOI":"10.14778\/3402707.3402750","article-title":"Stratification criteria and rewriting techniques for checking chase termination","volume":"4","author":"greco","year":"2011","journal-title":"Proc Very Large Databases Endowment"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920858"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7029750\/06858064.pdf?arnumber=6858064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T09:19:11Z","timestamp":1689412751000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6858064\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,1]]},"references-count":35,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2339816","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2015,3,1]]}}}