Abstract
In this paper, we consider high-level structures like graphs, Petri nets, and algebraic specifications and investigate two kinds of satisfiability of conditions and two kinds of rule matching over these structures. We show that, for weak adhesive HLR categories with class A of all morphisms and a class M of monomorphisms, strictly closed under decompositions, A- and M-satisfiability and A- and M-matching are expressively equivalent. The results are applied to the category of graphs, where M is the class of all injective graph morphisms. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Habel, A., & Pennemann, K. H. (2006). Satisfiability of high-level conditions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4178 LNCS, pp. 430–444). Springer Verlag. https://doi.org/10.1007/11841883_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
