{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T07:10:02Z","timestamp":1737184202785,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429579"},{"type":"electronic","value":"9783540456537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_28","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:30Z","timestamp":1181365050000},"page":"407-421","source":"Crossref","is-referenced-by-count":0,"title":["Reasoning about Evolving Nonmonotonic Knowledge Bases"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Fink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuliana","family":"Sabbatini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"issue":"1\u20133","key":"28_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0743-1066(99)00065-5","volume":"45","author":"J. Alferes","year":"2000","unstructured":"J. Alferes, J. Leite, L. Pereira, H. Przymusinska, and T. Przymusinski. Dynamic Updates of Non-Monotonic Knowledge Bases. J. Logic Programming, 45(1\u20133):43\u201370, 2000.","journal-title":"J. Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"J. Alferes, L. Pereira, H. Przymusinska, and T. Przymusinski. LUPS-ALanguage for Updating Logic Programs. In Proc. LPNMR\u201999, LNAI 1730, pp. 162\u2013176. Springer, 1999.","key":"28_CR2","DOI":"10.1007\/3-540-46767-X_12"},{"issue":"1\u20132","key":"28_CR3","first-page":"241","volume":"122","author":"C. Baral","year":"2000","unstructured":"C. Baral, V. Kreinovich, and R. Trejo. Computational Complexity of Planning and Approximate Planning in the Presence of Incompleteness. AIJ, 122(1\u20132):241\u2013267, 2000.","journal-title":"AIJ"},{"unstructured":"E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.","key":"28_CR4"},{"doi-asserted-by":"crossref","unstructured":"E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and Expressive Power of Logic Programming. In Proc. 12th IEEE International Conference on Computational Complexity (CCC\u2019 97), pp. 82\u2013101, 1997. Full paper ACM Computing Surveys, to appear.","key":"28_CR5","DOI":"10.1109\/CCC.1997.612304"},{"doi-asserted-by":"crossref","unstructured":"T. Eiter, M. Fink, G. Sabbatini, and H. Tompits. Considerations on Updates of Logic Programs. In Proc. JELIA 2000, LNAI 1919, pp. 2\u201320. Springer, 2000.","key":"28_CR6","DOI":"10.1007\/3-540-40006-0_2"},{"doi-asserted-by":"crossref","unstructured":"T. Eiter, M. Fink, G. Sabbatini, and H. Tompits. On Properties of Update Sequences Based on Causal Rejection. Theory and Practice of Logic Programming, to appear.","key":"28_CR7","DOI":"10.1017\/S1471068401001247"},{"unstructured":"T. Eiter, M. Fink, G. Sabbatini, and H. Tompits. A Framework for Declarative Update Specifications in Logic Programs. In Proc. IJCAI\u201901, pp. 649\u2013654.","key":"28_CR8"},{"doi-asserted-by":"crossref","unstructured":"E. Emerson. Temporal and Modal Logics, Vol. B. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier, 1990.","key":"28_CR9","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"doi-asserted-by":"crossref","unstructured":"R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT, 1995.","key":"28_CR10","DOI":"10.7551\/mitpress\/5803.001.0001"},{"unstructured":"D. Gabbay and P. Smets, editors. Handbook on Defeasible Reasoning and Uncertainty Management Systems, Vol. III. Kluwer Academic, 1998.","key":"28_CR11"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"M. Gelfond and V. Lifschitz. ClassicalNegation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365\u2013385, 1991.","journal-title":"New Generation Computing"},{"doi-asserted-by":"crossref","unstructured":"K. Inoue and C. Sakama. Updating Extended Logic Programs through Abduction. In Proc. LPNMR\u201999, LNAI 1730, pp. 147\u2013161. Springer, 1999.","key":"28_CR13","DOI":"10.1007\/3-540-46767-X_11"},{"unstructured":"J. Lobo, R. Bhatia, and S. Naqvi. A Policy Description Language. In Proc. AAAI\/IAAI\u201999, pp. 291\u2013298. AAAI Press \/ MIT Press, 1999.","key":"28_CR14"},{"unstructured":"J. Lobo and T. Son. Reasoning about Policies Using Logic Programs. In Proc. AAAI 2001 Spring Symposium on Answer Set Programming, pp. 210\u2013216, 2001.","key":"28_CR15"},{"doi-asserted-by":"crossref","unstructured":"V. Marek and M. Truszczy\u0144ski. Revision Specifications by Means of Programs. In Proc. JELIA\u201994, LNAI 838, pp. 122\u2013136. Springer, 1994.","key":"28_CR16","DOI":"10.1007\/BFb0021968"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(97)00092-3","volume":"190","author":"V. Marek","year":"1998","unstructured":"V. Marek and M. Truszczy\u0144ski. Revision Programming. TCS, 190(2):241\u2013277, 1998.","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"M. Winslett. Updating Logical Databases. Cambridge University Press, 1990.","key":"28_CR18","DOI":"10.1017\/CBO9780511663109"},{"doi-asserted-by":"crossref","unstructured":"M. Wooldridge. Reasoning about Rational Agents. MIT Press, 2000.","key":"28_CR19","DOI":"10.7551\/mitpress\/5804.001.0001"},{"doi-asserted-by":"crossref","unstructured":"M. Wooldridge. The Computational Complexity of Agent Design Problem. In Proc. International Conference on Multi-Agent Systems (ICMAS) 2000. IEEE Press, 2000.","key":"28_CR20","DOI":"10.1109\/ICMAS.2000.858472"},{"unstructured":"Y. Zhang and N. Foo. Updating Logic Programs. In Proc. ECAI\u201998, pp. 403\u2013407. 1998.","key":"28_CR21"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:21:29Z","timestamp":1737087689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}