Anton Belov Authors: Add personal information
 Affiliation history
Bibliometrics: publication history
SEARCH
ROLE
Author only

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 20 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 20 of 20 Result page: 1 2 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 June 2015 Artificial Intelligence: Volume 223 Issue C, June 2015 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 2 Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core decision procedures for a wide range of combinatorial problems. Advances in SAT solving during the last 10-15 years have been spurred by yearly solver competitions. In this article, we report on the main SAT solver ... Keywords: Boolean satisfiability, Empirical analysis, SAT solvers, Solver ranking, Competitions 2 November 2014 Artificial Intelligence: Volume 216 Issue 1, November 2014 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 0 Knowledge representation and reasoning using propositional logic is an important component of AI systems. A propositional formula in Conjunctive Normal Form (CNF) may contain redundant clauses — clauses whose removal from the formula does not affect the set of its models. Identification of redundant clauses is important because redundancy often ... Keywords: minimal unsatisfiability, redundancy, boolean satisfiability, irredundant subformula 3 October 2014 FMCAD '14: Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design Publisher: FMCAD Inc Bibliometrics: Citation Count: 3 Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 14 Full text available: PDF Computing minimal (or even just small) certificates is a central problem in automated reasoning and, in particular, in automated formal verification. For example, Minimal Unsatisfiable Subsets (MUSes) have a wide range of applications in verification ranging from abstraction and generalization to vacuity detection and more. In this paper, we study ... 4 August 2013 IJCAI '13: Proceedings of the Twenty-Third international joint conference on Artificial Intelligence Publisher: AAAI Press Bibliometrics: Citation Count: 31 A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal relaxations and minimal explanations for over-constrained problems find many practical uses. For Boolean formulas, minimal relaxations of over-constrained problems are referred to as Minimal Correction Subsets (MCSes). MCSes find many applications, including the enumeration of MUSes. Existing approaches ... 5 July 2013 CAV 2013: Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 12 The importance and impact of the Boolean satisfiability SAT problem in many practical settings is well-known. Besides SAT, a number of computational problems related with Boolean formulas find a wide range of practical applications. Concrete examples for CNF formulas include computing prime implicates PIs, minimal models MMs, minimal unsatisfiable subsets ... 6 July 2013 SAT'13: Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 Parallelization is a natural direction towards the improvements in the scalability of algorithms for the computation of Minimally Unsatisfiable Subformulas (MUSes), and group-MUSes, of CNF formulas. In this paper we propose and analyze a number of approaches to parallel MUS computation. Just as it is the case with the parallel ... 7 March 2013 DATE '13: Proceedings of the Conference on Design, Automation and Test in Europe Publisher: EDA Consortium Bibliometrics: Citation Count: 4 Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 32 Full text available: PDF Automatic abstraction is an important component of modern formal verification flows. A number of effective SAT-based automatic abstraction methods use unsatisfiable cores to guide the construction of abstractions. In this paper we analyze the impact of unsatisfiable core minimization, using state-of-the-art algorithms for the computation of minimally unsatisfiable subformulas (MUSes), ... 8 March 2013 TACAS'13: Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems Publisher: Springer-Verlag Bibliometrics: Citation Count: 6 Efficient algorithms for extracting minimally unsatisfiable subformulas (MUSes) of Boolean formulas find a wide range of applications in the analysis of systems, e.g., hardware and software bounded model checking. In this paper we study the applicability of preprocessing techniques for Boolean satisfiability (SAT) in the context of MUS extraction. Preprocessing ... 9 October 2012 Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming - Volume 7514 Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 A propositional formula in Conjunctive Normal Form CNF may contain redundant clauses -- clauses whose removal from the formula does not affect the set of its models. Identification of redundant clauses is important because redundancy often leads to unnecessary computation, wasted storage, and may obscure the structure of the problem. ... 10 June 2012 SAT'12: Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 2 In this paper we address the following problem: given an unsatisfiable CNF formula ${\mathcal{F}}$, find a minimal subset of variables of ${\mathcal{F}}$ that constitutes the set of variables in some unsatisfiable core of ${\mathcal{F}}$. This problem, known as variable MUS (VMUS) computation problem, captures the need to reduce the number ... 11 April 2012 AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”: Volume 25 Issue 2, April 2012 Publisher: IOS Press Bibliometrics: Citation Count: 22 Minimally Unsatisfiable Subformulas (MUS) find a wide range of practical applications, including product configuration, knowledge-based validation, and hardware and software design and verification. MUSes also find application in recent Maximum Satisfiability algorithms and in CNF formula redundancy removal. Besides direct applications in Propositional Logic, algorithms for MUS extraction have been ... Keywords: Boolean satisfiability, minimally unsatisfiable subformula 12 October 2011 FMCAD '11: Proceedings of the International Conference on Formal Methods in Computer-Aided Design Publisher: FMCAD Inc Bibliometrics: Citation Count: 14 Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Downloads (Overall): 33 Full text available: PDF Minimally Unsatisfiable Subformulas (MUSes) find a wide range of practical applications. A large number of MUS extraction algorithms have been proposed over the last decade, and most of these algorithms are based on iterative calls to a SAT solver. In this paper we introduce a powerful technique for acceleration of ... 13 July 2011 IJCAI'11: Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One Publisher: AAAI Press Bibliometrics: Citation Count: 3 We develop a novel circuit-level stochastic local search (SLS) method D-CRSat for Boolean satisfiability by integrating a structure-based heuristic into the recent CRSat algorithm. D-CRSat significantly improves on CRSat on real-world application benchmarks on which other current CNF and circuit-level SLS methods tend to perform weakly. We also give an ... 14 June 2011 SAT'11: Proceedings of the 14th international conference on Theory and application of satisfiability testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 2 Automated reasoning tasks in many real-world domains involve analysis of redundancies in unsatisfiable instances of SAT. In CNF-based instances, some of the redundancies can be captured by computing a minimally unsatisfiable subset of clauses (MUS). However, the notion of MUS does not apply directly to non-clausal instances of SAT, particularly ... 15 July 2010 SAT'10: Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 4 In this paper we describe a significant improvement to the justificationbased local search algorithm for circuit satisfiability proposed by Järvisalo et al [7]. By carefully combining local search with Boolean Constraint Propagation we achieve multiple orders of magnitude reduction in run-time on industrial and structured benchmark circuits, and, in some ... 16 January 2010 Bibliometrics: Citation Count: 2 The subject of this dissertation belongs to the area known as classical Propositional Satisfiability. The Propositional Satisfiability Problem (SAT) is the problem of determining whether a propositional formula has a model, that is a truth-value assignment to propositional variables under which the formula evaluates to true . In ... 17 June 2009 SAT '09: Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 5 This paper considers two methods for speeding-up stochastic local search SAT procedures. The first method aims at using the search history (represented by additional formulas derived at every state of the search process) to constrain the selection of candidate variables used to navigate through the search space of truth-value assignments. ... 18 May 2008 SAT'08: Proceedings of the 11th international conference on Theory and applications of satisfiability testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 3 In this paper we discuss search heuristics for non-clausal stochastic local search procedures for propositional satisfiability. These heuristics are based on a new method for variable selection as well as a novel clause learning technique for dynamic input formula simplification as well as for guiding the search for a model. 19 March 2008 Journal of Experimental & Theoretical Artificial Intelligence: Volume 20 Issue 1, March 2008 Publisher: Taylor & Francis, Inc. Bibliometrics: Citation Count: 0 A proof search procedure for propositional non-clausal resolution based on a new weighting strategy which utilizes search methods for propositional satisfiability (SAT solvers) and stochastic local search techniques for constructing counter-models is described. Keywords: Non-clausal resolution, Automated reasoning, Propositional satisfiability 20 June 2005 SAT'05: Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing Publisher: Springer-Verlag Bibliometrics: Citation Count: 1 The syntactic framework of the so-called saturated substitutions is defined and used to obtain new characterizations of SAT as well as the classes of minimal and maximal models of formulas of classical propositional logic.