268 search results - page 22 / 54 » Generalized pattern matching using orbit decomposition |
ESOP
2007
Springer
15 years 6 months ago
2007
Springer
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we hav...
CORR
2000
Springer
14 years 11 months ago
2000
Springer
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
CHI
2006
ACM
16 years 4 days ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...