Parallel cooperative propositional theorem proving

DOI10.1023/A:1018946526109MaRDI QIDQ1978017zbMATH OpenOpenAlexFDO

Authors Fumiaki Okushi

Publication date 7 June 2000

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018946526109

zbMATH Keywords

parallel modocparallel satisfiability testing algorithm

Mathematics Subject Classification ID

Recommendations

• A parallel approach for theorem proving in propositional logic
• Complexity analysis of propositional resolution with autarky pruning
• A propositional theorem prover to solve planning and other problems
• PARTHENON: A parallel theorem prover for non-horn clauses
• scientific article; zbMATH DE number 4047184

Cited in

(15)

• A competitive and cooperative approach to propositional satisfiability
• Autark assignments of Horn CNFs
• Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
• Computing maximal autarkies with few and simple oracle queries
• scientific article; zbMATH DE number 1285157 (Why is no real title available?)
• Parallel Multivariate Meta-Theorems
• scientific article; zbMATH DE number 4180829 (Why is no real title available?)
• Complexity analysis of propositional resolution with autarky pruning
• A cooperative parallelization approach for property-directed \(k\)-induction
• Cooperating proof attempts
• Parallelization of a hyper-linking-based theorem prover
• PARTHENON: A parallel theorem prover for non-horn clauses
• A parallel approach for theorem proving in propositional logic
• Investigations on autark assignments
• Cooperation in heterogeneous theorem prover networks (Diss., Univ. Kaiserslautern)

This page was built for publication: Parallel cooperative propositional theorem proving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978017)