A connectionist approach to abductive problems: employing a learning algorithm 
TitleA connectionist approach to abductive problems: employing a learning algorithm
Publication TypeConference Paper
Year of Publication2016
AuthorsGajda, A, Kups, A, Urbański, M
EditorGanzha, M, Maciaszek, L, Paprzycki, M
Conference NameProceedings of the 2016 Federated Conference on Computer Science and Information Systems (FedCSIS)

This paper presents preliminary results of an application of artificial neural networks and Backpropagation learning algorithm to solve logical abductive problems. To represent logic programs in the form of artificial neural networks CIL2P approach proposed by Garcez et al. is employed. Our abductive procedure makes use of translation of a logic program representing a knowledge base into a neural network, training of the neural network with an example representing an abductive goal and translation of the trained network back to the form of a logic program. An abductive hypothesis is represented as the symmetric difference between the initial logic program and the one obtained after training of the network. The first part of the paper introduces formal description of the tools used to model the abductive process, while the second part illustrates our contribution with results of a few computational experiments and discusses the ways of possible improvements of the proposed procedure.