D. Alrajeh, J. Kramer, A. Van-lamsweerde, A. Russo, and S. Uchitel, Generating obstacle conditions for requirements completeness, 2012 34th International Conference on Software Engineering (ICSE), pp.705-715, 2012.
DOI : 10.1109/ICSE.2012.6227147

D. Alrajeh, J. Kramer, A. Russo, and S. Uchitel, Elaborating Requirements Using Model Checking and Inductive Learning, IEEE Transactions on Software Engineering, vol.39, issue.3, pp.361-383, 2013.
DOI : 10.1109/TSE.2012.41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.2109

K. R. Apt, H. A. Blair, and A. Walker, Foundations of deductive databases and logic programming, pp.89-148, 1988.

H. Blockeel and L. D. Raedt, Top-down induction of first-order logical decision trees, Artificial Intelligence, vol.101, issue.1-2, pp.285-297, 1998.
DOI : 10.1016/S0004-3702(98)00034-4

S. Bragaglia and O. Ray, Nonmonotonic Learning in Large Biological Networks, 24th International Conference on Inductive Logic Programming, 2014.
DOI : 10.1007/978-3-319-23708-4_3

D. Chan, Constructive negation based on the completed database, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pp.111-125, 1988.

H. Christiansen, Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules, Journal of Applied Logic, vol.7, issue.3, pp.341-362, 2009.
DOI : 10.1016/j.jal.2008.10.004
URL : http://doi.org/10.1016/j.jal.2008.10.004

D. Corapi, Nonmonotonic inductive logic programming as abductive search, 2011.

D. Corapi, A. Russo, and E. Lupu, Inductive logic programming as abductive search

D. Corapi, A. Russo, and E. Lupu, Inductive Logic Programming in Answer Set Programming, ILP 2011, pp.91-97, 2012.
DOI : 10.1007/978-3-642-31951-8_12

R. Darimont and A. Van-lamsweerde, Formal refinement patterns for goal-driven requirements elaboration, pp.179-190, 1996.
DOI : 10.1145/239098.239131
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.412

T. Eiter, W. Faber, N. Leone, G. J. Pfeifer, I. Famili et al., Computing preferred answer sets by meta-interpretation in answer set programming Genome-scale reconstruction of the saccharomyces cerevisiae metabolic network, Gen. Res, vol.3, issue.132, pp.463-498, 2003.

M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub, clasp: A Conflict-Driven Answer Set Solver, Logic Programming and Nonmonotonic Reasoning, pp.260-265, 2007.
DOI : 10.1007/978-3-540-72200-7_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.3156

M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing, vol.38, issue.No. 3, pp.365-386, 1991.
DOI : 10.1007/BF03037169

B. D. Heavner, Yeast 5 ??? an expanded reconstruction of the Saccharomyces cerevisiae metabolic network, BMC Systems Biology, vol.6, issue.1, p.55, 2012.
DOI : 10.1038/sj.jim.2900584

A. Kakas, R. Kowalski, and F. Toni, Abductive Logic Programming, Journal of Logic and Computation, vol.2, issue.6, pp.719-770, 1992.
DOI : 10.1093/logcom/2.6.719

R. D. King, J. Rowland, S. G. Oliver, M. Young, W. Aubrey et al., The Automation of Science, Science, vol.324, issue.5923, pp.85-89, 2009.
DOI : 10.1126/science.1165620

R. D. King, K. E. Whelan, F. M. Jones, P. G. Reiser, C. H. Bryant et al., Functional genomic hypothesis generation and experimentation by a robot scientist, Nature, vol.427, issue.6971, pp.247-252, 2004.
DOI : 10.1038/nature02236

A. Lehninger, Biochemistry: The Molecular Basis of Cell Structure and Function, 1979.

S. Muggleton, Inverse entailment and progol, New Generation Computing, vol.12, issue.1, pp.245-286, 1995.
DOI : 10.1007/BF03037227
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.1630

S. H. Muggleton and C. H. Bryant, Theory Completion Using Inverse Entailment, ILP 2000, pp.130-146, 2000.
DOI : 10.1007/3-540-44960-4_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5787

S. Muggleton and L. De-raedt, Inductive Logic Programming: Theory and methods, The Journal of Logic Programming, vol.19, issue.20, pp.629-679, 1994.
DOI : 10.1016/0743-1066(94)90035-3
URL : http://doi.org/10.1016/0743-1066(94)90035-3

H. Ogata, S. Goto, K. Sato, W. Fujibuchi, H. Bono et al., KEGG: Kyoto Encyclopedia of Genes and Genomes, Nucleic Acids Research, vol.27, issue.1, pp.29-34, 1999.
DOI : 10.1093/nar/27.1.29

O. Ray, Hybrid Abductive-Inductive Learning, 2005.
DOI : 10.1016/j.jal.2008.10.007
URL : http://doi.org/10.1016/j.jal.2008.10.007

O. Ray, K. Whelan, and R. King, A Nonmonotonic Logical Approach for Modelling and Revising Metabolic Networks, 2009 International Conference on Complex, Intelligent and Software Intensive Systems, pp.825-829, 2009.
DOI : 10.1109/CISIS.2009.175

O. Ray, Nonmonotonic abductive inductive learning, Journal of Applied Logic, vol.7, issue.3, pp.329-340, 2009.
DOI : 10.1016/j.jal.2008.10.007
URL : http://doi.org/10.1016/j.jal.2008.10.007

O. Ray, K. Whelan, and R. King, Automatic Revision of Metabolic Networks through Logical Analysis of Experimental Data, ILP 2009, pp.194-201, 2010.
DOI : 10.1007/978-3-642-13840-9_18

P. Simons, I. Niemelä, and T. Soininen, Extending and implementing the stable model semantics, Artificial Intelligence, vol.138, issue.1-2, pp.181-234, 2002.
DOI : 10.1016/S0004-3702(02)00187-X
URL : http://doi.org/10.1016/s0004-3702(02)00187-x

A. Tamaddoni-nezhad, A. C. Kakas, S. H. Muggleton, and F. Pazos, Modelling Inhibition in Metabolic Pathways Through Abduction and Induction, ILP 2004, pp.305-322
DOI : 10.1007/978-3-540-30109-7_23

H. Springer, A. V. Assche, C. Vens, H. Blockeel, and S. Dzeroski, jan.ramon@cs.kuleuven.be References 1 First order random forests: learning relational classifiers with complex aggregates, Mach. Learn, vol.64, pp.1-3, 2004.

H. Blockeel and L. D. Raedt, Top-down induction of first-order logical decision trees, Artificial Intelligence, vol.101, issue.1-2, pp.285-297, 1998.
DOI : 10.1016/S0004-3702(98)00034-4

L. Getoor, Multi-relational data mining using probabilistic relational models: research summary, Proceedings of the First Workshop in Multi-relational Data Mining, 2001.

M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann et al., The WEKA data mining software, ACM SIGKDD Explorations Newsletter, vol.11, issue.1, pp.10-18, 2009.
DOI : 10.1145/1656274.1656278

E. Jelali, S. Braud, A. Lachiche, and N. , Propositionalisation of Continuous Attributes beyond Simple Aggregation, ILP 2012, pp.32-44, 2013.
DOI : 10.1007/978-3-642-38812-5_3

S. Joshi, G. Ramakrishnan, and A. Srinivasan, Feature construction using theoryguided sampling and randomised search
DOI : 10.1007/978-3-540-85928-4_14

M. A. Krogel and S. Wrobel, Facets of aggregation approaches to propositionalization, Progress Track at the Thirteenth International Conference on Inductive Logic Programming, 2003.

A. Ruas, J. Perret, F. Curie, A. Mas, A. Puissant et al., Conception of a GIS-platform to simulate urban densification basedon the analysis of topographic data, Advances in Cartography and GIScience. LNGC, pp.413-430, 0228.

C. Vens, J. Ramon, H. Blockeel, J. Fürnkranz, T. Scheffer et al., Refining aggregate conditions in relational learning Scalable acceleration of inductive logic programs, PKDD 2006 IEEE international conference on field-programmable technology, pp.383-394, 2002.

H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon et al., Improving the efficiency of inductive logic programming through the use of query packs, J. Artif. Intell. Res, vol.16, issue.1, pp.135-166, 2002.

A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM, vol.36, issue.4, pp.929-965, 1989.
DOI : 10.1145/76359.76371

A. Carlson, J. Betteridge, B. Kisiel, B. Settles, H. Jr et al., Toward an architecture for never-ending language learning, Proceedings of the Twenty-Fourth Conference on Artificial Intelligence, 2010.

W. Cohen, Grammatically biased learning: Learning logic programs using an explicit antecedent description language, Artificial Intelligence, vol.68, issue.2, pp.303-366, 1994.
DOI : 10.1016/0004-3702(94)90070-1

L. De-raedt, N. H. Bshouty, G. Stoltz, N. Vayatis, T. M. Zeugmann et al., Declarative modeling for machine learning and data mining Web server workload characterization: the search for invariants, ALT 2012, pp.126-137, 1996.

Z. Chi, Statistical properties of probabilistic context-free grammars, Comput. Linguist, vol.25, issue.1, pp.131-160, 1999.

L. De-raedt, A. Kimmig, and H. Toivonen, Problog: a probabilistic prolog and its application in link discovery, IJCAI, vol.7, pp.2462-2467, 2007.

B. A. Goodman and D. J. Litman, On the interaction between plan recognition and intelligent interfaces, User Modelling and User-Adapted Interaction, vol.14, issue.4, pp.1-2, 1992.
DOI : 10.1007/BF01101860

E. Horvitz, J. Breese, D. Heckerman, D. Hovel, and K. Rommelse, The lumiere project: Bayesian user modeling for inferring the goals and needs of software users, Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pp.256-265, 1998.

L. Huang, Advanced dynamic programming in semiring and hypergraph frameworks, In: COLING, 2008.

F. Jelinek and J. D. Lafferty, Computation of the probability of initial substring generation by stochastic context-free grammars, Comput. Linguist, vol.17, issue.3, pp.315-323, 1991.

N. Lesh, C. Rich, and C. L. Sidner, Using Plan Recognition in Human-Computer Collaboration, UM99 User Modeling. CISM International Centre for Mechanical Sciences -Courses and Lectures, pp.23-32, 1999.
DOI : 10.1007/978-3-7091-2490-1_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9528

M. J. Nederhof and G. Satta, Computation of infix probabilities for probabilistic context-free grammars, Proceedings of the Conference on Empirical Methods in Natural Language Processing, pp.1213-1221, 2011.

T. Sato, A statistical learning method for logic programs with distribution semantics, Proceedings of Internationall Conference on Logic Programming, p.1995, 1995.

T. Sato and Y. Kameya, Parameter learning of logic programs for symbolic-statistical modeling, J. Artif. Intell. Res, vol.15, pp.391-454, 2001.

T. Sato and Y. Kameya, New Advances in Logic-Based Probabilistic Modeling by PRISM, Probabilistic Inductive Logic Programming, pp.118-155
DOI : 10.1007/978-3-540-78652-8_5

T. Sato and P. Meyer, Abstract, Theory and Practice of Logic Programming, vol.15, issue.06, pp.1-29, 2013.
DOI : 10.1145/131295.131299
URL : https://hal.archives-ouvertes.fr/hal-00258389

A. Stolcke, An efficient probabilistic context-free parsing algorithm that computes prefix probabilities, Comput. Linguist, vol.21, issue.2, pp.165-201, 1995.

C. S. Wetherell, H. A. Blair, and A. Walker, Probabilistic Languages: A Review and Some Open Questions, Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming, pp.361-379, 1980.
DOI : 10.1145/356827.356829

A. Garcez and G. Zaverucha, The connectionist inductive learning and logic programming system, Applied Intelligence, vol.11, issue.1, pp.59-77, 1999.
DOI : 10.1023/A:1008328630915

E. Dubrova and M. Teslenko, A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, issue.5, pp.1393-1399, 2011.
DOI : 10.1109/TCBB.2010.20

A. Garcez, A. S. Broda, K. Gabbay, and D. , Symbolic knowledge extraction from trained neural networks: A sound approach, Artificial Intelligence, vol.125, issue.1-2, pp.155-207, 2001.
DOI : 10.1016/S0004-3702(00)00077-1

M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub, Answer Set Solving in Practice, Synthesis Lectures on Artificial Intelligence and Machine Learning, vol.6, issue.3, 2012.
DOI : 10.2200/S00457ED1V01Y201211AIM019

K. Inoue, Logic programming for boolean networks, Proceedings of the Twenty- Second International Joint Conference on Artificial Intelligence-Volume, pp.924-930, 2011.

K. Inoue, DNF Hypotheses in Explanatory Induction, ILP 2011, pp.173-188, 2012.
DOI : 10.1007/978-3-642-31951-8_18

K. Inoue, T. Ribeiro, and C. Sakama, Learning from interpretation transition, Machine Learning, vol.23, issue.4, pp.51-79, 2014.
DOI : 10.1007/s10994-013-5353-8

K. Inoue and C. Sakama, Oscillating Behavior of Logic Programs, Correct Reasoning, pp.345-362, 2012.
DOI : 10.1016/0743-1066(94)00023-Y

A. Kean and G. Tsiknis, An incremental method for generating prime implicants/implicates, Journal of Symbolic Computation, vol.9, issue.2, pp.185-206, 1990.
DOI : 10.1016/S0747-7171(08)80029-6
URL : http://doi.org/10.1016/s0747-7171(08)80029-6

R. S. Michalski, A theory and methodology of inductive learning, Artificial Intelligence, vol.20, issue.2, pp.111-161, 1983.
DOI : 10.1016/0004-3702(83)90016-4

T. M. Mitchell, Generalization as search, Artificial Intelligence, vol.18, issue.2, pp.203-226, 1982.
DOI : 10.1016/0004-3702(82)90040-6

S. Muggleton and L. De-raedt, Inductive Logic Programming: Theory and methods, The Journal of Logic Programming, vol.19, issue.20, pp.629-679, 1994.
DOI : 10.1016/0743-1066(94)90035-3
URL : http://doi.org/10.1016/0743-1066(94)90035-3

S. Muggleton, L. De-raedt, D. Poole, I. Bratko, P. Flach et al., ILP turns 20, Machine Learning, vol.14, issue.1???3, pp.3-23, 2012.
DOI : 10.1007/s10994-011-5259-2
URL : http://dx.doi.org/10.1007/s10994-011-5259-2

G. D. Plotkin, A note on inductive generalization, Mach. Intel, vol.5, issue.1, pp.153-163, 1970.

T. Ribeiro, K. Inoue, and C. Sakama, A BDD-Based Algorithm for Learning from Interpretation Transition, ILP 2013, pp.47-63, 2014.
DOI : 10.1007/978-3-662-44923-3_4

P. Tison, Generalization of Consensus Theory and Application to the Minimization of Boolean Functions, IEEE Transactions on Electronic Computers, vol.16, issue.4, pp.446-456, 1967.
DOI : 10.1109/PGEC.1967.264648

M. H. Van-emden, R. A. Kowalski, and B. Taskar, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM, vol.23, issue.4, pp.733-742, 1976.
DOI : 10.1145/321978.321991

S. Riedel, H. W. Chun, T. Takagi, and J. Tsujii, A Markov logic approach to biomolecular event extraction, Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing: Shared Task, pp.41-49, 2009.
DOI : 10.3115/1572340.1572347
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.3311

H. Poon and L. Vanderwende, Joint inference for knowledge extraction from biomedical literature, pp.813-821, 2010.

K. Yoshikawa, S. Riedel, M. Asahara, and Y. Matsumoto, Jointly identifying temporal relations with Markov Logic, Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1, ACL-IJCNLP '09, pp.405-413, 2009.
DOI : 10.3115/1687878.1687936
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.8919

H. Poon and P. Domingos, Unsupervised semantic parsing, Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 1, EMNLP '09, pp.1-10, 2009.
DOI : 10.3115/1699510.1699512
URL : http://ai.cs.washington.edu/www/media/papers/poon09.pdf

J. Davis, E. S. Burnside, I. De-castro-dutra, D. Page, R. Ramakrishnan et al., View learning for statistical relational learning: with an application to mammography, IJCAI, DTIC Document, pp.677-683, 2005.

J. Davis, I. M. Ong, J. Struyf, E. S. Burnside, D. Page et al., Change of representation for statistical relational learning, pp.2719-2726, 2007.

J. Davis, E. Burnside, I. De-castro-dutra, D. L. Page, S. Costa et al., An Integrated Approach to Learning Bayesian Networks of Rules, ECML 2005, pp.84-95, 2005.
DOI : 10.1007/11564096_13

S. Natarajan, T. Khot, K. Kersting, B. Gutmann, and J. Shavlik, Gradient-based boosting for statistical relational learning: The relational dependency network case, Machine Learning, vol.64, issue.1, pp.25-56, 2012.
DOI : 10.1007/s10994-011-5244-9

J. Weiss, S. Natarajan, P. Peissig, C. Mccarty, and D. Page, Statistical relational learning to predict primary myocardial infarction from electronic health records, 2012.

S. Natarajan, K. Kersting, E. Ip, D. Jacobs, and J. Carr, Early prediction of coronary artery calcification levels using machine learning, 2013.

S. Natarajan, B. Saha, S. Joshi, A. Edwards, T. Khot et al., Relational learning helps in three-way classification of Alzheimer patients from structural magnetic resonance images of the brain, International Journal of Machine Learning and Cybernetics, vol.3, issue.4, pp.659-669, 2013.
DOI : 10.1007/s13042-013-0161-9

L. Antanas, M. Van-otterlo, O. Mogrovejo, J. Antonio, T. Tuytelaars et al., A relational distance-based framework for hierarchical image understanding, Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods, pp.206-218, 2012.

L. Antanas, M. Hoffmann, P. Frasconi, T. Tuytelaars, and L. De-raedt, A relational kernel-based approach to scene classification, 2013 IEEE Workshop on Applications of Computer Vision (WACV), pp.133-139, 2013.
DOI : 10.1109/WACV.2013.6475010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.4200

S. Riedel, D. Mcclosky, M. Surdeanu, A. Mccallum, and C. D. Manning, Model combination for event extraction in bionlp, Proceedings of the BioNLP Shared Task 2011 Workshop, pp.51-55, 2011.

T. G. Dietterich, Machine Learning for Sequential Data: A Review, SPR 2002 and SSPR 2002, pp.15-30, 2002.
DOI : 10.1007/3-540-70659-3_2

A. Graves, M. Liwicki, H. Bunke, J. Schmidhuber, and S. Fernández, Unconstrained on-line handwriting recognition with recurrent neural networks, Advances in Neural Information Processing Systems, pp.577-584, 2007.

M. Liwicki and H. Bunke, HMM-based on-line recognition of handwritten whiteboard notes, Tenth International Workshop on Frontiers in Handwriting Recognition, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00108307

A. Shivram, B. Zhu, S. Setlur, M. Nakagawa, and V. Govindaraju, Segmentation Based Online Word Recognition: A Conditional Random Field Driven Beam Search Strategy, 2013 12th International Conference on Document Analysis and Recognition, pp.852-856, 2013.
DOI : 10.1109/ICDAR.2013.174

S. A. Guberman, I. Lossev, and A. V. Pashintsev, Method and apparatus for recognizing cursive writing from sequential input information, p.527, 1994.

X. Li and D. Y. Yeung, On-line handwritten alphanumeric character recognition using dominant points in strokes, Pattern Recogn, vol.30, issue.1, pp.31-44, 1997.

R. Plamondon and F. J. Maarse, An evaluation of motor models of handwriting, IEEE Transactions on Systems, Man, and Cybernetics, vol.19, issue.5, pp.1060-1072, 1989.
DOI : 10.1109/21.44021

M. Parizeau and R. Plamondon, A fuzzy-syntactic approach to allograph modeling for cursive script recognition, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.17, issue.7, pp.702-712, 1995.
DOI : 10.1109/34.391412

A. Malaviya and L. Peters, Fuzzy handwriting description language:, Pattern Recognition, vol.33, issue.1, pp.119-131, 2000.
DOI : 10.1016/S0031-3203(99)00034-5

D. Ziino, A. Amin, and C. Sammut, Recognition of hand printed Latin characters using machine learning, Proceedings of 3rd International Conference on Document Analysis and Recognition, pp.1098-1102, 1995.
DOI : 10.1109/ICDAR.1995.602102

A. Amin, C. Sammut, and K. Sum, LEARNING TO RECOGNIZE HAND-PRINTED CHINESE CHARACTERS USING INDUCTIVE LOGIC PROGRAMMING, International Journal of Pattern Recognition and Artificial Intelligence, vol.10, issue.07, pp.829-847, 1996.
DOI : 10.1142/S0218001496000487

S. Manke, M. Finke, and A. Waibel, NPen/sup ++/: a writer independent, large vocabulary on-line cursive handwriting recognition system, Proceedings of 3rd International Conference on Document Analysis and Recognition, pp.403-408, 1995.
DOI : 10.1109/ICDAR.1995.599023

J. Neville and D. Jensen, Relational dependency networks Introduction to Statistical Relational Learning, 2007.

P. Domingos and D. Lowd, Markov Logic: An Interface Layer for Artificial Intelligence, Synthesis Lectures on Artificial Intelligence and Machine Learning, vol.3, issue.1, pp.1-155, 2009.
DOI : 10.2200/S00206ED1V01Y200907AIM007

K. Kersting and L. De-raedt, Bayesian logic programming: theory and tool, Statistical Relational Learning, p.291, 2007.

N. Friedman, L. Getoor, D. Koller, and A. Pfeffer, Learning probabilistic relational models, In: IJCAI, vol.99, pp.1300-1309, 1999.

P. Singla and P. Domingos, Discriminative training of Markov logic networks, In: AAAI, vol.5, pp.868-873, 2005.

D. Lowd and P. Domingos, Recursive random fields, IJCAI, pp.950-955, 2007.

J. H. Friedman, machine., The Annals of Statistics, vol.29, issue.5, pp.1189-1232, 2001.
DOI : 10.1214/aos/1013203451

S. D. Connell, Online handwriting recognition using multiple pattern class models, 2000.

A. Malaviya and L. Peters, Fuzzy feature description of handwriting patterns, Pattern Recognition, vol.30, issue.10, pp.1591-1604, 1997.
DOI : 10.1016/S0031-3203(97)00003-4

M. Galar, A. Fernández, E. Barrenechea, H. Bustince, and F. Herrera, An overview of ensemble methods for binary classifiers in multi-class problems: Experimental study on one-vs-one and one-vs-all schemes, Pattern Recognition, vol.44, issue.8, pp.44-1761, 2011.
DOI : 10.1016/j.patcog.2011.01.017

A. Shivram, C. Ramaiah, S. Setlur, and V. Govindaraju, IBM UB 1: a dual mode unconstrained English handwriting dataset, Proceedings of the Twelfth International Conference on Document Analysis and Recognition 2013, pp.13-17, 2013.

I. Guyon, L. Schomaker, R. Plamondon, M. Liberman, and S. Janet, UNIPEN project of on-line data exchange and recognizer benchmarks, Proceedings of the 12th IAPR International Conference on Pattern Recognition (Cat. No.94CH3440-5), pp.29-33, 1994.
DOI : 10.1109/ICPR.1994.576870

C. L. Liu, H. Sako, and H. Fujisawa, Performance evaluation of pattern classifiers for handwritten character recognition, International Journal on Document Analysis and Recognition, vol.4, issue.3, pp.191-204, 2002.
DOI : 10.1007/s100320200076

B. Zhu, A. Shivram, S. Setlur, V. Govindaraju, and M. Nakagawa, Online Handwritten Cursive Word Recognition Using Segmentation-Free MRF in Combination with P2DBMN-MQDF, 2013 12th International Conference on Document Analysis and Recognition, pp.349-353, 2013.
DOI : 10.1109/ICDAR.2013.77

J. Cao, M. Shridhar, F. Kimura, and M. Ahmadi, Statistical and neural classification of handwritten numerals: a comparative study, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems, pp.643-646, 1992.
DOI : 10.1109/ICPR.1992.201859

S. , L. Kimmig, A. Toivonen, and H. , ProbLog: a probabilistic Prolog and its application in link discovery, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp.2468-2473, 2007.

T. Sato and Y. Kameya, Parameter learning of logic programs for symbolic-statistical modeling, J. Artif. Intell. Res, vol.15, pp.391-454, 2001.

J. Vennekens, S. Verbaeten, and M. Bruynooghe, Logic Programs with Annotated Disjunctions, ICLP 2004, pp.431-445, 2004.
DOI : 10.1007/978-3-540-27775-0_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.6404

D. Poole, Logic programming, abduction and probability, New Generation Computing, vol.7, issue.1, pp.377-400, 1993.
DOI : 10.1007/BF03037184
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.6513

T. Sato and Y. Kameya, A viterbi-like algorithm and EM learning for statistical abduction, Proceedings of Workshop on Fusion of Domain Knowledge with Data for Decision Support, 2000.
DOI : 10.1007/3-540-45884-0_11

A. Kimmig, B. Demoen, L. De-raedt, V. S. Costa, and R. Rocha, Abstract, Theory and Practice of Logic Programming, vol.15, issue.2-3, pp.235-262, 2011.
DOI : 10.1017/S1471068410000566

S. Bragaglia and F. Riguzzi, Approximate Inference for Logic Programs with Annotated Disjunctions, ILP 2010, pp.30-37, 2011.
DOI : 10.1007/978-3-642-21295-6_7

D. Fierens, G. Van-den-broeck, J. Renkens, D. Shterionov, B. Gutmann et al., Abstract, Theory and Practice of Logic Programming, vol.35, issue.03, pp.358-40110, 2015.
DOI : 10.1017/S1471068411000664

D. Fierens, G. Van-den-broeck, I. Thon, B. Gutmann, and L. De-raedt, Inference in probabilistic logic programs using weighted CNF's, Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, pp.211-220, 2011.

D. Fierens, G. Van-den-broeck, M. Bruynooghe, and L. De-raedt, Constraints for probabilistic logic programming, Proceedings of the NIPS Probabilistic Programming Workshop, 2012.

T. Sato, A statistical learning method for logic programs with distribution semantics, Proceedings of the 12th International Conference on Logic Programming (ICLP95), pp.715-729, 1995.

J. Vennekens, M. Denecker, and M. Bruynooghe, CP-logic: A language of causal probabilistic events and its relation to logic programming. Theory Pract. Logic Prog, pp.245-308, 2009.

B. Gutmann, On continuous distributions and parameter estimation in probabilistic logic programs, 2011.

L. Getoor and B. Taskar, Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning), 2007.

D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques, 2009.

A. Darwiche, Modeling and Reasoning with Bayesian Networks Chapter, 2009.
DOI : 10.1017/cbo9780511811357

B. Taskar, C. Guestrin, and D. Koller, Max-margin markov networks, Proceedings of Neural Information Processing Systems, 2003.

M. Richardson and P. Domingos, Markov logic networks, Machine Learning, vol.23, issue.1-2, pp.107-136, 2006.
DOI : 10.1007/s10994-006-5833-1

J. Huang, Solving map exactly by searching on compiled arithmetic circuits, Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), pp.143-148, 2006.

W. Meert, Inference and learning for directed probabilistic logic models, 2011.

T. Mantadelis and G. Janssens, Dedicated tabling for a probabilistic setting, ICLP (Tech. Communications of LIPIcs., Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.124-133, 2010.

A. Darwiche, New advances in compiling CNF into decomposable negation normal form, Proceedings of the 16th European Conference on Artificial Intelligence, pp.328-332, 2004.

A. Darwiche, A compiler for deterministic, decomposable negation normal form, AAAI/IAAI, pp.627-634, 2002.

W. Meert, J. Struyf, H. Blockeel, M. Berardi, and D. Malerba, CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods Learning recursive patterns for biomedical information extraction, Proceedings of 19th International Conference of Inductive Logic Programming ILP 2006, pp.96-109, 2007.

D. A. Bohan, G. Caron-lormier, S. H. Muggleton, A. Raybould, and A. Tamaddoni-nezhad, Automated Discovery of Food Webs from Ecological Data Using Logic-Based Machine Learning, PLoS ONE, vol.7, issue.12, p.29028, 2011.
DOI : 10.1371/journal.pone.0029028.s001

G. Caron-lormier, D. A. Bohan, C. Hawes, A. Raybould, A. J. Haughton et al., How might we model an ecosystem?, Ecological Modelling, vol.220, issue.17, pp.1935-1949, 2009.
DOI : 10.1016/j.ecolmodel.2009.04.021

J. Davey, I. Vaughan, R. A. King, J. Bell, D. Bohan et al., Intraguild predation in winter wheat: prey choice by a common epigeal carabid consuming spiders, Journal of Applied Ecology, vol.74, issue.1, pp.271-279, 2013.
DOI : 10.1111/1365-2664.12008

T. G. Dietterich, Machine learning in ecosystem informatics and sustainability, Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp.8-13, 2009.

A. J. Haughton, G. T. Champion, C. Hawes, M. S. Heard, D. R. Brooks et al., Invertebrate responses to the management of genetically modified herbicide-tolerant and conventional spring crops. ii. within-field epigeal and aerial arthropods, Philos. Trans. R. Soc. Lond. Ser. B Biol. Sci, vol.358, p.1863, 1439.

K. Inoue, K. Furukawa, I. Kobayashi, and H. Nabeshima, Discovering rules by metalevel abduction, ILP 2009, pp.49-64
DOI : 10.1007/978-3-642-13840-9_6

S. H. Muggleton and D. Lin, Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited, Proceedings of the 23rd International Joint Conference Artificial Intelligence (IJCAI 2013), pp.1551-1557, 2013.
DOI : 10.1007/s10994-014-5471-y

S. H. Muggleton, D. Lin, N. Pahlavi, and A. Tamaddoni-nezhad, Meta-interpretive learning: application to grammatical inference, Machine Learning, vol.2, issue.2, pp.25-49, 2014.
DOI : 10.1007/s10994-013-5358-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.5465

S. H. Muggleton and C. H. Bryant, Theory Completion Using Inverse Entailment, ILP 2000, p.130, 2000.
DOI : 10.1007/3-540-44960-4_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5787

S. H. Muggleton, D. Lin, and A. Tamaddoni-nezhad, Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited, Machine Learning, vol.27, issue.2, pp.49-7310, 2015.
DOI : 10.1007/s10994-014-5471-y

A. Tamaddoni-nezhad, D. Bohan, A. Raybould, and S. H. Muggleton, Machine Learning a Probabilistic Network of Ecological Interactions, ILP 2011, pp.332-346, 2012.
DOI : 10.1007/978-3-642-31951-8_28

A. Tamaddoni-nezhad, G. Milani, A. Raybould, S. Muggleton, and D. Bohan, Construction and Validation of Food Webs Using Logic-Based Machine Learning and Text Mining, Adv. Ecol. Res, vol.49, pp.225-289, 2013.
DOI : 10.1016/B978-0-12-420002-9.00004-4

R. Andersen, F. Chung, and K. Lang, Using PageRank to Locally Partition a Graph, Internet Mathematics, vol.4, issue.1, pp.35-64, 2007.
DOI : 10.1080/15427951.2007.10129139

P. Chebolu and P. Melsted, PageRank and the random surfer model, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete algorithms, 2008.

J. Cussens, Stochastic logic programs: sampling, inference and applications, Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, 2000.

L. De-raedt and K. Kersting, Probabilistic Inductive Logic Programming, Probabilistic Inductive Logic Programming, pp.1-27, 2008.

L. Getoor and B. Taskar, An Introduction to Statistical Relational Learning, 2007.

S. Muggleton, Stochastic logic programs. Adv. inductive logic prog, pp.254-264, 1996.

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: bringing order to the web, 1999.

S. I. Resnick, Adventures in Stochastic Processes, 1992.
DOI : 10.1007/978-1-4612-0387-2

W. Y. Wang, K. Mazaitis, and W. W. Cohen, Programming with personalized pagerank, Proceedings of the 22nd ACM international conference on Conference on information & knowledge management, CIKM '13, 2013.
DOI : 10.1145/2505515.2505573

W. Y. Wang, K. Mazaitis, W. W. Cohen, N. Aghaeepour, G. Finak et al., ProPPR: Efficient first-order probabilistic logic programming for structure discovery, parameter learning, and scalable inference In: AAAI Workshop on Statistical Relational Artificial Intelligence (StaRAI 2014) (2014) jan.ramon@cs.kuleuven.be References 1 Critical assessment of automated flow cytometry data analysis techniques, Nat. Methods, vol.10, issue.3, pp.228-238, 2013.

N. Aghaeepour, R. Nikolic, H. H. Hoos, and R. R. Brinkman, Rapid cell population identification in flow cytometry data, Cytometry Part A, vol.5, issue.1, pp.6-13, 2011.
DOI : 10.1002/cyto.a.21007

H. Blockeel and L. De-raedt, Top-down induction of first-order logical decision trees, Artificial Intelligence, vol.101, issue.1-2, pp.285-297, 1998.
DOI : 10.1016/S0004-3702(98)00034-4

H. Blockeel, L. De-raedt, and J. Ramon, Top-down induction of clustering trees, Proceedings of the 15th International Conference on Machine Learning, pp.55-63, 1998.

H. Blockeel and M. Bruynooghe, Aggregation versus selection bias, and relational neural networks, IJCAI-2003 Workshop on Learning Statistical Models from Relational Data, p.2003, 2003.

C. Charnay, N. Lachiche, and A. Braud, Incremental construction of complex aggregates: Counting over a secondary table, Online Preprints of 23th International Conference on Inductive Logic Programming, pp.1-6, 2013.

G. Finak, A. Bashashati, R. Brinkman, and R. Gottardo, Merging Mixture Components for Cell Population Identification in Flow Cytometry, Advances in Bioinformatics, vol.59, issue.4, p.12, 2009.
DOI : 10.1002/cyto.a.20754

R. Frank, F. Moser, and M. Ester, A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions, PKDD 2007, pp.430-437, 2007.
DOI : 10.1007/978-3-540-74976-9_43

P. Frasconi, M. Jaeger, and A. Passerini, Feature Discovery with Type Extension Trees, ILP 2008, pp.122-139
DOI : 10.1007/978-3-540-85928-4_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.2949

L. Herzenberg, J. Tung, W. Moore, L. Herzenberg, and D. Parks, Interpreting flow cytometry data: a guide for the perplexed, Nature Immunology, vol.45, issue.7, pp.681-685, 2006.
DOI : 10.1038/ni0706-681

M. Jaeger, M. Lippi, A. Passerini, and P. Frasconi, Type Extension Trees for feature construction and learning in relational domains, Artificial Intelligence, vol.204, pp.30-55, 2013.
DOI : 10.1016/j.artint.2013.08.002

A. J. Knobbe, A. Siebes, and B. Marseille, Involving aggregate functions in multirelational search, PKDD 2002, p.287, 2002.

D. Koller, Probabilistic Relational Models, ILP 1999, p.3, 1999.
DOI : 10.1007/3-540-48751-4_1
URL : http://ai.stanford.edu/~koller/Papers/Getoor+al:SRL07.pdf

M. A. Krogel and S. Wrobel, Facets of aggregation approaches to propositionalization, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pp.30-39, 2003.

S. Muggleton, Inductive Logic Programming, 1992.

J. Neville, D. Jensen, L. Friedland, and M. Hay, Learning relational probability trees, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.625-630, 2003.
DOI : 10.1145/956750.956830
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.1639

C. Perlich and F. Provost, Aggregation-based feature invention and relational concept classes, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.167-176, 2003.
DOI : 10.1145/956750.956772
URL : http://archive.nyu.edu/bitstream/2451/27768/2/CPP-03-03.pdf

A. Srinivasan, S. Muggleton, and R. King, Comparing the use of background knowledge by inductive logic programming systems, Proceedings of the 5th International Workshop on Inductive Logic Programming, pp.199-230, 1995.

I. P. Sugár and S. C. Sealfon, Misty Mountain clustering: application to fast unsupervised flow cytometry gating, BMC Bioinformatics, vol.11, issue.1, p.502, 2010.
DOI : 10.1186/1471-2105-11-502

W. Uwents and H. Blockeel, Classifying Relational Data with Neural Networks, ILP 2005, pp.384-396, 2005.
DOI : 10.1007/11536314_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.9603

A. Van-assche, C. Vens, H. Blockeel, and S. D?eroski, First order random forests: Learning relational classifiers with complex aggregates, Machine Learning, vol.37, issue.3, pp.1-3, 2006.
DOI : 10.1007/s10994-006-8713-9

C. Vens, J. Ramon, and H. Blockeel, Refining Aggregate Conditions in Relational Learning, PKDD 2006, pp.383-394, 2006.
DOI : 10.1007/11871637_37
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4422

H. Zare, P. Shooshtari, A. Gupta, R. R. Brinkman, H. Mannila et al., Data reduction for spectral clustering to analyze high throughput flow cytometry data Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, pp.307-328, 1996.

T. Akutsu, A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree, IEICE Trans. Fundam. Electron. Commun. Comput. Sci, vol.76, issue.9, pp.1488-1493, 1993.

Y. Chi, Y. Yang, and R. R. Muntz, Indexing and mining free trees, Third IEEE International Conference on Data Mining, pp.509-512, 2003.
DOI : 10.1109/ICDM.2003.1250964
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.7301

L. De-raedt, Logical and Relational Learning. Cognitive Technologies, 2008.

R. Diestel, Graph Theory, 2012.

G. C. Garriga, R. Khardon, and L. De-raedt, Mining closed patterns in relational, graph and network data, Annals of Mathematics and Artificial Intelligence, vol.4, issue.4, pp.315-342, 2013.
DOI : 10.1007/s10472-012-9324-8
URL : https://hal.archives-ouvertes.fr/hal-00754967

G. Gottlob, Subsumption and implication, Information Processing Letters, vol.24, issue.2, pp.109-111, 1987.
DOI : 10.1016/0020-0190(87)90103-7

M. Hajiaghayi and N. Nishimura, Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth, Journal of Computer and System Sciences, vol.73, issue.5, pp.755-768, 2007.
DOI : 10.1016/j.jcss.2007.01.003

J. Han, J. Pei, Y. Yin, and R. Mao, Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach, Data Mining and Knowledge Discovery, vol.8, issue.1, pp.53-87, 2004.
DOI : 10.1023/B:DAMI.0000005258.31418.83
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.2424

F. Harary, Graph Theory, 1994.

J. E. Hopcroft and R. M. Karp, An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973.
DOI : 10.1137/0202019

T. Horváth and J. Ramon, Efficient frequent connected subgraph mining in graphs of bounded tree-width, Theor. Comput. Sci, vol.411, pp.31-33, 2010.

T. Horváth, J. Ramon, and S. Wrobel, Frequent subgraph mining in outerplanar graphs, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.472-508, 2010.
DOI : 10.1145/1150402.1150427

T. Horváth and G. Turán, Learning logic programs with structured background knowledge??????An extended abstract of this paper appeared in: L.??De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53???76, Scientific Report of the Department of Computer Science, Katholieke Universiteit Leuven, and also in the post-conference volume: L.??De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, Amsterdam/Ohmsha, Tokyo, 1996, pp. 172???191., Artificial Intelligence, vol.128, issue.1-2, pp.31-97, 2001.
DOI : 10.1016/S0004-3702(01)00062-5

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

J. Matou?ek and R. Thomas, On the complexity of finding iso- and other morphisms for partial k-trees, Discrete Mathematics, vol.108, issue.1-3, pp.343-364, 1992.
DOI : 10.1016/0012-365X(92)90687-B

R. C. Read and R. Tarjan, Bound on backtrack algorithms for listing cycles, paths, and spanning trees, pp.237-252, 1975.

R. Shamir and D. Tsur, Faster subtree isomorphism, Proceedings of the Fifth Israeli Symposium on the Theory of Computing and Systems, pp.126-131, 1997.
DOI : 10.1006/jagm.1999.1044
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.1254