In his well-known paper \How computer should think" ((Be77b]) Belnap argues that four valued semantics is a very suitable setting for computerized reasoning. In this paper we vindicate this thesis by showing that the logical role that the four-valued structure has among Ginsberg's well-known bilattices is similar to the role that the two-valued algebra has among Boolean algebras. Speciically, w...

Axiomatic bases of admissible rules are obtained for fragments of the substructural logic R-mingle. In particular, it is shown that a “modus-ponens-like” rule introduced by Arnon Avron forms a basis for the admissible rules of its implication and implication-fusion fragments, while a basis for the admissible rules of the full multiplicative fragment requires an additional countably infinite set...

Argumentation is a dialectical process of knowing things (inquiry) and justifying them (advocacy) in general. Computational argumentation has been recognized as a social computing mechanism or paradigm in the multi-agent systems community. We have developed a computational argumentation framework that basically consists of EALP (Extended Annotated Logic Programming) and LMA (Logic of Multipleva...

Abstract: Methods for solution of a large class of problems on the base of nonclassical, multiple-valued, and probabilistic logics have been discussed. A theory of knowledge about changing knowledge, of defeasible inference, and network approach to an analogous derivation have been suggested. A method for regularity search, logic-axiomatic and logic-probabilistic methods for learning of terms a...

Abstract This paper is dedicated to extending and adapting modal logic the approach of fractional semantics classical logic. a multi-valued governed by pure proof-theoretic considerations, whose truth-values are rational numbers in closed interval $[0,1]$ . Focusing on K , proposed methodology relies three key components: bilateral sequent calculus, invertibility logical rules, stability (proof...

The “Von Neumann bottleneck” and large standby power become serious problems in recent deep-sub-micron technology. To solve these problems, this paper presents ferroelectric-based logic circuits called Flexible Ferroelectric-Capacitor (FFC) elements for logic-in-memory architectures. In an FFC element, storage and a logic function are integrated on non-volatile ferro-electric-capacitors to achi...

In [10] Osorio et al. introduced a paraconsistent three-valued logic, the logic CG3 which was named after the logic G ′ 3 due to the close relation between them. Authors defined CG3 via the three-valued matrix that defines G3 but changing the set of designated truth values. In this article we present a brief study of the Kripke-type semantics for some logics related with CG3 before constructing...

In this work we present additional results related to the property of strong equivalence of logic programs. This property asserts that two programs share the same set of stable models, even under the addition of new rules. As shown in a recent work by Lifschitz, Pearce and Valverde, strong equivalence can be simply reduced to equivalence in the logic of Here-and-There (HT). In this paper we pro...

Fundamental discrepancy between first order logic and statistical inference (global versus local properties of universe) is shown to be the obstacle for integration of logic and probability in L.p. logic of Bacchus. To overcome the counterintuitiveness of L.p. behaviour, a 3-valued logic is proposed.