Sciweavers

1445 search results - page 197 / 289
» Uniformly Hard Languages
Sort
View
OOPSLA
1995
Springer
15 years 7 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 7 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
ATAL
2006
Springer
15 years 6 months ago
On proactivity and maintenance goals
Goals are an important concept in intelligent agent systems, and can take a variety of forms. One such form is maintenance goals, which, unlike achievement goals, define states th...
Simon Duff, James Harland, John Thangarajah
AAAI
1990
15 years 5 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha
ECCC
2008
186views more  ECCC 2008»
15 years 4 months ago
Universal Semantic Communication II: A Theory of Goal-Oriented Communication
We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...
Brendan Juba, Madhu Sudan