<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author><author><style face="normal" font="default" size="100%">Adam Kups</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary construction of derivations in classical propositional logic using a symbolic-connectionist representation</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.framsticks.com/files/common/EvolutionOfDerivationsInLogic.pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">RA–3/17</style></number><publisher><style face="normal" font="default" size="100%">Poznan University of Technology, Institute of Computing Science</style></publisher><abstract><style face="normal" font="default" size="100%">This report introduces a way derivations in classical propositional logic can be constructed using evolutionary algorithms. The derivations are represented by connectionist systems. There are three kinds of nodes constituting these systems: formula nodes that generate signal in the form of strings of symbols, &quot;modus ponens&quot; nodes that transform incoming signal according to the &quot;modus ponens&quot; rule, and substitution nodes that transform incoming signal by applying the substitution rule. This work presents initial research on an approach that is a part of our quest for efficient construction of derivations using various logics and constrained in various ways. The final part of this report outlines limitations encountered in our initial experiments and the ways the proposed approach can be improved.</style></abstract><work-type><style face="normal" font="default" size="100%">Research report</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Andrzej Gajda</style></author><author><style face="normal" font="default" size="100%">Adam Kups</style></author><author><style face="normal" font="default" size="100%">Mariusz Urbański</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">M. Ganzha</style></author><author><style face="normal" font="default" size="100%">L. Maciaszek</style></author><author><style face="normal" font="default" size="100%">M. Paprzycki</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A connectionist approach to abductive problems: employing a learning algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2016 Federated Conference on Computer Science and Information Systems (FedCSIS)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><publisher><style face="normal" font="default" size="100%">ACSIS</style></publisher><pages><style face="normal" font="default" size="100%">353–362</style></pages><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author><author><style face="normal" font="default" size="100%">Adam Kups</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Time-order error and scalar variance in a computational model of human timing: simulations and predictions</style></title><secondary-title><style face="normal" font="default" size="100%">Computational Cognitive Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1186/s40469-015-0002-0</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">1–24</style></pages><abstract><style face="normal" font="default" size="100%">This work introduces a computational model of human temporal discrimination mechanism - the Clock-Counter Timing Network. It is an artificial neural network implementation of a timing mechanism based on the informational architecture of the popular Scalar Timing Model. The model has been simulated in a virtual environment enabling computational experiments which imitate a temporal discrimination task - the two-alternative forced choice task. The influence of key parameters of the model (including the internal pacemaker speed and the variability of memory translation) on the network accuracy and the time-order error phenomenon has been evaluated. The results of simulations reveal how activities of different modules contribute to the overall performance of the model. These results can be compared and verified in empirical experiments with human participants, especially when the modes of activity of the internal timing mechanism are changed because of some external conditions, or are impaired due to some kind of a neural degradation process.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author><author><style face="normal" font="default" size="100%">Adam Kups</style></author><author><style face="normal" font="default" size="100%">Dorota Leszczyńska-Jasion</style></author><author><style face="normal" font="default" size="100%">Mariusz Urbański</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Identifying efficient abductive hypotheses using multi-criteria dominance relation</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Transactions on Computational Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.framsticks.com/files/common/IdentifyingEfficientAbductiveHypotheses.pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><publisher><style face="normal" font="default" size="100%">Association for Computing Machinery</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">28:1–28:20</style></pages><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author><author><style face="normal" font="default" size="100%">Adam Kups</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Models and implementations of timing processes using Artificial Life techniques</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.framsticks.com/files/common/HumanTimingModelsSimulations.pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">RA-05/09</style></number><publisher><style face="normal" font="default" size="100%">Poznan University of Technology, Institute of Computing Science</style></publisher><abstract><style face="normal" font="default" size="100%">This work presents implementation of the Scalar Timing Model (STM) in the neural networks environment. STM is rather popular and commonly used model in the perception of time intervals in humans and animals fields of study. Currently many experiments are conducted in order to verify and research STM parameters and attributes. One of the goal of the implementation was to check whether theoretical model will cope with constraints of artificial neural networks. During implementation process it turned out, that scheme of the model should be revised (by adding extra components) in order to maintain it's functional adequacy. Another case was to check how does manipulations of certain parameters will influence collected representation of the real time within model. In this preliminary research we focus on the pacemaker module. Conclusion of this research is that appropriate choice of distribution form of impulses generated by pacemaker make it simulation of the model more congruent with the experimentally collected data then with formal assumptions of STM.</style></abstract><work-type><style face="normal" font="default" size="100%">Research report</style></work-type></record></records></xml>