Theories of computability
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Partial Polymorphisms and Constraint Satisfaction Problems
Complexity of Constraints
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic (TOCL)
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Lewis Dichotomies in Many-Valued Logics
Studia Logica
The expressibility of functions on the boolean domain, with applications to counting CSPs
Journal of the ACM (JACM)
Do hard SAT-related reasoning tasks become easier in the Krom fragment?
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.89 |
The complexity of various problems in connection with Boolean constraints, like, for example, quantified Boolean constraint satisfaction, have been studied recently. Depending on what types of constraints may be used, the complexity of such problems varies. A very interesting observation of the recent past has been that the thus derived classification of constraints can be explained with the help of universal algebra. More precisely, the difficulty of such a constraint problem often depends on the co-clone the constraints are from. A co-clone is a set of Boolean relations that is closed under very natural closure operations. Nearly all these co-clones can be generated by said operators out of a finite set of relations, a so-called base. Knowing a, preferably simple, base for each co-clone can therefore be of great value when studying the complexity of Boolean constraint problems, since this knowledge reduces the infinitely many cases of equivalent problems to a single one-the constraint satisfaction problem for this base. In this paper we give a finite and simple base for every Boolean co-clone, where this is possible. We give evidence that the presented bases are as easy as possible.