C. Andrews and . Macé, Beyond the tree of texts: Graph methods for stemmatic analysis, preparation, 2012.

C. Baret, P. Macé, C. Robinson, R. Peersman, J. Mazza et al., Testing methods on an artificially created textual tradition, The evolution of texts: Confronting stemmatological and genetical methods, pp.255-283, 2006.

B. Bogaerts, . Broes-de-cat, M. Stef-de-pooter, and . Denecker, The idp framework reference manual

C. De and L. Higuera, A bibliographical study of grammatical inference, Pattern Recognition, vol.38, issue.9, pp.1332-1348, 2005.
URL : https://hal.archives-ouvertes.fr/ujm-00376590

D. Pooter, J. Wittocx, and M. Denecker, A Prototype of a Knowledge-Based Programming Environment, International Conference on Applications of Declarative Programming and Knowledge Management, 2011.
DOI : 10.1007/978-3-642-41524-1_16

M. Denecker and E. Ternovska, A logic of nonmonotone inductive definitions, ACM Transactions on Computational Logic, vol.9, issue.2, 2008.
DOI : 10.1145/1342991.1342998

P. Gambette, Who is who in phylogenetic networks: Articles, authors and programs. Published electronically at http://www.atgc-montpellier, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01376483

M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub, clasp: A Conflict-Driven Answer Set Solver, LNCS, vol.4483, pp.260-265, 2007.
DOI : 10.1007/978-3-540-72200-7_23

M. Gold, Complexity of automaton identification from given data, Information and Control, vol.37, issue.3, pp.302-320, 1978.
DOI : 10.1016/S0019-9958(78)90562-4

M. Heule and S. Verwer, Exact DFA Identification Using SAT Solvers, Grammatical Inference: Theoretical Results and Applications, ICGI 2010, pp.66-79, 2010.
DOI : 10.1007/978-3-642-15488-1_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

H. Daniel, R. Huson, C. Rupp, and . Scornavacca, Phylogenetic Networks: Concepts, Algorithms and Applications, 2010.

R. Ierusalimschy, L. Henrique-de-figueiredo, and W. Celes, Lua ? an extensible extension language. Software: Practice and Experience, pp.635-652, 1996.
DOI : 10.1002/(sici)1097-024x(199606)26:6<635::aid-spe26>3.0.co;2-p

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Labarre and S. Verwer, Merging partially labelled trees: hardness and an efficient practical solution, preparation, 2012.

G. Leone, W. Pfeifer, T. Faber, G. Eiter, S. Gottlob et al., The DLV system for knowledge representation and reasoning, ACM Transactions on Computational Logic, vol.7, issue.3, pp.499-562, 2002.
DOI : 10.1145/1149114.1149117

K. Marriott, N. Nethercote, R. Rafeh, P. J. Stuckey, M. Garcia-de-la-banda et al., The Design of the Zinc Modelling Language, Constraints, vol.84, issue.1, pp.229-267, 2008.
DOI : 10.1007/s10601-008-9041-4

G. David, E. Mitchell, and . Ternovska, A framework for representing and solving NP search problems, AAAI, pp.430-435, 2005.

R. and T. Heikkilä, Evaluating methods for computer-assisted stemmatology using artificial benchmark data sets. Literary and Linguistic Computing 19 The StaMinA competition, Learning regular languages with large alphabets, pp.417-433, 2009.