2225 search results - page 263 / 445 » Logical Structures in the Lexicon |
146
click to vote
IJCAI
1989
15 years 7 months ago
1989
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...
149
click to vote
COGSCI
2008
15 years 6 months ago
2008
We propose a new model of human concept learning that provides a rational analysis for learning of feature-based concepts. This model is built upon Bayesian inference for a gramma...
154
click to vote
ENTCS
2008
15 years 6 months ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
144
click to vote
ENTCS
2008
15 years 6 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
167
click to vote
ENTCS
2006
15 years 6 months ago
2006
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...