We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore the relationship between coherence-based and classical model-theoretic probabilistic logic. Interestingly, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reas...

N.B.: For the references, please see Selected Bibliography on Aristotle's Theory of Categorical Syllogism "When modem logicians in the 1920s and 1930s first turned their attention to the problem of understanding Aristotle’s contribution to logic in modern terms, they were guided both by the Frege-Russell conception of logic as formal ontology and at the same time by a desire to protect Aristotl...

Three-valued logics belong to a family of nonclassical logics that started to flourish in the 1920s and 1930s, following the work of ( Lukasiewicz, 1920), and earlier insights coming from Frege and Peirce (see (Frege, 1879), (Frege, 1892), (Fisch and Turquette, 1966)). All of them were moved by the idea that not all sentences need be True or False, but that some sentences can be indeterminate i...

Introduction. Classical logics are based on the bivalence principle, that is, the set of truth-values V has cardinality |V | = 2, usually with V = {T,F} where T and F stand for truthhood and falsity, respectively. Many-valued logics generalize this requirement to more or less arbitrary sets of truth-values, rather referred to as truth-degrees in that context. Popular examples of many-valued log...

There are several three-valued logical systems that form a scattered landscape, even if all reasonable connectives in three-valued logics can be derived from a few of them. Most papers on this subject neglect the issue of the relevance of such logics in relation with the intended meaning of the third truth value. Here, we focus on the case where the third truth-value means unknown, as suggested...

We introduce a new approach to probabilistic logic programming in which probabilities are defined over a set of possible worlds. More precisely, classical program clauses are extended by a subinterval of [0; 1℄ that describes a range for the conditional probability of the head of a clause given its body. We then analyze the complexity of selected probabilistic logic programming tasks. It turns ...

The minimum number of NOT gates in a logic circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that ⌈log 2 (d(f)+ 1)⌉ NOT gates are necessary and sufficient to compute any Boolean function f (where d(f) is the maximum number of value changes from greater to smaller...

Rule-driven processing is a proven way of achieving high-speed in fuzzy processing. Up to now, ruledriven architectures where designed to work with minimum or product as T-norm. Nevertheless, a Lukasiewicz T-norm is typically used with the compositional rule of inference in expert systems applications that are based on a fuzzy inference engine. This paper presents a rule-driven processing archi...