Results 1  10
of
528,889
Variable Elimination Method for Cardinality Constraint Formulas
"... Abstract. Cardinality constraints are important for describing many types of problems with sets. In the paper Cardinality Constraint Databases Dr. Revesz has proposed a variable elimination method for cardinality constraint formulas. In this project report the method proposed by Dr. Revesz, some imp ..."
Abstract
 Add to MetaCart
Abstract. Cardinality constraints are important for describing many types of problems with sets. In the paper Cardinality Constraint Databases Dr. Revesz has proposed a variable elimination method for cardinality constraint formulas. In this project report the method proposed by Dr. Revesz, some
Planning as satisfiability
 IN ECAI92
, 1992
"... We develop a formal model of planning based on satisfiability rather than deduction. The satis ability approach not only provides a more flexible framework for stating di erent kinds of constraints on plans, but also more accurately reflects the theory behind modern constraintbased planning systems ..."
Abstract

Cited by 505 (27 self)
 Add to MetaCart
We develop a formal model of planning based on satisfiability rather than deduction. The satis ability approach not only provides a more flexible framework for stating di erent kinds of constraints on plans, but also more accurately reflects the theory behind modern constraintbased planning
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization
, 2007
"... The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative ..."
Abstract

Cited by 561 (20 self)
 Add to MetaCart
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding
Alloy: A Lightweight Object Modelling Notation
, 2001
"... Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a setbased formula syntax powerful enough to express complex constraints and yet amenable to a fully automatic semantic analysis. Its meaning is given by tr ..."
Abstract

Cited by 458 (17 self)
 Add to MetaCart
Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a setbased formula syntax powerful enough to express complex constraints and yet amenable to a fully automatic semantic analysis. Its meaning is given
A filtering algorithm for constraints of difference in CSPs
 Proceedings of AAAI’94, the 12th (US) National Conference on Artificial Intelligence
, 1994
"... Abstract Many reallife Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. They are defined on a subset of variables by a set of tuples for which the values occuring in the same tuple are ..."
Abstract

Cited by 378 (6 self)
 Add to MetaCart
Abstract Many reallife Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. They are defined on a subset of variables by a set of tuples for which the values occuring in the same tuple
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization
Feature models, grammars, and propositional formulas
, 2005
"... Abstract. Feature models are used to specify members of a productline. Despite years of progress, contemporary tools provide limited support for feature constraints and offer little or no support for debugging feature models. We integrate prior results to connect feature models, grammars, and propo ..."
Abstract

Cited by 307 (14 self)
 Add to MetaCart
, and propositional formulas. This connection allows arbitrary propositional constraints to be defined among features and enables offtheshelf satisfiability solvers to debug feature models. We also show how our ideas can generalize recent results on the staged configuration of feature models.
Generalized Arc Consistency for Global Cardinality Constraint
"... A global cardinality constraint (gcc) is specified in terms of a set of variables X = fx1 ; :::; xpg which take their values in a subset of V = fv1 ; :::; vdg. It constrains the number of times a value v i 2 V is assigned toavariable in X to be in an interval (l i ;c i ). Cardinality constraints hav ..."
Abstract

Cited by 204 (11 self)
 Add to MetaCart
A global cardinality constraint (gcc) is specified in terms of a set of variables X = fx1 ; :::; xpg which take their values in a subset of V = fv1 ; :::; vdg. It constrains the number of times a value v i 2 V is assigned toavariable in X to be in an interval (l i ;c i ). Cardinality constraints
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 326 (7 self)
 Add to MetaCart
paths are maps from the set of nonnegative reals to system states. To model finitestate systems we introduce timed graphs  statetransition graphs annotated with timing constraints. As our main result, we develop an algorithm for modelchecking, for determining the truth of a TCTLformula
Towards an optimal cnf encoding of boolean cardinality constraints
 In Proc. of the 11th Intl. Conf. on Principles and Practice of Constraint Programming (CP 2005
, 2005
"... Abstract. We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at least) k out of n propositional variables or formulae are true. We present a unifying framework for a whole f ..."
Abstract

Cited by 74 (1 self)
 Add to MetaCart
Abstract. We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at least) k out of n propositional variables or formulae are true. We present a unifying framework for a whole
Results 1  10
of
528,889