A parallel approach for theorem proving in propositional logic

DOI10.1016/0020-0255(87)90005-3zbMath0644.68116OpenAlexW1490800496MaRDI QIDQ1102766

Wen-Tsuen Chen, Lung-Lung Liu

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0255(87)90005-3

zbMATH Keywords

theorem provingpropositional logicNP-completedivide-and-conquer strategypipeliningparallel proof procedure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05) Theory of operating systems (68N25)

Related Items

A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes, The \(Multi\)-SAT algorithm

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• The Specialization of Programs by Theorem Proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item