Glucose

swMATH7833MaRDI QIDQ19849FDOQ19849

Author name not available (Why is that?)

Cited In (52)

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

This page was built for software: Glucose