scientific article
From MaRDI portal
Publication:3815282
zbMath0664.03012MaRDI QIDQ3815282
Hans Kleine Büning, Peter H. Schmitt, Marek Karpinski
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial time algorithmlogic programmingevaluation problem for quantified propositional Horn clauses
Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property, Disjunctive closures for knowledge compilation, Quantified Constraints in Twenty Seventeen, Quantified constraint satisfaction and the polynomially generated powers property, Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
