Database design almost invariably includes a specification of a set of rules(the integrity constraints) which should guarantee its consistency. Provided that an adequate mechanism to express them is available, the following question arises: is there any way to populate a database which satisfies the constraints supplied by a designer? i.e., does the database schema, including constraints, admit at least one model in which all classes are non-empty? This work gives an answer to the above question in an OODB environment, providing a Data Definition Language (DDL) able to express the semantics of a relevant set of state constraints and a specialized reasoner able to check the consistency of a schema with such constraints.
Reasoning with constraints in Database Models / Beneventano, Domenico; Bergamaschi, Sonia; S., Lodi; C., Sartori. - STAMPA. - (1994), pp. 23-38. (Intervento presentato al convegno Sistemi Evoluti per Basi di Dati tenutosi a Rimini, Italy nel 6-8 June 1994).