Substitutional Definition of Satisfiability in Classical Propositional Logic. - Anton Belov; Zbigniew Stachniak (SAT, 2005)

Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. - Zbigniew Stachniak; Anton Belov (SAT, 2008)

Weighting strategy for non-clausal resolution. - Zbigniew Stachniak; Anton Belov (J. Exp. Theor. Artif. Intell., 2008)

Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. - Anton Belov; Zbigniew Stachniak (SAT, 2009)

Improved Local Search for Circuit Satisfiability. - Anton Belov; Zbigniew Stachniak (SAT, 2010)

Accelerating MUS extraction with recursive model rotation. - Anton Belov; João Marques-Silva 001 (FMCAD, 2011)

Depth-Driven Circuit-Level Stochastic Local Search for SAT. - Anton Belov; Matti Järvisalo; Zbigniew Stachniak (IJCAI, 2011)

Minimally Unsatisfiable Boolean Circuits. - Anton Belov; João Marques-Silva 001 (SAT, 2011)

Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability - Anton Belov; Matti Järvisalo (CoRR, 2011)

On Computing Minimal Equivalent Subformulas. - Anton Belov; Mikolás Janota; Inês Lynce; João Marques-Silva 001 (CP, 2012)

On Efficient Computation of Variable MUSes. - Anton Belov; Alexander Ivrii; Arie Matsliah; João Marques-Silva 001 (SAT, 2012)

Towards efficient MUS extraction. - Anton Belov; Inês Lynce; João Marques-Silva 001 (AI Commun., 2012)

Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality - Anton Belov; João Marques-Silva 001 (CoRR, 2012)

MUSer2: An Efficient MUS Extractor. - Anton Belov; João Marques-Silva 001 (J. Satisf. Boolean Model. Comput., 2012)

Minimal Sets over Monotone Predicates in Boolean Formulae. - João Marques-Silva 001; Mikolás Janota; Anton Belov (CAV, 2013)

Core minimization in SAT-based abstraction. - Anton Belov; Huan Chen 001; Alan Mishchenko; João Marques-Silva 001 (DATE, 2013)

On Computing Minimal Correction Subsets. - João Marques-Silva 001; Federico Heras; Mikolás Janota; Alessandro Previti; Anton Belov (IJCAI, 2013)

SAT-Based Preprocessing for MaxSAT. - Anton Belov; António Morgado 001; João Marques-Silva 001 (LPAR, 2013)

Parallel MUS Extraction. - Anton Belov; Norbert Manthey; João Marques-Silva 001 (SAT, 2013)

Formula Preprocessing in MUS Extraction. - Anton Belov; Matti Järvisalo; João Marques-Silva 001 (TACAS, 2013)

SAT-based Preprocessing for MaxSAT (extended version). - Anton Belov; António Morgado 001; João Marques-Silva 001 (CoRR, 2013)

Small inductive safe invariants. - Alexander Ivrii; Arie Gurfinkel; Anton Belov (FMCAD, 2014)

Robot Trajectory Optimization for the Relaxed End-effector Path. - Sergey Alatartsev; Anton Belov; Mykhaylo Nykolaychuk; Frank Ortmeier (ICINCO (1), 2014)

MUS Extraction Using Clausal Proofs. - Anton Belov; Marijn Heule; João Marques-Silva 001 (SAT, 2014)

FrankenBit: Bit-Precise Verification with Many Bits - (Competition Contribution). - Arie Gurfinkel; Anton Belov (TACAS, 2014)

Synthesizing Safe Bit-Precise Invariants. - Arie Gurfinkel; Anton Belov; João Marques-Silva 001 (TACAS, 2014)

Algorithms for computing minimal equivalent subformulas. - Anton Belov; Mikolás Janota; Inês Lynce; João Marques-Silva 001 (Artif. Intell., 2014)

Overview and analysis of the SAT Challenge 2012 solver competition. - Adrian Balint; Anton Belov; Matti Järvisalo; Carsten Sinz (Artif. Intell., 2015)

Performance Indicator for Benchmarking Force-Controlled Robots. - Roland Behrens; Anton Belov; Maik Poggendorf; Felix Penzlin; Magnus Hanses; Emily Jantz; Norbert Elkmann (ICRA, 2018)

Center-of-delay: a new metric to drive timing margin against spatial variation in complex SOCs. - Christian Lütkemeyer; Anton Belov (DATE, 2023)