On the restricted equivalence for subclasses of propositional logic

A. Flögel; H. Kleine Büning; T. Lettmann

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1993)

  • Volume: 27, Issue: 4, page 327-340
  • ISSN: 0988-3754

How to cite

top

Flögel, A., Kleine Büning, H., and Lettmann, T.. "On the restricted equivalence for subclasses of propositional logic." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 27.4 (1993): 327-340. <http://eudml.org/doc/92454>.

@article{Flögel1993,
author = {Flögel, A., Kleine Büning, H., Lettmann, T.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {restricted equivalence problem; restricted implication problem; classes of propositional formulas; satisfiability problem; quantified Boolean formulas; quantified definite Horn formulas; algorithms; quantified 2CNF formulas},
language = {eng},
number = {4},
pages = {327-340},
publisher = {EDP-Sciences},
title = {On the restricted equivalence for subclasses of propositional logic},
url = {http://eudml.org/doc/92454},
volume = {27},
year = {1993},
}

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
PB - EDP-Sciences
VL - 27
IS - 4
SP - 327
EP - 340
LA - eng
KW - restricted equivalence problem; restricted implication problem; classes of propositional formulas; satisfiability problem; quantified Boolean formulas; quantified definite Horn formulas; algorithms; quantified 2CNF formulas
UR - http://eudml.org/doc/92454
ER -

References

top
  1. 1. B. ASPVALL, M. F. PLASS and R. E. TARJAN, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing letters, 8, 1979, pp. 121-123. Zbl0398.68042MR526451
  2. 2. S. van DENNEHEUVEL and K. L. KWAST, Weak equivalence for constraint sets, Proc. IJCAI-91, Sidney, Australie, Vol. 2, 1991, pp. 851-856. Zbl0749.68018
  3. 3. E. M. GOLD, Complexity of automaton identification from given data, unpublished manuscript, 1974. 
  4. 4. J. N. HOOKER, Logical inference and polyhedral projection, to appear in Proc. CSL'91, Springer LNCS, 1991. Zbl0819.68105MR1232887
  5. 5. H. KLEINE BÜNING, M. KARPINSKI and A. FLÖGEL, Resolution for quantified boolean formulas, to appear in Information and Cornputation. Zbl0828.68045MR1318810
  6. 6. L. J. STOCKMEYER and A. R. MEYER, World problems requiring exponential time, Proc. 5th Ann. ACM Symp. Theory of Computing, 1973, pp. 1-9. Zbl0359.68050MR418518
  7. 7. L. J. STOCKMEYER, The polynomial-time hierarchy, Theoretical computer Science, 3, 1977, pp. 1-22. Zbl0353.02024MR438810
  8. 8. G. S. TSEITIN, 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. Zbl0205.00402

NotesEmbed ?

top

You must be logged in to post comments.