Summary of On the Structure Of Game Provenance and Its Applications, by Shawn Bowers et al.
On the Structure of Game Provenance and its Applications
by Shawn Bowers, Yilin Xia, Bertram Ludäscher
First submitted to arxiv on: 7 Oct 2024
Categories
- Main: Artificial Intelligence (cs.AI)
- Secondary: None
GrooveSquid.com Paper Summaries
GrooveSquid.com’s goal is to make artificial intelligence research accessible by summarizing AI papers in simpler terms. Each summary below covers the same AI paper, written at different levels of difficulty. The medium difficulty and low difficulty versions are original summaries written by GrooveSquid.com, while the high difficulty version is the paper’s original abstract. Feel free to learn from the version that suits you best!
| Summary difficulty | Written by | Summary |
|---|---|---|
| High | Paper authors | High Difficulty Summary Read the original abstract here |
| Medium | GrooveSquid.com (original content) | Medium Difficulty Summary The paper presents a game-theoretic approach to understanding query evaluation in databases, focusing on first-order queries. The authors introduce a natural provenance model that unifies how and why-not provenance, and then study the fine-grain structure of this game-based provenance. They identify seven edge types that give rise to new kinds of provenance, including potential, actual, and primary edges, which are computed while solving games. The paper discusses applications, such as abstract argumentation frameworks. |
| Low | GrooveSquid.com (original content) | Low Difficulty Summary This research studies how databases answer queries by modeling it as a two-player game. The game has positions and moves, and the goal is to determine whether a tuple is included in the query result. The authors create a new model for understanding why certain tuples are or aren’t part of the answer. They identify different types of edges that explain this process, which can be used in other areas like abstract argumentation frameworks. |
