Non-deterministic matrices

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...

Full description

Saved in:
Bibliographic Details
Published inProceedings. 34th International Symposium on Multiple-Valued Logic pp. 282 - 287
Main Authors Avron, A., Lev, I.
Format Conference Proceeding
LanguageEnglish
Published Los Alamitos CA IEEE 2004
IEEE Computer Society
Subjects
Application software
Applied sciences
Artificial intelligence
Automata
Character generation
Computer science
Computer science; control theory; systems
Cost accounting
Electronics
Exact sciences and technology
Gold
Integrated circuits
Integrated circuits by function (including memories and processors)
Logic
Logical, boolean and switching functions
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Theoretical computing
Uncertainty
Uncertainty
Uncertain system
Probabilistic approach
Compactness
Multivalued logic
Logical programming
Non determinism
Non deterministic system
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:0769521304
9780769521305
ISSN:0195-623X
2378-2226
DOI:10.1109/ISMVL.2004.1319955