Sciweavers

894 search results - page 3 / 179
» Universal Relations and
Sort
View
DAGSTUHL
2006
13 years 8 months ago
Recent Results in Universal and Non-Universal Induction
We present and relate recent results in prediction based on countable classes of either probability (semi-)distributions or base predictors. Learning by Bayes, MDL, and stochastic ...
Jan Poland
ACSC
2007
IEEE
14 years 1 months ago
Domination Normal Form - Decomposing Relational Database Schemas
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
Henning Köhler
RTA
2010
Springer
13 years 5 months ago
The Undecidability of Type Related Problems in Type-free Style System F
We consider here a number of variations on the System F, that are predicative second-order systems whose terms are intermediate between the Curry style and Church style. The terms ...
Ken-etsu Fujita, Aleksy Schubert
EJC
2003
13 years 8 months ago
A Dialogue Manager for Accessing Databases
We present a logic programming based dialogue system that enables the access in natural language to the heterogeneous external relational databases of the Évora University. The p...
Salvador Abreu, Paulo Quaresma, Luis Quintano, Ire...
NDJFL
2010
13 years 1 months ago
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
Kenshi Miyabe