1916 search results - page 51 / 384 » Reasoning with class algebra |
ACMMPC
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We argue for the benefits of relations over functions for modelling programs, and even more so for modelling specifications. To support this argument, we present an ext...
ICMLA
2008
13 years 11 months ago
2008
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
EACL
1993
ACL Anthology
13 years 11 months ago
1993
ACL Anthology
This paper contributes to the theory of substructural logics .that are of interest to categorial grammarians. Combining semantic ideas of Hepple [1990] and Morrill [1990], proof-t...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
COLING
2002
13 years 9 months ago
2002
A detailed approach has been developed for core aspects of the task of understanding a broad class of metaphorical utterances. The utterances in question are those that depend on ...