Sciweavers

23 search results - page 3 / 5
» Multi-Amalgamation in Adhesive Categories
Sort
View
GG
2008
Springer
13 years 8 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
FUIN
2006
132views more  FUIN 2006»
13 years 7 months ago
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Adhesive high-level replacement (HLR) systems are introduced as a new categorical framework for graph transformation in the double pushout (DPO) approach, which combines the well-k...
Hartmut Ehrig, Julia Padberg, Ulrike Prange, Anneg...
GG
2004
Springer
14 years 1 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
GG
2004
Springer
14 years 1 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...
IFIPTCS
2010
13 years 5 months ago
A Logic on Subobjects and Recognizability
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
Harrie Jan Sander Bruggink, Barbara König