Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding is inefficient, so many authors has proposed specialized algorithms : the pseudo-boolean solvers. In this paper we show that an appropriate pure CNF encoding can be competitive with these specialized methods. In conjunction wi...

We address the problem of answering conjunctive queries (CQs) over extended Entity-Relationship schemata, which we call EER (Extended ER) schemata, with is-a among entities and relationships, and cardinality constraints. This is a common setting in conceptual data modelling, where reasoning over incomplete data with respect to a knowledge base is required. We adopt a semantics for EER schemata ...

Note: This version is a preliminary draft. Comments and suggestions are welcome. Abstract Predicting gene structure requires search within a combinatorially large space of possible gene structures. The search space may be narrowed by two types of computational tools: optimality criteria and consistency constraints. Consistency constraints are requirements concerning reading frame and stop codon...

In this paper we extend the traditional Dung framework for argumentation with cardinality constraints over the set of warranted arguments. This results in a new definition for argumentation semantics wherein arguments within an extension are both in some sense consistent and compliant with the constraints imposed on the system. After discussing the theoretical aspects of such a resource-bounded...

We study the Slide meta-constraint. This slides a constraint down one or more sequences of variables. We show that Slide can be used to encode and propagate a wide range of global constraints. We consider a number of extensions including sliding down sequences of set variables, and combining Slide with a global cardinality constraint. We also show how to propagate Slide. Our experiments demonst...

This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the produced formula can be exponentially related to the size of the input constraint, but some important classes of pseudo-Boolean constraints, including Boolean cardinality constraints, are encoded in polynomial time and ...

Feature modeling is a common framework for software design. A feature model is a graphical structure presenting a hierarchical decomposition of features, called a feature diagram, with some possible crosscutting constraints between them. Feature modeling languages are grouped into basic and cardinality-based feature models. Cardinalitybased feature models subsume basic ones. In this paper, we p...

Software product line engineering is a very common method for designingcomplex software systems. Feature modeling is the most common approach tospecify product lines. The main part of a feature model is a special tree offeatures called a feature diagram. Cardinality-based feature diagrams providethe most expressive tool among the current feature diagram languages. Themost co...

We apply the logic-based declarative programming approach of Model Expansion (MX) to a phylogenetic inference task. We axiomatize the task in multi-sorted first-order logic with cardinality constraints. Using the model expansion solver MXG and SAT+cardinality solver MXC, we compare the performance of several MX axiomatizations on a challenging set of test instances. Our methods perform orders o...

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted universal role quantifications, set union, intersection, subset and disjointness. A sound, complete and terminating consistency checking procedure is provided to...