B Properties of the Declarative System 23 1 Lemma (Declarative Weakening) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 2 Lemma (Declarative Term Substitution) . . . . . . . . . . . . . . . . . . . . . . . . 23 3 Lemma (Reflexivity of Declarative Subtyping) . . . . . . . . . . . . . . . . . . . . . 23 4 Lemma (Subtyping Inversion) . . . . . . . . . . . . . . . . . . . . . . . . . ....

In this paper, we review Icarus, a cognitive architecture that utilizes hierarchical skills and concepts for reactive execution in physical environments. In addition, we present two extensions to the framework. The first involves the incorporation of means-ends analysis, which lets the system compose known skills to solve novel problems. The second involves the storage of new skills that are ba...

This paper employs Data Envelopment Analysis to measure for the first time the performance of Greek domestic equity mutual funds over four different one-year horizons and for the whole four-year period. In particular, the model used examines whether fund managers employ inputs (i.e. assets, loads, and risk) efficiently to produce output (returns). The results demonstrate that the efficient fund...

In the above paper, Lemma (4), on page 2659 play the key role for deriving the main results in the paper. The statement as well as the proof of Lemma (4), page 2659, [1] is not correct. Here mainly two serious errors in this Lemma, one is in the statement of lemma and the other one in the proof of Lemma (4), on page 2666, [1]. In the Lemma (4), page 2659, [1], Wan and Yi, states the lemma as fo...

Björklund and Husfeldt developed a randomized polynomial time algorithm to solve the shortest two disjoint paths problem. Their algorithm is based on computation of permanents modulo 4 and the isolation lemma. In this paper, we consider the following generalization of the shortest two disjoint paths problem, and develop a similar algebraic algorithm. The shortest perfect (A + B)-path packing pr...

Introduction 1 1 Languages 3 1.1 Notation and examples . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 Grammars . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.2 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3 Ambiguity . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.1.4 Reduced grammars, normal forms . . . . . . . . . . . . . . . 6 1.1...

we show that in {bf zf} set theory without choice, the ultrafilter mbox{principle} ({bf up}) is equivalent to several compactness theorems for alexandroff discrete spaces and to rudin's lemma, a basic tool in topology and the theory of quasi-continuous domains. important consequences of rudin's lemma are various lift lemmas, saying that certain properties of posets are inherited by th...