Sciweavers

2944 search results - page 95 / 589
» On Well Quasi-orders on Languages
Sort
View
SIGMOD
1996
ACM
99views Database» more  SIGMOD 1996»
14 years 2 months ago
A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
Leonid Libkin, Rona Machlin, Limsoon Wong
AIR
2006
124views more  AIR 2006»
13 years 10 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
JLP
2007
89views more  JLP 2007»
13 years 9 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
TNN
1998
125views more  TNN 1998»
13 years 9 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
ALT
2004
Springer
14 years 7 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber