673 search results - page 21 / 135 » Approximate coherence-based reasoning |
CONTEXT
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In this paper we propose to re-read the past work on formalizing context as the search for a logic of the relationships between partial, approximate, and perspectival the...
122
click to vote
AGP
1995
IEEE
15 years 5 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
124
Voted
FLOPS
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
NIPS
2008
15 years 3 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
126
click to vote
CP
2009
Springer
15 years 8 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...