{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:04Z","timestamp":1725564904535},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_55","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:35:03Z","timestamp":1283974503000},"page":"795-800","source":"Crossref","is-referenced-by-count":1,"title":["Constraint Programming for Modelling and Solving Modal Satisfiability"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Brand","sequence":"first","affiliation":[]},{"given":"Rosella","family":"Gennari","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","first-page":"199","volume-title":"Proc. ECAI 2000","author":"C. Areces","year":"2000","unstructured":"Areces, C., Gennari, R., Heguiabehere, J., de Rijke, M.: Tree-based Heuristics in Modal Theorem Proving. In: Proc. ECAI 2000, pp. 199\u2013203. IOS Press, Amsterdam (2000)"},{"key":"55_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008204403391","volume":"6","author":"P. Blackburn","year":"1997","unstructured":"Blackburn, P., De Rijke, M.: Zooming in, zooming out. Journal of Logic, Language and Information\u00a06, 5\u201331 (1997)","journal-title":"Journal of Logic, Language and Information"},{"key":"55_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"issue":"1\u20132","key":"55_CR4","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1006\/inco.1999.2850","volume":"162","author":"F. Giunchiglia","year":"2000","unstructured":"Giunchiglia, F., Sebastiani, R.: Building Decision Procedures for Modal Logics from Propositional Decision Procedures. The Case Study of Modal K(m). Information and Computation\u00a0162(1\u20132), 158\u2013178 (2000)","journal-title":"The Case Study of Modal K(m). Information and Computation"},{"key":"55_CR5","unstructured":"Haarslev, V., M\u00f6ller, R.: RACER (September 2002), \n                    \n                      http:\/\/kogs-www.informatik.uni-hamburg.de\/~race\/"},{"key":"55_CR6","unstructured":"Heuerding, A., Schwendimann, S.: A Benchmark Method for the Propositional Modal Logics K, KT, S4. Technical Report IAM-96-015, University of Bern (1996)"},{"key":"55_CR7","unstructured":"Horrocks, I.: FaCT (September 2002), \n                    \n                      http:\/\/www.cs.man.ac.uk\/~horrocks\/FaCT\/"},{"issue":"3","key":"55_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1093\/jigpal\/8.3.293","volume":"8","author":"I. Horrocks","year":"2000","unstructured":"Horrocks, I., Patel-Schneider, P.F., Sebastiani, R.: An Analysis of Empirical Testing for Modal Decision Procedures. Logic J. of the IGPL\u00a08(3), 293\u2013323 (2000)","journal-title":"Logic J. of the IGPL"},{"key":"55_CR9","unstructured":"MSPASS V 1.0.0t.1.2.a. February 23 (2001), URL: \n                    \n                      http:\/\/www.cs.man.ac.uk\/~schmidt\/mspass"},{"key":"55_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-45620-1_2","volume-title":"Automated Deduction - CADE-18","author":"G. Pan","year":"2002","unstructured":"Pan, G., Sattler, U., Vardi, M.Y.: BDD-Based Decision Procedures for K. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 16\u201330. Springer, Heidelberg (2002)"},{"key":"55_CR11","unstructured":"Patel-Schneider, P.F.: DLP (September 2002), URL: \n                    \n                      http:\/\/www.bell-labs.com.user\/pfps\/dlp\/"},{"key":"55_CR12","unstructured":"Tacchella, A.: \u2009\u2217\u2009SAT System Description. In: Collected Papers from the International Description Logics Workshop 1999, CEUR (1999)"},{"key":"55_CR13","unstructured":"TANCS: Tableaux Non-Classical Systems Comparison, January 17 (2000), URL: \n                    \n                      http:\/\/www.dis.uniroma1.it\/~tancs"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:45:40Z","timestamp":1553046340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}