{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:02:53Z","timestamp":1774591373796,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662228","type":"print"},{"value":"9783540486602","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48660-7_4","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T20:53:07Z","timestamp":1194641587000},"page":"52-66","source":"Crossref","is-referenced-by-count":8,"title":["A PSpace Algorithm for Graded Modal Logic"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Tobies","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,17]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"Y. Andr\u00e9","year":"1998","unstructured":"Y. Andr\u00e9, J. van Benthem, and I. N\u00e9meti. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217\u2013274, 1998.","journal-title":"Journal of Philosophical Logic"},{"issue":"1-2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0004-3702(96)00010-0","volume":"88","author":"F. Baader","year":"1996","unstructured":"F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1-2):195\u2013213, 1996.","journal-title":"Artificial Intelligence"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"D. Calvanese, M. Lenzerini, and D. Nardi. A Unified Framework for Class Based Representation Formalisms. Proc. of KR-94, 1994.","DOI":"10.1016\/B978-1-4832-1452-8.50107-X"},{"issue":"3","key":"4_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/logcom\/5.3.325","volume":"5","author":"W. Hoek","year":"1995","unstructured":"W. Van der Hoek, and M. De Rijke. Counting objects. Journal of Logic and Computation, 5(3):325\u2013345, June 1995.","journal-title":"Journal of Logic and Computation"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages.. Information and Computation, 134(1):1\u201358, 10 April 1997.","DOI":"10.1006\/inco.1997.2625"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K. Fine","year":"1972","unstructured":"K. Fine. In so many possible worlds. Notre Dame Journal of Formal Logic, 13:516\u2013520, 1972.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"4_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CADE-13","author":"F. Giunchiglia","year":"1996","unstructured":"F. Giunchiglia and R. Sebastiani. Building decision procedures for modallogics from propositional decision procedures\u2014the case study of modal K.. Proc. of CADE-13, LNCS 1104. Springer, 1996."},{"key":"4_CR8","unstructured":"B. Hollunder and F. Baader. Qualifying number restrictions in concept languages. In Proc. of KR-91, pages 335\u2013346, Boston (USA) 1991."},{"issue":"3","key":"4_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J. Y. Halpern","year":"1992","unstructured":"J. Y. Halpern and Y. Moses. A guide to completeness and complexity for model logics of knowledge and belief. Artificial Intelligence 54(3):319\u2013379, April 1992.","journal-title":"Artificial Intelligence"},{"key":"4_CR10","first-page":"202","volume":"1","author":"U. Hustadt","year":"1997","unstructured":"U. Hustadt and R. A. Schmidt. On evaluating decision procedures for modal logic. In Proc. of IJCAI-97, volume 1, pages 202\u2013207, 1997.","journal-title":"Proc. of IJCAI-97"},{"issue":"3","key":"4_CR11","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. E. Ladner","year":"1977","unstructured":"R. E. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing,, 6(3):467\u2013480, September 1977.","journal-title":"SIAM Journal on Computing,"},{"issue":"5","key":"4_CR12","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1093\/logcom\/7.5.581","volume":"7","author":"H. J. Ohlbach","year":"1997","unstructured":"H. J. Ohlbach and R. A. Schmidt. Functional translation and second-order frame properties of modal logics. Journal of Logic and Computation, 7(5):581\u2013603, October 1997.","journal-title":"Journal of Logic and Computation"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"H. J. Ohlbach, R. A. Schmidt, and U. Hustadt. Translating graded modalities into predicate logic.. In H. Wansing, editor, Proof Theory of Modal Logic volume 2 of Applied Logic Series, pages 253\u2013291. Kluwer, 1996.","DOI":"10.1007\/978-94-017-2798-3_14"},{"issue":"2","key":"4_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. J. Savitch","year":"1970","unstructured":"W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177\u2013192, April 1970.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR15","unstructured":"K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91,, pages 466\u2013471, 1991."},{"key":"4_CR16","unstructured":"R. A. Schmidt. Resolution is a decision procedure for many propositional modal logics: Extended abstract. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic \u201996. CLSI Publications, 1997."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M. Schmidt-Schau\u00df","year":"1991","unstructured":"M. Schmidt-Schau\u00df and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48:1\u201326, 1991.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-16"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48660-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T02:37:55Z","timestamp":1551062275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48660-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662228","9783540486602"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48660-7_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}