Search Results for author:
Found 5 papers, 3 papers with code
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width, noticeably, plain, generalized, and fractional hypertree width (hw, ghw, and fhw).
Databases
General and Fractional Hypertree Decompositions: Hard and Easy Cases
It is known that hw(H) <= k can be checked in polynomial time for fixed k, while checking ghw(H) <= k is NP-complete for any k greater than or equal to 3.
Databases Computational Complexity
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width, noticeably, plain, generalized, and fractional hypertree width (hw, ghw, and fhw).
Datalog: Bag Semantics via Set Semantics
This use of Datalog$^\pm$ is extended to give a set semantics to duplicates in Datalog$^\pm$ itself.
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research.
