Sökning: "automated method"

Visar resultat 1 - 5 av 447 avhandlingar innehållade orden automated method.

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

    Författare :Magnus Björk; Chalmers University of Technology; []
    Nyckelord :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

  2. 2. Capturing semi-automated decision making : the methodology of CASADEMA

    Författare :Maria Nilsson; Tom Ziemke; Joeri van Laere; Tarja Susi; Amy Loutfi; Ann Bisantz; Örebro universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; Decision making; distributed cognition; human-computer interaction; semi-automated processes; SOCIAL SCIENCES; SAMHÄLLSVETENSKAP; Information technology; Informationsteknologi; Computer and Systems Science; Datalogi; Decision Making; Distributed Cognition; Human-Computer Interaction; Information Fusion; Semi-Automated processes; Teknik; Technology;

    Sammanfattning : This thesis presents a new methodology named CASADEMA (CApturing Semi-Automated DEcision MAking) which captures the interaction between humans and the technology they use to support their decision-making within the domain of Information Fusion. We are particularly interested in characterising the interaction between human decision makers and artefacts in semi-automated fusion processes. LÄS MER

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

    Författare :Magnus Björk; Chalmers University of Technology; []
    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

  4. 4. Extending the Automated Reasoning Toolbox

    Författare :Ann Lillieström; Chalmers University of Technology; []
    Nyckelord :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

  5. 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 :NATURAL SCIENCES; NATURVETENSKAP; 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