Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Anton Belov
Observed names:
A. Belov,
Belov, Anton
Institution:
Synopsys (United States)
Observed institutions:
University College Dublin,
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento,
Synopsys (Switzerland),
York University,
Synopsys (United States)
ORCID:
0000-0001-8624-7247
Observed ORCID:
0000-0001-8624-7247
OpenAlex ID:
A5026813811
Works
41
Awards
1
On computing minimal correction subsets
2013
·
João Marques‐Silva
, Federico Heras
, et al.
·
International Joint Conference on Artificial Intelligence
·
135
Minimal Sets over Monotone Predicates in Boolean Formulae
2013
·
Joao Marques-Silva
, Mikoláš Janota
, et al.
·
Lecture notes in computer science
·
91
PDF
Towards efficient MUS extraction
2012
·
Anton Belov
, Inês Lynce
, et al.
·
AI Communications
·
89
MUSer2: An Efficient MUS Extractor1
2012
·
Anton Belov
, Joao Marques-Silva
·
Journal on Satisfiability Boolean Modeling and Computation
·
71
PDF
Accelerating MUS extraction with recursive model rotation
2011
·
Anton Belov
, João Marques‐Silva
·
46
Overview and analysis of the SAT Challenge 2012 solver competition
2015
·
Adrian Balint
, Anton Belov
, et al.
·
Artificial Intelligence
·
40
PDF
MUS Extraction Using Clausal Proofs
2014
·
Anton Belov
, Marijn J. H. Heule
, et al.
·
Lecture notes in computer science
·
31
Proceedings of SAT Competition 2014
2014
·
Anton Belov
, Daniel Diepold
, et al.
·
28
Synthesizing Safe Bit-Precise Invariants
2014
·
Arie Gurfinkel
, Anton Belov
, et al.
·
Lecture notes in computer science
·
21
PDF
SAT-Based Preprocessing for MaxSAT
2013
·
Anton Belov
, António Morgado
, et al.
·
Lecture notes in computer science
·
21
Formula Preprocessing in MUS Extraction
2013
·
Anton Belov
, Matti Järvisalo
, et al.
·
Lecture notes in computer science
·
21
Proceedings of SAT Challenge 2012 : Solver and Benchmark Descriptions
2012
·
Adrian Balint
, Anton Belov
, et al.
·
21
On Computing Minimal Equivalent Subformulas
2012
·
Anton Belov
, Mikoláš Janota
, et al.
·
Lecture notes in computer science
·
20
Algorithms for computing minimal equivalent subformulas
2014
·
Anton Belov
, Mikoláš Janota
, et al.
·
Artificial Intelligence
·
12
PDF
Minimally Unsatisfiable Boolean Circuits
2011
·
Anton Belov
, Joao Marques-Silva
·
Lecture notes in computer science
·
12
An RTL-to-GDSII Flow for Single Flux Quantum Circuits Based on an Industrial EDA Toolchain
2023
·
Eric Mlinar
, Stephen Whiteley
, et al.
·
IEEE Transactions on Applied Superconductivity
·
11
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
2009
·
Anton Belov
, Zbigniew Stachniak
·
Lecture notes in computer science
·
10
Small Inductive Safe Invariants
2014
·
Alexander Ivrii
, Arie Gurfinkel
, et al.
·
9
Proceedings of SAT Competition 2013
2013
·
Adrian Balint
, Anton Belov
, et al.
·
9
On Efficient Computation of Variable MUSes
2012
·
Anton Belov
, Alexander Ivrii
, et al.
·
Lecture notes in computer science
·
9
Core Minimization in SAT-based Abstraction
·
Anton Belov
, Huan Chen
, et al.
·
9
Core Minimization in SAT-based Abstraction
2013
·
Anton Belov
, Huan Chen
, et al.
·
Design, Automation, and Test in Europe
·
8
Depth-driven circuit-level stochastic local search for SAT
2011
·
Anton Belov
, Matti Järvisalo
, et al.
·
8
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
2008
·
Zbigniew Stachniak
, Anton Belov
·
Springer eBooks
·
8
Small inductive safe invariants
2014
·
Alexander Ivrii
, Arie Gurfinkel
, et al.
·
Formal Methods in Computer-Aided Design
·
7
Show more works
View as search
Works count:
41
Citation count:
791
H-index:
13
I10-index:
17
Year
Topic
Type
