Sciweavers

1000 search results - page 77 / 200
» Nominal rewriting systems
Sort
View
FMCO
2005
Springer
101views Formal Methods» more  FMCO 2005»
14 years 1 months ago
Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
Gian Luigi Ferrari, Dan Hirsch, Ivan Lanese, Ugo M...
WADT
2004
Springer
14 years 1 months ago
Theoroidal Maps as Algebraic Simulations
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
Narciso Martí-Oliet, José Meseguer, ...
ECAL
2003
Springer
14 years 28 days ago
Representation of Genotype and Phenotype in a Coherent Framework Based on Extended L-Systems
A formal language approach for the specification of ALife models is presented. “Relational Growth Grammars” incorporate rulebased, procedural and object-oriented concepts. By ...
Ole Kniemeyer, Gerhard H. Buck-Sorlin, Winfried Ku...
ACL
2006
13 years 9 months ago
Event Extraction in a Plot Advice Agent
In this paper we present how the automatic extraction of events from text can be used to both classify narrative texts according to plot quality and produce advice in an interacti...
Harry Halpin, Johanna D. Moore
AIPS
1998
13 years 9 months ago
Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments
We present the application of the Planning by Rewriting PbR framework to query planning in distributed and heterogeneous environments. PbR is a new paradigm for e cient high-quali...
José Luis Ambite, Craig A. Knoblock