Abstract. The formulation of a Propositional Satisfiability (SAT) problem instance is vital to efficient solving. This has motivated research on preprocessing, and inprocessing techniques where reformulation of a SAT instance is interleaved with solving. Preprocessing and inprocessing are highly effective in extending the reach of SAT solvers, however they necessarily operate on the lowest leve...

The objective of this paper is to offer an improvement to the translation from ECTL to SAT introduced in [7] and show that the improvement proposed substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. keywords: ECTL, Bounded Model Checking, translation to SAT

The time complexity of problems and algorithms, i.e., the scaling of the time required for solving a problem instance as a function of instance size, is of key interest in theoretical computer science and practical applications. In this context, propositional satisfiability (SAT) is one of the most intensely studied problems, and it is generally believed that solving SAT requires exponential ti...

The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the problem is backtracking search. In this paper, we show how to improve such a search procedure by lemma learning. For efficiency reasons, we represent the lemmas by propositional formulas and use a SAT solver to perform the nec...

We introduce h-modularity, a structural parameter of CNF formulas, and present algorithms that render the decision problem SAT and the model counting problem #SAT fixed-parameter tractable when parameterized by h-modularity. The new parameter is defined in terms of a partition of clauses of the given CNF formula into strongly interconnected communities which are sparsely interconnected with eac...

SAT solvers are nowadays the standard solving engines for the search problems in automated termination analysis. Consequently, the performance of current termination tools heavily relies on the speed of modern SAT solvers on the corresponding SAT encodings. If a model for the SAT instance at hand is found, it can be used to instantiate the parameters for the current proof step to advance the te...