Consistent answers of self-join-free conjunctive queries over naturally ordered positive semirings are rewritable in the logic LK exactly when the query's attack graph is acyclic, generalizing the Boolean case.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Rewriting Consistent Answers on Annotated Data
Consistent answers of self-join-free conjunctive queries over naturally ordered positive semirings are rewritable in the logic LK exactly when the query's attack graph is acyclic, generalizing the Boolean case.