{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:14:09Z","timestamp":1742922849944,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983332"},{"type":"electronic","value":"9783319983349"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98334-9_4","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T08:33:14Z","timestamp":1534926794000},"page":"47-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class"],"prefix":"10.1007","author":[{"given":"Massimo","family":"Bono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfonso Emilio","family":"Gerevini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J Allen","year":"1983","unstructured":"Allen, J.: Maintaining knowledge about temporal intervals. Commun. ACM 26(1), 832\u2013843 (1983)","journal-title":"Commun. ACM"},{"key":"4_CR2","first-page":"276","volume":"93","author":"RR Bakker","year":"1993","unstructured":"Bakker, R.R., Dikker, F., Tempelman, F., Wognum, P.M.: Diagnosing and solving over-determined constraint satisfaction problems. IJCAI 93, 276\u2013281 (1993)","journal-title":"IJCAI"},{"key":"4_CR3","unstructured":"van Beek, P.: Reasoning about qualitative temporal information. In: Proceedings of the Eighth National Conference of the American Association for Artificial Intelligence (AAAI-1990), Boston, MA, pp. 728\u2013734 (1990)"},{"issue":"1\u20133","key":"4_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","volume":"58","author":"P Beek van","year":"1992","unstructured":"van Beek, P.: Reasoning about qualitative temporal information. Artif. Intell. 58(1\u20133), 297\u2013321 (1992)","journal-title":"Artif. Intell."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/S1574-6526(07)03013-1","volume-title":"Handbook of Knowledge Representation","author":"Anthony G. Cohn","year":"2008","unstructured":"Cohn, A.G., Renz, J.: Qualitative spatial representation and reasoning. In: Handbook of Knowledge Representation, pp. 551\u2013596 (2008)"},{"key":"4_CR6","unstructured":"Condotta, J., Kaci, S., Schwind, N.: A framework for merging qualitative constraints networks. In: Proceedings of the Twenty-First International Florida Artificial Intelligence, pp. 586\u2013591 (2008)"},{"key":"4_CR7","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Cambridge (1990)"},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0020-0190(01)00278-2","volume":"83","author":"J Delgrande","year":"2002","unstructured":"Delgrande, J., Gupta, A.: Updating \n                      \n                        \n                      \n                      $$<=,<$$\n                    -chains. Inf. Process. Lett. 83(5), 261\u2013268 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"4_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0004-3702(01)00119-9","volume":"131","author":"J Delgrande","year":"2001","unstructured":"Delgrande, J., Gupta, A., Allen, T.: A comparison of point-based approaches to qualitative temporal reasoning. Artif. Intell. 131(1\u20132), 135\u2013170 (2001)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"4_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0004-3702(97)00021-0","volume":"93","author":"T Drakengren","year":"1997","unstructured":"Drakengren, T., Jonsson, P.: Twenty-one large tractable subclasses of Allen\u2019s algebra. Artif. Intell. 93(1\u20132), 297\u2013319 (1997)","journal-title":"Artif. Intell."},{"key":"4_CR11","volume-title":"Algorithms and Theory of Computation Handbook","author":"D Eppstein","year":"1999","unstructured":"Eppstein, D., Galil, Z., Italiano, G.: Dynamic graph algorithms. In: Atallah, M. (ed.) Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton (1999)"},{"issue":"1\u20133","key":"4_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"EC Freuder","year":"1992","unstructured":"Freuder, E.C., Wallace, R.J.: Partial constraint satisfaction. Artif. Intell. 58(1\u20133), 21\u201370 (1992)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"4_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0304-3975(00)00013-X","volume":"259","author":"D Frigioni","year":"2001","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1\u20132), 287\u2013305 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR14","unstructured":"Georgiadis, L., Hansen, T.D., Italiano, G.F., Krinninger, S., Parotsidis, N.: Decremental data structures for connectivity and dominators in directed graphs. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, pp. 42:1\u201342:15 (2017)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(02)00193-5","volume":"137","author":"A Gerevini","year":"2002","unstructured":"Gerevini, A., Renz, J.: Combining topological and size information for spatial reasoning. Artif. Intell. 137, 1\u201342 (2002)","journal-title":"Artif. Intell."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0004-3702(94)00016-T","volume":"74","author":"A Gerevini","year":"1995","unstructured":"Gerevini, A., Schubert, L.: Efficient algorithms for qualitative reasoning about time. Artif. Intell. 74, 207\u2013248 (1995)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"4_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2005.04.005","volume":"166","author":"AE Gerevini","year":"2005","unstructured":"Gerevini, A.E.: Incremental qualitative temporal reasoning: algorithms for the point algebra and the ORD-Horn class. Artif. Intell. 166(1\u20132), 37\u201380 (2005)","journal-title":"Artif. Intell."},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.artint.2010.10.004","volume":"175","author":"AE Gerevini","year":"2011","unstructured":"Gerevini, A.E., Saetti, A.: Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure. Artif. Intell. 175(2), 556\u2013585 (2011)","journal-title":"Artif. Intell."},{"issue":"5","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1145\/174147.169675","volume":"40","author":"C Golumbic","year":"1993","unstructured":"Golumbic, C., Shamir, R.: Complexity and algorithms for reasoning about time: a graph-theoretic approach. J. Assoc. Comput. Mach. (ACM) 40(5), 1108\u20131133 (1993)","journal-title":"J. Assoc. Comput. Mach. (ACM)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). \n                      https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9\n                      \n                    . Plenum"},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/876638.876639","volume":"50","author":"A Krokhin","year":"2003","unstructured":"Krokhin, A., Jeavons, P., Jonsson, P.: The tractable subalgebras of Allen\u2019s interval algebra. J. Assoc. Comput. Mach. (ACM) 50(5), 591\u2013640 (2003)","journal-title":"J. Assoc. Comput. Mach. (ACM)"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/176584.176585","volume":"41","author":"P Ladkin","year":"1994","unstructured":"Ladkin, P., Maddux, R.: On binary constraint problems. J. Assoc. Comput. Mach. (ACM) 41(3), 435\u2013469 (1994)","journal-title":"J. Assoc. Comput. Mach. (ACM)"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2483699.2483707","volume":"9","author":"Jakub \u0141\u0105cki","year":"2013","unstructured":"\u0141\u0105cki, J.: Improved deterministic algorithms for decremental reachability and strongly connected components. ACM Trans. Algorithms 9(3), 27:1\u201327:15 (2013)","journal-title":"ACM Transactions on Algorithms"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1240","volume":"20","author":"D Long","year":"2003","unstructured":"Long, D., Fox, M.: The 3rd international planning competition: results and analysis. J. Artif. Intell. Res. 20, 1\u201359 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1613\/jair.1141","volume":"20","author":"DS Nau","year":"2003","unstructured":"Nau, D.S., Au, T.C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D., Yaman, F.: Shop2: an htn planning system. J. Artif. Intell. Res. 20, 379\u2013404 (2003)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B Nebel","year":"1995","unstructured":"Nebel, B., B\u00fcrckert, H.J.: Reasoning about temporal relations: a maximal tractable subclass of Allen\u2019s interval algebra. J. Assoc. Comput. Mach. (ACM) 42(1), 43\u201366 (1995)","journal-title":"J. Assoc. Comput. Mach. (ACM)"},{"key":"4_CR27","unstructured":"Penberthy, J.S.: Planning with continuous change (1993), Technical report UW-CSE-93-12-01"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","volume":"7","author":"M Sharir","year":"1981","unstructured":"Sharir, M.: A strong-connectivity algorithm and its applications in data flow analysis. Comput. Math. Appl. 7(1), 67\u201372 (1981)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth first search and linear graph algorithms. SIAM J. Comput. 1(2), 215\u2013225 (1972)","journal-title":"SIAM J. Comput."},{"key":"4_CR30","unstructured":"Vilain, M., Kautz, H.: Constraint propagation algorithms for temporal reasoning. In: Proceedings of the Fifth National Conference of the American Association for Artificial Intelligence (AAAI-1986), pp. 377\u2013382. Morgan Kaufmann (1986)"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/B978-1-4832-1447-4.50034-1","volume-title":"Readings in Qualitative Reasoning About Physical Systems","author":"Marc Vilain","year":"1990","unstructured":"Vilain, M., Kautz, H., van Beek, P.: Constraint propagation algorithms for temporal reasoning: a revised report. In: Readings in Qualitative Reasoning about Physical Systems, pp. 373\u2013381. Morgan Kaufman, San Mateo (1990)"},{"key":"4_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60618-2","volume-title":"Intelligent Planning","author":"Q Yang","year":"1997","unstructured":"Yang, Q.: Intelligent Planning. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/978-3-642-60618-2"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98334-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:31:51Z","timestamp":1558326711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2018.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,85","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}