We consider problems in which several individuals each need to make a yes/no choice regarding a number of issues and these choices then need to be aggregated into a collective choice. Depending on the application at hand, different combinations of yes/no may be considered rational. We describe rationality assumptions as integrity constraints using a simple propositional language and we explore ...

The so-called Possible Models Approach (PMA) is a minimal change semantics for database updates. In this paper we give a sound and complete decision procedure for the PMA which is based on normal forming. We prove complexity results in particular for the case of updates restricted to conjunctions or disjunctions of literals. Finally, we sketch how integrity constraints can be taken into account.

Crowdsourcing e-market provides a lot of advantages to solve problems of organizations, companies and individuals. As a result, it’s important to develop an understanding of online reference group and participation behavior of crowd. The authors argue that reference group can obtain trustworthiness in the eyes of the crowd, such as integrity trustworthiness and ability trustworthiness. The trus...

In this paper we propose a model for checking integrity constraints of mobile databases called Three-Level (3-L) model, wherein the process of constraint checking to maintain the consistent state of mobile databases is realized at three different levels. Sufficient and complete tests proposed in the previous works together with the idea of caching relevant data items for checking the integrity ...

We are interested in the problem of validating the consistency of integrity constraints when data is modi ed. In particular, we consider how constraints can be checked with only \partial information". Partial information may include: (1) the constraint speci cations only, (2) the constraint speci cations and the modi ed data, or (3) the constraint speci cations, the modi ed data, and portions o...

We discuss the issue of dealing with integrity constraints over the global schema in data integration. On the one hand, integrity constraints can be used to extract more information from incomplete sources, similarly to the case of databases with incomplete information. On the other hand, integrity constraints raise the problem of dealing with the inconsistency of the whole system, due to contr...

Schema comparison is essential for integrating diierent database schemata. Since the semantics of a schema is also represented by its integrity constraints, they must be considered by a correct schema comparison method. Especially the extensional relationships between classes are determined by the relationship between the corresponding integrity constraint sets. In this paper, we work out the r...

We consider the problem of merging several belief bases in the presence of integrity constraints. We propose a logical characterization of operators having a majority behaviour or a consensual one. Then we give a representation theorem in terms of pre-orders on interpretations. We show the close connection between belief revision and merging operators and we show that our proposal extends the p...

In this work we expand upon the previous efforts to infer schema information from existing XML documents. We find the inference of structure to be sufficiently researched and focus further on integrity constraints. After briefly introducing some of them we turn our attention to ID/IDREF/IDREFS attributes in DTD. Building on the research by Barbosa and Menelzon (2003) we introduce a heuristic ap...

In this paper we present a refutation procedure to compute goals in a deductive database according to particular views of it. Views are deened by a set of constraints rules. The declarative semantics of the constrained database is deened and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation...