Parallel cooperative propositional theorem proving

DOI10.1023/A:1018946526109zbMATH Open0940.68120OpenAlexW1485312863MaRDI QIDQ1978017FDOQ1978017

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

Cited In (12)

• Autark assignments of Horn CNFs
• Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
• Title not available (Why is that?)
• Parallel Multivariate Meta-Theorems
• Title not available (Why is that?)
• Computing Maximal Autarkies with Few and Simple Oracle Queries
• Complexity analysis of propositional resolution with autarky pruning
• A cooperative parallelization approach for property-directed \(k\)-induction
• Parallelization of a hyper-linking-based theorem prover
• PARTHENON: A parallel theorem prover for non-horn clauses
• Investigations on autark assignments
• Cooperation in heterogeneous theorem prover networks (Diss., Univ. Kaiserslautern)

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)