7 citations · 13 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.SE2015★ 7 cited
SAT-based Analysis of Large Real-world Feature Models is Easy
Jia Hui Liang, Vijay Ganesh, Venkatesh Raman +1
Modern conflict-driven clause-learning (CDCL) Boolean SAT solvers provide efficient automatic analysis of real-world feature models (FM) of systems ranging from cars to operating s…
cs.LO2015★ 1 cited
Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
Jia Hui Liang, Vijay Ganesh, Ed Zulkoski +2
Conflict-Driven Clause-Learning SAT solvers crucially depend on the Variable State Independent Decaying Sum (VSIDS) branching heuristic for their performance. Although VSIDS was pr…