The following pages link to MiniSat (Q13332):
Displaying 50 items.
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- Subsumption Algorithms for Three-Valued Geometric Resolution (Q2817925) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- Extreme Cases in SAT Problems (Q2818004) (← links)
- Improved Static Symmetry Breaking for SAT (Q2818005) (← links)
- Learning Rate Based Branching Heuristic for SAT Solvers (Q2818006) (← links)
- On the Hardness of SAT with Community Structure (Q2818008) (← links)
- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT (Q2818016) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers (Q2818024) (← links)
- Finding Finite Models in Multi-sorted First-Order Logic (Q2818025) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- 2QBF: Challenges and Solutions (Q2818033) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- LMHS: A SAT-IP Hybrid MaxSAT Solver (Q2818041) (← links)
- Anti-alignments in Conformance Checking – The Dark Side of Process Models (Q2822655) (← links)
- On the one-way function candidate proposed by Goldreich (Q2828220) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- Pakota: A System for Enforcement in Abstract Argumentation (Q2835885) (← links)
- DRAT Proofs for XOR Reasoning (Q2835888) (← links)
- Preprocessing in Incremental SAT (Q2843332) (← links)
- Temporal induction by incremental SAT solving (Q2845506) (← links)
- Web Based System for Weighted Defeasible Argumentation (Q2851967) (← links)
- Optimal implementation of watched literals and more general techniques (Q2859022) (← links)
- Bounded model checking with parametric data structures (Q2864380) (← links)
- Interpolant learning and reuse in SAT-based model checking (Q2864382) (← links)
- Compressing BMC encodings with QBF (Q2864383) (← links)
- Encoding first order proofs in SMT (Q2864408) (← links)
- Polynomial path orders (Q2865062) (← links)
- Blocked Clause Decomposition (Q2870145) (← links)
- Partial Backtracking in CDCL Solvers (Q2870149) (← links)
- Constraint answer set programming systems (Q2883103) (← links)
- Applications of Action Languages in Cognitive Robotics (Q2900522) (← links)
- Gearing Up for Effective ASP Planning (Q2900527) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- Satallax: An Automatic Higher-Order Prover (Q2908482) (← links)
- Multi-criteria optimization in answer set programming (Q2909134) (← links)
- Verification of Petri Nets with Read Arcs (Q2912697) (← links)
- Using Satisfiability for Non-optimal Temporal Planning (Q2915070) (← links)
- Tableau Calculi for Logic Programs under Answer Set Semantics (Q2946700) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Optimization Modulo Theories with Linear Rational Costs (Q2946768) (← links)
- Solving Nonlinear Integer Arithmetic with MCSAT (Q2961575) (← links)
- NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Q2964454) (← links)
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers (Q2964456) (← links)
- Extending Clause Learning DPLL with Parity Reasoning (Q2999100) (← links)
- Identifying Necessary Reactions in Metabolic Pathways by Minimal Model Generation (Q2999147) (← links)
- (Q3002781) (← links)
- Equality Saturation: A New Approach to Optimization (Q3003313) (← links)
