output
20142024
most citedModel Interpretability through the Lens of Computational Complexity

38 citations

researchers with a paper here
collaborating institutions
Showing 2014 · cs.DBShow all

1 paper · 2 filters

cs.DB2014★ 6 cited

Query Containment for Highly Expressive Datalog Fragments

Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph

The containment problem of Datalog queries is well known to be undecidable. There are, however, several Datalog fragments for which containment is known to be decidable, most notab…