Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.23507

Encoding higher-order argumentation frameworks with supports to propositional logic systems

Shuai Tang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Argumentation frameworks ($AF$s) have been extensively developed, but existing higher-order bipolar $AF$s suffer from critical limitations: attackers and supporters are restricted to arguments, multi-valued and fuzzy semantics lack unified generalization, and encodings often rely on complex logics with poor interoperability. To address these gaps, this paper proposes a higher-order argumentation framework with supports ($HAFS$), which explicitly allows attacks and supports to act as both targets and sources of interactions. We define a suite of semantics for $HAFS$s, including extension-based semantics, adjacent complete labelling semantics (a 3-valued semantics), and numerical equational semantics ([0,1]-valued semantics). Furthermore, we develop a normal encoding methodology to translate $HAFS$s into propositional logic systems ($\mathcal{PLS}$s): $HAFS$s under complete labelling semantics are encoded into Łukasiewicz's three-valued propositional logic ($\mathcal{PL}_3^L$), and those under equational semantics are encoded into fuzzy $\mathcal{PLS}$s ($\mathcal{PL}_{[0,1]}$) such as Gödel and Product fuzzy logics. We prove model equivalence between $HAFS$s and their encoded logical formulas, establishing the logical foundation of $HAFS$ semantics. Additionally, we investigate the relationships between 3-valued complete semantics and fuzzy equational semantics, showing that models of fuzzy encoded semantics can be transformed into complete semantics models via ternarization, and vice versa for specific t-norms. This work advances the formalization and logical encoding of higher-order bipolar argumentation, enabling seamless integration with lightweight computational solvers and uniform handling of uncertainty.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shuai Tang. 2025-12-29. Encoding higher-order argumentation frameworks with supports to propositional logic systems. https://arxiv.org/abs/2512.23507

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗