{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:52:54Z","timestamp":1762509174470,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T00:00:00Z","timestamp":1730160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Independent Research Fund Denmark","award":["DFF-7014-00041"],"award-info":[{"award-number":["DFF-7014-00041"]}]},{"name":"FCT through the LASIGE Research Unit","award":["UIDB\/00408\/2020 and UIDP\/00408\/2020"],"award-info":[{"award-number":["UIDB\/00408\/2020 and UIDP\/00408\/2020"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2024,10,31]]},"abstract":"<jats:p>\n            Answers to continuous queries over data streams are often delayed until some relevant input arrives through the data stream. These delays may turn answers when they arrive, obsolete to users who sometimes have to make decisions with no help whatsoever. Therefore, it can be useful to provide hypothetical answers\u2014\u201cgiven the current information, it is possible that\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(X\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            will become true at time\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(t\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            \u201d\u2014instead of no information at all.\n          <\/jats:p>\n          <jats:p>In this work, we present a semantics for queries and corresponding answers that cover such hypothetical answers, together with an incremental online algorithm for updating the set of facts that are consistent with the currently available information. Our framework also works in a language supporting negation.<\/jats:p>","DOI":"10.1145\/3688845","type":"journal-article","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T14:41:50Z","timestamp":1723905710000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hypothetical Answers to Continuous Queries Over Data Streams"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7866-7484","authenticated-orcid":false,"given":"Lu\u00eds","family":"Cruz-Filipe","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3106-0423","authenticated-orcid":false,"given":"Gra\u00e7a","family":"Gaspar","sequence":"additional","affiliation":[{"name":"LASIGE, Departamento de Inform\u00e1tica, Faculdade de Ci\u00eancias, Universidade de Lisboa, Lisbon, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3966-4966","authenticated-orcid":false,"given":"Isabel","family":"Nunes","sequence":"additional","affiliation":[{"name":"LASIGE, Departamento de Inform\u00e1tica, Faculdade de Ci\u00eancias, Universidade de Lisboa, Lisbon, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2024,10,29]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61488-5"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1186\/2041-1480-5-35"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1025"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0147-z"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543615"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526856"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13486-9_1"},{"key":"e_1_3_2_10_1","first-page":"2741","volume-title":"Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI \u201915)","author":"Beck Harald","year":"2015","unstructured":"Harald Beck, Minh Dao-Tran, and Thomas Eiter. 2015a. Answer Update for Rule-Based Stream Reasoning. In Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI \u201915). Buenos Aires, Argentina, Qiang Yang and Michael J. Wooldridge (Eds.), AAAI Press, 2741\u20132747."},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9408"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4129-7"},{"key":"e_1_3_2_13_1","volume-title":"Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI \u201915)","author":"Bonet Blai","year":"2015","unstructured":"Blai Bonet and Sven Koenig (Eds.). 2015. Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI \u201915). AAAI Press."},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11229"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/308386.308416"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5668"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-46235-1_1"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187671.2187677"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/139"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012760"},{"key":"e_1_3_2_21_1","first-page":"1","article-title":"Stream Reasoning: A Survey and Outlook","volume":"1","author":"Dell\u2019Aglio Daniele","year":"2017","unstructured":"Daniele Dell\u2019Aglio, Emanuele Della Valle, Frank van Harmelen, and Abraham Bernstein. 2017. Stream Reasoning: A Survey and Outlook. Data Sci. 1, 1\u20132 (2017), 59\u201383.","journal-title":"Data Sci"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646001.675770"},{"key":"e_1_3_2_23_1","first-page":"3","volume-title":"Proceedings of the 8th International Conference on Logic Programming","author":"Dung Phan Minh","year":"1991","unstructured":"Phan Minh Dung. 1991. Negations as Hypotheses: An Abductive Foundation for Logic Programming. In Proceedings of the 8th International Conference on Logic Programming. Koichi Furukawa (Ed.), MIT Press, 3\u201317."},{"key":"e_1_3_2_24_1","first-page":"1070","volume-title":"Proceedings of the International Logic Programming Conference and Symposium","author":"Gelfond Michael","year":"1988","unstructured":"Michael Gelfond and Vladimir Lifschitz. 1988. The Stable Model Semantics for Logic Programming. In Proceedings of the International Logic Programming Conference and Symposium. Kowalski, Robert and Bowen, Kenneth (Eds.), MIT Press., 1070\u20131080."},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250585"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1108\/17440080710829216"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170066"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11554"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90043-4"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90059-B"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01995674"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612176"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966385.1966386"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6"},{"key":"e_1_3_2_35_1","volume-title":"Proceedings of the 2013 AAAI Workshop: Plan, Activity, and Intent Recognition","author":"Meadows Ben Leon","year":"2013","unstructured":"Ben Leon Meadows, Pat Langley, and Miranda Jane Emery. 2013. Seeing Beyond Shadows: Incremental Abductive Reasoning for Plan Understanding. In Proceedings of the 2013 AAAI Workshop: Plan, Activity, and Intent Recognition. AAAI."},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9409"},{"key":"e_1_3_2_37_1","first-page":"183","volume-title":"Proceedings of the 37th Annual German Conference on Advances in Artificial Intelligence","volume":"8736","author":"\u00d6z\u00e7ep \u00d6zg\u00fcr L\u00fctf\u00fc","year":"2014","unstructured":"\u00d6zg\u00fcr L\u00fctf\u00fc \u00d6z\u00e7ep, Ralf M\u00f6ller, and Christian Neuenstadt. 2014. A Stream-Temporal Query Language for Ontology Based Data Access. In Proceedings of the 37th Annual German Conference on Advances in Artificial Intelligence. Carsten Lutz and Michael Thielscher (Eds.), Lecture Notes in Computer Science, Vol. 8736, Springer, 183\u2013194."},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90013-6"},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/61352.61357"},{"key":"e_1_3_2_40_1","first-page":"1081","article-title":"Perfect Model Semantics","volume":"88","author":"Przymusinski Teodor C.","year":"1988","unstructured":"Teodor C. Przymusinski. 1988b. Perfect Model Semantics. ICLP\/SLP 88 (1988), 1081\u20131096.","journal-title":"ICLP\/SLP"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750544"},{"key":"e_1_3_2_42_1","first-page":"571","volume-title":"Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR \u201918).","author":"Ronca Alessandro","year":"2018","unstructured":"Alessandro Ronca, Mark Kaminski, Bernardo Cuenca Grau, and Ian Horrocks. 2018a. The Window Validity Problem in Rule-Based Stream Reasoning. In Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR \u201918). Michael Thielscher, Francesca Toni, and Frank Wolter (Eds.), AAAI Press, 571\u2013581."},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103668"},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11537"},{"key":"e_1_3_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1107499.1107504"},{"key":"e_1_3_2_46_1","first-page":"72","volume-title":"Proceedings of the International Conference on Future Internet (FIS \u201908).","volume":"5468","author":"Valle Emanuele Della","year":"2009","unstructured":"Emanuele Della Valle, Stefano Ceri, Davide Francesco Barbieri, Daniele Braga, and Alessandro Campi. 2009a. A First Step Towards Stream Reasoning. In Proceedings of the International Conference on Future Internet (FIS \u201908). John Domingue, Dieter Fensel, and Paolo Traverso (Eds.), Lecture Notes in Computer Science, Vol. 5468, Springer, 72\u201381."},{"key":"e_1_3_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2009.125"},{"key":"e_1_3_2_48_1","first-page":"3092","volume-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI\u2019 19)","author":"Walega Przemyslaw Andrzej","year":"2019","unstructured":"Przemyslaw Andrzej Walega, Mark Kaminski, and Bernardo Cuenca Grau. 2019. Reasoning over Streaming Data in Metric Temporal Datalog. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI\u2019 19), 3092\u20133099."},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32925-8_18"},{"key":"e_1_3_2_50_1","volume-title":"Proceedings of the Technical Communications of the 31st International Conference and Symposium on Logic Programming (ICLP \u201915)","volume":"1433","author":"Zaniolo Carlo","year":"2015","unstructured":"Carlo Zaniolo. 2015. Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs. In Proceedings of the Technical Communications of the 31st International Conference and Symposium on Logic Programming (ICLP \u201915). Marina De Vos, Thomas Eiter, Yuliya Lierler, and Francesca Toni (Eds.), CEUR Workshop Proceedings, Vol. 1433, CEUR-WS.org."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688845","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3688845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:10Z","timestamp":1750291450000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,29]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10,31]]}},"alternative-id":["10.1145\/3688845"],"URL":"https:\/\/doi.org\/10.1145\/3688845","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2024,10,29]]},"assertion":[{"value":"2021-12-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}