306 search results - page 45 / 62 » Underspecified computation of normal forms |
APCSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
A popular trend in current software technology is to gain program portability by compiling programs to an inte form based on an abstract machine definition. Such approaches date b...
EXACT
2007
13 years 10 months ago
2007
This study describes a discourse approach to explanation aware knowledge representation. It presents a reasoning model that adheres to argumentation as found in written discourse,...
COMMA
2008
13 years 9 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
UAI
2000
13 years 9 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
DAGSTUHL
1996
13 years 9 months ago
1996
Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...