Algorithms for computing backbones of propositional formulae
Mikoláš Janota, Inês Lynce, João P. Marques-Silva · AI Communications · 2015
The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a formula's satisfiability alone is insufficient. Often, some other proper