We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
This paper introduces a typed λ-calculus called λPower , a predicative reformulation of part of Cardelli’s power type system. Power types integrate subtyping into the typing t...
We show that dependent sums and dependent products of continuous parametrizations on domains with dense, codense, and natural totalities agree with dependent sums and dependent pro...
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
This paper explores the applicability of the new paradigm of Multi-dimensional Dynamic Logic Programming to represent an agent’s view of the combination of societal knowledge dyn...
We propose a general scheme for the cooperation of different constraint solvers. A uniform interface for constraint solvers allows to formally specify information exchange between...