The aim of this paper is to show that a restriction of a logical language to clauses like Horn clauses, as they are used in Prolog, applied to [0,1]--valued logics leads to calculi with a sound and complete proof theory. In opposition to other models where generally the set of axioms as well as the deduction schemata are enriched we restrict ourselves to a simple modification of the deduction rules of classical logic without adding new axioms. In our model the truth values from the unit interval can be interpreted in a probabilistic sense, so that a value between 0 and 1 is not just intuitively interpreted as a `degree of truth'. Keywords: Prolog; [0,1]--valued logic; probabilistic logic; possibilistic logic 1 Introduction N. Rescher ...
The propositional language extended by two families of unary propositional probability operators and...
Minimal Polynomial Logic (MPL) is a generalisation of classical propositional logic which allows tru...
Abstract. The exogenous semantics approach to enriching a logic consists in defining each model in t...
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoni...
We present n-valued first-order logics with a purely probabilistic semantics. We then introduce a ne...
It is commonly assumed that Boolean logic is synonymous with two-valued logic. However, this needs n...
We introduce probabilistic manyvalued logic programs in which the implication connective is interpr...
. We present many-valued disjunctive logic programs in which classical disjunctive logic program cla...
We introduce probabilistic many-valued logic programs in which the implication connective is interpr...
We introduce probabilistic many-valued logic programs in which the implication connective is interpr...
We present many-valued disjunctive logic programs in which classical disjunctive logic program claus...
Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of exc...
The text of the paper corresponds to the author's invited contribution to the Workshop on "Aspects o...
We present a new approach to probabilistic logic programs with a possible worlds semantics. Classica...
This paper is devoted to a logical and algebraic treatment of conditional probability. The main idea...
The propositional language extended by two families of unary propositional probability operators and...
Minimal Polynomial Logic (MPL) is a generalisation of classical propositional logic which allows tru...
Abstract. The exogenous semantics approach to enriching a logic consists in defining each model in t...
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoni...
We present n-valued first-order logics with a purely probabilistic semantics. We then introduce a ne...
It is commonly assumed that Boolean logic is synonymous with two-valued logic. However, this needs n...
We introduce probabilistic manyvalued logic programs in which the implication connective is interpr...
. We present many-valued disjunctive logic programs in which classical disjunctive logic program cla...
We introduce probabilistic many-valued logic programs in which the implication connective is interpr...
We introduce probabilistic many-valued logic programs in which the implication connective is interpr...
We present many-valued disjunctive logic programs in which classical disjunctive logic program claus...
Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of exc...
The text of the paper corresponds to the author's invited contribution to the Workshop on "Aspects o...
We present a new approach to probabilistic logic programs with a possible worlds semantics. Classica...
This paper is devoted to a logical and algebraic treatment of conditional probability. The main idea...
The propositional language extended by two families of unary propositional probability operators and...
Minimal Polynomial Logic (MPL) is a generalisation of classical propositional logic which allows tru...
Abstract. The exogenous semantics approach to enriching a logic consists in defining each model in t...