UnitWalk
From MaRDI portal
Software:13737
swMATH993MaRDI QIDQ13737FDOQ13737
Author name not available (Why is that?)
Cited In (31)
- GridSAT: Design and implementation of a computational grid application
- The state of SAT
- A taxonomy of exact methods for partial Max-SAT
- A comparative runtime analysis of heuristic algorithms for satisfiability problems
- A parallelization scheme based on work stealing for a class of SAT solvers
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Bounds-Consistent Local Search
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Phase Transitions in Machine Learning
- Improved Local Search for Circuit Satisfiability
- Theory and Applications of Satisfiability Testing
- Artificial Evolution
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- Machine learning-based restart policy for CDCL SAT solvers
- Algorithmic Applications in Management
- A SAT approach to query optimization in mediator systems
- The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
- Justification-Based Local Search with Adaptive Noise Strategies
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
- Title not available (Why is that?)
- Boosting Local Search Thanks to cdcl
- Theory and Applications of Satisfiability Testing
- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- Title not available (Why is that?)
- Decision procedures. An algorithmic point of view
- From Idempotent Generalized Boolean Assignments to Multi-bit Search
- Title not available (Why is that?)
This page was built for software: UnitWalk
