The following pages link to Armin Biere (Q209458):
Displaying 50 items.
- SAT race 2015 (Q334795) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Progress in certifying hardware model checking results (Q832275) (← links)
- Verifying the IEEE 1394 fireWire tree identify protocol with SMV (Q1402475) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- Verification of out-of-order processor designs using model Checking and a light-weight completion function (Q1604724) (← links)
- Propagation based local search for bit-precise reasoning (Q1688546) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Covered clauses are not propagation redundant (Q2096437) (← links)
- Nullstellensatz-proofs for multiplier verification (Q2110233) (← links)
- Duplex encoding of staircase at-most-one constraints for the antibandwidth problem (Q2110406) (← links)
- Efficient all-UIP learned clause minimization (Q2118297) (← links)
- XOR local search for Boolean Brent equations (Q2118332) (← links)
- Incremental inprocessing in SAT solving (Q2181926) (← links)
- Backing backtracking (Q2181937) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- Incremental column-wise verification of arithmetic circuits using computer algebra (Q2225473) (← links)
- Strong extension-free proof systems (Q2303251) (← links)
- What a difference a variable makes (Q2324225) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Short proofs without new variables (Q2405245) (← links)
- Four flavors of entailment (Q2661334) (← links)
- Distributed cube and conquer with Paracooba (Q2661340) (← links)
- (Q2754079) (← links)
- Super-Blocked Clauses (Q2817910) (← links)
- Liveness checking as safety checking for infinite state spaces (Q2852018) (← links)
- Compressing BMC encodings with QBF (Q2864383) (← links)
- Blocked Clause Decomposition (Q2870145) (← links)
- Inprocessing Rules (Q2908507) (← links)
- On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (Q2922635) (← links)
- Clause Elimination for SAT and QSAT (Q2941732) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- Failed Literal Detection for QBF (Q3007688) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- (Q3181652) (← links)
- Detecting Cardinality Constraints in CNF (Q3192077) (← links)
- Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses (Q3192078) (← links)
- Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask) (Q3192079) (← links)
- A Unified Proof System for QBF Preprocessing (Q3192183) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- Counterexample-Guided Model Synthesis (Q3303898) (← links)
- (Q3429163) (← links)
- Extended Resolution Proofs for Conjoining BDDs (Q3434726) (← links)
- Evaluating CDCL Variable Scoring Schemes (Q3453243) (← links)
- Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination (Q3460072) (← links)
- Compositional Propositional Proofs (Q3460074) (← links)
- Adaptive Restart Strategies for Conflict Driven SAT Solvers (Q3502690) (← links)
- Nenofex: Expanding NNF for QBF Solving (Q3502708) (← links)
- Blocked Clause Elimination (Q3557074) (← links)
