6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.AI2013★ 1 cited
SAT-based Preprocessing for MaxSAT (extended version)
Anton Belov, Antonio Morgado, Joao Marques-Silva
State-of-the-art algorithms for industrial instances of MaxSAT problem rely on iterative calls to a SAT solver. Preprocessing is crucial for the acceleration of SAT solving, and th…
cs.LO2012★ 6 cited
Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality
Anton Belov, Joao Marques-Silva
Detection and elimination of redundant clauses from propositional formulas in Conjunctive Normal Form (CNF) is a fundamental problem with numerous application domains, including AI…
cs.AI2011
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability
Anton Belov, Matti Järvisalo
This work focuses on improving state-of-the-art in stochastic local search (SLS) for solving Boolean satisfiability (SAT) instances arising from real-world industrial SAT applicati…