Matches in SemOpenAlex for { <https://semopenalex.org/work/W4384808203> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W4384808203 abstract "Model-driven software engineering is a suitable method for dealing with the ever-increasing complexity of software development processes. Graphs and graph transformations have proven useful for representing such models and changes to them. These models must satisfy certain sets of constraints. An example are the multiplicities of a class structure. During the development process, a change to a model may result in an inconsistent model that must at some point be repaired. This problem is called model repair. In particular, we will consider rule-based graph repair which is defined as follows: Given a graph $G$, a constraint $c$ such that $G$ does not satisfy $c$, and a set of rules $R$, use the rules of $mathcal{R}$ to transform $G$ into a graph that satisfies $c$. Known notions of consistency have either viewed consistency as a binary property, either a graph is consistent w.r.t. a constraint $c$ or not, or only viewed the number of violations of the first graph of a constraint. In this thesis, we introduce new notions of consistency, which we call consistency-maintaining and consistency-increasing transformations and rules, respectively. This is based on the possibility that a constraint can be satisfied up to a certain nesting level. We present constructions for direct consistency-maintaining or direct consistency-increasing application conditions, respectively. Finally, we present an rule-based graph repair approach that is able to repair so-called emph{circular conflict-free constraints}, and so-called circular conflict-free sets of constraints. Intuitively, a set of constraint $C$ is circular conflict free, if there is an ordering $c_1, ldots, c_n$ of all constraints of $C$ such that there is no $j <i$ such that a repair of $c_i$ at all graphs satisfying $c_j$ leads to a graph not satisfying $c_j$." @default.
- W4384808203 created "2023-07-20" @default.
- W4384808203 creator A5045372801 @default.
- W4384808203 date "2023-07-18" @default.
- W4384808203 modified "2023-09-26" @default.
- W4384808203 title "Rule-based Graph Repair using Minimally Restricted Consistency-Improving Transformations" @default.
- W4384808203 doi "https://doi.org/10.48550/arxiv.2307.09150" @default.
- W4384808203 hasPublicationYear "2023" @default.
- W4384808203 type Work @default.
- W4384808203 citedByCount "0" @default.
- W4384808203 crossrefType "posted-content" @default.
- W4384808203 hasAuthorship W4384808203A5045372801 @default.
- W4384808203 hasBestOaLocation W43848082031 @default.
- W4384808203 hasConcept C105795698 @default.
- W4384808203 hasConcept C118615104 @default.
- W4384808203 hasConcept C122377713 @default.
- W4384808203 hasConcept C132525143 @default.
- W4384808203 hasConcept C137105694 @default.
- W4384808203 hasConcept C154945302 @default.
- W4384808203 hasConcept C178481205 @default.
- W4384808203 hasConcept C185429906 @default.
- W4384808203 hasConcept C199622910 @default.
- W4384808203 hasConcept C2524010 @default.
- W4384808203 hasConcept C2776036281 @default.
- W4384808203 hasConcept C2776436953 @default.
- W4384808203 hasConcept C31388003 @default.
- W4384808203 hasConcept C33923547 @default.
- W4384808203 hasConcept C41008148 @default.
- W4384808203 hasConcept C49937458 @default.
- W4384808203 hasConcept C558772884 @default.
- W4384808203 hasConcept C80444323 @default.
- W4384808203 hasConceptScore W4384808203C105795698 @default.
- W4384808203 hasConceptScore W4384808203C118615104 @default.
- W4384808203 hasConceptScore W4384808203C122377713 @default.
- W4384808203 hasConceptScore W4384808203C132525143 @default.
- W4384808203 hasConceptScore W4384808203C137105694 @default.
- W4384808203 hasConceptScore W4384808203C154945302 @default.
- W4384808203 hasConceptScore W4384808203C178481205 @default.
- W4384808203 hasConceptScore W4384808203C185429906 @default.
- W4384808203 hasConceptScore W4384808203C199622910 @default.
- W4384808203 hasConceptScore W4384808203C2524010 @default.
- W4384808203 hasConceptScore W4384808203C2776036281 @default.
- W4384808203 hasConceptScore W4384808203C2776436953 @default.
- W4384808203 hasConceptScore W4384808203C31388003 @default.
- W4384808203 hasConceptScore W4384808203C33923547 @default.
- W4384808203 hasConceptScore W4384808203C41008148 @default.
- W4384808203 hasConceptScore W4384808203C49937458 @default.
- W4384808203 hasConceptScore W4384808203C558772884 @default.
- W4384808203 hasConceptScore W4384808203C80444323 @default.
- W4384808203 hasLocation W43848082031 @default.
- W4384808203 hasOpenAccess W4384808203 @default.
- W4384808203 hasPrimaryLocation W43848082031 @default.
- W4384808203 hasRelatedWork W1510768092 @default.
- W4384808203 hasRelatedWork W1540444271 @default.
- W4384808203 hasRelatedWork W1557377862 @default.
- W4384808203 hasRelatedWork W2008412758 @default.
- W4384808203 hasRelatedWork W2030985429 @default.
- W4384808203 hasRelatedWork W2140769824 @default.
- W4384808203 hasRelatedWork W2186112877 @default.
- W4384808203 hasRelatedWork W3021103288 @default.
- W4384808203 hasRelatedWork W3038101674 @default.
- W4384808203 hasRelatedWork W2611003898 @default.
- W4384808203 isParatext "false" @default.
- W4384808203 isRetracted "false" @default.
- W4384808203 workType "article" @default.