We extend the tractable DL-Lite languages by (i) relaxing the restriction on the allowed interaction between cardinality constraints and role inclusions; (ii) extending the languages with attributes and datatypes. On the one hand, we push the limits of the use of cardinality constraints over role hierarchies and also show effects of the ABox on allowed cardinality constraints. On the other hand...

Weight and cardinality constraints constitute a very useful programming construct widely adopted in Answer Set Programming (ASP). In recent work we have proposed RASP, an extension to plain ASP where complex forms of preferences can be flexibly expressed. In this paper, we illustrate an application of these preferences within weight/cardinality constraints. We emphasize, mainly by simple exampl...

In this paper, we study the joint bandwidth allocation and path selection problem, which is an extension of well-known network utility maximization (NUM) via solving a multi-objective minimization problem under cardinality constraints. Specifically, such formulation captures various types objectives including proportional fairness, average delay, as well load balancing. addition, in order to ha...

Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. This paper proposes an approach based on cardinality constraints, derived a-priori from the application domain, which may bound either the cardinality of a view or the ratio between the cardinalities of two views. We face the problem by first computing satisfactory bounds for ...

Abstract This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for solution optimization problems with geometric constraints. Specifically, we study situations where parts constraints are nonconvex possibly complicated, but allow a fast computation projections onto this set. Typical problem classes which satisfy requirement disjunctive (like comp...

XML Schema supports the specification of occurrence constraints by declaring values for its min/maxOccurs attributes. These constraints are structural in the sense that they restrict the cardinality of children elements independently of the data that is present in their subtrees. Thus, occurrence constraints do not address any data semantics and are therefore only of limited interest to data mo...