Essays about: "SAT solving"
Showing result 1 - 5 of 14 essays containing the words SAT solving.
-
1. Explainable Product Configuration for Telecom via Constraint Reasoning
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Product Configuration is one of the most successful applications of Artificial Intelligence and is widely adopted in industry. Nowadays,intelligent systems not only have to be able to generate outputs but these outputs are desired to be understandable and interpretable to humans. READ MORE
-
2. Feature Extraction from an SMT Problem
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : One way of solving complex satisfiability problems is by using the method of SMT(Satisfiability Modulo Theories). For satisfiability problems that are harder to solve than trivial ones, we could very well save ourselves a lot of time if we choose the most suitable solver immediately. READ MORE
-
3. A Deep Neural Network Approach for Intersection Testing of Two 3D Meshes
University essay from Blekinge Tekniska Högskola/Institutionen för datavetenskapAbstract : Background. Neural Networks have mainly been used in behavior and gameplayrelated areas in games, but they have not yet been used specifically for intersection testing. This thesis explores the possibility to use deep neural networks for intersection testing of two 3D meshes. Objectives. READ MORE
-
4. Improving the Development of Safety Critical Software : Automated Test Case Generation for MC/DC Coverage using Incremental SAT-Based Model Checking
University essay from Linköpings universitet/Institutionen för datavetenskapAbstract : The importance and requirements of certifying safety critical software is today more apparent than ever. This study focuses on the standards and practices used within the avionics, automotive and medical domain when it comes to safety critical software. READ MORE
-
5. Solving Temporal CSPs via Enumeration and SAT Compilation
University essay from Linköpings universitet/Institutionen för datavetenskapAbstract : The constraint satisfaction problem (CSP) is a powerful framework used in theoretical computer science for formulating a multitude of problems. The CSP over a constraint language Γ (CSP(Γ)) is the decision problem of verifying whether a set of constraints based on the relations in Γ admits a satisfying assignment or not. READ MORE