{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:25:29Z","timestamp":1725585929349},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221187"},{"type":"electronic","value":"9783642221194"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22119-4_10","type":"book-chapter","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T10:21:08Z","timestamp":1308133268000},"page":"104-118","source":"Crossref","is-referenced-by-count":7,"title":["A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders"],"prefix":"10.1007","author":[{"given":"Serenella","family":"Cerrito","sequence":"first","affiliation":[]},{"given":"Marta","family":"Cialdea Mayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-48168-0_22","volume-title":"Computer Science Logic","author":"C. Areces","year":"1999","unstructured":"Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 307\u2013321. Springer, Heidelberg (1999)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S1570-2464(07)80017-6","volume-title":"Handbook of Modal Logics","author":"C. Areces","year":"2007","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., Wolter, F., van Benthem, J. (eds.) Handbook of Modal Logics, pp. 821\u2013868. Elsevier, Amsterdam (2007)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01049415","volume":"4","author":"P. Blackburn","year":"1995","unstructured":"Blackburn, P., Seligman, J.: Hybrid languages. Journal of Logic, Language and Information\u00a04, 251\u2013272 (1995)","journal-title":"Journal of Logic, Language and Information"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1093\/logcom\/exm014","volume":"17","author":"T. Bolander","year":"2007","unstructured":"Bolander, T., Blackburn, P.: Termination for hybrid tableaus. Journal of Logic and Computation\u00a017(3), 517\u2013554 (2007)","journal-title":"Journal of Logic and Computation"},{"key":"10_CR5","unstructured":"Cerrito, S., Cialdea Mayer, M.: Nominal substitution at work with the global and converse modalities. In: Beklemishev, L., Goranko, V., Shehtman, V. (eds.) Advances in Modal Logic, vol.\u00a08, pp. 57\u201374. College Publications (2010)"},{"key":"10_CR6","unstructured":"Cerrito, S., Cialdea Mayer, M.: A calculus for a decidable fragment of hybrid logic with binders. Technical Report RT-DIA-181-2011, Dipartimento di Informatica e Automazione, Universit\u00e0 di Roma Tre (2011), \n                  \n                    http:\/\/www.dia.uniroma3.it\/Plone\/ricerca\/technical-reports\/2011"},{"key":"10_CR7","first-page":"295","volume-title":"Proc. 14th Symposium on Logic in Computer Science","author":"H. Ganzinger","year":"1999","unstructured":"Ganzinger, H., De Nivelle, H.: A superposition decision procedure for the guarded fragment with equality. In: Proc. 14th Symposium on Logic in Computer Science, pp. 295\u2013305. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E. Gr\u00e4del","year":"1998","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. Journal of Symbolic Logic\u00a064, 1719\u20131742 (1998)","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR9","first-page":"257","volume-title":"Advances in Modal Logic","author":"C. Hirsch","year":"2001","unstructured":"Hirsch, C., Tobies, S.: A tableau algorithm for the clique guarded fragment. In: Wolter, F., Wansing, H., de Rijke, M., Zakharyaschev, M. (eds.) Advances in Modal Logic, vol.\u00a03, pp. 257\u2013277. CSLI Publications, Stanford (2001)"},{"key":"10_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45616-3_11","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J. Hladik","year":"2002","unstructured":"Hladik, J.: Implementation and optimisation of a tableau algorithm for the guarded fragment. In: Egly, U., Ferm\u00fcller, C.G. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 145\u2013159. Springer, Heidelberg (2002)"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10849-009-9087-8","volume":"18","author":"M. Kaminski","year":"2009","unstructured":"Kaminski, M., Smolka, G.: Terminating tableau systems for hybrid logic with difference and converse. Journal of Logic, Language and Information\u00a018(4), 437\u2013464 (2009)","journal-title":"Journal of Logic, Language and Information"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10849-005-5787-x","volume":"14","author":"B. Cate ten","year":"2005","unstructured":"ten Cate, B., Franceschet, M.: Guarded fragments with constants. Journal of Logic, Language and Information\u00a014, 281\u2013288 (2005)","journal-title":"Journal of Logic, Language and Information"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11538363_24","volume-title":"Computer Science Logic","author":"B.D. Cate ten","year":"2005","unstructured":"ten Cate, B.D., Franceschet, M.: On the complexity of hybrid logics with binders. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 339\u2013354. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22119-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T18:21:09Z","timestamp":1553797269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22119-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221187","9783642221194"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22119-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}