The downward closure of a language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of every language is regular. Moreover, recent results show that downward closures are computable for quite powerful system models. One advantage of abstracting a language by its downward closure is that then, equivalence and inclusion become deci...

Peirce’s pragmatic notion of semiosis can be described in terms of a multi-level system of constraints involving chance, efficient, formal and final causation. According to the model proposed here, law-like regularities, which work as boundary conditions or organizational principles, have a downward effect on the spatiotemporal distribution of lower-level semiotic items. We treat this downward ...

ion inherent in each single individual. In its reality it is the ensemble of social relations’ [Marx 1972: 109]). If one were to represent these two views of emergence as ideal types, one could say the former, complex systems approach stresses the ordinary workings of nature as resulting in surprising behaviour of complex systems; the distinction between levels is characterized as a distinction...

By a celebrated theorem of Morley, a theory T is א1-categorical if and only if it is κ-categorical for all uncountable κ. In this paper we are taking the first steps towards extending Morley’s categoricity theorem “to the finite”. In more detail, we are presenting conditions, implying that certain finite subsets of certain א1-categorical T have at most one n-element model for each natural numbe...

We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.

Fast Downward SMAC uses the SMAC algorithm configurator (Hutter, Hoos, and Leyton-Brown 2011) to find a single configuration of Fast Downward (Helmert 2006) for a given planning domain. It closely follows the methodology used by Fawcett et al. (2011), but employs the newer modelbased algorithm configurator SMAC instead of ParamILS (Hutter et al. 2009) to optimize Fast Downward for each domain o...

Cedalion is our algorithm for automatically configuring sequential planning portfolios. Given a parametrized planner and a set of training instances, it iteratively selects the pair of planner configuration and time slice that improves the current portfolio the most per time spent. At the end of each iteration all instances for which the current portfolio finds the best solution are removed fro...

the problem of downward continuation of the gravity field from the earth’s surface to the reference ellipsoid arises from the fact that the solution to the boundary value problem for geoid determination without applying stokes formula is sought in terms of the disturbing potential on the ellipsoid but the gravity observations are only available on the earth’s surface. downward continuation is a...