On generating all maximal independent sets, Inf. Process. Lett, vol.27, issue.3, pp.119-123, 1988. ,
Enumeration complexity and matroid decomposition, vol.7, 2010. ,
Candidate keys for relations, J. Comput. Syst. Sci, vol.17, issue.2, pp.270-279, 1978. ,
The complexity of mining maximal frequent subgraphs, ACM Trans. Database Syst, vol.39, issue.4, 2014. ,
Parameterized complexity of weighted satisfiability problems: Decision, enumeration, counting, Fundam. Inform, vol.136, issue.4, pp.297-316, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01192908
Efficiently enumerating minimal triangulations, Proc. PODS 2017, pp.273-287, 2017. ,
On acyclic conjunctive queries and constant delay enumeration, Computer Science Logic, pp.208-222, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00195010
Enumerating answers to first-order queries over databases of low degree, Proc. PODS, pp.121-131, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01070898
The satanic notations: counting classes beyond #P and other definitional adventures, SIGACT News, vol.26, issue.1, pp.2-13, 1995. ,
PP is as hard as the polynomial-time hierarchy, SIAM J. Comput, vol.20, issue.5, pp.865-877, 1991. ,
On the complexity of hard enumeration problems, Proc. LATA, pp.183-195, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01786350
The strong exponential hierarchy collapses, Proc. STOC 1987, pp.110-122, 1987. ,
On enumerating monomials and other combinatorial structures by polynomial interpolation, Theory Comput. Syst, vol.53, issue.4, pp.532-568, 2013. ,
, Computational Complexity: A Modern Approach, 2009.
Enumeration: Algorithms and complexity, Master's thesis, 2009. ,
First-order queries on structures of bounded degree are computable with constant delay, ACM Trans. Comput. Log, vol.8, issue.4 ,
URL : https://hal.archives-ouvertes.fr/hal-00195016
De la pertinence de l'énumération : complexité en logiques propositionnelle et du premier ordre. (the relevance of the list: propositional logic and complexity of the first order), 2013. ,
Enumération des dominants minimaux d'un graphe, 2013. ,
On the enumeration of minimal dominating sets and related notions, SIAM J. Discrete Math, vol.28, issue.4, pp.1916-1929, 2014. ,
On generating all solutions of generalized satisfiability problems, Informatique théorique et applications, vol.31, issue.6, pp.499-511, 1997. ,
The complexity of satisfiability problems, Proc. STOC 1978, pp.216-226, 1978. ,
The complexity of logic-based abduction, J. ACM, vol.42, issue.1, pp.3-42, 1995. ,
Subtractive reductions and complete problems for counting complexity classes, Theor. Comput. Sci, vol.340, issue.3, pp.496-513, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00099381
A theory of diagnosis from first principles, Artificial Intelligence, vol.32, issue.1, pp.57-95, 1987. ,
Efficient model based diagnosis with maximum satisfiability, Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, pp.1966-1972, 2015. ,
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
Consistent query answers in inconsistent databases, Proc. PODS 1999, pp.68-79, 1999. ,
, Foundations of Databases, 1995.
Counting and enumerating (preferred) database repairs, Proc. PODS 2017, ACM, pp.289-301, 2017. ,
Complexity of repair checking and consistent query answering, Proc. ICDT, vol.21, pp.1-21, 2016. ,
On the complexity of enumerating the answers to well-designed pattern trees, Proc. ICDT 2016, vol.48, p.18, 2016. ,