{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:57:28Z","timestamp":1725742648887},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_32","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"455-469","source":"Crossref","is-referenced-by-count":7,"title":["Satisfiability of CTL* with Constraints"],"prefix":"10.1007","author":[{"given":"Claudia","family":"Carapelle","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Kartzow","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Boja\u0144czyk, M., Toru\u0144czyk, S.: Weak MSO+U over infinite trees. In: Proc.\u00a0STACS 2012. LIPIcs, vol.\u00a014, pp. 648\u2013660. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012)"},{"key":"32_CR2","unstructured":"Boja\u0144czyk, M., Toru\u0144czyk, S.: Weak MSO+U over infinite trees (long version), \n                    \n                      http:\/\/www.mimuw.edu.pl\/~bojan\/papers\/wmsou-trees.pdf"},{"key":"32_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11916277_14","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L. Bozzelli","year":"2006","unstructured":"Bozzelli, L., Gascon, R.: Branching-time temporal logic extended with qualitative Presburger constraints. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 197\u2013211. Springer, Heidelberg (2006)"},{"key":"32_CR4","unstructured":"Carapelle, C., Kartzow, A., Lohrey, M.: Satisfiability of CTL* with constraints Technical report, arXiv.org (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1306.0814"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-58201-0_56","volume-title":"Automata, Languages, and Programming","author":"K. \u010cer\u0101ns","year":"1994","unstructured":"\u010cer\u0101ns, K.: Deciding properties of integral relational automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 35\u201346. Springer, Heidelberg (1994)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Colcombet, T., L\u00f6ding, C.: Regular cost functions over finite trees. In: Proc.\u00a0LICS 2010, pp. 70\u201379. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.36"},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B. Courcelle","year":"1991","unstructured":"Courcelle, B.: The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comput. Sci.\u00a080(2), 153\u2013202 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"32_CR8","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ic.2006.09.006","volume":"205","author":"S. Demri","year":"2007","unstructured":"Demri, S., D\u2019Souza, D.: An automata-theoretic approach to constraint LTL. Inf. Comput.\u00a0205(3), 380\u2013415 (2007)","journal-title":"Inf. Comput."},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2008.07.023","volume":"409","author":"S. Demri","year":"2008","unstructured":"Demri, S., Gascon, R.: Verification of qualitative \u2124 constraints. Theor. Comput. Sci.\u00a0409(1), 24\u201340 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.entcs.2009.05.040","volume":"239","author":"R. Gascon","year":"2009","unstructured":"Gascon, R.: An automata-based approach for CTL* with constraints. Electr. Notes Theor. Comput. Sci.\u00a0239, 193\u2013211 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"32_CR11","unstructured":"Lutz, C.: Description logics with concrete domains-a survey. In: Advances in Modal Logic 4, pp. 265\u2013296. King\u2019s College Publications (2003)"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.artint.2003.08.001","volume":"152","author":"C. Lutz","year":"2004","unstructured":"Lutz, C.: Combining interval-based temporal reasoning with general TBoxes. Artificial Intelligence\u00a0152(2), 235\u2013274 (2004)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/1024922.1024925","volume":"5","author":"C. Lutz","year":"2004","unstructured":"Lutz, C.: NEXPTIME-complete description logics with concrete domains. ACM Trans. Comput. Log.\u00a05(4), 669\u2013705 (2004)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1-3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10817-006-9049-7","volume":"38","author":"C. Lutz","year":"2007","unstructured":"Lutz, C., Milicic, M.: A tableau algorithm for description logics with concrete domains and general TBoxes. J. Autom. Reasoning\u00a038(1-3), 227\u2013259 (2007)","journal-title":"J. Autom. Reasoning"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:54:18Z","timestamp":1557960858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}