We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
A significant obstacle to the development of intelligent natural language processing systems is the lack of rich knowledge bases containing representations of world knowledge. Fo...
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
This article presents the first participation of the Avignon University Science Laboratory (LIA) to the Cross Language Evaluation Forum (CLEF). LIA participated to the monolingual ...
Laurent Gillard, Laurianne Sitbon, Eric Blaudez, P...
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...