The following pages link to MiniSat (Q13332):
Displaying 50 items.
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) (Q4593048) (← links)
- Formal System Verification (Q4610434) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers (Q4649734) (← links)
- Replanning in Domains with Partial Information and Sensing Actions (Q4899128) (← links)
- (Q4904223) (← links)
- Superposition for Bounded Domains (Q4913861) (← links)
- MACE4 and SEM: A Comparison of Finite Model Generators (Q4913862) (← links)
- Gibbard’s Collapse Theorem for the Indicative Conditional: An Axiomatic Approach (Q4913867) (← links)
- Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
- E-MaLeS 1.1 (Q4928455) (← links)
- InKreSAT: Modal Reasoning via Incremental Reduction to SAT (Q4928458) (← links)
- Automated Testing and Debugging of SAT and QBF Solvers (Q4930578) (← links)
- Improved Local Search for Circuit Satisfiability (Q4930596) (← links)
- Two Techniques for Minimizing Resolution Proofs (Q4930598) (← links)
- Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis (Q4930731) (← links)
- (Q4931177) (← links)
- Graph Transformation Units Guided by a SAT Solver (Q4931302) (← links)
- Assignment Stack Shrinking (Q4931560) (← links)
- Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers (Q4933300) (← links)
- Partitioning SAT Instances for Distributed Solving (Q4933318) (← links)
- Improving Resource-Unaware SAT Solvers (Q4933329) (← links)
- The External Interface for Extending WASP (Q4957194) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- The 10th IJCAR automated theorem proving system competition – CASC-J10 (Q5019796) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- A Study of Symmetry Breaking Predicates and Model Counting (Q5039506) (← links)
- Implementing Superposition in iProver (System Description) (Q5049017) (← links)
- The CADE-28 Automated Theorem Proving System Competition – CASC-28 (Q5069650) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
- Inconsistency Proofs for ASP: The ASP - DRUPE Format (Q5108508) (← links)
- (Q5109519) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
- MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks* (Q5140144) (← links)
- The CADE-26 automated theorem proving system competition – CASC-26 (Q5145427) (← links)
- Towards backbone computing: A Greedy-Whitening based approach (Q5145436) (← links)
- Resizing cardinality constraints for MaxSAT (Q5145443) (← links)
- The CADE-27 Automated theorem proving System Competition – CASC-27 (Q5145460) (← links)
- Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving (Q5172605) (← links)
- Extracting verified decision procedures: DPLL and Resolution (Q5177337) (← links)
- Compressing Propositional Refutations (Q5178991) (← links)
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis (Q5191098) (← links)
- Multi-shot ASP solving with clingo (Q5197744) (← links)
- Blocked Clause Elimination for QBF (Q5200018) (← links)
- Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (Q5200021) (← links)
