An efficient procedure for theorem proving in propositional logic on vector computers

DOI10.1016/S0167-8191(05)80043-2zbMath0731.68091MaRDI QIDQ808298

Ming-Yi Fang, Wen-Tsuen Chen

Publication date: 1991

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

NP-completevectorizationsatisfiabilitydivide-and-conquerpipelinevector computers

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)

Related Items

A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes