23 citations · 149 across the 34 of their papers we have counts for
11 papers · 1 filter
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer +2
We study the question of when we can provide direct access to the k-th answer to a Conjunctive Query (CQ) according to a specified order over the answers in time logarithmic in the…
Database Repairing with Soft Functional Dependencies
Nofar Carmeli, Martin Grohe, Benny Kimelfeld +2
A common interpretation of soft constraints penalizes the database for every violation of every constraint, where the penalty is the cost (weight) of the constraint. A computationa…
ViS-Á-ViS : Detecting Similar Patterns in Annotated Literary Text
Moshe Schorr, Oren Mishali, Benny Kimelfeld +1
We present a web-based system called ViS-Á-ViS aiming to assist literary scholars in detecting repetitive patterns in an annotated textual corpus. Pattern detection is made possibl…
The Shapley Value of Inconsistency Measures for Functional Dependencies
Ester Livshits, Benny Kimelfeld
Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data cleaning. Another goal i…
Approximate Denial Constraints
Ester Livshits, Alireza Heidari, Ihab F. Ilyas +1
The problem of mining integrity constraints from data has been extensively studied over the past two decades for commonly used types of constraints including the classic Functional…
Algorithmic Techniques for Necessary and Possible Winners
Vishal Chakraborty, Theo Delemazure, Benny Kimelfeld +3
We investigate the practical aspects of computing the necessary and possible winners in elections over incomplete voter preferences. In the case of the necessary winners, we show h…