Logo Logo
Switch Language to German

Bry, François and Manthey, Rainer (1986): Checking Consistency of Database Constraints. A Logical Basis. In: Kambayashi, Yahiko (ed.) : Very large data bases. Los Altos: Morgan Kaufman. pp. 13-20 [PDF, 1MB]

[thumbnail of 8461.pdf]
Download (1MB)


This paper addresses the problem of consistency of a set of integrity constraints itself, independent from any state. It is pointed out that database constraints have not only to be consistent, but in addition to be finitely satisfiable. This stronger property reflects that the constraints have to admit a finite set of (stored as well as derivable) facts. As opposed to consistency, being undecidable, finite satisfiability is semidecidable. For efficiency purposes we investigate methods that check both finite satisfiability as well as unsatisfiability . Two different methods are proposed which extend two alternative approaches to refutation.

Actions (login required)

View Item View Item