The study of clause redundancy in Boolean satisfiability (SAT) has proven significant in
various terms, from fundamental insights into preprocessing and inprocessing to the …

This document presents a lightweight approach–combining Coq and OCaml typecheckers–
in order to formally verify higher-order imperative programs for partial correctness. In this …

The propositional model counting problem# SAT asks to compute the number of satisfying
assignments for a given propositional formula. Recently, three# SAT proof systems kcps …

Many problems for formal verification and artificial intelligence rely on advanced reasoning
technologies in the background, often in the form of SAT or QBF solvers. Such solvers are …

We study the complexity of proof systems augmenting resolution with inference rules that
allow, given a formula $\Gamma $ in conjunctive normal form, deriving clauses that are not …

It has been proven that extended resolution (ER) has more powerful reasoning than general
resolution for the pigeonhole principle in Cook's paper. This fact indicates the possibility that …

Computer programs, so-called solvers, for solving the well-known Boolean satisfiability
problem (Sat) have been improving for decades. Among the reasons, why these solvers are …

We study the complexity of proof systems augmenting resolution with inference rules that
allow, given a formula Γ in conjunctive normal form, deriving clauses that are not necessarily …

The study of clause redundancy in Boolean satisfiability (SAT) has proven significant in
various terms, from fundamental insights into preprocessing and inprocessing to the …

One of the main advancements in SAT solving over the last decade was the development of
a family of proof systems collectively called interference-based proof systems, including but …