Skip to main content

51 Result(s)

within Chapter Remove this filter Minghui **ao Remove this filter Discrete Mathematics in Computer Science Remove this filter

previous disabled Page of 3
and

  1. No Access

    Chapter and Conference Paper

    Sequent Calculi for Normal Update Logics

    Normal update logic is the temporalization of normal conditional logic. Sequent calculi for the least normal update logic $$\mathbf {U...

    Katsuhiko Sano, Minghui Ma in Logic and Its Applications (2019)

  2. No Access

    Chapter and Conference Paper

    Labelled Sequent Calculus for Inquisitive Logic

    A contraction-free and cut-free labelled sequent calculus \(\mathsf {GInqL}\) ...

    **sheng Chen, Minghui Ma in Logic, Rationality, and Interaction (2017)

  3. No Access

    Chapter and Conference Paper

    Tableaux for Non-normal Public Announcement Logic

    This paper presents a tableau calculus for two semantic interpretations of public announcements over monotone neighbourhood models: the intersection and the subset semantics, developed by Ma and Sano. We show ...

    Minghui Ma, Katsuhiko Sano, François Schwarzentruber… in Logic and Its Applications (2015)

  4. No Access

    Chapter and Conference Paper

    Algebraic Semantics for Dynamic Dynamic Logic

    Dynamic dynamic logic (DDL) is a generalisation of propositional dynamic logic PDL and dynamic epistemic logic. In this paper, we develop algebraic semantics for DDL without the constant program. We introduce ind...

    Minghui Ma, Jeremy Seligman in Logic, Rationality, and Interaction (2015)

  5. No Access

    Chapter and Conference Paper

    Edge-Disjoint Packing of Stars and Cycles

    We study the parameterized complexity of two graph packing problems, Edge-Disjoint \(k\) ...

    Minghui Jiang, Ge **a, Yong Zhang in Combinatorial Optimization and Applications (2015)

  6. No Access

    Chapter and Conference Paper

    Trees, Paths, Stars, Caterpillars and Spiders

    For any \(k \ge 2\) k ≥ ...

    Minghui Jiang in Combinatorial Optimization and Applications (2015)

  7. No Access

    Chapter and Conference Paper

    Quell

    We study the computational complexity of the puzzle Quell. The goal is to collect pearls by sliding a droplet of water over them in a grid map. The map contains obstacles. In each move, the droplet slides in o...

    Minghui Jiang, Pedro J. Tejada, Haitao Wang in Fun with Algorithms (2014)

  8. No Access

    Chapter and Conference Paper

    Shortest Color-Spanning Intervals

    Given a set of n points on a line, where each point has one of k colors, and given an integer s i  ≥ 1 for each color i, 1 ≤ i ≤ k, the problem Shortest Color-Sp...

    Minghui Jiang, Haitao Wang in Computing and Combinatorics (2014)

  9. No Access

    Chapter and Conference Paper

    Competitive Algorithms for Unbounded One-Way Trading

    In the one-way trading problem, a seller has some product to be sold to a sequence σ of buyers u 1, u 2, …, u σ arriving online ...

    Francis Y. L. Chin, Bin Fu, Minghui Jiang… in Algorithmic Aspects in Information and Man… (2014)

  10. No Access

    Chapter and Conference Paper

    How to Update Neighborhood Models

    This paper studies two ways of updating neighborhood models: update by taking the intersection of the neighborhoods with the announced proposition, and update by selecting all the neighborhoods that can entail...

    Minghui Ma, Katsuhiko Sano in Logic, Rationality, and Interaction (2013)

  11. No Access

    Chapter and Conference Paper

    On Covering Points with Minimum Turns

    We point out mistakes in several previous FPT algorithms for k -Link Covering Tour and its variants in ℝ2, and show that the previous NP-hardness proofs for Minimum-Link Rectilinear Covering Tour an...

    Minghui Jiang in Frontiers in Algorithmics and Algorithmic … (2012)

  12. No Access

    Chapter and Conference Paper

    Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths

    The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology....

    Guillaume Blin, Laurent Bulteau, Minghui Jiang… in Combinatorial Pattern Matching (2012)

  13. No Access

    Chapter and Conference Paper

    Maximal Empty Boxes Amidst Random Points

    We show that the expected number of maximal empty axis-parallel boxes amidst n random points in the unit hypercube [0,1] d in ℝ d is ...

    Adrian Dumitrescu, Minghui Jiang in Approximation, Randomization, and Combinat… (2012)

  14. No Access

    Chapter and Conference Paper

    Parameterized Complexity in Multiple-Interval Graphs: Domination

    We show that several variants of the problem k -Dominating Set, including k -Connected Dominating Set, k -Independent Dominating Set, k -Dominating Clique,

    Minghui Jiang, Yong Zhang in Parameterized and Exact Computation (2012)

  15. No Access

    Chapter and Conference Paper

    H  ∞  Synchronization Control in Nonlinear Time-Delay Complex Dynamical Network

    On the basis of Lyapunov stability theory and LMI technique, this paper investigates H  ∞  synchronization control of time-varying synchronization state in general complex networks with time-delay...

    Ting **ang, Minghui Jiang in Advances in Neural Networks – ISNN 2011 (2011)

  16. No Access

    Chapter and Conference Paper

    Mathematics of Public Announcements

    We study some mathematical aspects of public announcement logic (PAL) and its several variants. By a model-theoretic approach, we explore van Benthem’s result that uses recursion axioms to characterize the sub...

    Minghui Ma in Logic, Rationality, and Interaction (2011)

  17. No Access

    Chapter and Conference Paper

    Flip** Triangles and Rectangles

    We study the chromatic number of the flip graph of triangles determined by n points in convex position in the plane, and present new or improved bounds on several related parameters for this graph. We also find t...

    Minghui Jiang in Computing and Combinatorics (2011)

  18. No Access

    Chapter and Conference Paper

    Algebraic Semantics and Model Completeness for Intuitionistic Public Announcement Logic

    In this paper, we start studying epistemic updates using the standard toolkit of duality theory. We focus on public announcements. We give the dual characterization of the corresponding submodel-injection map,...

    Mehrnoosh Sadrzadeh, Alessandra Palmigiano… in Logic, Rationality, and Interaction (2011)

  19. No Access

    Chapter and Conference Paper

    Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy

    We present new results on the parameterized complexities of k - Vertex Clique Partition and k -Separating Vertices in multiple-interval graphs and their complements, and present a very...

    Minghui Jiang, Yong Zhang in Computing and Combinatorics (2011)

  20. No Access

    Chapter and Conference Paper

    Logics of Belief over Weighted Structures

    We explore logics of belief over weighted structures under the supposition that everything believed by an agent has a weight in the range of agent’s belief. We first define static graded belief logics which ar...

    Minghui Ma, Meiyun Guo in Logic, Rationality, and Interaction (2011)

previous disabled Page of 3