activity
20102025
most citedTaming the Infinite Chase: Query Answering under Expressive Integrity Constraints

232 citations · 250 across the 9 of their papers we have counts for

collaborators
Showing 2019 · cs.CCShow all

1 paper · 2 filters

cs.CC2019

Regular resolution for CNFs with almost bounded one-sided treewidth

Andrea Cali, Igor Razgon

We introduce a one-sided incidence tree decomposition of a CNF . This is a tree decomposition of the incidence graph of where the underlying tree is rooted and the set of ba…