{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:40:02Z","timestamp":1749944402122,"version":"3.41.0"},"reference-count":8,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270403271","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:14:22Z","timestamp":1486048462000},"page":"327-340","source":"Crossref","is-referenced-by-count":2,"title":["On the restricted equivalence for subclasses of propositional logic"],"prefix":"10.1051","volume":"27","author":[{"given":"A.","family":"Fl\u00f6gel","sequence":"first","affiliation":[]},{"given":"H.","family":"Kleine B\u00fcning","sequence":"additional","affiliation":[]},{"given":"T.","family":"Lettmann","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"1. ASPVALL B., PLASS M. F. and TARJAN R. E., A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing letters, 8, 1979, pp. 121-123.5264510398.68042","key":"R1","DOI":"10.1016\/0020-0190(79)90002-4"},{"unstructured":"2. van DENNEHEUVEL S. and KWAST K. L., Weak equivalence for constraint sets, Proc. IJCAI-91, Sidney, Australie, Vol. 2, 1991, pp. 851-856.0749.68018","key":"R2"},{"unstructured":"3. GOLD E. M., Complexity of automaton identification from given data, unpublished manuscript, 1974.","key":"R3"},{"unstructured":"4. HOOKER J. N., Logical inference and polyhedral projection, to appear in Proc. CSL'91, Springer LNCS, 1991.12328870819.68105","key":"R4"},{"unstructured":"5. KLEINE B\u00dcNING H., KARPINSKI M. and FL\u00d6GEL A., Resolution for quantified boolean formulas, to appear in Information and Cornputation.13188100828.68045","key":"R5"},{"doi-asserted-by":"crossref","unstructured":"6. STOCKMEYER L. J. and MEYER A. R., World problems requiring exponential time, Proc. 5th Ann. ACM Symp. Theory of Computing, 1973, pp. 1-9.4185180359.68050","key":"R6","DOI":"10.1145\/800125.804029"},{"doi-asserted-by":"crossref","unstructured":"7. STOCKMEYER L. J., The polynomial-time hierarchy, Theoretical computer Science, 3, 1977, pp. 1-22.4388100353.02024","key":"R7","DOI":"10.1016\/0304-3975(76)90061-X"},{"doi-asserted-by":"crossref","unstructured":"8. TSEITIN G. S., On the complexity of d\u00e9rivations in propositional calculus, in A. O. Slisenko (ed.): Studies in constructive mathematics and mathematical logic, Consultants bureau, New York, 1970, part II, pp. 115-125.0205.00402","key":"R8","DOI":"10.1007\/978-1-4899-5327-8_25"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270403271\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:17:52Z","timestamp":1749943072000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270403271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":8,"journal-issue":{"issue":"4"},"alternative-id":["ita1993270403271"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270403271","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[1993]]}}}