The following pages link to Anton Belov (Q460637):
Displaying 13 items.
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- On Efficient Computation of Variable MUSes (Q2843335) (← links)
- SAT-Based Preprocessing for MaxSAT (Q2870118) (← links)
- Minimally Unsatisfiable Boolean Circuits (Q3007680) (← links)
- Towards efficient MUS extraction (Q3164969) (← links)
- MUS Extraction Using Clausal Proofs (Q3192054) (← links)
- (Q3194802) (← links)
- Weighting strategy for non-clausal resolution (Q3499018) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)
- Improved Local Search for Circuit Satisfiability (Q4930596) (← links)
- Formula Preprocessing in MUS Extraction (Q5326319) (← links)
- Parallel MUS Extraction (Q5326458) (← links)
- Theory and Applications of Satisfiability Testing (Q5713728) (← links)
