@article{ITA_1993__27_4_327_0, author = {Fl\"ogel, A. and Kleine B\"uning, H. and Lettmann, T.}, title = {On the restricted equivalence for subclasses of propositional logic}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {327--340}, publisher = {EDP-Sciences}, volume = {27}, number = {4}, year = {1993}, mrnumber = {1238054}, zbl = {0787.03008}, language = {en}, url = {http://www.numdam.org/item/ITA_1993__27_4_327_0/} }
TY - JOUR AU - Flögel, A. AU - Kleine Büning, H. AU - Lettmann, T. TI - On the restricted equivalence for subclasses of propositional logic JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1993 SP - 327 EP - 340 VL - 27 IS - 4 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1993__27_4_327_0/ LA - en ID - ITA_1993__27_4_327_0 ER -
%0 Journal Article %A Flögel, A. %A Kleine Büning, H. %A Lettmann, T. %T On the restricted equivalence for subclasses of propositional logic %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1993 %P 327-340 %V 27 %N 4 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1993__27_4_327_0/ %G en %F ITA_1993__27_4_327_0
Flögel, A.; Kleine Büning, H.; Lettmann, T. On the restricted equivalence for subclasses of propositional logic. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 27 (1993) no. 4, pp. 327-340. http://www.numdam.org/item/ITA_1993__27_4_327_0/
1. A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing letters, 8, 1979, pp. 121-123. | MR | Zbl
, and ,2. Weak equivalence for constraint sets, Proc. IJCAI-91, Sidney, Australie, Vol. 2, 1991, pp. 851-856. | Zbl
and ,3. Complexity of automaton identification from given data, unpublished manuscript, 1974.
,4. Logical inference and polyhedral projection, to appear in Proc. CSL'91, Springer LNCS, 1991. | MR | Zbl
,5. Resolution for quantified boolean formulas, to appear in Information and Cornputation. | MR | Zbl
, and ,6. World problems requiring exponential time, Proc. 5th Ann. ACM Symp. Theory of Computing, 1973, pp. 1-9. | MR | Zbl
and ,7. The polynomial-time hierarchy, Theoretical computer Science, 3, 1977, pp. 1-22. | MR | Zbl
,8. On the complexity of dérivations 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. | Zbl
,