Sökning: "Nonmonotonic Logic"

Hittade 2 avhandlingar innehållade orden Nonmonotonic Logic.

  1. 1. Complexity Dichotomies for CSP-related Problems

    Författare :Gustav Nordh; Peter Jonsson; Andrei Krokhin; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Complexity; Constraint Satisfaction Problem; System of Equations; Nonmonotonic Logic; Circumscription; Abduction; Isomorphism; Computer science; Datavetenskap;

    Sammanfattning : Ladner’s theorem states that if P ≠ NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. LÄS MER

  3. 2. Fundamentals and logical foundations of truth maintenance

    Författare :Michael Reinfrank; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Despite their importance in AI problem solving, nonmonotonic truth maintenance systems (TMSs) still lack sufficiently well-understood logical foundations. In this thesis, I present a rigorous logical theory of TMSs. I pursue a two-step, bottom-up approach. First, I specify a direct, but implementation-independent, theory of truth maintenance. LÄS MER