11 citations · 11 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2015
Exploiting Resolution-based Representations for MaxSAT Solving
Miguel Neves, Ruben Martins, Mikoláš Janota +2
Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of…
cs.AI2010★ 11 cited
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
Mikoláš Janota, Joao Marques-Silva, Radu Grigore
Circumscription is a representative example of a nonmonotonic reasoning inference technique. Circumscription has often been studied for first order theories, but its propositional…