M. Ben-ari, Mathematical Logic for Computer Science, 2003.

V. G. Bodnarchuk, L. A. Kalu?nin, V. N. Kotov, and B. A. Romov, Galois theory for Post algebras, I, II. Cybernetics, vol.5, pp.531-539, 1969.

E. Böhler, N. Creignou, S. Reith, and H. Vollmer, Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory, vol.34, pp.38-52, 2003.

E. Böhler, S. Reith, H. Schnoor, and H. Vollmer, Bases for Boolean co-clones, Information Processing Letters, vol.96, pp.59-66, 2005.

N. Creignou and H. Vollmer, Boolean constraint satisfaction problems: When does Post's lattice help?, Complexity of Constraints, vol.5250, pp.3-37, 2008.

N. Creignou and B. Zanuttini, A complete classification of the complexity of propositional abduction, SIAM J. Comput, vol.36, issue.1, pp.207-229, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00197028

M. , Investigations into theory of knowledge base revision, Proc. AAAI, pp.475-479, 1988.

T. Eiter and G. Gottlob, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Artif. Intell, vol.57, issue.2-3, pp.227-270, 1992.

T. Eiter and G. Gottlob, The complexity of logic-based abduction, J. ACM, vol.42, issue.1, pp.3-42, 1995.

T. Eiter and G. Gottlob, The complexity class ? p 2 : Recent results and applications in AI and modal logic, Proc. FCT, volume 1279 of LNCS, pp.1-18

. Springer, , 1997.

W. I. Gasarch, M. W. Krentel, and K. J. Rappoport, OptP as the normal behavior of NP-complete problems, Mathematical Systems Theory, vol.28, issue.6, pp.487-514, 1995.

D. Geiger, Closed systems of functions and predicates, Pac. J. Math, vol.27, issue.1, pp.95-100, 1968.

M. Hermann and R. Pichler, Counting complexity of propositional abduction, J. Comput. Syst. Sci, vol.76, issue.7, pp.634-649, 2010.

P. G. Jeavons, On the algebraic structure of combinatorial problems, Theor. Comput. Sci, vol.200, pp.185-204, 1998.

M. W. Krentel, The complexity of optimization problems, J. Comput. Syst. Sci, vol.36, issue.3, pp.490-509, 1988.

M. W. Krentel, Generalizations of OptP to the polynomial hierarchy, Theor. Comput. Sci, vol.97, issue.2, pp.183-198, 1992.

P. Liberatore and M. Schaerf, Belief revision and update: Complexity of model checking, J. Comput. Syst. Sci, vol.62, issue.1, pp.43-72, 2001.

G. Nordh and B. Zanuttini, What makes propositional abduction tractable, Artif. Intell, vol.172, issue.10, pp.1245-1284, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00995230

G. Nordh and B. Zanuttini, Frozen boolean partial co-clones, Proc. ISMVL, pp.120-125, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00944410

C. H. Papadimitriou, Computational Complexity, 1994.

E. L. Post, The two-valued iterative systems of mathematical logic, Annals of Mathematical Studies, vol.5, pp.1-122, 1941.

K. Satoh, Nonmonotonic reasoning by minimal belief revision, Proc. FGCS, pp.455-462, 1988.

T. J. Schaefer, The complexity of satisfiability problems, Proc. STOC, pp.216-226, 1978.

H. Schnoor and I. Schnoor, Partial polymorphisms and constraint satisfaction problems, Complexity of Constraints, vol.5250, pp.229-254, 2008.

G. Tseytin, On the complexity of derivation in propositional calculus, Studies in Constructive Mathematics and Mathematical Logic, Part II, pp.115-125, 1970.

K. Wagner, On restricting the access to an NP-oracle, Proc. ICALP, vol.317, pp.682-696, 1988.