The following pages link to Armin Biere (Q209458):
Displaying 50 items.
- Tutorial on Model Checking: Modelling and Verification in Computer Science (Q3599190) (← links)
- (Q3604000) (← links)
- A First Step Towards a Unified Proof Checker for QBF (Q3612467) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- (Q4255565) (← links)
- (Q4553279) (← links)
- Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories (Q4633534) (← links)
- Blocked Clauses in First-Order Logic (Q4645725) (← links)
- (Q4817533) (← links)
- Revisiting Hyper Binary Resolution (Q4922905) (← links)
- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR (Q4928459) (← links)
- More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding (Q4928502) (← links)
- Automated Testing and Debugging of SAT and QBF Solvers (Q4930578) (← links)
- Integrating Dependency Schemes in Search-Based QBF Solvers (Q4930586) (← links)
- Reconstructing Solutions after Blocked Clause Elimination (Q4930602) (← links)
- Clause Elimination Procedures for CNF Formulas (Q4933317) (← links)
- Skolem Function Continuation for Quantified Boolean Formulas (Q5086224) (← links)
- Better Decision Heuristics in CDCL through Local Search and Target Phases (Q5101311) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Blocked Clause Elimination for QBF (Q5200018) (← links)
- (Q5219922) (← links)
- Linear Encodings of Bounded LTL Model Checking (Q5310676) (← links)
- Computer Aided Verification (Q5312927) (← links)
- Factoring Out Assumptions to Speed Up MUS Extraction (Q5326470) (← links)
- Automated Technology for Verification and Analysis (Q5394184) (← links)
- Formal Methods in Computer-Aided Design (Q5492980) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703781) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711503) (← links)
- Theory and Applications of Satisfiability Testing (Q5713748) (← links)
- Theory and Applications of Satisfiability Testing (Q5714773) (← links)
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification (Q5756562) (← links)
- Bounded model checking using satisfiability solving (Q5946344) (← links)
- Mining definitions in Kissat with Kittens (Q6056639) (← links)
- Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)
- Certified SAT solving with GPU accelerated inprocessing (Q6564174) (← links)
- Migrating solver state (Q6572043) (← links)
- Cadiback: Extracting backbones with CaDiCaL (Q6643075) (← links)
- IPASIR-up: user propagators for CDCL (Q6643080) (← links)
- Faster LRAT checking than solving with CaDiCaL (Q6643101) (← links)
- On enumerating short projected models (Q6657245) (← links)
- Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker (Q6661748) (← links)
- Artifact for Paper ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving (Q6700794) (← links)
- Sampled and Normalized Satisfiable Instances from the main track of the SAT Competition 2004 to 2022 (Q6700797) (← links)
- The SAT Museum POS'23 Artifact (Q6700819) (← links)
- CNF Encoded Hard Miters from IWLS'22 Paper (Q6700825) (← links)
- CNF Encoded Isomorphic and Optimized Miters from Hardware Model Checking Competition 2012 Models (Q6700826) (← links)
- CNF Encoded Isomorphic and Optimized Miters from Hardware Model Checking Competition 2020 Models (Q6700828) (← links)
- Clausal Equivalence Sweeping Paper Logs (Q6700830) (← links)
- SAT Competition 2023 Main Track Benchmarks (Q6700831) (← links)
- SAT Competition 2021 Main Track Benchmarks (Q6700832) (← links)
