8838 search results - page 139 / 1768 » Generalizing Domain Theory |
114
click to vote
SLP
1990
15 years 5 months ago
1990
We discuss the impact of Partial Evaluation within the framework of structured logic programming. We define a general scheme for Partial Evaluation to be applied to a wide class o...
112
click to vote
EOR
2010
15 years 4 months ago
2010
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
165
click to vote
AIMSA
2010
Springer
15 years 6 months ago
2010
Springer
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
153
Voted
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
134
click to vote
BIRTHDAY
2000
Springer
15 years 8 months ago
2000
Springer
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...