Approximation fixpoint theory yields well-behaved paraconsistent semantics for extended fuzzy logic programs containing both by-failure and strong negation, generalizing prior work and producing new variants.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
Approximation fixpoint theory yields well-behaved paraconsistent semantics for extended fuzzy logic programs containing both by-failure and strong negation, generalizing prior work and producing new variants.