Database Paper Browser

Back to papers

Checking Consistency of Database Constraints: a Logical Basis

Summary: Introduces a logical basis for checking the consistency of a constraint set itself, independent of data. Finite satisfiability—admitting a finite set of stored and derivable facts—is semi-decidable; the paper links undecidability of consistency to this property and proposes two refutation-based methods extending existing refutation approaches to decide finite satisfiability and detect unsatisfiability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7728
Venue
VLDB
Year
1986
Pagerank
4.5455963e-05
Overall Rank
8,269 | 42.48%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,791 Semantic Modeling of Object Oriented Databases 1991 VLDB 4.9250521e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers