Pages that link to "Item:Q5756562"
From MaRDI portal
The following pages link to Extended Resolution Proofs for Symbolic SAT Solving with Quantification (Q5756562):
Displaying 13 items.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Extended clause learning (Q622116) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- Dual proof generation for quantified Boolean formulas with a BDD-based solver (Q2055876) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Compressing Propositional Refutations (Q5178991) (← links)
- Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)
- Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms (Q6535701) (← links)