Computational technique for obtaining consequences in multi-adjoint logic programming with generalized quantifiers (pp.520-540)
Applied and Computational Mathematics · 2024
This paper will introduce an operational semantics for the flexible framework of propositional multi-adjoint logic programming with generalized quantifiers.This approach extends diverse general logic programming frameworks, weakening the existential feature of the supremum operator and considering a malleable algebraic structure.