Computing the Why-Provenance for Datalog Queries via SAT Solvers.

Marco Calautti Ester Livshits Andreas Pieris Markus Schneider

Published in: SEBD (2024)

Keyphrases

sat solvers
datalog queries
propositional satisfiability
orders of magnitude
max sat
search space
constraint satisfaction
search strategies
sat instances
sat problem
cardinality constraints
metadata
transitive closure
np complete
datalog programs
answer sets
recursive queries
database