{"id":"https://openalex.org/W7131802982","doi":"https://doi.org/10.46298/lmcs-22(1:10)2026","title":"Using weakest application conditions to rank graph transformations for graph repair","display_name":"Using weakest application conditions to rank graph transformations for graph repair","publication_year":2026,"publication_date":"2026-02-27","ids":{"openalex":"https://openalex.org/W7131802982","doi":"https://doi.org/10.46298/lmcs-22(1:10)2026"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-22(1:10)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(1:10)2026","pdf_url":"https://lmcs.episciences.org/17597/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/17597/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080629825","display_name":"Lars Fritsche","orcid":"https://orcid.org/0000-0003-4996-4639"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lars Fritsche","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045372801","display_name":"Alexander Lauer","orcid":"https://orcid.org/0009-0001-9077-9817"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Lauer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126955544","display_name":"Maximilian Kratz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maximilian Kratz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126964915","display_name":"Andy Sch\u00fcrr","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andy Sch\u00fcrr","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126952305","display_name":"Gabriele Taentzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gabriele Taentzer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5080629825"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79020979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 22, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.8999000191688538,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.8999000191688538,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.01889999955892563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.017400000244379044,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.6274999976158142},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.5564000010490417},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4918000102043152},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46639999747276306},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.45980000495910645},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.447299987077713},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.4424000084400177},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.42570000886917114}],"concepts":[{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.6274999976158142},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.5564000010490417},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4918000102043152},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46639999747276306},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.45980000495910645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44749999046325684},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.447299987077713},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.4424000084400177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4399999976158142},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4343999922275543},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.42570000886917114},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41280001401901245},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.412200003862381},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.36500000953674316},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.33719998598098755},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.30309998989105225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29330000281333923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29319998621940613},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.2919999957084656},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.2669000029563904},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.26589998602867126},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-22(1:10)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(1:10)2026","pdf_url":"https://lmcs.episciences.org/17597/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-22(1:10)2026","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-22(1:10)2026","pdf_url":"https://lmcs.episciences.org/17597/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.41335564851760864}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7131802982.pdf","grobid_xml":"https://content.openalex.org/works/W7131802982.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"When":[0],"using":[1],"graphs":[2],"and":[3,58,78,119,137,183],"graph":[4,26,71,102,122,152,159,165],"transformations":[5,153],"to":[6,33,44,82,155],"model":[7],"systems,":[8],"consistency":[9,15,45],"is":[10,27],"an":[11,42],"important":[12],"concern.":[13],"While":[14],"has":[16,40],"primarily":[17],"been":[18],"viewed":[19],"as":[20,46],"a":[21,25,34,47,56,67,121],"binary":[22],"property,":[23],"i.e.,":[24],"consistent":[28],"or":[29],"inconsistent":[30],"with":[31,53,74,148,172],"respect":[32],"set":[35],"of":[36,95,114,134,176,181],"constraints,":[37],"recent":[38],"work":[39],"presented":[41],"approach":[43],"graduated":[48],"property.":[49],"This":[50,141],"allows":[51],"living":[52],"inconsistencies":[54,65],"for":[55,146,158],"while":[57],"repairing":[59,64],"them":[60],"when":[61],"necessary.":[62],"For":[63],"in":[66,179],"graph,":[68],"we":[69],"use":[70],"transformation":[72,123],"rules":[73,171],"so-called":[75],"{\\em":[76],"impairment-indicating":[77,136],"repair-indicating":[79,138],"application":[80,139,177],"conditions}":[81],"understand":[83],"how":[84],"much":[85],"repair":[86,166],"gain":[87],"certain":[88],"rule":[89],"applications":[90],"would":[91],"bring.":[92],"Both":[93],"types":[94,175],"conditions":[96,178],"can":[97,125,167],"be":[98,126,168],"derived":[99],"from":[100],"given":[101],"constraints.":[103],"Our":[104],"main":[105],"theorem":[106],"shows":[107,163],"that":[108,150,164],"the":[109,112,129,132,144],"difference":[110,130],"between":[111,131],"number":[113],"actual":[115],"constraint":[116],"violations":[117],"before":[118],"after":[120],"step":[124],"characterised":[127],"by":[128,170],"numbers":[133],"violated":[135],"conditions.":[140],"theory":[142],"forms":[143],"basis":[145],"algorithms":[147],"look-ahead":[149],"rank":[151],"according":[154],"their":[156],"potential":[157],"repair.":[160],"An":[161],"evaluation":[162],"well-supported":[169],"these":[173],"new":[174],"terms":[180],"effectiveness":[182],"scalability.":[184]},"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2026-02-27T00:00:00"}