Given a constraint satisfaction problem (CSP) on n variables, x1, x2, . . . , xn ∈ {±1}, and m constraints, a global cardinality constraint has the form of ∑n i=1 xi = (1−2p)n, where p ∈ (Ω(1), 1−Ω(1)) and pn is an integer. Let AV G be the expected number of constraints satisfied by randomly choosing an assignment to x1, x2, . . . , xn, complying with the global cardinality constraint. The CSP ...

Analysis constraints and its diversity in security access control model. Cardinality is a common constraint in access control model. An extended cardinality constraint access control model is established. According to actual demand, we describe the user-role, user-session, role-session cardinality constraints based on the RBAC model. The differences between static and dynamic cardinality constr...

Abstract Formal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason the size of a given data structure. The Constraint Logic Programming tool $$\{ log\} $$ provides decision procedure deciding satisfiability formulas involving general forms sets, although it does not provide constraints. In this pa...

Edmonds' fundamental theorem on arborescences characterizes the existence of $k$ pairwise arc-disjoint spanning with prescribed root sets in a digraph. In this paper, we study problem packing branchings digraphs under cardinality constraints their by arborescence augmentation. Let $D=(V+x,A)$ be digraph, $\mathcal{P}=$ $\{I_{1}, \ldots, I_{l} \}$ partition $[k]$, $c_{1}, c_{l}, c'_{1}, c'_{l}$ ...

Copyright © 2002, Idea Group Publishing. Entity-Relationship (ER) schemas include cardinality constraints that restrict the dependencies among entities within a relationship type. The cardinality constraints have direct impact on application transactions, since insertions or deletions of entities or relationships might affect related entities. Application transactions can be strengthened to pre...

Entity Relationship (ER) schemas include cardinality constraints, that restrict the dependencies among entities within a relationship type. The cardinality constraints have direct impact on application transactions, since insertions or deletions of entities or relationships might affect related entities. Application transactions can be strengthened to preserve the consistency of a database with...

The length-lex representation has been recently proposed for representing sets in Constraint Satisfaction Problems. The length-lex representation directly captures cardinality information, provides a total ordering for sets, and allows bound consistency on unary constraints to be enforced in time Õ(c), where c is the cardinality of the set. However, no algorithms were given to enforce bound con...