Results 1  10
of
161
NonDeterministic Matrices
 in Proceedings of the 34th IEEE International Symposium on MultipleValued Logic (ISMVL 2004), 282287, IEEE Computer
, 2000
"... We generalize the ordinary concept of a matrix by introducing nondeterministic matrices (Nmatrices). We show that some important logics for reasoning under uncertainty can be characterized by nite Nmatrices (and so they are decidable) although they have only innite characteristic matrices. We pro ..."
Abstract
 Add to MetaCart
We generalize the ordinary concept of a matrix by introducing nondeterministic matrices (Nmatrices). We show that some important logics for reasoning under uncertainty can be characterized by nite Nmatrices (and so they are decidable) although they have only innite characteristic matrices. We
Nondeterministic matrices and modular semantics of rules
 in Logica Universalis
, 2005
"... Abstract. We show by way of example how one can provide in a lot of cases simple modular semantics for rules of inference, so that the semantics of a system is obtained by joining the semantics of its rules in the most straightforward way. Our main tool for this task is the use of finite Nmatrices, ..."
Abstract

Cited by 27 (11 self)
 Add to MetaCart
, which are multivalued structures in which the value assigned by a valuation to a complex formula can be chosen nondeterministically out of a certain nonempty set of options. The method is applied in the area of logics with a formal consistency operator (known as LFIs), allowing us to provide in a
Canonical Signed Calculi, Nondeterministic Matrices and Cutelimination, forthcoming
 in the Proceedings of LFCS 2009, LNCS
, 2009
"... Abstract. Canonical propositional Gentzentype calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one occurrence of a connective is introduced and no other connective is mentioned. Cutelimination in such systems ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
elimination in such calculi, while for characterizing strong and standard cutelimination a stronger criterion of density is required. Modular semantics based on nondeterministic matrices are provided for every coherent canonical signed calculus. 1
DistanceBased NonDeterministic Semantics
"... Abstract. Representing uncertainty and reasoning with dynamically evolving systems are two related issues that are in the heart of many information systems. In this paper we show that these tasks can be successfully dealt with by incorporating distance semantics and nondeterministic matrices. The o ..."
Abstract
 Add to MetaCart
Abstract. Representing uncertainty and reasoning with dynamically evolving systems are two related issues that are in the heart of many information systems. In this paper we show that these tasks can be successfully dealt with by incorporating distance semantics and nondeterministic matrices
Effective Nondeterministic Semantics for firstorder LFIs
"... A paraconsistent logic is a logic which allows nontrivial inconsistent theories. One of the bestknown approaches to designing useful paraconsistent logics is da Costa’s approach, which has led to the family of Logics of Formal Inconsistency (LFIs), where the notion of inconsistency is expressed at ..."
Abstract
 Add to MetaCart
at the object level. In this paper we use nondeterministic matrices, a generalization of standard multivalued matrices, to provide simple and modular finitevalued semantics for a large family of firstorder LFIs. We demonstrate that the modular approach of Nmatrices provides new insights into the semantic
Distancebased nondeterministic semantics for reasoning with uncertainty. Logic
 Handbook of Mathematical Logic
, 2009
"... Abstract. Nondeterministic matrices, a natural generalization of manyvalued matrices, are semantic structures in which the value assigned to a complex formula may be chosen nondeterministically from a given set of options. We show that by combining nondeterministic matrices and distancebased co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Nondeterministic matrices, a natural generalization of manyvalued matrices, are semantic structures in which the value assigned to a complex formula may be chosen nondeterministically from a given set of options. We show that by combining nondeterministic matrices and distance
Nondeterministic Multivalued Matrices for Firstorder Logics of Formal Inconsistency
 Proceedings of the 37th IEEE International Symposium on MultipleValued Logics
, 2007
"... Paraconsistent logic is the study of contradictory yet nontrivial theories. One of the bestknown approaches to designing useful paraconsistent logics is da Costa’s approach, which has led to the family of Logics of Formal Inconsistency (LFIs), where the notion of inconsistency is expressed at the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
at the object level. In this paper we use nondeterministic matrices, a generalization of standard multivalued matrices, to provide simple and modular finitevalued semantics for a large family of firstorder LFIs. The modular approach provides new insights into the semantic role of each of the studied axioms
Strong CutElimination, Coherence, and Nondeterministic Semantics
, 2007
"... An (n, k)ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)ary quantifiers form a natural class of Gentzentype systems which in addition to the standard axioms and structural rules have only logical rules in which exac ..."
Abstract
 Add to MetaCart
exactly one occurrence of a quantifier is introduced. The semantics for these systems is provided using twovalued nondeterministic matrices, a generalization of the classical matrix. In this paper we use a constructive syntactic criterion of coherence to characterize strong cut
A Triple Correspondence in Canonical Calculi: Strong CutElimination, Coherence, and Nondeterministic Semantics
"... An (n, k)ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)ary quantifiers form a natural class of Gentzentype systems which in addition to the standard axioms and structural rules have only logical rules in which exa ..."
Abstract
 Add to MetaCart
exactly one occurrence of a quantifier is introduced. The semantics for these systems is provided using twovalued nondeterministic matrices, a generalization of the classical matrix. In this paper we use a constructive syntactic criterion of coherence to characterize strong cut
Reasoning with Uncertainty by Nmatrix–Metric Semantics
"... Abstract. Nondeterministic matrices, a natural generalization of manyvalued matrices, are semantic structures in which the value assigned to a complex formula may be chosen nondeterministically from a given set of options. We show that by combining Nmatrices and preferential metricsbased conside ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Nondeterministic matrices, a natural generalization of manyvalued matrices, are semantic structures in which the value assigned to a complex formula may be chosen nondeterministically from a given set of options. We show that by combining Nmatrices and preferential metrics
Results 1  10
of
161