7 citations · 24 across the 10 of their papers we have counts for
12 papers
RUBEN: Rule-Based Explanations for Retrieval-Augmented LLM Systems
Joel Rorseth, Parke Godfrey, Lukasz Golab +2
This paper demonstrates RUBEN, an interactive tool for discovering minimal rules to explain the outputs of retrieval-augmented large language models (LLMs) in data-driven applicati…
Rule-Based Explanations for Retrieval-Augmented LLM Systems
Joel Rorseth, Parke Godfrey, Lukasz Golab +2
If-then rules are widely used to explain machine learning models; e.g., "if employed = no, then loan application = rejected." We present the first proposal to apply rules to explai…
RAGE Against the Machine: Retrieval-Augmented LLM Explanations
Joel Rorseth, Parke Godfrey, Lukasz Golab +2
This paper demonstrates RAGE, an interactive tool for explaining Large Language Models (LLMs) augmented with retrieval capabilities; i.e., able to query external sources and pull r…
CREDENCE: Counterfactual Explanations for Document Ranking
Joel Rorseth, Parke Godfrey, Lukasz Golab +3
Towards better explainability in the field of information retrieval, we present CREDENCE, an interactive tool capable of generating counterfactual explanations for document rankers…
Efficient Discovery of Approximate Order Dependencies
Reza Karegar, Parke Godfrey, Lukasz Golab +3
Order dependencies (ODs) capture relationships between ordered domains of attributes. Approximate ODs (AODs) capture such relationships even when there exist exceptions in the data…
Answer Graph: Factorization Matters in Large Graphs
Zahid Abul-Basher, Nikolay Yakovets, Parke Godfrey +2
Our answer-graph method to evaluate SPARQL conjunctive queries (CQs) finds a factorized answer set first, an answer graph, and then finds the embedding tuples from this. This appro…
Discovering Domain Orders through Order Dependencies
Reza Karegar, Melicaalsadat Mirsafian, Parke Godfrey +4
Much real-world data come with explicitly defined domain orders; e.g., lexicographic order for strings, numeric for integers, and chronological for time. Our goal is to discover im…
Errata Note: Discovering Order Dependencies through Order Compatibility
Parke Godfrey, Lukasz Golab, Mehdi Kargar +2
A number of extensions to the classical notion of functional dependencies have been proposed to express and enforce application semantics. One of these extensions is that of order…
Guided Automated Learning for query workload re-Optimization
Guilherme Damasio, Vincent Corvinelli, Parke Godfrey +4
Query optimization is a hallmark of database systems enabling complex SQL queries of today's applications to be run efficiently. The query optimizer often fails to find the best pl…
Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization
Jaroslaw Szlichta, Parke Godfrey, Lukasz Golab +2
Integrity constraints (ICs) provide a valuable tool for expressing and enforcing application semantics. However, formulating constraints manually requires domain expertise, is pron…
Towards Query Optimization for SPARQL Property Paths
Nikolay Yakovets, Parke Godfrey, Jarek Gryz
The extension of SPARQL in version 1.1 with property paths offers a type of regular path query for RDF graph databases. Such queries are difficult to optimize and evaluate efficien…
Fundamentals of Order Dependencies
Jaroslaw Szlichta, Parke Godfrey, Jarek Gryz
Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies…