Selected work

Representative Papers

Probabilistic Disjunctive Normal Forms in Temporal Logic and Automata Theory

Mar 10, 2026

This work addresses the challenge of effectively modeling and reasoning about uncertainty within temporal logic and automata theory. It proposes Probabilistic Disjunctive Normal Form (PDNF), which encodes the probabilities of a variable’s presence, absence, or negation through real-valued weights, and constructs a PDNF vector space to enable algebraic evidence fusion. Innovatively integrating probability distributions with venjunction structures from temporal logic, the approach establishes a Banach space framework that unifies logical semantics with functional-analytic properties. Leveraging exponential parameterization and tools from functional analysis, the study demonstrates that PDNF addition is equivalent to Bayesian evidence fusion and derives probabilistic bounds for identifying outcomes from random samples.

0 citationsRead paper

Pairwise similarity method for majority domination problem

Jun 10, 2025

This paper investigates the minimum dominant voter ratio required to guarantee proposal approval in a two-tier voting system: local voting within subgroups followed by global aggregation. Addressing the majority dominance threshold problem, we systematically introduce pairwise comparison modeling to characterize the local–global decision linkage—first in this context. Leveraging graph-theoretic structures (trees, complete graphs, and odd-order regular graphs), we design specialized heuristic algorithms with provable polynomial-time complexity and theoretically guaranteed lower bounds on solution accuracy. Our approach extends the class of polynomially solvable graph topologies beyond prior limitations. Furthermore, we derive principled criteria for optimal algorithm selection in the post-processing stage, enabling adaptive refinement based on structural properties of the underlying voter network. Collectively, these contributions advance both the theoretical understanding and practical computability of dominance thresholds in hierarchical voting systems.

0 citationsRead paper

Recent publications

Latest Papers

Probabilistic Disjunctive Normal Forms in Temporal Logic and Automata Theory

Mar 10, 2026

This work addresses the challenge of effectively modeling and reasoning about uncertainty within temporal logic and automata theory. It proposes Probabilistic Disjunctive Normal Form (PDNF), which encodes the probabilities of a variable’s presence, absence, or negation through real-valued weights, and constructs a PDNF vector space to enable algebraic evidence fusion. Innovatively integrating probability distributions with venjunction structures from temporal logic, the approach establishes a Banach space framework that unifies logical semantics with functional-analytic properties. Leveraging exponential parameterization and tools from functional analysis, the study demonstrates that PDNF addition is equivalent to Bayesian evidence fusion and derives probabilistic bounds for identifying outcomes from random samples.

0 citationsRead paper

Pairwise similarity method for majority domination problem

Jun 10, 2025

This paper investigates the minimum dominant voter ratio required to guarantee proposal approval in a two-tier voting system: local voting within subgroups followed by global aggregation. Addressing the majority dominance threshold problem, we systematically introduce pairwise comparison modeling to characterize the local–global decision linkage—first in this context. Leveraging graph-theoretic structures (trees, complete graphs, and odd-order regular graphs), we design specialized heuristic algorithms with provable polynomial-time complexity and theoretically guaranteed lower bounds on solution accuracy. Our approach extends the class of polynomially solvable graph topologies beyond prior limitations. Furthermore, we derive principled criteria for optimal algorithm selection in the post-processing stage, enabling adaptive refinement based on structural properties of the underlying voter network. Collectively, these contributions advance both the theoretical understanding and practical computability of dominance thresholds in hierarchical voting systems.

0 citationsRead paper