default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Belov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c22]Christian Lütkemeyer, Anton Belov:
Center-of-delay: a new metric to drive timing margin against spatial variation in complex SOCs. DATE 2023: 1-6
2010 – 2019
- 2018
- [c21]Roland Behrens, Anton Belov, Maik Poggendorf, Felix Penzlin, Magnus Hanses, Emily Jantz, Norbert Elkmann:
Performance Indicator for Benchmarking Force-Controlled Robots. ICRA 2018: 1653-1660 - 2015
- [j5]Adrian Balint, Anton Belov, Matti Järvisalo
, Carsten Sinz:
Overview and analysis of the SAT Challenge 2012 solver competition. Artif. Intell. 223: 120-155 (2015) - 2014
- [j4]Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva:
Algorithms for computing minimal equivalent subformulas. Artif. Intell. 216: 309-326 (2014) - [c20]Alexander Ivrii, Arie Gurfinkel, Anton Belov:
Small inductive safe invariants. FMCAD 2014: 115-122 - [c19]Sergey Alatartsev, Anton Belov, Mykhaylo Nykolaychuk, Frank Ortmeier:
Robot Trajectory Optimization for the Relaxed End-effector Path. ICINCO (1) 2014: 385-390 - [c18]Anton Belov, Marijn Heule, João Marques-Silva:
MUS Extraction Using Clausal Proofs. SAT 2014: 48-57 - [c17]Arie Gurfinkel, Anton Belov, João Marques-Silva:
Synthesizing Safe Bit-Precise Invariants. TACAS 2014: 93-108 - [c16]Arie Gurfinkel, Anton Belov:
FrankenBit: Bit-Precise Verification with Many Bits - (Competition Contribution). TACAS 2014: 408-411 - 2013
- [c15]João Marques-Silva, Mikolás Janota, Anton Belov:
Minimal Sets over Monotone Predicates in Boolean Formulae. CAV 2013: 592-607 - [c14]Anton Belov, Huan Chen, Alan Mishchenko, João Marques-Silva:
Core minimization in SAT-based abstraction. DATE 2013: 1411-1416 - [c13]João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov:
On Computing Minimal Correction Subsets. IJCAI 2013: 615-622 - [c12]Anton Belov, António Morgado, João Marques-Silva:
SAT-Based Preprocessing for MaxSAT. LPAR 2013: 96-111 - [c11]Anton Belov, Norbert Manthey, João Marques-Silva:
Parallel MUS Extraction. SAT 2013: 133-149 - [c10]Anton Belov, Matti Järvisalo, João Marques-Silva:
Formula Preprocessing in MUS Extraction. TACAS 2013: 108-123 - [i3]Anton Belov, António Morgado, João Marques-Silva:
SAT-based Preprocessing for MaxSAT (extended version). CoRR abs/1310.2298 (2013) - 2012
- [j3]Anton Belov, Inês Lynce, João Marques-Silva:
Towards efficient MUS extraction. AI Commun. 25(2): 97-116 (2012) - [j2]Anton Belov, João Marques-Silva:
MUSer2: An Efficient MUS Extractor. J. Satisf. Boolean Model. Comput. 8(3/4): 123-128 (2012) - [c9]Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva:
On Computing Minimal Equivalent Subformulas. CP 2012: 158-174 - [c8]Anton Belov, Alexander Ivrii, Arie Matsliah, João Marques-Silva:
On Efficient Computation of Variable MUSes. SAT 2012: 298-311 - [i2]Anton Belov, João Marques-Silva:
Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality. CoRR abs/1207.1257 (2012) - 2011
- [c7]Anton Belov, João Marques-Silva:
Accelerating MUS extraction with recursive model rotation. FMCAD 2011: 37-40 - [c6]Anton Belov, Matti Järvisalo, Zbigniew Stachniak:
Depth-Driven Circuit-Level Stochastic Local Search for SAT. IJCAI 2011: 504-509 - [c5]Anton Belov, João Marques-Silva:
Minimally Unsatisfiable Boolean Circuits. SAT 2011: 145-158 - [i1]Anton Belov, Matti Järvisalo:
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability. CoRR abs/1109.2049 (2011) - 2010
- [c4]Anton Belov, Zbigniew Stachniak:
Improved Local Search for Circuit Satisfiability. SAT 2010: 293-299
2000 – 2009
- 2009
- [c3]Anton Belov, Zbigniew Stachniak:
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. SAT 2009: 258-264 - 2008
- [j1]Zbigniew Stachniak, Anton Belov:
Weighting strategy for non-clausal resolution. J. Exp. Theor. Artif. Intell. 20(1): 61-78 (2008) - [c2]Zbigniew Stachniak, Anton Belov:
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. SAT 2008: 257-270 - 2005
- [c1]Anton Belov, Zbigniew Stachniak:
Substitutional Definition of Satisfiability in Classical Propositional Logic. SAT 2005: 31-45
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
