Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks.

Ivor T. A. Spence

Published in: ACM J. Exp. Algorithmics (2015)

Keyphrases

cardinality constraints
np complete
boolean algebra
functional dependencies
quantifier elimination
computational complexity
np hard
constraint query languages
entity relationship
phase transition
integrity constraints
constraint satisfaction