A Polly Cracker system based on satisfiability
From MaRDI portal
Recommendations
- A survey on Polly Cracker systems
- Polynomially solvable satisfiability problems
- Theoretical Computer Science
- Hierarchies of polynomially solvable satisfiability problems
- A perspective on certain polynomial-time solvable classes of satisfiability
- A certified polynomial-based decision procedure for propositional logic
- Complexity of satisfiability problems with symmetric polynomial clauses
- scientific article; zbMATH DE number 1925556
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Satisfiability in Boolean logic (SAT problem) is polynomial
Cited in
(6)
This page was built for publication: A Polly Cracker system based on satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154862)