Pages that link to "Item:Q1777395"

The following pages link to UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395):

Displaying 14 items.

• UnitWalk (Q13737) (← links)
• A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← links)
• A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804) (← links)
• Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances (Q1776200) (← links)
• On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
• A SAT approach to query optimization in mediator systems (Q1777403) (← links)
• The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems (Q1928267) (← links)
• An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
• A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
• GridSAT: Design and implementation of a computational grid application (Q2505055) (← links)
• The state of SAT (Q2643296) (← links)
• A Decision-Making Procedure for Resolution-Based SAT-Solvers (Q3502699) (← links)
• A Computing Procedure for Quantification Theory (Q5613969) (← links)