109 search results - page 11 / 22 » Commonsense Reasoning in and Over Natural Language |
CSL
2004
Springer
15 years 3 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
DLOG
2003
14 years 11 months ago
2003
The Semantic Web initiative defines important challenges for knowledge representation and database systems. Recently, several standards for representation languages have been pro...
85
Voted
LACL
2001
Springer
15 years 2 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
OOPSLA
2010
Springer
14 years 8 months ago
2010
Springer
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...