On the restricted equivalence for subclasses of propositional logic
DOI10.1051/ita/1993270403271zbMath0787.03008MaRDI QIDQ3142267
Hans Kleine Büning, Andreas Flögel, Theodor Lettmann
Publication date: 15 November 1993
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_1993__27_4_327_0/
algorithms; satisfiability problem; quantified Boolean formulas; classes of propositional formulas; quantified 2CNF formulas; quantified definite Horn formulas; restricted equivalence problem; restricted implication problem
68Q25: Analysis of algorithms and problem complexity
03B25: Decidability of theories and sets of sentences
03D15: Complexity of computation (including implicit computational complexity)
03B05: Classical propositional logic
Related Items
Cites Work