On the Complexity of Finding Set Repairs for Data-Graphs

DOI10.1613/jair.1.13994arXiv2206.07504OpenAlexW4362457061MaRDI QIDQ6135957

Sergio Abriola, Unnamed Author, Nina Pardal, Maria Vanina Martinez, Unnamed Author

Publication date: 28 August 2023

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.07504

zbMATH Keywords

uncertaintyautomated reasoningknowledge representation

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• On the data complexity of consistent query answering
• Prioritized repairing and consistent query answering in relational databases
• Regular path queries with constraints
• Path constraints in semistructured databases
• Inconsistency-tolerant query answering for existential rules
• On the data complexity of consistent query answering over graph databases
• Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases
• Querying Graphs with Data
• XML data exchange
• Answer sets for consistent query answering in inconsistent databases

This page was built for publication: On the Complexity of Finding Set Repairs for Data-Graphs