Glucose
From MaRDI portal
Software:19849
No author found.
Related Items (52)
Multi-agent pathfinding with continuous time ⋮ Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ SAT-Based Formula Simplification ⋮ Between SAT and UNSAT: The Fundamental Difference in CDCL SAT ⋮ Evaluating CDCL Variable Scoring Schemes ⋮ SAT-Based Horn Least Upper Bounds ⋮ Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ SAT race 2015 ⋮ Open-WBO: A Modular MaxSAT Solver, ⋮ SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ PySAT: a Python toolkit for prototyping with SAT oracles ⋮ Conformant planning as a case study of incremental QBF solving ⋮ Breaking symmetries in graph search with canonizing sets ⋮ Learning a propagation complete formula ⋮ Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Substitutive structure of Jeandel-Rao aperiodic tilings ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ Symmetric explanation learning: effective dynamic symmetry handling for SAT ⋮ An empirical study of branching heuristics through the lens of global learning rate ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ Computer-aided proof of Erdős discrepancy properties ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ A SAT attack on the Erdős-Szekeres conjecture ⋮ Unnamed Item ⋮ Managing caching strategies for stream reasoning with reinforcement learning ⋮ Acceptance in incomplete argumentation frameworks ⋮ Propositional proof systems based on maximum satisfiability ⋮ Minimal self-similar Peano curve of genus \(5 \times 5\) ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ Ramsey numbers of ordered graphs ⋮ A SAT attack on the Erdős-Szekeres conjecture ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ New models for generating hard random Boolean formulas and disjunctive logic programs ⋮ Clause vivification by unit propagation in CDCL SAT solvers ⋮ Unnamed Item ⋮ Definability for model counting ⋮ Extreme Cases in SAT Problems ⋮ Learning Rate Based Branching Heuristic for SAT Solvers ⋮ On conversions from CNF to ANF ⋮ Pakota: A System for Enforcement in Abstract Argumentation ⋮ Multi-agent path finding with mutex propagation ⋮ Unnamed Item ⋮ A novel SAT solver for the van der Waerden numbers ⋮ Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT ⋮ Partial Backtracking in CDCL Solvers ⋮ Learning Optimal Decision Sets and Lists with SAT ⋮ Deep cooperation of CDCL and local search for SAT ⋮ SAT-based rigorous explanations for decision lists ⋮ Assessing progress in SAT solvers through the Lens of incremental SAT ⋮ The \textsc{MergeSat} solver
This page was built for software: Glucose
