Parallel cooperative propositional theorem proving
From MaRDI portal
Publication:1978017
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
(19)- A parallel approach for theorem proving in propositional logic
- PARTHENON: A parallel theorem prover for non-horn clauses
- A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Parallelization of a hyper-linking-based theorem prover
- Autark assignments of Horn CNFs
- Autarky pruning in propositional model elimination reduces failure redundancy
- Investigations on autark assignments
- Complexity analysis of propositional resolution with autarky pruning
- A propositional theorem prover to solve planning and other problems
- PSATO: A distributed propositional prover and its application to quasigroup problems
- Cooperation in heterogeneous theorem prover networks (Diss., Univ. Kaiserslautern)
- scientific article; zbMATH DE number 4180829 (Why is no real title available?)
- Computing maximal autarkies with few and simple oracle queries
- Cooperating proof attempts
- scientific article; zbMATH DE number 1285157 (Why is no real title available?)
- Parallel Multivariate Meta-Theorems
- A cooperative parallelization approach for property-directed \(k\)-induction
- A competitive and cooperative approach to propositional satisfiability
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)
