Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Coalgebra (2)
- Modal logic (2)
- Algebraic theories (1)
- Belief functions (1)
- Categorical Semantics (1)
-
- Category Theory (1)
- Coalgebras (1)
- Completeness (1)
- Cover modality (1)
- DSmT (1)
- Decoding techniques (1)
- Erasure techniques (1)
- Game Theory (1)
- Information fusion (1)
- Integrity constraints (1)
- MRD (1)
- Maximum Rank Distance (1)
- Military strategies (1)
- Modal Logic (1)
- Models (1)
- Neutrosophic logic; indeterminacy; indeterminate model; indeterminate element; indeterminate mass; indeterminate fusion rules; DSmT; DST; TBM (1)
- Presentation of functors (1)
- Presentations by generators and relations (1)
- Relation lifting (1)
- Sifted colimits (1)
- Stochastic Logic (1)
- Stone duality (1)
Articles 1 - 7 of 7
Full-Text Articles in Computer Engineering
Extended Pcr Rules For Dynamic Frames, Florentin Smarandache, Jean Dezert
Extended Pcr Rules For Dynamic Frames, Florentin Smarandache, Jean Dezert
Branch Mathematics and Statistics Faculty and Staff Publications
In most of classical fusion problems modeled from belief functions, the frame of discernment is considered as static. This means that the set of elements in the frame and the underlying integrity constraints of the frame are fixed forever and they do not change with time. In some applications, like in target tracking for example, the use of such invariant frame is not very appropriate because it can truly change with time. So it is necessary to adapt the Proportional Conflict Redistribution fusion rules (PCR5 and PCR6) for working with dynamical frames. In this paper, we propose an extension of …
Completeness For The Coalgebraic Cover Modality, Clemens Kupke, Alexander Kurz, Yde Venema
Completeness For The Coalgebraic Cover Modality, Clemens Kupke, Alexander Kurz, Yde Venema
Engineering Faculty Articles and Research
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover modality depending on the type functor. Its semantics is defined in terms of a categorically defined relation lifting operation.
As the main contributions of our paper we introduce a derivation system, and prove that it provides a sound and complete axiomatization for the collection of coalgebraically valid inequalities. Our soundness and completeness proof is algebraic, …
Colonel Blotto Games And Lancaster's Equations: A Novel Military Modeling Combination, Andrew Collins, Patrick T. Hester
Colonel Blotto Games And Lancaster's Equations: A Novel Military Modeling Combination, Andrew Collins, Patrick T. Hester
VMASC Publications
Military strategists face a difficult task when engaged in a battle against an adversarial force. They have to predict both what tactics their opponent will employ and the outcomes of any resultant conflicts in order to make the best decision about their actions. Game theory has been the dominant technique used by analysts to investigate the possible actions that an enemy will employ. Traditional game theory can be augmented by use of Lanchester equations, a set of differential equations used to determine the outcome of a conflict. This paper demonstrates a novel combination of game theory and Lanchester equations using …
Erasure Techniques In Mrd Codes, Florentin Smarandache, W.B. Vasantha Kandasamy, R. Sujatha, R.S. Raja Durai
Erasure Techniques In Mrd Codes, Florentin Smarandache, W.B. Vasantha Kandasamy, R. Sujatha, R.S. Raja Durai
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors study the erasure techniques in concatenated Maximum Rank Distance (MRD) codes. The authors for the first time in this book introduce the new notion of concatenation of MRD codes with binary codes, where we take the outer code as the RD code and the binary code as the inner code. The concatenated code consists of the codewords of the outer code expressed in terms of the alphabets of the inner code. These new class of codes are defined as CRM codes. This concatenation techniques helps one to construct any CRM code of desired minimum distance …
Coalgebraic Logics (Dagstuhl Seminar 12411), Ernst-Erich Doberkat, Alexander Kurz
Coalgebraic Logics (Dagstuhl Seminar 12411), Ernst-Erich Doberkat, Alexander Kurz
Engineering Faculty Articles and Research
This report documents the program and the outcomes of Dagstuhl Seminar 12411 “Coalgebraic Logics”. The seminar deals with recent developments in the area of coalgebraic logic, a branch of logics which combines modal logics with coalgebraic semantics. Modal logic finds its uses when reasoning about behavioural and temporal properties of computation and communication, coalgebras have evolved into a general theory of systems. Consequently, it is natural to combine both areas for a mathematical description of system specification. Coalgebraic logics are closely related to the broader categories semantics/formal methods and verification/logic.
Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický
Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický
Engineering Faculty Articles and Research
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts.
Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the …
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the indeterminate models in information fusion, which are due either to the existence of some indeterminate elements in the fusion space or to some indeterminate masses. The best approach for dealing with such models is the neutrosophic logic.