Related papers: Algebraic hierarchy of logics unifying fuzzy logic…
Fuzzy answer set programming is a declarative framework for representing and reasoning about knowledge in fuzzy environments. However, the unavailability of fuzzy aggregates in disjunctive fuzzy logic programs, DFLP, with fuzzy answer set…
Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…
We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept Analysis. We discuss an interpretation and possible…
In this paper we extend the concept of fuzzy AG-subgroups. We introduce some results in normal fuzzy AG-subgroups. We define fuzzy cosets and quotient fuzzy AG-subgroups, and prove that the sets of their collection form an AG-subgroup and…
Evaluating argument strength in quantitative argumentation systems has received increasing attention in the field of abstract argumentation. The concept of acceptability degree is widely adopted in gradual semantics, however, it may not be…
Answering complex First-Order Logical (FOL) queries on large-scale incomplete knowledge graphs (KGs) is an important yet challenging task. Recent advances embed logical queries and KG entities in the same space and conduct query answering…
The article demonstrates that logic is not necessarily singleton and does not always have the standard interpretation of negation. Appropriate generalizations of logic are suggested. Positive logic and multivalued negation operations are…
Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification…
We present a novel unity of logic, viz., a single sequent calculus that embodies classical, intuitionistic and linear logics. Concretely, we define classical linear logic negative (CLL$^-$), a new logic that is classical and linear yet…
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Defeasible Logic Programming (DeLP) is a defeasible…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…
Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…
Transportation Problem is an important aspect which has been widely studied in Operations Research domain. It has been studied to simulate different real life problems. In particular, application of this Problem in NP- Hard Problems has a…
Ontology-based query answering with existential rules is well understood and implemented for positive queries, in particular conjunctive queries. The situation changes drastically for queries with negation, where there is no agreed-upon…
We investigate the problem of characterizing the classes of Grothendieck toposes whose internal logic satisfies a given assertion in the theory of Heyting algebras, and introduce natural analogues of the double negation and De Morgan…
Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Goedel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but…