1,349 results for Constraint · 0.156s

arxiv.org/abs/1002.3023v1

Rewriting Constraint Models with Metamodels

An important challenge in constraint programming is to rewrite constraint models into executable programs calculat- ing the solutions. This phase of constraint processing may require translations between constraint programming lan- guages, transfor...

Sponsored Partners
arxiv.org/abs/2511.11872v1

Decomposition and Preprocessing of Ternary Constraint Networks

Constraint programming is a general and exact method based on constraint propagation and backtracking search. We provide a function decomposing a constraint network into a ternary constraint network (TCN) with a reduced number of operators. TCNs are...

en.wikipedia.org/wiki/Constraint

Constraint - Wikipedia

Look up constraint in Wiktionary, the free dictionary. Constraint may refer to: Constraint (computer-aided design), a demarcation of geometrical characteristics

arxiv.org/abs/1401.5341v1

Domain Views for Constraint Programming

Views are a standard abstraction in constraint programming: They make it possible to implement a single version of each constraint, while avoiding to create new variables and constraints that would slow down propagation. Traditional constraint-progra...

arxiv.org/abs/1706.02025v1

Imposing Hard Constraints on Deep Networks: Promises and Limitations

Imposing constraints on the output of a Deep Neural Net is one way to improve the quality of its predictions while loosening the requirements for labeled training data. Such constraints are usually imposed as soft constraints by adding new terms to t...

arxiv.org/abs/1512.05331v1

A simpler way of imposing simplicity constraints

We investigate a way of imposing simplicity constraints in a holomorphic Spin Foam model that we recently introduced. Rather than imposing the constraints on the boundary spin network, as is usually done, one can impose the constraints directly on th...

arxiv.org/abs/2011.04886v4

Optimal Stopping with Expectation Constraints

We analyze an optimal stopping problem with a series of inequality-type and equality-type expectation constraints in a general non-Markovian framework. We show that the optimal stopping problem with expectation constraints (OSEC) in an arbitrary prob...

arxiv.org/abs/cs/0405100v1

Typing constraint logic programs

We present a prescriptive type system with parametric polymorphism and subtyping for constraint logic programs. The aim of this type system is to detect programming errors statically. It introduces a type discipline for constraint logic programs an...

arxiv.org/abs/1806.10654v1

Generalized chart constraints for efficient PCFG and TAG parsing

Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up chart parsers for PCFGs. We generalize chart constraints to more expressive grammar formalisms and describe a neural tagger which p...

arxiv.org/abs/1609.05221v5

Logical compactness and constraint satisfaction problems

We investigate a correspondence between the complexity hierarchy of constraint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures. It seems that the harder a constraint satisfaction problem is, th...

arxiv.org/abs/2004.14061v2

Constrained Nonsmooth Problems of the Calculus of Variations

The paper is devoted to an analysis of optimality conditions for nonsmooth multidimensional problems of the calculus of variations with various types of constraints, such as additional constraints at the boundary and isoperimetric constraints. To der...

arxiv.org/abs/2501.06900v2

Universal Constraints for Conformal Line Defects

We present a novel framework for deriving integral constraints for correlators on conformal line defects. These constraints emerge from the non-linearly realized ambient-space conformal symmetry. To validate our approach, we examine several examples...

arxiv.org/abs/1906.02394v3

Counting curves with local tangency constraints

We construct invariants for any closed semipositive symplectic manifold which count rational curves satisfying tangency constraints to a local divisor. More generally, we introduce invariants involving multibranched local tangency constraints. We giv...

arxiv.org/abs/gr-qc/9607044v1

Reality conditions for Ashtekar variables as Dirac constraints

We show that the reality conditions to be imposed on Ashtekar variables to recover real gravity can be implemented as second class constraints a la Dirac. Thus, counting gravitational degrees of freedom follows accordingly. Some constraints of the...

arxiv.org/abs/1203.1471v1

Developmental constraints on vertebrate genome evolution

Constraints in embryonic development are thought to bias the direction of evolution by making some changes less likely, and others more likely, depending on their consequences on ontogeny. Here, we characterize the constraints acting on genome evolut...

arxiv.org/abs/1508.06096v1

Unsatisfiable Cores and Lower Bounding for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, especially for soft-constraint opt...

arxiv.org/abs/1305.1690v1

Unsatisfiable Cores for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, especially for soft-constraint opt...

arxiv.org/abs/1304.1628v1

Pattern-Based Constraint Satisfaction and Logic Puzzles

Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of reasoning with t...

arxiv.org/abs/1501.01178v3

Constraint-based sequence mining using constraint programming

The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by the user. Many constraints have been proposed in the literature, but a...

github.com/androidx/constraintlayout

androidx/constraintlayout

ConstraintLayout is an Android layout component which allows you to position and size widgets in a flexible way (⭐ 1087)

en.wikipedia.org/wiki/Constraint_graph

Constraint graph - Wikipedia

In constraint satisfaction research in artificial intelligence and operations research, constraint graphs and hypergraphs are used to represent relations

arxiv.org/abs/1806.04325v2

Augmenting Stream Constraint Programming with Eventuality Conditions

Stream constraint programming is a recent addition to the family of constraint programming frameworks, where variable domains are sets of infinite streams over finite alphabets. Previous works showed promising results for its applicability to real-wo...