Sciweavers

3775 search results - page 1 / 755
» The Expression Problem Revisited
Sort
View
ECOOP
2004
Springer
13 years 10 months ago
The Expression Problem Revisited
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
Mads Torgersen
ICDT
2005
ACM
125views Database» more  ICDT 2005»
13 years 10 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu
LPNMR
2005
Springer
13 years 10 months ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar
ILP
2004
Springer
13 years 10 months ago
Macro-Operators Revisited in Inductive Logic Programming
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
Érick Alphonse
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
13 years 11 months ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan