Sciweavers

1550 search results - page 59 / 310
» Benchmarking for Graph Transformation
Sort
View
137
Voted
ASP
2003
Springer
15 years 6 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
113
Voted
DATESO
2004
134views Database» more  DATESO 2004»
15 years 2 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
101
Voted
ICPR
2010
IEEE
14 years 11 months ago
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
Manuel Igelmo, Alberto Sanfeliu, Miquel Ferrer
108
Voted
ICWE
2007
Springer
15 years 7 months ago
Model Transformation for Service-Oriented Web Applications Development
In recent years, innovation in technologies such as web services, business process automation, etc., have motivated a new paradigm in the application development field to appear, k...
Valeria de Castro, Juan M. Vara, Esperanza Marcos
WADT
1998
Springer
15 years 4 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...