TY - CONF
T1 - A connectionist approach to abductive problems: employing a learning algorithm
T2 - Proceedings of the 2016 Federated Conference on Computer Science and Information Systems (FedCSIS)
Y1 - 2016
A1 - Andrzej Gajda
A1 - Adam Kups
A1 - Mariusz Urbański
ED - M. Ganzha
ED - L. Maciaszek
ED - M. Paprzycki
AB - 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.
JF - Proceedings of the 2016 Federated Conference on Computer Science and Information Systems (FedCSIS)
PB - ACSIS
ER -
TY - JOUR
T1 - Identifying efficient abductive hypotheses using multi-criteria dominance relation
JF - ACM Transactions on Computational Logic
Y1 - 2014
A1 - Maciej Komosinski
A1 - Adam Kups
A1 - Dorota Leszczyńska-Jasion
A1 - Mariusz Urbański
AB - In this article, results of the automation of an abductive procedure are reported. This work is a continuation of our earlier research, where a general scheme of the procedure has been proposed. Here, a more advanced system developed to generate and evaluate abductive hypotheses is introduced. Abductive hypotheses have been generated by the implementation of the Synthetic Tableau Method. Before the evaluation, the set of hypotheses has undergone several reduction phases. To assess usefulness of abductive hypotheses in the reduced set, several criteria have been employed. The evaluation of efficiency of the hypotheses has been provided by the multi-criteria dominance relation. To comprehend the abductive procedure and the evaluation process more extensively, analyses have been conducted on a number of artificially generated abductive problems.
PB - Association for Computing Machinery
CY - New York, NY, USA
VL - 15
UR - http://www.framsticks.com/files/common/IdentifyingEfficientAbductiveHypotheses.pdf
ER -