Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 35 for “"Constraint propagation"”.
-
Parallel constraint propagation
Interval constraints is a recently developed method used in numerical computation, and has many applications, such as solving systems of non-linear equations, complex function plotting, etc. An important aspect of solving a problem in terms of interval constraints is the constraint propagation …
-
Systems Statistical Engineering – Hierarchical Fuzzy Constraint Propagation
… set forth the Bayesian systemic hierarchical constraint propagation theoretical basis for modeling the amplification and attenuation effects of environmental constraints propagated into systemic variability and variety. In their conceptual development, they simplified the analysis to only …
-
Pseudo-Boolean proof logging for constraint propagation algorithms
… new proof logging techniques in the area of constraint programming (CP). CP is a powerful algorithmic paradigm for modelling and solving problems expressed in terms of variables; possible values for those variables; and constraints on allowed combinations of values. The field has matured over …
-
Constraint propagation and variable ordering heuristics for solving Constrained Partial CP-nets
… the partial CP-net along with user-defined hard constraints. This thesis contributes towards the improvement of the Search-Partial-CP algorithm along with the addition of functionality to increase usability. We address the challenges we face, in practice, when searching for a solution from a …
-
Improving support for generic programming in C# with associated types and constraint propagation
… in C# and Java use a sub-typing relation to constraint type parameters. Failing to encapsulate type parameters within generic interfaces and inability to encapsulate type constraints as part of an interface definition have been identified as deficiencies in the way this design choice has been …
-
Constraint programming: algorithms and systems
Constraint Programming aims at the easy declaration and fast resolution of Constraint Satisfaction Problems (CSPs) like course scheduling, radio link frequency assignment, etc. To solve the problems, Constraint Programming is based on search methods and constraint propagation. This dissertation …
-
APPLICATION OF FUZZY LOGIC TO PARTIAL CONSTRAINT SATISFACTION PROBLEM
Constraint-directed search techniques are an efficient approc1ch for solving constraint satisfaction problems (CSPs). These techniques usually use constraint propagation to simplify the original problem, and then employ intelligent backtracking to search for a solution, or all possible solutions, …
-
Conditional Preference Networks: Learning and Optimization
… the e ect of variable ordering heuristics and constraint propagation to the problem and show that a variable ordering heuristic augmented with constraint propagation yields a saving to the solving process.
-
Implementation and Applications of Ad Hoc Constraints
… successfully solve a combinatorial problem using constraint-based techniques (constraint programming), we need to represent the constraints and model the problem in a way that strong constraint propagation can be efficiently computed; also, we must devise a search strategy that explores the search …
-
Using Conflict and Support Counts for Variable and Value Ordering in CSPs
A Constraint Satisfaction Problem (CSP) is a very powerful framework for representing and solving constraint problems. Many real world computational problems in Artificial Intelligence and other areas of computer science can be formulated as CSPs. Problems such as scheduling and timetabling in …
-
Efficient satisfiability solver
… components: decision heuristics, Boolean constraint propagation, conflict analysis, restart, clause deletion and preprocessing. Various algorithms and implementations in each component will be discussed and analyzed. Then we propose a new backtracking strategy, partial backtracking, which …
-
BoilerModel: a qualitative model-based reasoning system implemented in Ada
… relationship ("first principles") and constraint propagation result in compact mode because there is no need for the extensive rule base found in conventional expert systems. Implementation in Ada permits the use of concurrent tasking to simulate simultaneous valve propagation found in …
-
Cusp Pattern Enumeration and Completion Search for Mixed-Platonic 3-Manifold
… embeddings to cusp cells via backtracking with constraint propagation. The cusp decomposes into strips whose structure is encoded as a cusp pattern—a combinatorial bracelet—with two cases distinguished by the shortest translation symmetry [4]. In the short-meridian case, patterns are binary …
-
Prioritized Unit Propagation and Extended Resolution Techniques for SAT Solvers
… need by proposing a new heuristic for Boolean Constraint Propagation (BCP), a key component of CDCL SAT solvers, and a novel, extensible, architectural design of an Extended Resolution (ER) SAT solver, a class of solvers that is more powerful than CDCL solvers. The impressive performance of …
-
Partitioning algorithms for induced subgraph problems
… These data structures enable fast, simple constraint propagation algorithms and very fast calculation of upper bounds. Versions of these algorithms for both sparse and dense graphs are described and implemented. The resulting algorithms are over an order of magnitude faster than the best …
-
Generic programming in Scala
… of generic methods. This issue led to repeated constraints, implicit instantiation failure and code verbosity increase. However, Scala's member types enabled constraint propagation and type aliasing, two significantly useful generic programming mechanisms.
-
Fast Static Learning and Inductive Reasoning with Applications to ATPG Problems
… of EDA applications. Techniques such as boolean constraint propagation for static learning and assume-then-verify approach to reason about inductive invariants have been possible due to efficient SAT solvers. Although a significant amount of research effort has been dedicated to the development …
-
Sports scheduling: an artificial intelligence approach
… solutions. The rst approach combines ACO with constraint processing techniques in order to handle the hard constraints of the TTP. The key component is creating a framework which uses forward-checking and con ict-directed backjumping to handle the constraints while using ACO for choosing the …
-
Adaptive strategies for solving contraint satisfaction problems
A major challenge in constraint programming is to develop efficient generic approaches to solve instances of the constraint satisfaction problem (CSP). In recent years adaptive approaches for solving CSPs have attracted the interest of many researchers. General speaking a strategy that uses the …
-
Incomplete information in RDF databases with an emphasis on the geospatial domain
… The RDFi framework is parameterized with a constraint language and serves for expressing partial knowledge about property values through the formulation of constraints. We give the syntax and formal semantics of RDFi and extend the compositional semantics of SPARQL to capture the new …
Page 1 of 2