Sökning: "interval algebra"

Hittade 5 avhandlingar innehållade orden interval algebra.

  1. 1. Contributions to Pointfree Topology and Apartness Spaces

    Författare :Anton Hedin; Erik Palmgren; Viggo Stoltenberg-Hansen; Peter Schuster; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Constructive mathematics; General topology; Pointfree topology; Domain theory; Interval analysis; Apartness spaces; Mathematical logic; Matematisk logik; Mathematical Logic; Matematisk logik;

    Sammanfattning : The work in this thesis contains some contributions to constructive point-free topology and the theory of apartness spaces. The first two papers deal with constructive domain theory using formal topology. LÄS MER

  3. 2. Boolean complexes of involutions and smooth intervals in Coxeter groups

    Författare :Vincent Umutabazi; Axel Hultman; Jan Snellman; Christian Stump; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This dissertation is composed of four papers in algebraic combinatorics related to Coxeter groups. By a Coxeter group, we mean a group W generated by a subset S ⊂ W such that for all s ∈ S , we have s2 = e, and (s, s′)m(s,s′) = (s′ s)m(s,s′) = e, where m(s, s′) = m(s′ s) ≥ 2 for all s ≠ s′ ≥ ∈ S . LÄS MER

  4. 3. A Study in the Computational Complexity of Temporal Reasoning

    Författare :Mathias Broxvall; Peter Jonsson; Ulf Nilsson; Anders Haraldsson; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; temporal and spatial information; artificiell intelligens; algebra; tractable fragments; temporal formalisms; formalism STP; Computer science; Datavetenskap;

    Sammanfattning : Reasoning about temporal and spatial information is a common task in computer science, especially in the field of artificial intelligence. The topic of this thesis is the study of such reasoning from a computational perspective. LÄS MER

  5. 4. Deductive Planning and Composite Actions in Temporal Action Logic

    Författare :Martin Magnusson; Patrick Doherty; John-Jules Meyer; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Temporal Action Logic; deductive planning; composite actions; interval algebra; constraint logic programming; execution monitoring; Computer science; Datalogi;

    Sammanfattning : Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. LÄS MER

  7. 5. Algorithms and Complexity for Temporal and Spatial Formalisms

    Författare :Thomas Drakengren; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : The problem of computing with temporal information was early recognised within the area of artificial intelligence, most notably the temporal interval algebra by Allen has become a widely used formalism for representing and computing with qualitative knowledge about relations between temporal intervals. However, the computational properties of the algebra and related-formalisms are known to be bad: most problems (like satisfiability) are NP-hard. LÄS MER