Sökning: "closure rule"
Visar resultat 1 - 5 av 7 avhandlingar innehållade orden closure rule.
1. Reasoning by Analogy - A Study on Analogy-Based Arguments in Law
Sammanfattning : This doctoral dissertation is a study on analogy-based arguments in law. Its overarching aim is to clarify reasoning by analogy in law. A model is proposed for analyzing and assessing arguments from analogy in law. LÄS MER
2. Diagnosis of interatrial shunts and the influence of patent foramen ovale on oxygen desaturation in obstructive sleep apnea
Sammanfattning : Patent foramen ovale (PFO) is found in 27% of the population and although mostly asymptomatic, PFO has been associated with e.g. cryptogenic stroke and, rarely, also with oxygen desaturation. PFO and atrial septal defects may nowadays be closed percutaneously without open heart surgery. LÄS MER
3. Fatigue of Spot Welded Joints: Experiments and Life Predictions
Sammanfattning : Methods to assess the fatigue strength of spot welds in built-up structures are used on a daily basis in the automotive industry. Efficient and reliable numerical methods make it possible to achieve designs with low weight, low manufacturing costs and good durability within short development cycles, since the number of prototypes built can be reduced. LÄS MER
4. Development and Evaluation of a Computerised Decision Support System for use in pre-hospital care
Sammanfattning : The aim of the thesis was to develop and evaluate a Computerised Decision Support System (CDSS) for use in pre-hospital care.The thesis was guided by a theoretical framework for developing and evaluating a complex intervention. The four studies used different designs and methods. LÄS MER
5. Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
Sammanfattning : In this thesis we study the worst-case time complexity of the constraint satisfaction problem parameterized by a constraint language (CSP(S)), which is the problem of determining whether a conjunctive formula over S has a model. To study the complexity of CSP(S) we borrow methods from universal algebra. LÄS MER