709 search results - page 45 / 142 » In-stroke word completion |
158
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
137
Voted
TCS
2011
14 years 10 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
99
Voted
SIAMMAX
2010
14 years 10 months ago
2010
We investigate the structural, spectral, and sparsity properties of Stochastic Galerkin matrices as they arise in the discretization of linear differential equations with random co...
149
Voted
ACL
2012
13 years 6 months ago
2012
“Lightweight” semantic annotation of text calls for a simple representation, ideally without requiring a semantic lexicon to achieve good coverage in the language and domain. ...
129
Voted
ENTCS
2007
15 years 3 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...