umu.sePublications
Change search
Refine search result
1 - 9 of 9
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Cohen, Mika
    et al.
    Minock, Michael
    KTH Royal Institute of Technology, Stockholm, Sweden.
    Oskarsson, Daniel
    Pelzer, Björn
    Enterprise architecture with executable modelling rules: A case study at the Swedish Defence Materiel Administration2015In: Advanced Information Systems Engineering Workshops, CAiSE 2015 / [ed] Persson A.,Stirna J., Springer, 2015, Vol. 215, p. 339-350Conference paper (Refereed)
  • 2. Cohen, Mika
    et al.
    Minock, Michael
    KTH Royal Institute of Technology, Stockholm.
    Oskarsson, Daniel
    Pelzer, Björn
    Natural Language Specification and Violation Reporting of Business Rules over ER-modeled Databases2015In: Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, OpenProceedings.org, University of Konstanz, University Library , 2015, p. 541-544Conference paper (Refereed)
    Abstract [en]

    This paper presents our work on adapting and extending natural language interface (NLI) to database technology to support the specification and violation reporting of business rules. The resulting system allows non-technical users to author and manage a rulebook in controlled natural language - serving as a single point of definition that can be compiled into SQL to generate violation reports. To achieve this we represent business rules in tuple calculus, handle negation in our query re-writing algorithms and add support for natural language reflexives (e.g. 'its', 'themselves', etc.). Our results show a large class of business rules can be captured with these extensions. Although our approach is general, we present it applied to compliance checking of regulations over a materiel capability development information system at the Swedish Defence Materiel Administration. At EDBT we will also demonstrate this work over a more generic package delivery domain. While there has been recent effort in pursuing Semantics for Business Vocabulary and Business Rules (SBVR) in the semantic web and description logic communities, to our knowledge ours is the first attempt to provide this capability for ER-modeled relational databases.

  • 3.
    Minock, Michael
    Umeå University, Faculty of Science and Technology, Department of Computing Science. KTH Royal Institute of Technology, Stockholm, Sweden.
    COVER: Covering the Semantically Tractable Question2017In: Proceedings of the Software Demonstrations of the 15th Conference of the European Chapter of the Association for Computational Linguistics (EACL), 2017: Demonstration session, 2017, p. 1-4Conference paper (Refereed)
    Abstract [en]

    In semantic parsing, natural language questions map to meaning representation language (MRL) expressions over some fixed vocabulary of predicates. To do this reliably, one must guarantee that for a wide class of natural language questions (the so called semantically tractable questions), correct interpretations are always in the mapped set of possibilities. Here we demonstrate the system COVER which significantly clarifies, revises and extends the notion of semantic tractability. COVER is written in Python and uses NLTK.

  • 4.
    Minock, Michael
    Umeå University, Faculty of Science and Technology, Department of Computing Science. KTH Royal Institute of Technology, Stockholm, Sweden.
    Evaluating an Automata Approach to Query Containment2017In: Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP) / [ed] Frank Drewes, 2017, p. 75-79Conference paper (Refereed)
    Abstract [en]

    Given two queries Qsuper and Qsub, query containment is the problem of determining if Qsub(D) ⊆ Qsuper(D) for all databases D. This problem has long been explored, but to our knowledge no one has empirically evaluated a straightforward application of finite state automata to the problem. We do so here, covering the case of conjunctive queries with limited set conditions. We evaluate an implementation of our approach against straightforward implementations of both the canonical database and theorem proving approaches. Our implementation outperforms theorem proving on a natural language interface corpus over a photo/video domain. It also outperforms the canonical database implementation on single relation queries with large set conditions.

  • 5.
    Minock, Michael
    KTH Royal Institute of Technology, Stockholm, Sweden.
    In Pursuit of Decidable 'Logical Form'2014Conference paper (Refereed)
  • 6.
    Minock, Michael
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Using HOL LIGHT to Reason over Higher-Order Meaning Representation Languages2016Conference paper (Refereed)
  • 7.
    Minock, Michael
    KTH Royal Institute of Technology.
    Using HOL Light to Reason over Second-Order MRLs2016Conference paper (Refereed)
  • 8.
    Minock, Michael
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Everling, Nils
    Replication and Generalization of PRECISE2015Report (Other academic)
  • 9.
    Minock, Michael
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Mollevik, Johan
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Åsander, Mattias
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Does TTS-based pedestrian navigation work?2014Report (Other academic)
    Abstract [en]

    We seek to test the hypothesis that text-to-speech(TTS) navigation systems can adequately guide pedestrians to unknown destinations in an unfamiliar city. Such systems bypass screenbased, multi-modal techniques and simply speak route following instructions incrementally into the pedestrian’s ear piece. Due to errors in GPS positioning, uncertainty of user heading, poor map quality and potential communication and processing latencies, this becomes a surprisingly challenging task. In our study, subjects are led on an unknown tour on the grounds of Ume˚a University. We evaluated both a human wizard controller as well as a simple decision-tree based controller and compared them to an ideal subject that knows the route. Results give support to our hypothesis that TTS-based navigation systems can adequately guide pedestrians. That said, our experiences point toward immediate and future improvements to make such systems more effective and agreeable. All the software and data behind this work will be open sourced to encourage confirmation, replication and, ultimately, improvement upon our results. This will soon be available for public download at http://janus-system.eu.

1 - 9 of 9
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf