Dominance constraints are a language of tree descriptions. Tree descriptions are widely used in computational linguistics for talking and reasoning about trees. While previous research has focused on the conjunctive fragment, we now extend the account to all Boolean connectives and propose a new formalism that combines dominance constraints with a feature tree logic. Although the satisfiability...

Assessment of the correctness of software models is a key issue to ensure the quality of the final application. To this end, this paper presents an automatic method for the verification of UML class diagrams extended with OCL constraints. Our method checks compliance of the diagram with respect to several correctness properties including weak and strong satisfiability or absence of constraint r...

While Robust Model Predictive Control considers the worst-case system uncertainty, Stochastic Control, using chance constraints, provides less conservative solutions by allowing a certain constraint violation probability depending on predefined risk parameter. However, for safety-critical systems it is not only important to bound but reduce this as much possible. Therefore, an approach necessar...

B-coloring is a theoretical optimization problem on graph that, top of being used to model some real-world applications, exploited by bounding techniques embedded into solvers for the classical coloring problem. This implies that improved solutions b-coloring have an impact even larger pool practical applications modelled in several different fields such as scheduling, timetabling and telecommu...