1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2022★ 1 cited
Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits
Alexander Semenov, Konstantin Chukharev, Egor Tarasov +2
In this paper we investigate how to estimate the hardness of Boolean satisfiability (SAT) encodings for the Logical Equivalence Checking problem (LEC). Meaningful estimates of hard…
cs.FL2019
fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver
Konstantin Chukharev, Daniil Chivilikhin
Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence,…