{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:57:52Z","timestamp":1743008272210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031426070"},{"type":"electronic","value":"9783031426087"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42608-7_15","type":"book-chapter","created":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T23:02:37Z","timestamp":1694991757000},"page":"184-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Most Likely Scenarios of\u00a0Qualitative Constraint Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9803-385X","authenticated-orcid":false,"given":"Tobias","family":"Schwartz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9185-0147","authenticated-orcid":false,"given":"Diedrich","family":"Wolter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,18]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 832\u2013843 (1983). https:\/\/doi.org\/10.1145\/182.358434","DOI":"10.1145\/182.358434"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Cai, S., Luo, C., Thornton, J., Su, K.: Tailoring local search for partial maxsat. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 2623\u20132629. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9109"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Condotta, J.F., Kaci, S., Schwind, N.: A framework for merging qualitative constraints networks. In: Proceedings of the Twenty-First International FLAIRS Conference (2008)","DOI":"10.1109\/ICTAI.2009.36"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Condotta, J., Nouaouri, I., Sioutis, M.: A SAT approach for maximizing satisfiability in qualitative spatial and temporal constraint networks. In: Baral, C., Delgrande, J.P., Wolter, F. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, pp. 432\u2013442. AAAI Press (2016)","DOI":"10.1109\/ICTAI.2015.73"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Condotta, J.F., Mensi, A., Nouaouri, I., Sioutis, M., Sa\u00efd, L.B.: A practical approach for maximizing satisfiability in qualitative spatial and temporal constraint networks. In: Proceedings of International Conference on Tools with Artificial Intelligence (ICTAI), pp. 445\u2013452 (2015). https:\/\/doi.org\/10.1109\/ICTAI.2015.73","DOI":"10.1109\/ICTAI.2015.73"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Dubois, D., Fargier, H., Prade, H.: Possibility theory in constraint satisfaction problems: handling priority, preference and uncertainty. Appl. Intell. 6(4), 287\u2013309 (1996). https:\/\/doi.org\/10.1007\/bf00132735","DOI":"10.1007\/bf00132735"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dylla, F., et al.: A survey of qualitative spatial and temporal calculi: Algebraic and computational properties. ACM Comput. Surv. 50, 1\u201339 (2017). article 7","DOI":"10.1145\/3038927"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10846-006-9099-4","volume":"48","author":"F Dylla","year":"2007","unstructured":"Dylla, F., Wallgr\u00fcn, J.O.: Qualitative spatial reasoning with conceptual neighborhoods for agent control. J. Intell. Robotic Syst. 48(1), 55\u201378 (2007). https:\/\/doi.org\/10.1007\/s10846-006-9099-4","journal-title":"J. Intell. Robotic Syst."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-44953-1_17","volume-title":"Principles and Practice of Constraint Programming","author":"J Goffinet","year":"2016","unstructured":"Goffinet, J., Ramanujan, R.: Monte-carlo tree search for the maximum satisfiability problem. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 251\u2013267. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_17"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a python toolkit for prototyping with SAT oracles. In: SAT, pp. 428\u2013437 (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26","DOI":"10.1007\/978-3-319-94144-8_26"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/SAT190116","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: RC2: an efficient maxsat solver. J. Satisf. Boolean Model. Comput. 11(1), 53\u201364 (2019). https:\/\/doi.org\/10.3233\/SAT190116","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974). https:\/\/doi.org\/10.1016\/S0022-0000(74)80044-9","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"15_CR15","unstructured":"Ligozat, G.: Qualitative Spatial and Temporal Reasoning. Wiley, Hoboken (2011)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-28633-2_8","volume-title":"PRICAI 2004: Trends in Artificial Intelligence","author":"G Ligozat","year":"2004","unstructured":"Ligozat, G., Renz, J.: What Is a qualitative calculus? A general framework. In: Zhang, C., W. Guesgen, H., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 53\u201364. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28633-2_8"},{"key":"15_CR17","unstructured":"Miyazaki, S., Iwama, K., Kambayashi, Y.: Database queries as combinatorial optimization problems. In: Kambayashi, Y., Yokota, K. (eds.) Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, pp. 477\u2013483. World Scientific (1996)"},{"issue":"1","key":"15_CR18","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.: Reasoning about temporal relations: a maximal tractable subclass of allen\u2019s interval algebra. J. ACM 42(1), 43\u201366 (1995). https:\/\/doi.org\/10.1145\/200836.200848","journal-title":"J. ACM"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/11889205_31","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"DN Pham","year":"2006","unstructured":"Pham, D.N., Thornton, J., Sattar, A.: Towards an efficient SAT encoding for temporal reasoning. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 421\u2013436. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889205_31"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-23954-0_18","volume-title":"AI*IA 2011: Artificial Intelligence Around Man and Beyond","author":"A Previti","year":"2011","unstructured":"Previti, A., Ramanujan, R., Schaerf, M., Selman, B.: Monte-carlo style UCT search for boolean satisfiability. In: Pirrone, R., Sorbello, F. (eds.) AI*IA 2011. LNCS (LNAI), vol. 6934, pp. 177\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23954-0_18"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1613\/jair.872","volume":"15","author":"J Renz","year":"2001","unstructured":"Renz, J., Nebel, B.: Efficient methods for qualitative spatial reasoning. J. Artif. Intell. Res. (JAIR) 15, 289\u2013318 (2001)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Schiex, T.: Possibilistic constraint satisfaction problems or \u201chow to handle soft constraints?\u201d. In: Dubois, D., Wellman, M.P. (eds.) Proceedings of the Eighth Annual Conference on Uncertainty in Artificial Intelligence (UAI 1992), pp. 268\u2013275. Morgan Kaufmann (1992)","DOI":"10.1016\/B978-1-4832-8287-9.50041-4"},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"\u015awiechowski, M., Godlewski, K., Sawicki, B., Ma\u0144dziuk, J.: Monte carlo tree search: a review of recent modifications and applications. Artif. Intell. Rev. (2022). https:\/\/doi.org\/10.1007\/s10462-022-10228-y","DOI":"10.1007\/s10462-022-10228-y"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Westphal, M., Hu\u00e9, J., W\u00f6lfl, S.: On the propagation strength of SAT encodings for qualitative temporal reasoning. In: 25th IEEE International Conference on Tools with Artificial Intelligence, pp. 46\u201354. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICTAI.2013.18","DOI":"10.1109\/ICTAI.2013.18"}],"container-title":["Lecture Notes in Computer Science","KI 2023: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42608-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T23:04:05Z","timestamp":1694991845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42608-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031426070","9783031426087"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42608-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2023.gi.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}