Search Results for author:
Found 2 papers, 0 papers with code
Materializing Knowledge Bases via Trigger Graphs
The chase is a well-established family of algorithms used to materialize Knowledge Bases (KBs), like Knowledge Graphs (KGs), to tackle important tasks like query answering under dependencies or data cleaning.
Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting
On the other hand, global voting over non-$\mathcal{O}$-legal CP-nets has not carefully been analyzed, despite it was stated in the literature that a theoretical comparison between global and sequential voting was promising and a precise complexity analysis for global voting has been asked for multiple times.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
