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 102 for “"Constraint satisfaction problems"”.
-
Promise constraint satisfaction problems
… the complexity of various approximations of constraint satisfaction problems. In the constraint satisfaction problem (CSP), we are given a set of variables, a domain for the variables, and a set of constraints on those variables, and must construct an assignment of values from the domain to …
-
Promise constraint satisfaction problems
<p>The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of each constraint: a strict one and a weak one. Given the …
-
Probabilistic Techniques For Constraint Satisfaction Problems
Constraint satisfaction problems (CSPs) are at the core of many tasks with direct practical relevance, such as hardware and software verification, planning, and scheduling to name a few. The two main solution paradigms for solving such problems are based on backtrack-style search and local search. …
-
Search in weighted constraint satisfaction problems
A wide variety of real-world optimisation problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). Such problems are NP-hard and require an exponential amount of time to find the optimal solution. This thesis concentrates on the University Examination Timetabling Problem. A …
-
Interactive exploration of numerical constraint satisfaction problems
One of the problems of conventional numerical computation is rounding error. Interval methods like interval arithmetic and interval constraints automatically compute an estimate of the error for each real number. These methods have proved to be valuable in numerical computation because of their …
-
Threshold Phenomena in Random Constraint Satisfaction Problems
… k >= 3, is just one family of a large number of constraint satisfaction problems that are conjectured to have exact satisfiability thresholds, but for which the existence and location of these thresholds has yet to be proven. Of those problems for which we are able to prove an exact …
-
Resolution Complexity of Random Constraint Satisfaction Problems
The resolution complexity of random constraint satisfaction problems is a widely studied topic. This line of research started with a seminal paper by Chvátal and Szemeréd. They showed that for any ≥ 3, w.h.p. an unsatisfiable random -SAT instance has exponentially high resolution complexity when …
-
Bounded Width Dichotomies in Constraint Satisfaction Problems
… conjecture for finite structures, namely, the Constraint Satisfaction Problem (CSP) of a finite structure is either in P or NP-complete. We are interested in finding classes in which a stronger dichotomy exists; namely, where every structure has either bounded width or a hard CSP. We call this …
-
Learning SAT Encodings for Constraint Satisfaction Problems
Constraint programming addresses many interesting and challenging problems in our world, including recent applications to contexts as diverse as allocating refugee relief funds, short-term mine planning and hardware circuit design. Users define their problems in high-level modelling languages which …
-
Phase transition behaviour in constraint satisfaction problems
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment for every variable such that no constraints …
-
Valued Constraint Satisfaction Problems over Infinite Domains
… complexity of certain combinatorial optimisation problems called \emph{valued constraint satisfaction problems}, or \emph{VCSPs} for short. The requirements and optimisation criteria of these problems are expressed by sums of \emph{(valued) constraints} (also called \emph{cost functions}). More …
-
Solving Constraint Satisfaction Problems with Matrix Product States
… Since spin system Hamiltonians can be considered constraint satisfaction problems (CSPs), it follows that MPS should provide a versatile framework for studying a variety of general CSPs. In this thesis, we apply MPS to two types of CSP. First, use MPS to simulate adiabatic quantum computation …
-
Robustness and stability in dynamic constraint satisfaction problems
Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. It is well-known that many real life problems can be modeled as Constraint Satisfaction Problems (CSPs). Much effort has been spent to increase the efficiency of algorithms for solving …
-
Towards more efficient solution of conditional constraint satisfaction problems
The focus of the thesis is on improving solving constraint satisfaction problems (CSPs) that change with certain conditions. This special class of problems, which we call conditional CSPs, has proved very useful in modeling important applications, such product configuration and design, and …
-
Hybrid tractability of constraint satisfaction problems with global constraints
<p>A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or intensionally, whether by an …
-
Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems
Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other …
Page 1 of 6