Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAnton Belov
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 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]
- [c19]Sergey Alatartsev, Anton Belov, Mykhaylo Nykolaychuk, Frank Ortmeier:
Robot Trajectory Optimization for the Relaxed End-effector Path. ICINCO (1) 2014: 385-390 - [c18]
- [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]
- [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]
- [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]
- [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
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-16 22:36 CEST by the dblp team