A linear-time algorithm for testing the truth of certain quantified Boolean formulas

Volume 14, Number 4

INFORMATION PROCESSING LETTERS

13 June 1982

ER_&dTUM A LINEAR=I’IME ALGORITHM BOOLEAN FORMULAS Information

FOR TESTING

THE TRUTH

OF CERTAIN

QUANTIFIED

Processing Letters 8 (3) (1979) 121- 123

Bengt ASPVALL, Michael F. PLASS and Robert Es,dre TARJAN Computer Scier?ze Department, Stanford Uniuersity, Stanford CA 94305, U.S.A. Received 22 August 1978; revised version received 16 October 1978

The first sentence of Step 6 on page 123 should read as follows: If S is marked contingent or false and g has a successor stop: condition 3(S) holds.

~20-0190/82/~-oooO/$O2.75

0 1982 North-Holland

marked

contingent or false,