{"type":"ScholarlyArticle","title":"On the Complexity of Finding Set Repairs for Data-Graphs (Abstract Reprint)","authors":[{"name":"Sergio Abriola","slug":"sergio-abriola","given":"Sergio","family":"Abriola","affiliation":"ICC CONICET , Universidad de Buenos Aires"},{"name":"Maria Vanina Martinez","slug":"maria-vanina-martinez","given":"María Vanina","family":"Martínez","affiliation":"ICC CONICET , Universidad de Buenos Aires"},{"name":"Nina Pardal","slug":"nina-pardal","given":"Nina","family":"Pardal","affiliation":"ICC CONICET , Universidad de Buenos Aires"},{"name":"Santiago Cifuentes","slug":"santiago-cifuentes","given":"Santiago","family":"Cifuentes","affiliation":"Departamento de Computación , Universidad de Buenos Aires {sabriola , mvmartinez , npardal ,"},{"name":"Edwin Pin Baque","slug":"edwin-pin-baque","given":"Edwin Pin","family":"Baque","affiliation":"Departamento de Computación , Universidad de Buenos Aires {sabriola , mvmartinez , npardal ,"}],"abstract":"In the deeply interconnected world we live in, pieces of information link domains all\r\naround us. As graph databases embrace effectively relationships among data and allow\r\nprocessing and querying these connections efficiently, they are rapidly becoming a popular\r\nplatform for storage that supports a wide range of domains and applications. As in the\r\nrelational case, it is expected that data preserves a set of integrity constraints that define\r\nthe semantic structure of the world it represents. When a database does not satisfy its\r\nintegrity constraints, a possible approach is to search for a ‘similar’ database that does\r\nsatisfy the constraints, also known as a repair. In this work, we study the problem of\r\ncomputing subset and superset repairs for graph databases with data values using a notion\r\nof consistency based on having a set of Reg-GXPath expressions as integrity constraints.\r\nWe show that for positive fragments of Reg-GXPath these problems admit a polynomialtime algorithm, while the full expressive power of the language renders them intractable.","doi":"10.24963/ijcai.2024/944","url":"https://ijcai.org/proceedings/2024/944","pdf":"https://ijcai.org/proceedings/2024/0944.pdf","markdown":"https://ijcai.org/proceedings/2024/944.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/944","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Journal Track","track":"Journal Track","number":944,"pages":{"first":8472,"last":8472},"keywords":["Journal Track: Journal Track"],"videos":[],"references":[{"position":1,"raw":"[Abriola et al., 2023] Sergio Abriola, María Vanina Martínez, Nina Pardal, Santiago Cifuentes, and Ed- win Pin Baque. On the complexity of finding set repairs for data-graphs. J. Artif. Intell. Res., 76:721-759, 2023.","title":"On the complexity of finding set repairs for data-graphs","authors":"Sergio Abriola, María Vanina Martínez, Nina Pardal, Santiago Cifuentes, Edwin Pin Baque","year":"2023","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}