207 search results - page 27 / 42 » Synthesizing Switching Logic Using Constraint Solving |
SAS
2005
Springer
15 years 5 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
ICWS
2003
IEEE
15 years 1 months ago
2003
IEEE
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
DATE
1999
IEEE
15 years 4 months ago
1999
IEEE
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...
TIME
1994
IEEE
15 years 3 months ago
1994
IEEE
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...
ISAAC
1992
Springer
15 years 3 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...