Wayfinding is a basic activity people do throughout their entire lives as they navigate from one place to another. In order to create different spaces in such a way that they facilitate people’s wayfinding it is necessary to integrate principles of human spatial cognition into the design process. This paper presents a methodology to structure space based on experiental patterns, called image sc...

We address the problem of answering conjunctive queries (CQs) over extended Entity-Relationship schemata, which we call EER (Extended ER) schemata, with is-a among entities and relationships, and cardinality constraints. This is a common setting in conceptual data modelling, where reasoning over incomplete data with respect to a knowledge base is required. We adopt a semantics for EER schemata ...

Ereignisgesteuerte Prozessketten (EPK) sind eine Notation zur Modellierung von Geschäftsprozessen. Komplexe Geschäftsprozesse werden üblicherweise nicht als eine einzige EPK modelliert, sondern durch mehrere EPK-Schemata, die durch Prozesswegweiser und hierarchisierte Funktionen miteinander verbunden sind. In diesem Beitrag wird untersucht, welche Forderungen an solche EPK-Schemata zu stellen s...

We describe a computational project concerning labeling of dissonance treatments – schematic descriptions of the uses of dissonances. We use automatic score annotation and database methods to develop schemata for a large corpus of 16th-century polyphonic music. We then apply structural techniques to investigate coincidence of schemata, and to extrapolate from found structures to unused possibil...

The most fascinating claim of the genetic algorithm is that apportionment of credit to schemata is accomplished implicitly, with no information explicitly revealed about which schemata are being favored or disfavored. From a philosophical perspective, this idea makes a claim about what is knowable or rather unknowable about evolution, especially in terms of what is good and bad within us.

Intrinsic parallelism is shown to have application beyond schemata and o-schemata. More general objects called formae are introduced and general operators which manipulate these are introduced and discussed. These include random, respectful recombination. The extended formalism is applied to various common representations and standard operators are analysed in the light of the formalism.

Proof schemata are a variant of LK-proofs able to simulate various induction schemes in first-order logic by adding so called proof links to the standard first-order LK-calculus. Proof links allow proofs to reference proofs thus giving proof schemata a recursive structure. Unfortunately, applying reductive cutelimination is non-trivial in the presence of proof links. Borrowing the concept of la...

The main contribution of the thesis is to develop a comprehensive framework for developinglogic programs using ve program schemata and some basic data types, and to evaluate itssuitability for developing sizable programs. The schemata are intended to capture designdecisions made by a programmer during top-down re nement of a predicate. The schemataare completely independent from...

Due to the increasing acceptance of database management systems, many enterprises store most of their information in such databases. Unfortunately , the diversity of database management systems frequently leads to the situation, that diierent units of an enterprise use diierent systems or at least incompatible schemata, which makes it very burdensome to exchange data between these units. To inc...

A logic is devised for reasoning about iterated schemata of SMT problems. The satis ability problem is shown to be undecidable for this logic, but we present a proof procedure that is sound, complete w.r.t. satis ability and terminating for a precisely characterized class of problems. It is parameterized by an external procedure (used as a black box) for testing the satis ability of ground inst...