This paper addresses methods of specialising rst-order theories within the context of incremental learning systems. We demonstrate the shortcomings of existing rst-order incremental learning systems with regard to their specialisation mechanisms. We prove that these shortcomings are fundamental to the use of classical logic. In particular, minimal \correct-ing" specialisations are not always ob...

The systematic modelling of dynamic spatial systems is a key requirement in a wide range of application areas such as commonsense cognitive robotics, computer-aided architecture design, dynamic geographic information systems. We present ASPMT(QS), a novel approach and fully-implemented prototype for non-monotonic spatial reasoning —a crucial requirement within dynamic spatial systems— based on ...

A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. () by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show that the least n for which there exists such an n-gon is seven. In order to demonstrate non-deflatability, we use a new combinatorial structure for polygons,...

Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given ...

We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which they are reducing: Each query is strictly longer (shorter) than the previous one. We call these reductions query-increasing (query-decreasing) Turing reductions. We also study query-nonincreasing (querynondecreasing) Tu...

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptively splits the input sequence into small chunks over which soft attention is ...

This article describes a method for constructing a special rule (we call it synergy rule) that uses as its input information the outputs (scores) of several monotonic rules which solve the same pattern recognition problem. As an example of scores of such monotonic rules we consider here scores of SVM classifiers. In order to construct the optimal synergy rule, we estimate the conditional probab...

A simple model for dendritic growth is given by S2d'" + 9' — cos(9). For S ss 1 we prove that there is no bounded, monotonic solution which satisfies d(-oo) = -7t/2 and Q(oo) = n/2. We also investigate the existence of bounded, monotonic solutions of an equation derived from the Kuramoto-Sivashinsky equation, namely y" + y = 1 y1 /2. We prove that there is no monotonic solution which satisfies ...

Semantics of multidimensional dynamic logic programming is traditionally based on the causal rejection principle: if there is a conflict between rules then the rule from a less preferred program is rejected. However, sometimes it is useful to solve a conflict between the heads of rules by blocking the body of a rule. Moreover, semantics based on the causal rejection principle, is not able to re...

In an earlier work [AČJYK00] we presented a general framework for verification of infinite-state transition systems, where the transition relation is monotonic with respect to a well quasi-ordering on the set of states. In this paper, we investigate extending the framework from the context of transition systems to that of games. We show that monotonic games are in general undecidable. We identi...