Sciweavers

3809 search results - page 516 / 762
» Associative language descriptions
Sort
View
DLT
2006
15 years 8 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
CJ
2008
97views more  CJ 2008»
15 years 7 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
CORR
2010
Springer
198views Education» more  CORR 2010»
15 years 7 months ago
Space and the Synchronic A-Ram
Space is a spatial programming language designed to exploit the massive parallelism available in a formal model of computation called the Synchronic A-Ram, and physically related ...
Alexander Victor Berka
JCSS
2000
71views more  JCSS 2000»
15 years 7 months ago
Path Constraints in Semistructured Databases
We investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically ...
Peter Buneman, Wenfei Fan, Scott Weinstein
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 7 months ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts