Pages that link to "Item:Q3434726"

The following pages link to Extended Resolution Proofs for Conjoining BDDs (Q3434726):

Displaying 16 items.

• A finite state intersection approach to propositional satisfiability (Q442157) (← links)
• Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
• Extended clause learning (Q622116) (← links)
• Producing and verifying extremely large propositional refutations (Q694550) (← links)
• On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
• Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
• Non-clausal redundancy properties (Q2055860) (← 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)
• Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
• DRAT Proofs for XOR Reasoning (Q2835888) (← links)
• Dynamic Symmetry Breaking by Simulating Zykov Contraction (Q3637171) (← links)
• Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability (Q5200054) (← links)
• Efficient verified (UN)SAT certificate checking (Q5919480) (← links)
• Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)
• Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms (Q6535701) (← links)