Sökning: "Automated reasoning"

Visar resultat 1 - 5 av 43 avhandlingar innehållade orden Automated reasoning.

  1. 1. 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

  3. 2. Extending the Automated Reasoning Toolbox

    Författare :Ann Lillieström; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; First-Order Logic; Sorted Logic; Automated Reasoning;

    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 intro- ducing two new tools for analysing problems in first-order logic. Infinox is aimed at showing finite unsatisfiability, i.e. LÄS MER

  4. 3. Reasoning with Bounded Cognitive Resources

    Författare :Abdul Rahim Nizamani; Göteborgs universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Artificial general intelligence; logical reasoning; inductive learning; proof systems; bounded cognitive resources; cognitive modeling;

    Sammanfattning : Reasoning is an essential element of intelligence. Automated reasoning in formal and symbolic systems is a major topic in computer science and artificial intelligence (AI). Programs for computer-assisted and automated theorem proving are being constructed and used by mathematicians and logicians. LÄS MER

  5. 4. Efficient Temporal Reasoning with Uncertainty

    Författare :Mikael Nilsson; Patrick Doherty; Jonas Kvarnström; Félix Ingrand; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Temporal Reasoning; Dynamic Controllability; Simple Temporal Network with Uncertainty; Incremental Algorithms; Temporal Networks;

    Sammanfattning : Automated Planning is an active area within Artificial Intelligence. With the help of computers we can quickly find good plans in complicated problem domains, such as planning for search and rescue after a natural disaster. When planning in realistic domains the exact duration of an action generally cannot be predicted in advance. LÄS MER

  7. 5. Quantifiers and Theories : A Lazy Approach

    Författare :Peter Backeman; Philipp Rümmer; Jie-Hong Roland Jiang; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Automated Reasoning; Automated Theorem Proving; SMT; Unification; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

    Sammanfattning : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. LÄS MER