Now showing items 81-85 of 297

    • Automatic generation of proof terms in dependently typed programming languages 

      Slama, Franck (University of St Andrews, 2018-09-17) - Thesis
      Dependent type theories are a kind of mathematical foundations investigated both for the formalisation of mathematics and for reasoning about programs. They are implemented as the kernel of many proof assistants and ...
    • AIF-EL - an OWL2-EL-compliant AIF ontology 

      Cerutti, Federico; Toniolo, Alice; Norman, Timothy J.; Bex, Floris; Rahwan, Iyad; Reed, Chris (IOS Press, 2018-09-11) - Conference item
      This paper briefly describes AIF-EL, an OWL2-EL compliant ontology for the Argument Interchange Format.
    • CISpaces.org : from fact extraction to report generation 

      Cerutti, Federico; Norman, Timothy J.; Toniolo, Alice; Middleton, Stuart E. (IOS Press, 2018-09-11) - Conference item
      We introduce CISpaces.org, a tool to support situational understanding in intelligence analysis that complements but not replaces human expertise. The system combines natural language processing, argumentation-based ...
    • Querying metric spaces with bit operations 

      Connor, Richard; Dearle, Alan (Springer, 2018) - Conference item
      Metric search techniques can be usefully characterised by the time at which distance calculations are performed during a query. Most exact search mechanisms use a “just-in-time” approach where distances are calculated as ...
    • Structured arrows : a type-based framework for structured parallelism 

      Castro, David (University of St Andrews, 2018-06-27) - Thesis
      This thesis deals with the important problem of parallelising sequential code. Despite the importance of parallelism in modern computing, writing parallel software still relies on many low-level and often error-prone ...