|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-Reports 1985-1989 | Copyright 1985-1989 Universität Bonn, Institut für Informatik, Abt. V | |
|
8520
|
On the Computational Complexity of Quantified Horn Clauses
Marek Karpinski, Hans Kleine-Buening, Peter H. Schmitt [Download PostScript] [Download PDF] A polynomial time algorithm is presented for the evaluation problem for quantified propositional Horn clauses. This answers an open problem of \cite{IM 87}. |
|
|
Last Change:
12/01/08 at 18:40:49
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |