# Bases for Boolean co-clones

@article{Bhler2005BasesFB, title={Bases for Boolean co-clones}, author={Elmar B{\"o}hler and S. Reith and H. Schnoor and H. Vollmer}, journal={Inf. Process. Lett.}, year={2005}, volume={96}, pages={59-66} }

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… CONTINUE READING

51 Citations

The expressibility of functions on the boolean domain, with applications to counting CSPs

- Computer Science, Mathematics
- 2013

- 34
- PDF

The complexity of satisfiability problems: Refining Schaefer's theorem

- Mathematics, Computer Science
- 2009

- 71
- PDF

Structure identification of Boolean relations and plain bases for co-clones

- Mathematics, Computer Science
- 2008

- 47
- PDF

A Complete Classification of the Complexity of Propositional Abduction

- Mathematics, Computer Science
- 2006

- 50
- PDF

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?

- Mathematics, Computer Science
- 2008

- 28
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 10 REFERENCES

Complexity classifications of Boolean constraint satisfaction problems

- Mathematics, Computer Science
- 2001

- 422

The complexity of satisfiability problems: Refining Schaefer's theorem

- Mathematics, Computer Science
- 2009

- 71
- PDF

Playing with Boolean blocks

- 2003

Playing with Boolean blocks , part I : Post ’ s lattice with applications to complexity theory

- 2003

Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory

- 2003