41,729 research outputs found
Robust Grammatical Analysis for Spoken Dialogue Systems
We argue that grammatical analysis is a viable alternative to concept
spotting for processing spoken input in a practical spoken dialogue system. We
discuss the structure of the grammar, and a model for robust parsing which
combines linguistic sources of information and statistical sources of
information. We discuss test results suggesting that grammatical processing
allows fast and accurate processing of spoken input.Comment: Accepted for JNL
Attempto - From Specifications in Controlled Natural Language towards Executable Specifications
Deriving formal specifications from informal requirements is difficult since
one has to take into account the disparate conceptual worlds of the application
domain and of software development. To bridge the conceptual gap we propose
controlled natural language as a textual view on formal specifications in
logic. The specification language Attempto Controlled English (ACE) is a subset
of natural language that can be accurately and efficiently processed by a
computer, but is expressive enough to allow natural usage. The Attempto system
translates specifications in ACE into discourse representation structures and
into Prolog. The resulting knowledge base can be queried in ACE for
verification, and it can be executed for simulation, prototyping and validation
of the specification.Comment: 15 pages, compressed, uuencoded Postscript, to be presented at EMISA
Workshop 'Naturlichsprachlicher Entwurf von Informationssystemen -
Grundlagen, Methoden, Werkzeuge, Anwendungen', May 28-30, 1996, Ev. Akademie
Tutzin
Bisimulation in Inquisitive Modal Logic
Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style
modal logic. In its epistemic incarnation, it extends standard epistemic logic
to capture not just the information that agents have, but also the questions
that they are interested in. Technically, InqML fits within the family of
logics based on team semantics. From a model-theoretic perspective, it takes us
a step in the direction of monadic second-order logic, as inquisitive modal
operators involve quantification over sets of worlds. We introduce and
investigate the natural notion of bisimulation equivalence in the setting of
InqML. We compare the expressiveness of InqML and first-order logic, and
characterise inquisitive modal logic as the bisimulation invariant fragments of
first-order logic over various classes of two-sorted relational structures.
These results crucially require non-classical methods in studying bisimulations
and first-order expressiveness over non-elementary classes.Comment: In Proceedings TARK 2017, arXiv:1707.0825
Symbolic and analytic techniques for resource analysis of Java bytecode
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap shapes, in the tradition of separation logic, and assertions about consumable resources. Separately, polyhedral methods have been used to calculate bounds on numbers of iterations in loop-based programs. We are attempting to combine these ideas to deal with Java programs involving both data structures and loops, focusing on the bytecode level rather than on source code
The Topology of Quantum Algorithms
We use a categorical topological semantics to examine the Deutsch-Jozsa,
hidden subgroup and single-shot Grover algorithms. This reveals important
structures hidden by conventional algebraic presentations, and allows novel
proofs of correctness via local topological operations, giving for the first
time a satisfying high-level explanation for why these procedures work. We also
investigate generalizations of these algorithms, providing improved analyses of
those already in the literature, and a new generalization of the single-shot
Grover algorithm.Comment: 33 pages. Updated to match the final published articl
Bounded Reachability for Temporal Logic over Constraint Systems
We present CLTLB(D), an extension of PLTLB (PLTL with both past and future
operators) augmented with atomic formulae built over a constraint system D.
Even for decidable constraint systems, satisfiability and Model Checking
problem of such logic can be undecidable. We introduce suitable restrictions
and assumptions that are shown to make the satisfiability problem for the
extended logic decidable. Moreover for a large class of constraint systems we
propose an encoding that realize an effective decision procedure for the
Bounded Reachability problem
Inquisitive bisimulation
Inquisitive modal logic InqML is a generalisation of standard Kripke-style
modal logic. In its epistemic incarnation, it extends standard epistemic logic
to capture not just the information that agents have, but also the questions
that they are interested in. Technically, InqML fits within the family of
logics based on team semantics. From a model-theoretic perspective, it takes us
a step in the direction of monadic second-order logic, as inquisitive modal
operators involve quantification over sets of worlds. We introduce and
investigate the natural notion of bisimulation equivalence in the setting of
InqML. We compare the expressiveness of InqML and first-order logic in the
context of relational structures with two sorts, one for worlds and one for
information states. We characterise inquisitive modal logic, as well as its
multi-agent epistemic S5-like variant, as the bisimulation invariant fragment
of first-order logic over various natural classes of two-sorted structures.
These results crucially require non-classical methods in studying bisimulation
and first-order expressiveness over non-elementary classes of structures,
irrespective of whether we aim for characterisations in the sense of classical
or of finite model theory
- …