Improving exact exponential-time algorithms for NP-complete problems is an expanding
research area. Unfortunately, general methods for comparing the complexity of such …

Two well-studied closure operators for relations are based on existentially quantified
conjunctive formulas, primitive positive (pp) definitions, and primitive positive formulas …

Constraint satisfaction problems (CSPs) are combinatorial problems with strong ties to
universal algebra and clone theory. The recently proved CSP dichotomy theorem states that …

We continue the investigation of polynomial-time sparsification for NP-complete Boolean
Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number …

The inverse satisfiability problem over a set of relations Γ (Inv-SAT (Γ)) is the problem of
deciding whether a relation R can be defined as the set of models of a SAT (Γ) instance …

We investigate the complexity of an optimization problem in Boolean propositional logic
related to information theory: Given a conjunctive formula over a set of relations, find a …

For several types of maximal clones on finite sets, we construct singleton weak bases
consisting of an irredundant relation without fictitious coordinates such that every variable …

We improve an existence condition for weak bases of relational clones on finite sets.
Moreover, we provide a set of singleton weak bases of Boolean relational clones different …

We study the minimum Hamming distance between distinct satisfying assignments of a
conjunctive input formula over a given set of Boolean relations (MinSolutionDistance, MSD) …

Many AI-related reasoning problems are based on the problem of satisfiability of
propositional formulas with some cardinality-minimality condition. While the complexity of …