Minimizing the number of clauses by renaming
From MaRDI portal
Publication:6488560
DOI10.1007/3-540-52885-7_114zbMATH Open1509.68295MaRDI QIDQ6488560FDOQ6488560
Publication date: 28 April 2023
Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
Cited In (6)
- A Mizar mode for HOL
- Removing redundancy from a clause
- On the practical value of different definitional translations to normal form
- Practically useful variants of definitional translations to normal form
- An optimality result for clause form translation
- Solving strong controllability of temporal problems with uncertainty using SMT
Recommendations
- Removing redundancy from a clause π π
- Eliminating Redundant Clauses in SAT Instances π π
- Preprocessing of propagation redundant clauses π π
- Preprocessing of propagation redundant clauses π π
- Renaming a set of non-Horn clauses π π
- Simplifying CDCL clause database reduction π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: Minimizing the number of clauses by renaming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488560)