Cited in
(only showing first 100 items - show all)- Arg2P
- OptiLog
- Clause vivification by unit propagation in CDCL SAT solvers
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Learning Optimal Decision Sets and Lists with SAT
- Improved Computational Approaches and Heuristics for Zero Forcing
- Partial backtracking in CDCL solvers
- scientific article; zbMATH DE number 7306863 (Why is no real title available?)
- Deep cooperation of CDCL and local search for SAT
- SAT-based rigorous explanations for decision lists
- Breaking symmetries in graph search with canonizing sets
- Managing caching strategies for stream reasoning with reinforcement learning
- Definability for model counting
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- SAT-Based Horn Least Upper Bounds
- On conversions from CNF to ANF
- Minimal self-similar Peano curve of genus \(5 \times 5\)
- Multi-agent path finding with mutex propagation
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- A SAT attack on the Erdős-Szekeres conjecture
- An empirical study of branching heuristics through the lens of global learning rate
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Pakota: a system for enforcement in abstract argumentation
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- A novel SAT solver for the van der Waerden numbers
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Propositional proof systems based on maximum satisfiability
- Extreme cases in SAT problems
- A SAT attack on the Erdős-Szekeres conjecture
- SAT-Based Formula Simplification
- FRAT
- Open-WBO-Inc
- MergeSat
- MedleySolver
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- The \textsc{MergeSat} solver
- New models for generating hard random Boolean formulas and disjunctive logic programs
- Learning a propagation complete formula
- Computer-aided proof of Erdős discrepancy properties
- Kissat
- Paracooba
- Learning rate based branching heuristic for SAT solvers
- Acceptance in incomplete argumentation frameworks
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- Multi-agent pathfinding with continuous time
- Evaluating CDCL variable scoring schemes
- The first international competition on computational models of argumentation: results and analysis
- HaifaSat
- ManySAT
- MiniSat
- Siege
- SATIRE
- Chaff
- clasp
- Plingeling
- PrecoSAT
- ASPARTIX
- QMaxSAT
- D-FLAT
- Azucar
- CryptoMiniSat
- GlueMiniSat
- Open-WBO
- PackUp
- antom
- ppfolio
- Ltur
- ABC
- MTBDD
- pfolioUZK
- PBLib
- Treengeling
- SATenstein
- IGraph/M
- HordeSat
- LMHS
- SpySMAC
- Substitutive structure of Jeandel-Rao aperiodic tilings
- COMiniSatPS
- satUZK
- Mosel
- VOLT
- MaxHS
- Argtools
- Carneades
- CEGARTIX
- CoQuiAAS
- Dungine
- LamatzSolver
- prefMaxSAT
- ProGraph
- TCAS
- abcdSAT
- MiFuMax
- pylgl
- PySAT
- PyMiniSolvers
This page was built for software: Glucose
