Search for dissertations about: "string constraint problems"
Found 4 swedish dissertations containing the words string constraint problems.
-
1. Other Things Besides Number : Abstraction, Constraint Propagation, and String Variable Types
Abstract : Constraint programming (CP) is a technology in which a combinatorial problem is modeled declaratively as a conjunction of constraints, each of which captures some of the combinatorial substructure of the problem. Constraints are more than a modeling convenience: every constraint is partially implemented by an inference algorithm, called a propagator, that rules out some but not necessarily all infeasible candidate values of one or more unknowns in the scope of the constraint. READ MORE
-
2. On Solving String Constraints
Abstract : Software systems are deeply involved in diverse human activities as everyone uses a variety of software systems on a daily basis. It is essential to guarantee that software systems all work correctly. Two popular methods for finding failures of software systems are testing and model checking. READ MORE
-
3. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search
Abstract : This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. READ MORE
-
4. On Cooperative Control of Automated Driving Systems from a Stability and Safety Perspective
Abstract : Over the last few decades, congested traffic network have become a seriousproblem in many countries. Congestions result in time losses, increase of fuelconsumption and also raise the risk of accidents. Intelligent transportationsystems may contribute to mitigate such problems. READ MORE