{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:46Z","timestamp":1725488506034},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_19","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"230-241","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Poor Man\u2019s Logic"],"prefix":"10.1007","author":[{"given":"Edith","family":"Hemaspaandra","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"S. Demri and Ph. Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). In 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 61\u201372, 1998.","DOI":"10.1007\/BFb0028549"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2625","volume":"134","author":"F. Donini","year":"1997","unstructured":"F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. Information and Computation, 134, pp. 1\u201358, 1997.","journal-title":"Information and Computation"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0004-3702(92)90076-A","volume":"53","author":"F. Donini","year":"1992","unstructured":"F. Donini, B. Hollunder, M. Lenzerini, D. Nardi, W. Nutt, and A. Spaccamela. The complexity of existential quantification in concept languages. Artificial Intelligence, 53, pp. 309\u2013327, 1992.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0004-3702(95)00018-A","volume":"75","author":"J. Y. Halpern","year":"1995","unstructured":"J. Y. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75(2), pp. 361\u2013372, 1995.","journal-title":"Artificial Intelligence"},{"key":"19_CR5","unstructured":"E. Hemaspaandra. The complexity of poor man\u2019s logic. ACM Computing Research Repository Technical Report cs.LO\/9911014, 1999."},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing, 6(3), pp. 467\u2013480, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"19_CR7","unstructured":"K. Schild. A correspondence theory for terminological logics: preliminary report. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp. 466\u2013471, 1991."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M. Schmidt-Schauss","year":"1991","unstructured":"M. Schmidt-Schauss and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48, pp. 1\u201326, 1991.","journal-title":"Artificial Intelligence"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3, pp. 1\u201322, 1977.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:09:51Z","timestamp":1556719791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}