(I can't get no) satisfaction: Can SAT-solvers resolve dependency hell?
Whether you’re a software engineer or data scientist, dealing with dependency hell is often an unavoidable problem when building complex projects that require 3rd packages. Most package managers alleviate these pain points by implementing a dependency resolver. Because dependency resolution can be modeled as an NP-complete problem, one such promising dependency resolver is a boolean satisfiability (SAT) solver. This talk will explore a classic case of dependency hell, known as the diamond dependency problem, and if SAT-solvers are adequate enough to address these issues.