Batya Kenig

J. Artif. Intell. Res., 2025

2024

Enumeration of Minimal Hitting Sets Parameterized by Treewidth.

[BibT_eX]

[DOI]

Dan Shlomo Mizrahi

CoRR, 2024

2023

Ranked Enumeration of Minimal Separators.

[BibT_eX]

[DOI]

CoRR, 2023

Quantifying the Loss of Acyclic Join Dependencies.

[BibT_eX]

[DOI]

Nir Weinberger

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

2022

Integrity Constraints Revisited: From Exact to Approximate Implication.

[BibT_eX]

[DOI]

Dan Suciu

Log. Methods Comput. Sci., 2022

2021

Efficiently enumerating minimal triangulations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Approximate implication with d-separation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries.

[BibT_eX]

[DOI]

Dan Suciu

Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

2020

Mining Approximate Acyclic Schemes from Relations.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

2019

The Complexity of the Possible Winner Problem with Partitioned Preferences.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Approximate Inference of Outcomes in Probabilistic Elections.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

The Complexity of the Possible Winner Problem over Partitioned Preferences.

[BibT_eX]

[DOI]

CoRR, 2018

A Query Engine for Probabilistic Preferences.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Conference on Management of Data, 2018

Probabilistic Inference Over Repeated Insertion Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Querying Probabilistic Preferences in Databases.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Efficiently Enumerating Minimal Triangulations.

[BibT_eX]

[DOI]

Nofar Carmeli

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

A Database Framework for Probabilistic Preferences.

[BibT_eX]

[DOI]

Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

2016

On the Enumeration of all Minimal Triangulations.

[BibT_eX]

[DOI]

Nofar Carmeli

CoRR, 2016

On the Enumeration of Tree Decompositions.

[BibT_eX]

[DOI]

Nofar Carmeli

Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, 2016

Exploiting the Hidden Structure of Junction Trees for MPE.

[BibT_eX]

[DOI]

Proceedings of the Beyond NP, 2016

2015

On the Impact of Junction-Tree Topology on Weighted Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Scalable Uncertainty Management - 9th International Conference, 2015

2013

MFIBlocks: An effective blocking algorithm for entity resolution.

[BibT_eX]

[DOI]

Inf. Syst., 2013

A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time.

[BibT_eX]

[DOI]

Ofer Strichman

Proceedings of the Scalable Uncertainty Management - 7th International Conference, 2013

2012

A practical approximation algorithm for optimal k-anonymity.

[BibT_eX]

[DOI]