| References: [1] Ad–e, Hilde., Denecker, Marc. (1995). Ailp: Abductive inductive logic programming. In IJCAI (pp. 1201-1209).
[2] Alrajeh, Dalal, Kramer, Je, Russo, Alessandra., Uchitel, Sebasti–an. (2009). Learning operational requirements from goal models. In ICSE (pp. 265-275).
[3] Bandara, A. K., Nuseibeh, B. A., Price, B. A., et al. (2008). Privacy rights management for mobile applications. In 4th Int. Symp. on Usable Privacy and Security. Pittsburgh.
[4] Bostrnom, H.., Idestam-Almquist, P. (1994). Specialization of logic programs by pruning SLD-trees. GMD-Studien, 237.
[5] Bratko, Ivan. (1999). Refining complete hypotheses in ILP. In ILP ’99: 9th Workshop on Inductive Logic Programming (pp. 44-55). Springer-Verlag.
[6] Clark, Keith L. (1977). Negation as failure. In Logic and Data Bases (pp. 293-322).
[7] Cohen, William W. (1994). Grammatically biased learning: Learning logic programs using an explicit antecedent description language. Artif. Intell., 68(2), 303-366.
[8] Corapi, D., Ray, O., Russo, A., Bandara, A. K.., Lupu, E. C. (2009). Learning rules from user behaviour. In 5th Artif. Intell. Applications and Innovations (AIAI 2009). Thessaloniki, Greece.
[9] Costa, V–tor Santos, Damas, Lu–s, Reis, Rog–erio., Azevedo, R–uben. (2008). Yap user’s manual.
[10] Dzroski, Saso. (2000). Relational data mining applications: An overview (pp. 339-360).
[11] Eagle, Nathan., Pentland, Alex. (2006). Reality mining: Sensing complex social systems. Personal and Ubiquitous Computing, 10(4), 255-268.
[12] Esposito, Floriana, Semeraro, Giovanni, Fanizzi, Nicola., Ferilli, Stefano. (2000). Multistrategy theory revision: Induction and Abduction in INTHELEX. Mach. Learn., 38(1-2), 133-156.
[13] Kakas, Antonis C., Kowalski, Robert A.., Toni, Francesca. (1992). Abductive logic programming. J. Log. Comput., 2(6), 719-770.
[14] Kakas, Antonis C.., Riguzzi, Fabrizio. (2000). Abductive concept learning. New Generation Comput., 18(3), 243-2000.
[15] Kakas, C., Van Nuelen, Bert., Denecker, Marc. (2001). A-system: Problem solving through abduction. In 17th International Joint Conference on Artif. Intell. (Vol. 1, pp. 591-596).
[16] Kimber, Tim, Broda, Krysia., Russo, Alessandra. (2009). Induction on failure: Learning connected horn theories. In LPNMR (pp. 169-181).
[17] Lavrac, N.., Dzeroski, S. (1994). Inductive Logic Programming: Techniques and Applications.
[18] Lloyd, John W. (1987). Foundations of Logic Programming, 2nd Edition. Springer.
[19] Malerba, D., Esposito, F.., Lisi, F. A. (1998). Learning recursive theories with ATRE. In Proc. of the 13th European Conference on Artif. Intell. (pp. 435-439).
[20] Moyle, S. (2003). An investigation into theory completion techniques in inductive logic (Ph.D. thesis). University of Oxford.
[21] Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing J., 13, 245-286.
[22] Muggleton, Stephen, Santos, Jose Carlos Almeida., Tamaddoni-Nezhad, Alireza. (2008). Toplog: Ilp using a logic program declarative bias. In ICLP (Vol. 5366, pp. 687-692).
[23] Quinlan, J. Ross. (1996). Learning first-order definitions of functions. J. Artif. Intell. Res. (JAIR), 5, 139"161.
[24] Ray, Oliver. (2007). Inferring process models from temporal data with abduction and induction. In 1st Workshop on the Induction of Process Models.
[25] Ray, Oliver., Bryant, Chris. (2008). Inferring the function of genes from synthetic lethal mutations. In 2nd Int. Conf. on Complex, Intelligent and Software Intensive Systems (pp. 667- 671).
[26] Ray, Oliver. (2009). Nonmonotonic abductive inductive learning. Journal of Applied Logic 7, 329-340.
[27] Ray, Oliver, Whelan, Ken., King, Ross. (2009). A nonmonotonic logical approach for modelling and revising metabolic networks. In 3rd Int. Conf. on Complex, Intelligent and Software Intensive Systems.
[28] Richards, Bradley L.., Mooney, Raymond J. (1995). Automated refinement of first-order horn-clause domain theories. Machine Learning, 19(2), 95-131.
[29] Shapiro, Leon., Sterling, Ehud Y. (1994). The Art of PROLOG: Advanced Programming Techniques. The MIT Press.
[30] Shanahan, Murray. (1999). The event calculus explained. LNCS, 1600.
[31] Wrobel, Stefan. (1996). First order theory refinement. In Advances in Inductive Logic Programming (pp. 14-33).
[32] Yamamoto, Akihiro. (1997). Which hypotheses can be found with inverse entailment? In ILP (pp. 296-308). |
Author Rights 
