Sciweavers

329 search results - page 55 / 66
» Automatic Proofs for Scalecharts
Sort
View
LPAR
2005
Springer
14 years 3 months ago
Termination of Fair Computations in Term Rewriting
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...
Salvador Lucas, José Meseguer
DALT
2004
Springer
14 years 3 months ago
Representational Content and the Reciprocal Interplay of Agent and Environment
Declarative modelling approaches in principle assume a notion of representation or representational content for the modelling concepts. The notion of representational content as di...
Tibor Bosse, Catholijn M. Jonker, Jan Treur
FOSSACS
2004
Springer
14 years 3 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
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...
Salvador Lucas
GCC
2003
Springer
14 years 3 months ago
Toward the Composition of Semantic Web Services
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...
Jinghai Rao, Xiaomeng Su
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
14 years 3 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
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...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...