4128 search results - page 384 / 826 » Learning and using relational theories |
171
click to vote
ENTCS
2006
15 years 6 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
189
click to vote
JCT
2006
15 years 6 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
189
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
171
click to vote
JAPLL
2011
15 years 1 months ago
2011
The paper proposes a formal analysis of a theory of norms resulting from pulling together Anderson’s reduction, the analysis of counts-as, and a novel approach to the formal rep...
194
click to vote
GIS
2010
ACM
15 years 5 months ago
2010
ACM
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...