While they are very useful to diagnose typical cases, it is difficult for them to diagnose complicated cases. Therefore various approaches, such as deeper knowledge representation, case-based reasoning, are proposed in order to overcome this problem. However, they axe not sufficient to solve this problem completely. One reason that they are not so sutticient is that they are lacking one important track of diagnosis that medical experts do when they meet complicated cases. In this paper, we introduce combination of reasoning, planning and learning methods in order to solve this difficulty.

Berkes, Pietro, Wood, Frank, Pillow, Jonathan W.

The coding of information by neural populations depends critically on the statistical dependencies between neuronal responses. However, there is no simple model that combines the observations that (1) marginal distributions over single-neuron spike counts are often approximately Poisson; and (2) joint distributions over the responses of multiple neurons are often strongly dependent. Here, we show that both marginal and joint properties of neural responses can be captured using Poisson copula models. Copulas are joint distributions that allow random variables with arbitrary marginals to be combined while incorporating arbitrary dependencies between them. Different copulas capture different kinds of dependencies, allowing for a richer and more detailed description of dependencies than traditional summary statistics, such as correlation coefficients. We explore a variety of Poisson copula models for joint neural response distributions, and derive an efficient maximum likelihood procedure for estimating them. We apply these models to neuronal data collected in and macaque motor cortex, and quantify the improvement in coding accuracy afforded by incorporating the dependency structure between pairs of neurons.

We discover the patterns of autistic reasoning in the conditions requiring change in representation of domain knowledge. The formalism of nonmonotonic logic of defaults is used to simulate the autistic decision-making while learning how to adjust an action to the environment which forces new representation structure. Our main finding is that while autistic reasoning may be able to process single default rules, they have a characteristic difficulty in cases with nontrivial representation changes, where multiple default rules conflict. We evaluate our hypothesis that the skill of representation adjustment can be advanced by learning default reasoning patterns via a set of exercises.

Patkos, Theodore, Plexousakis, Dimitris, Chibani, Abdelghani, Amirat, Yacine

Action languages have emerged as an important field of Knowledge Representation for reasoning about change and causality in dynamic domains. This article presents Cerbere, a production system designed to perform online causal, temporal and epistemic reasoning based on the Event Calculus. The framework implements the declarative semantics of the underlying logic theories in a forward-chaining rule-based reasoning system, coupling the high expressiveness of its formalisms with the efficiency of rule-based systems. To illustrate its applicability, we present both the modeling of benchmark problems in the field, as well as its utilization in the challenging domain of smart spaces. A hybrid framework that combines logic-based with probabilistic reasoning has been developed, that aims to accommodate activity recognition and monitoring tasks in smart spaces. Under consideration in Theory and Practice of Logic Programming (TPLP)

Answer Set Programming (ASP) is nowadays a dominant rule-based knowledge representation tool. Though existing ASP variants enjoy efficient implementations, generating an answer set remains intractable. The goal of this research is to define a new \asp-like rule language, 4SP, with tractable model generation. The language combines ideas of ASP and a paraconsistent rule language 4QL. Though 4SP shares the syntax of \asp and for each program all its answer sets are among 4SP models, the new language differs from ASP in its logical foundations, the intended methodology of its use and complexity of computing models. As we show in the paper, 4QL can be seen as a paraconsistent counterpart of ASP programs stratified with respect to default negation. Although model generation of well-supported models for 4QL programs is tractable, dropping stratification makes both 4QL and ASP intractable. To retain tractability while allowing non-stratified programs, in 4SP we introduce trial expressions interlacing programs with hypotheses as to the truth values of default negations. This allows us to develop a~model generation algorithm with deterministic polynomial time complexity. We also show relationships among 4SP, ASP and 4QL.