Results 1  10
of
1,177,308
Entailment with conditional equality constraints
 In Proceedings of European Symposium on Programming
, 2001
"... Abstract Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complex ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete
The complexity of equality constraint languages
 CORNELL UNIVERSITY
, 2006
"... We apply the algebraic approach to infinitevalued constraint satisfaction to classify the computational complexity of all constraint satisfaction problems with templates that have a highly transitive automorphism group. A relational structure has such an automorphism group if and only if all the c ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
the constraint types are Boolean combinations of the equality relation, and we call the corresponding constraint languages equality constraint languages. We show that an equality constraint language is tractable if it admits a constant unary or an injective binary polymorphism, and is NPcomplete otherwise.
Quantified equality constraints
 In Proceedings of LICS’07
, 2007
"... An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality template ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality
The Complexity of Equality Constraint Languages
"... Abstract. We apply the algebraic approach to infinitevalued constraint satisfaction to classify the computational complexity of all constraint languages where the constraint types are Boolean combinations of the equality relation. We show that such a constraint language is tractable if it admits a ..."
Abstract
 Add to MetaCart
Abstract. We apply the algebraic approach to infinitevalued constraint satisfaction to classify the computational complexity of all constraint languages where the constraint types are Boolean combinations of the equality relation. We show that such a constraint language is tractable if it admits a
Control Problems with Equality Constraints
"... Optimization methods that employ the classical PowellHestenesRockafellar Augmented Lagrangian are useful tools for solving Nonlinear Programming problems. Their reputation decreased in the last ten years due to the comparative success of InteriorPoint Newtonian algorithms, which are asymptoticall ..."
Abstract
 Add to MetaCart
Optimization methods that employ the classical PowellHestenesRockafellar Augmented Lagrangian are useful tools for solving Nonlinear Programming problems. Their reputation decreased in the last ten years due to the comparative success of InteriorPoint Newtonian algorithms, which are asymptotically faster. In the present research a combination of both approaches is evaluated. The idea is to produce a competitive method, being more robust and efficient than its ”pure ” counterparts for critical problems. Moreover, an additional hybrid algorithm is defined, in which the Interior Point method is replaced by the Newtonian resolution of a KKT system identified by the Augmented
The Learnability of Description Logics with Equality Constraints
 Machine Learning
, 1994
"... Although there is an increasing amount of experimental research on learning concepts expressed in firstorder logic, there are still relatively few formal results on the polynomial learnability of firstorder representations from examples. Most previous analyses in the pacmodel have focused on s ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
Although there is an increasing amount of experimental research on learning concepts expressed in firstorder logic, there are still relatively few formal results on the polynomial learnability of firstorder representations from examples. Most previous analyses in the pacmodel have focused on subsets of Prolog, and only a few highly restricted subsets have been shown to be learnable. In this paper, we will study instead the learnability of the restricted firstorder logics known as "description logics", also sometimes called "terminological logics" or "KLONEtype languages". Description logics are also subsets of predicate calculus, but are expressed using a different syntax, allowing a different set of syntactic restrictions to be explored. We first define a simple description logic, summarize some results on its expressive power, and then analyze its learnability. It is shown that the full logic cannot be tractably learned. However, syntactic restrictions exist that enable tractable learning from positive examples alone, independent of the size of the vocabulary used to describe examples. The learnable sublanguage appears to be incomparable in expressive power to any subset of firstorder logic previously known to be learnable.
filtering in the presence of state space equality constraints
 in IEEE Proceedings of the 26th Chinese Control Conference, July 2007, arXiv:physics.aoph/0705.4563, Oxford natr:07/14
"... Abstract: We discuss two separate techniques for Kalman Filtering in the presence of state space equality constraints. We then prove that despite the lack of similarity in their formulations, under certain conditions, the two methods result in mathematically equivalent constrained estimate structure ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract: We discuss two separate techniques for Kalman Filtering in the presence of state space equality constraints. We then prove that despite the lack of similarity in their formulations, under certain conditions, the two methods result in mathematically equivalent constrained estimate
On Distributed Convex Optimization Under Inequality and Equality Constraints
 UNIVERSITY OF CALIFORNIA, SAN DIEGO (UC SAN
, 2012
"... We consider a general multiagent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set. The objective function is defined by a sum of local objective ..."
Abstract

Cited by 49 (8 self)
 Add to MetaCart
We consider a general multiagent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set. The objective function is defined by a sum of local
State estimation for linear systems with state equality constraints
 Automatica
, 2007
"... Abstract: This paper deals with the state estimation problem for linear systems with state equality constraints. Using noisy measurements which are available from the observable system, we construct the optimal estimate which also satisfies linear equality constraints. For this purpose, after review ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract: This paper deals with the state estimation problem for linear systems with state equality constraints. Using noisy measurements which are available from the observable system, we construct the optimal estimate which also satisfies linear equality constraints. For this purpose, after
Results 1  10
of
1,177,308