Results 1  10
of
2,812
and Soft Constraints
 In Handbook of Satisfiability, chapter 19
, 2009
"... We study economies where some assets play an essential role to
nance consumption opportunities but payment arrangements are subject to a moral hazard problem. Agents can produce fraudulent assets at a positive cost, which generates an endogenous upper bound on the quantity of assets that can be ex ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
be exchanged for goods and services. This endogenous liquidity constraint depends on the characteristics of the assets, trading frictions, and policy. Our model o¤ers insights for asset prices and liquidity premia, the value of currency, the rate of return dominance, and the working of monetary policy.
Arc Consistency for Soft Constraints
 Artificial Intelligence
"... . Traditionally, local consistency is dened as a relaxation of consistency which can be checked in polynomial time. It is accompanied by a corresponding \ltering" or \enforcing" algorithm that computes in polynomial time, and from any given CSP, an equivalent unique CSP which satises t ..."
Abstract

Cited by 91 (27 self)
 Add to MetaCart
the local consistency property. The question whether the notion of local consistency can be extended to soft constraint frameworks has been addressed by several papers, in several settings [4, 14, 12]. The main positive conclusion of these works is that the notion of local consistency can be extended
Abstracting soft constraints
 PROC. 1999 ERCIM/COMPULOG NET WORKSHOP ON CONSTRAINTS, SPRINGER LNAI 1865
, 2000
"... We propose an abstraction scheme for soft constraint problems and we study its main properties. Processing the abstracted version of a soft constraint problem can help us in many ways: for example, to nd good approximations of the optimal solutions, or also to provide us with information that can m ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We propose an abstraction scheme for soft constraint problems and we study its main properties. Processing the abstracted version of a soft constraint problem can help us in many ways: for example, to nd good approximations of the optimal solutions, or also to provide us with information that can
Arc consistency for soft constraints
, 2001
"... The notion of arc consistency plays a central role in constraint satisfaction. It is known since [19, 4, 5] that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes n ..."
Abstract

Cited by 32 (8 self)
 Add to MetaCart
The notion of arc consistency plays a central role in constraint satisfaction. It is known since [19, 4, 5] that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes
The Complexity of Soft Constraint Satisfaction
, 2006
"... Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the complexity of a set of constraints to a corresponding ..."
Abstract

Cited by 44 (13 self)
 Add to MetaCart
corresponding set of algebraic operations, known as polymorphisms. In this paper we extend the analysis of complexity to the more general framework of combinatorial optimisation problems expressed using various forms of soft constraints. We launch a systematic investigation of the complexity of these problems
Imprecise Soft Constraint Problems
"... Abstract. We define intervalvalued soft constraints, where users can associate an interval of preference values, rather than a single value, to each instantiation of the variables of the constraints. This allows us to model a form of uncertainty and imprecision that is often found in reallife prob ..."
Abstract
 Add to MetaCart
Abstract. We define intervalvalued soft constraints, where users can associate an interval of preference values, rather than a single value, to each instantiation of the variables of the constraints. This allows us to model a form of uncertainty and imprecision that is often found in real
Imprecise Soft Constraint Problems
"... We define intervalvalued soft constraints, where users can associate an interval of preference values, rather than a single value, to each instantiation of the variables of the constraints. This allows us to model a form of uncertainty and imprecision that is often found in reallife problems. We ..."
Abstract
 Add to MetaCart
We define intervalvalued soft constraints, where users can associate an interval of preference values, rather than a single value, to each instantiation of the variables of the constraints. This allows us to model a form of uncertainty and imprecision that is often found in reallife problems. We
Imprecise Soft Constraint Problems
"... We define intervalvalued soft constraints, where users can associate an interval of preference values, rather than a single value, to each instantiation of the variables of the constraints. This allows us to model a form of uncertainty and imprecision that is often found in reallife problems. We ..."
Abstract
 Add to MetaCart
We define intervalvalued soft constraints, where users can associate an interval of preference values, rather than a single value, to each instantiation of the variables of the constraints. This allows us to model a form of uncertainty and imprecision that is often found in reallife problems. We
Scheduling with soft constraints
 in Proc. Int. Conf. on Computer Aided Design, 2009
"... In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, area, power, etc., so that the resulting RTL design is favorable in these aspects. The mechanism is often flawed in practi ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
in practice because many such constraints are actually soft constraints which are not necessary, and the constraint system may become inconsistent when many hard constraints are added for different purposes. This paper describes a scheduler that distinguishes soft constraints from hard constraints when
Modularity and Soft Constraints
, 2005
"... This thesis advocates a modular and parallel grammar architecture with declarative constraints on the syntactic, semantic, prosodic, and pragmatic structures which are derived in parallel while mutually constraining one another as proposed by Jackendoff (1997, 2002). The main claim of this thesis is ..."
Abstract
 Add to MetaCart
is that because of the many conflicting requirements among modules, the interfaces cannot employ crisp constraints. Instead, a softconstraint satisfaction approach is required. We also argue that simply violable constraints are insufficient to account for certain linguistic phenomena; there is need for graded
Results 1  10
of
2,812