81 search results - page 6 / 17 » Approximating module semantics with constraints |
82
Voted
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
CODES
2005
IEEE
15 years 3 months ago
2005
IEEE
Sensor network applications face continuously changing environments, which impose varying processing loads on the sensor node. This paper presents an online control method which a...
106
click to vote
ESOP
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
108
click to vote
WEBDB
2004
Springer
15 years 3 months ago
2004
Springer
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...