138,640 research outputs found
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
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
Predicting software project effort: A grey relational analysis based method
This is the post-print version of the final paper published in Expert Systems with Applications. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. Copyright @ 2011 Elsevier B.V.The inherent uncertainty of the software development process presents particular challenges for software effort prediction. We need to systematically address missing data values, outlier detection, feature subset selection and the continuous evolution of predictions as the project unfolds, and all of this in the context of data-starvation and noisy data. However, in this paper, we particularly focus on outlier detection, feature subset selection, and effort prediction at an early stage of a project. We propose a novel approach of using grey relational analysis (GRA) from grey system theory (GST), which is a recently developed system engineering theory based on the uncertainty of small samples. In this work we address some of the theoretical challenges in applying GRA to outlier detection, feature subset selection, and effort prediction, and then evaluate our approach on five publicly available industrial data sets using both stepwise regression and Analogy as benchmarks. The results are very encouraging in the sense of being comparable or better than other machine learning techniques and thus indicate that the method has considerable potential.National Natural Science Foundation
of Chin
A higher-order behavioural algebraic institution for ASL
In this paper, we generalise the semantics of ASL including
the three behavioural operators for a fixed but
arbitrary algebraic institution. After that,
we define a behavioural algebraic institution which
is used to give an alternative semantics of the
behavioural operators, to define the normal forms
of the both semantics of behavioural operators and to relate both
semantics. Finally, we present a higher-order behavioural
algebraic institution.Postprint (published version
Refactorings of Design Defects using Relational Concept Analysis
Software engineers often need to identify and correct design defects, ıe} recurring design problems that hinder development and maintenance\ud
by making programs harder to comprehend and--or evolve. While detection\ud
of design defects is an actively researched area, their correction---mainly\ud
a manual and time-consuming activity --- is yet to be extensively\ud
investigated for automation. In this paper, we propose an automated\ud
approach for suggesting defect-correcting refactorings using relational\ud
concept analysis (RCA). The added value of RCA consists in exploiting\ud
the links between formal objects which abound in a software re-engineering\ud
context. We validated our approach on instances of the <span class='textit'></span>Blob\ud
design defect taken from four different open-source programs
- …