{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:52Z","timestamp":1725566332140},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232421"},{"type":"electronic","value":"9783540302278"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_32","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:34:52Z","timestamp":1284860092000},"page":"372-384","source":"Crossref","is-referenced-by-count":11,"title":["A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment"],"prefix":"10.1007","author":[{"given":"Yevgeny","family":"Kazakov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., van Benthem, J., N\u00e9meti, I.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic\u00a027, 217\u2013274 (1998)","journal-title":"Journal of Philosophical Logic"},{"key":"32_CR2","first-page":"295","volume-title":"Proc. 14th IEEE 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 IEEE Symposium on Logic in Computer Science, pp. 295\u2013305. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"32_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-48660-7_3","volume-title":"Automated Deduction - CADE-16","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E.: Decision procedures for guarded logics. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 31\u201351. Springer, Heidelberg (1999a)"},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. Journal of Symbolic Logic\u00a064(4), 1719\u20131742 (1999b)","journal-title":"Journal of Symbolic Logic"},{"key":"32_CR5","unstructured":"Haarslev, V., M\u00f6ller, R.: Optimizing reasoning in description logics with qualified number restrictions. In: Proceedings of the International Workshop on Description Logics (DL 2001), Stanford, USA, pp. 142\u2013151 (2001)"},{"key":"32_CR6","unstructured":"Haarslev, V., Timmann, M., M\u00f6ller, R.: Combining tableau and algebraic methods for reasoning with qualified number restrictions in description logics. In: Proceedings of the International Workshop on Methods for Modalities 2 (M4M-2), Amsterdam, Netherlands (2001)"},{"key":"32_CR7","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. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, p. 145. Springer, Heidelberg (2002)"},{"key":"32_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-45085-6_8","volume-title":"Automated Deduction \u2013 CADE-19","author":"J. Hladik","year":"2003","unstructured":"Hladik, J., Sattler, U.: A translation of looping alternating automata to description logics. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 90\u2013105. Springer, Heidelberg (2003)"},{"key":"32_CR9","unstructured":"Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation, PhD thesis, RWTH Aachen, Germany (2001)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Vardi, M.: Why is modal logic so robustly decidable? In: Immerman, N., Kolaitis, P.G. (eds.) Descriptive Complexity and Finite Models. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a031, pp. 149\u2013184. American Mathematical Society, Princeton University (1996)","DOI":"10.1090\/dimacs\/031\/05"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:49:11Z","timestamp":1558306151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}