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

DOI10.1016/0020-0255(95)00026-LzbMath0878.68112OpenAlexW2076587260MaRDI QIDQ1357089

B. Pradeep, C. Siva Ram Murthy

Publication date: 4 January 1998

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(95)00026-l

zbMATH Keywords

theorem proving

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cites Work

• Unnamed Item
• An efficient procedure for theorem proving in propositional logic on vector computers
• A parallel approach for theorem proving in propositional logic
• Applications of reconfigurable meshes to constant-time computations
• Parallel computations on reconfigurable meshes

This page was built for publication: A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes