DocumentCode
3267408
Title
Non-deterministic matrices
Author
Avron, Arnon ; Lev, Iddo
Author_Institution
Sch. of Comput. Sci., Tel-Aviv Univ., Israel
fYear
2004
fDate
19-22 May 2004
Firstpage
282
Lastpage
287
Abstract
The ordinary concept of a multiple-valued matrix is generalized by introducing non-deterministic matrices (Nmatrices), in which non-deterministic computations of truth-values are allowed. The induced logics are investigated, and a generalized compactness theorem that applies to all finite Nmatrices is proved. Among the applications, it is shown that some important logics for reasoning under uncertainty can be characterized by finite Nmatrices but not by finite ordinary matrices.
Keywords
decidability; matrix algebra; multivalued logic; uncertainty handling; decidability; finite Nmatrices; generalized compactness theorem; many-valued semantics; multiple-valued matrix; nondeterminism; nondeterministic matrices; propositional language; truth value nondeterministic computations; uncertainty reasoning; Application software; Artificial intelligence; Automata; Character generation; Computer science; Cost accounting; Gold; Logic; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 2004. Proceedings. 34th International Symposium on
ISSN
0195-623X
Print_ISBN
0-7695-2130-4
Type
conf
DOI
10.1109/ISMVL.2004.1319955
Filename
1319955
Link To Document