Avancerad sökning

Visar resultat 1 - 5 av 507 avhandlingar som matchar ovanstående sökkriterier.

  1. 1. Automated Computational Modeling

    Författare :Johan Jansson; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; multi-adaptivity; Galerkin; ODE; PDE; plasticity; elasticity; FEM; automated;

    Sammanfattning : This thesis is part of the FEniCS project of Automation of Computational Mathematical Modeling (ACMM) as the modern manifestation of the basic principle of science:formulating mathematical equations (modeling) and solving equations (computation). The vision of FEniCS is to set a new standard towards the goals of generality, efficiency, and simplicity, concerning mathematical methodology, implementation, and application. LÄS MER

  3. 2. Stålmarck's Method for Automated Theorem Proving in First Order Logic

    Författare :Magnus Björk; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; automated theorem proving; Stålmarck s method; tableaux; first order logic;

    Sammanfattning : We present an extension of Stålmarck's method to classical first order predicate logic. Stålmarck's method is a satisfiability checking method for propositional logic, and it resembles tableaux and KE. Its most distinctive feature is the dilemma rule, which is an extended branching rule, that allows branches to be recombined. LÄS MER

  4. 3. A First Order Extension of Stålmarck's Method

    Författare :Magnus Björk; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Tableaux; Automated Theorem Proving; Stålmarck s Method;

    Sammanfattning : Stålmarck's method is an algorithm that decides validity of formulae in propositional logic. It resembles many tableaux method, but uses a special branch-and-merge-rule, called the dilemma rule. The dilemma rule creates two branches, where a formula (called the dilemma formula) is assumed to be false in one branch and true in the other one. LÄS MER

  5. 4. Extending the Automated Reasoning Toolbox

    Författare :Ann Lillieström; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; transitivity; integer linear programming; first-order logic; many-sorted logic; automated reasoning; morpheme segmentation;

    Sammanfattning : Due to the semi-decidable nature of first-order logic, it can be desirable to address a wider range of problems than the standard ones of satisfiability and derivability. We extend the automated reasoning toolbox by introducing three new tools for analysing problems in first-order logic. Infinox aims to show finite unsatisfiability, i.e. LÄS MER

  7. 5. Efficient algorithms for highly automated evaluation of liquid chromatography - mass spectrometry data

    Författare :Mattias Fredriksson; Dan Bylund; Patrik Petersson; Bengt-Olof Axelsson; Mittuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Digital filtering; Liquid chromatography; Mass spectrometry; Method; Chemistry; Kemi;

    Sammanfattning : Liquid chromatography coupled to mass spectrometry (LC‐MS) has due to its superiorresolving capabilities become one of the most common analytical instruments fordetermining the constituents in an unknown sample. Each type of sample requires a specificset‐up of the instrument parameters, a procedure referred to as method development. LÄS MER