We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
An important activity in the design of a particular database application consists in identifying the integrity constraints that must hold on the database, and that are used to det...
Karla A. V. Borges, Alberto H. F. Laender, Clodove...
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entitie...