In this paper we present a transformation of finite propositional default theories into socalled propositional argumentation systems. This transformation allows to characterize all notions of Reiter’s default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered wi...

The asymptotic performance of the linear MMSE detector for any finite observation window and any symbol impinging the observed signal is derived for asynchronous but chip synchronous CDMA systems with random spreading. Additionally, a multistage detector that does not suffer from windowing effects and performs as well as the correspondent detector in synchronous systems is proposed. In contrast...

Multiplicative Linear Logic for Resource Transformation Nets p. 81 The Parameterized Complexity of Some Problems in Logic and Linguistics p. 89 Foundations of Proof Search Strategies Design in Linear Logic p. 101 On Extreme Points of Convex Compact Turing Located Set p. 114 Application of Typed Lambda Calculi in the Untyped Lambda Calculus p. 129 Classes with Pairwise Equivalent Enumerations p....