329 search results - page 55 / 66 » Automatic Proofs for Scalecharts |
100
Voted
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
DALT
2004
Springer
15 years 6 months ago
2004
Springer
Declarative modelling approaches in principle assume a notion of representation or representational content for the modelling concepts. The notion of representational content as di...
138
Voted
FOSSACS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
92
Voted
GCC
2003
Springer
15 years 5 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
66
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...