# 2010 40th IEEE International Symposium on Multiple-Valued Logic

## Filter Results

Displaying Results 1 - 25 of 70
• ### [Front cover]

Publication Year: 2010, Page(s): C1
| |PDF (412 KB)
• ### [Title page i]

Publication Year: 2010, Page(s): i
| |PDF (27 KB)
• ### [Title page iii]

Publication Year: 2010, Page(s): iii
| |PDF (90 KB)

Publication Year: 2010, Page(s): iv
| |PDF (147 KB)

Publication Year: 2010, Page(s):v - viii
| |PDF (185 KB)
• ### Preface

Publication Year: 2010, Page(s):ix - x
| |PDF (86 KB) | HTML
• ### Organizing Committee

Publication Year: 2010, Page(s): xi
| |PDF (100 KB)
• ### Program Committee

Publication Year: 2010, Page(s): xii
| |PDF (101 KB)

Publication Year: 2010, Page(s): xiii
| |PDF (79 KB)

Publication Year: 2010, Page(s): xiv
| |PDF (46 KB)

Classical Boolean events stand to continuous events as yes-no observables stand to observables with bounded continuous spectrum. We first show that Lukasiewicz logic has a universal role in the representation of (de Finetti coherent) probability assessments of continuous events. We then approach the problem of defining a conditional for continuous events, as a map (F, G) → P(F, G), read "th... View full abstract»

• ### Spectral Techniques: The First Decade of the XXI Century (Invited Paper)

Publication Year: 2010, Page(s):3 - 8
Cited by:  Papers (1)
| |PDF (260 KB) | HTML

Following an “unwritten tradition” this paper offers a review of another decade of achievements in the area of Spectral Techniques. Topics like transforms of matrix-valued functions, transforms based on non-Abelian groups, latest advancements related to Linear Independent transforms, a space-efficient algorithm to calculate spectral transforms, will be discussed. A special mention ... View full abstract»

• ### Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)

Publication Year: 2010, Page(s):9 - 14
Cited by:  Papers (6)  |  Patents (1)
| |PDF (243 KB) | HTML

The task of modeling and reasoning about real-world problems often involves analyzing overconstrained representations, where not all constraints of a problem can be simultaneously satisfied. The need to analyze over-constrained (or unsatisfiable) problems occurs in many settings, including data and knowledge bases, artificial intelligence, applied formal methods, operations research and descriptio... View full abstract»

• ### MDGs Reduction Technique Based on the HOL Theorem Prover

Publication Year: 2010, Page(s):15 - 20
| |PDF (287 KB) | HTML

Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams(BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this paper, we propose a reduction technique to improve MDGs model checking. We use a reduction platform based on combining MDGs together with the rewriting engine in the HOL theorem prover. The idea is to prune the transition relati... View full abstract»

• ### The Automorphism Group of Finite Godel Algebras

Publication Year: 2010, Page(s):21 - 26
| |PDF (306 KB) | HTML

We investigate the automorphism group of finite Gödel algebras, the algebraic counterpart of Godel infinite-valued propositional logic with a finite number of variables. In logical terms, we look at the structure of substitution of terms that preserve logical equivalence in this logic. We obtain a characterisation of the arising automorphism groups in terms of semidirect and direct products ... View full abstract»

• ### Schauder Hats for the Two-Variable Fragment of BL

Publication Year: 2010, Page(s):27 - 32
| |PDF (388 KB) | HTML

The theory of Schauder hats is a beautiful and powerful tool for investigating, under several respects, the algebraic semantics of &#x0141;ukasiewicz infinite-valued logic [CDM99],[MMM07], [Mun94], [P95]. As a notably application of the theory, the elements of the free n-generated MV-algebra, that constitutes the algebraic semantics of the n-variate fragment of&#x0141;ukasiewicz lo... View full abstract»

• ### Learning of the Non-threshold Functions of Multiple-Valued Logic by a Single Multi-valued Neuron with a Periodic Activation Function

Publication Year: 2010, Page(s):33 - 38
Cited by:  Papers (3)
| |PDF (449 KB) | HTML

In this paper, a theory of multiple-valued threshold functions over the field of complex numbers is further developed. k-valued threshold functions over the field of complex numbers can be learned using a single multi-valued neuron (MVN). We propose a new approach for the projection of a k-valued function, which is not a threshold one, to m-valued logic (m≫k), where this function becomes a ... View full abstract»

• ### Synthesis of Reversible Circuits with No Ancilla Bits for Large Reversible Functions Specified with Bit Equations

Publication Year: 2010, Page(s):39 - 45
Cited by:  Papers (5)
| |PDF (378 KB) | HTML

This paper presents a new algorithm MP(multiple pass) to synthesize large reversible binary circuits without ancilla bits. The MMD algorithm requires to store a truth table (or a Reed-Muller -RM transform) as a 2^n vector for a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we do not store such an exponentially growing data structure.... View full abstract»

• ### New Insights into Encodings from MaxCSP into Partial MaxSAT

Publication Year: 2010, Page(s):46 - 52
Cited by:  Papers (1)
| |PDF (263 KB) | HTML

We analyze the existing encodings from MaxCSP into Partial MaxSAT, and report on a number of new insights that we have gained from our analysis, which can be summarized as follows: (i) the at-most-one (AMO) condition can be omitted in direct encodings from MaxCSP into Partial MaxSAT, and auxiliary variables are not needed; (ii) the sequential encoding of the cardinality constraint is, in fact, a r... View full abstract»

• ### Non-deterministic Multi-valued Logics - A Tutorial

Publication Year: 2010, Page(s):53 - 60
Cited by:  Papers (1)
| |PDF (357 KB) | HTML

Non-deterministic multi-valued matrices (Nmatrices) are a new, fruitful and quickly expanding field of research first introduced a few years ago. Since then it has been rapidly developing towards a foundational logical theory and has found numerous applications. The novelty of Nmatrices is in extending the usual many-valued algebraic semantics of logical systems by importing the idea of non-determ... View full abstract»

• ### Logics of Reasonable Information Sources

Publication Year: 2010, Page(s):61 - 66
| |PDF (333 KB) | HTML

Extending the work of Belnap [3], we continue our research on ESP structures, consisting of information sources and a processor which collects information from the sources, and develops it further using certain coherent rules. We examine the case of reasonable sources which provide coherent information, characterize the logic of a single reasonable source, and prove that the logics generated by ES... View full abstract»

• ### Design of Tamper-Resistant Registers for Multiple-Valued Cryptographic Processors

Publication Year: 2010, Page(s):67 - 72
Cited by:  Papers (1)
| |PDF (387 KB) | HTML

This paper presents the design of tamper-resistant registers for multiple-valued cryptographic processors. The voltage-mode and current-mode registers are proposed for hiding dependencies between power consumption and input data. For this purpose, the voltage-mode register activates any one of two flip-flops in a complementary style, and the current-mode register maintains the number of current si... View full abstract»

• ### On a Graded Notion of t-Norm and Dominance

Publication Year: 2010, Page(s):73 - 78
Cited by:  Papers (3)
| |PDF (315 KB) | HTML

The paper studies graded properties of MTL_Delta-valued binary connectives, focusing on conjunctive connectives such as t-norms, uninorms, aggregation operators, or quasicopulas. The graded properties studied include monotony, a generalized Lipschitz property, unit and null elements, commutativity, associativity, and idempotence. Finally, a graded notion of dominance is investigated and applied to... View full abstract»

• ### Low Voltage Semi Floating-Gate Binary to Multiple-Value and Multiple-Value to Binary Converters

Publication Year: 2010, Page(s):79 - 82
Cited by:  Papers (5)
| |PDF (473 KB) | HTML

In this paper we present low-voltage multiple-valued gates. The low voltage gates may operate at a supply voltage below 250mV. We utilize the ultra low voltage CMOS logic style [1][2] to implement simple multiple-valued circuits. The radix used is determined by the supply voltage and is limited to 4 for a supply voltage equal to 250mV . Simulated data presented are valid for a ST 90nm CMOS process... View full abstract»

• ### Infinite-Valued Lukasiewicz Logic Based on Principal Lattice Filters

Publication Year: 2010, Page(s):83 - 88
Cited by:  Papers (1)
| |PDF (332 KB) | HTML

In this paper we axiomatize the formulas that, in the infinite-valued (standard) Lukasiewicz algebra, always take a value above certain fixed number. This generalizes the approach considered in the infinite-valued Lukasiewicz logic, where the fixed number is the maximum. View full abstract»

• ### Completions in Subvarieties of BL-Algebras

Publication Year: 2010, Page(s):89 - 92
| |PDF (284 KB) | HTML

In the present paper we extend the results of cite{BuCa} by completely characterizing dual canonical subvarieties of BL-algebras. These are subvarieties of algebras that satisfy the equation $x^k=x^{k+1}$ for some integer $kge 1$. As a corollary we get a full description of subvarieties of BL-algebras that admit completions. View full abstract»