نتایج جستجو برای: constraint theory
تعداد نتایج: 847011 فیلتر نتایج به سال:
The problems that deserve an attack demonstrate it by a counterattack. Abstract Andr eka and Maddux (1994, Notre Dame Journal of Formal Logic, 35(4)) classiied the small relation algebras | those with at most 8 elements, or in other terms, at most 3 atomic relations. They showed that there are eighteen isomorphism types of small relation algebras, all representable. For each simple, small relat...
In contrast to standard constraint satisfaction problems (CSPs) practical applications often require both, the management of changing validity of constraints and variables. Based on experiences made with the development of a commercial nurse scheduling system this paper suggests the application of local optimization algorithms for knowledge-based conngura-tion systems, which strongly rely on dy...
Optimality Theory is a constraint-based theory of phonology which allows constraints to conflict and to be violated. Consequently, implementing the theory presents problems for declarative constraint-based processing frameworks. On the basis of two regularity assumptions, that sets are regular and that constraints can be modelled by transducers, this paper presents and proves correct algorithms...
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-categorical structure, then maximal constraint languages are in...
We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major structural CSP decomposition methods. We then introduce a new class of tractable CSPs based on the concept of hypertree decomposition recently developed in Database Theory, and analyze the cost of solving CSPs having bounded hypertree-width. We provide a framework for compa...
Outline Outline Restatement Restatement of of the differences between the differences between legal rules and legal rules and legal legal principles principles Theory of coherence as constraint Theory of coherence as constraint satisfaction satisfaction applied to applied to legal reasoning legal reasoning (a (a glimpse glimpse)) Case study Case study
In terms of non-commutative geometry, we show that the σ–model can be built up by the gauge theory on discrete group Z2. We introduce a constraint in the gauge theory, which lead to the constraint imposed on linear σ model to get nonlinear σ model .
Random constraint satisfaction problems (CSPs) have been widely studied both in AI and complexity theory. Empirically and theoretically, many random CSPs have been shown to exhibit a phase transition. As the ratio of constraints to variables passes certain thresholds, they transition from being almost certainly satisfiable to unsatisfiable. The exact location of this threshold has been thorough...
Constraint handling is not straightforward in evolutionary algorithms (ea) since the usual search operators, mutation and recombination, are ‘blind’ to constraints. Nevertheless, the issue is highly relevant, for many challenging problems involve constraints. Over the last decade numerous eas for solving constraint satisfaction problems (csp) have been introduced and studied on various problems...
We construct the 12-dimensional exceptional field theory associated to the group SL(2)× R. Demanding the closure of the algebra of local symmetries leads to a constraint, known as the section condition, that must be imposed on all fields. This constraint has two inequivalent solutions, one giving rise to 11-dimensional supergravity and the other leading to F-theory. Thus SL(2) × R exceptional f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید