发布求助
文献互助 智能选刊 最新文献

2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)最新文献

筛选
英文 中文
Extending Ideal Paraconsistent Four-Valued Logic 扩展理想副协调四值逻辑
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-22 DOI: 10.1109/ISMVL.2017.14
N. Kamide
{"title":"Extending Ideal Paraconsistent Four-Valued Logic","authors":"N. Kamide","doi":"10.1109/ISMVL.2017.14","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.14","url":null,"abstract":"We introduce a Gentzen-type sequent calculus PL for a modified extension of Arieli, Avron and Zamansky's ideal paraconsistent four-valued logic 4CC. The calculus PL, which is also regarded as a paradefinite four-valued logic, is formalized based on the idea of connexive logic. Theorems for syntactically and semantically embedding PL into a Gentzen-type sequent calculus LK for classical logic and vice versa are proved. The cut-elimination and completeness theorems for PL are obtained via these embedding theorems. Moreover, we introduce an extension EPL of both PL and a Gentzen-type sequent calculus for 4CC, and show the cut-elimination theorem for EPL. The calculus EPL has a novel characteristic property of negative symmetry.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116343106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
On Fixed Points of the Reed-Muller-Fourier Transform reed - muller -傅里叶变换的不动点
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.36
C. Moraga, R. Stankovic, M. Stankovic, S. Stojkovic
{"title":"On Fixed Points of the Reed-Muller-Fourier Transform","authors":"C. Moraga, R. Stankovic, M. Stankovic, S. Stojkovic","doi":"10.1109/ISMVL.2017.36","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.36","url":null,"abstract":"The Reed-Muller-Fourier transform combines relevant aspects of the RM transform and the DFT. It constitutes a bijection in the set of p-valued functions. Some properties of the transform matrix are formally analyzed and its eigenvectors with eigenvalue lambda = 1, which are its fixed points, are studied. Some methods to generate fixed points from known fixed points are presented and the number of fixed points for some values of p and n are given.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124042355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Term Models of Horn Clauses over Rational Pavelka Predicate Logic 有理Pavelka谓词逻辑上Horn子句的项模型
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.26
Vicent Costa, Pilar Dellunde
{"title":"Term Models of Horn Clauses over Rational Pavelka Predicate Logic","authors":"Vicent Costa, Pilar Dellunde","doi":"10.1109/ISMVL.2017.26","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.26","url":null,"abstract":"This paper is a contribution to the study of the universal Horn fragment of predicate fuzzy logics, focusing on the proof of the existence of free models of theories of Horn clauses over Rational Pavelka predicate logic. We define the notion of a term structure associated to every consistent theory T over Rational Pavelka predicate logic and we prove that the term models of T are free on the class of all models of T. Finally, it is shown that if T is a set of Horn clauses, the term structure associated to T is a model of T.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127561384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Study of GPU Acceleration in Genetic Algorithms for Quantum Circuit Synthesis 量子电路合成遗传算法中GPU加速的研究
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.24
M. Lukac, Georgiy Krylov
{"title":"Study of GPU Acceleration in Genetic Algorithms for Quantum Circuit Synthesis","authors":"M. Lukac, Georgiy Krylov","doi":"10.1109/ISMVL.2017.24","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.24","url":null,"abstract":"In this work we present a comparative study of several GPU accelerated elements of a Genetic Algorithm (GA) for the synthesis of quantum circuits on the level of Electro-Magnetic (EM) pulses. The novelty in our approach is in the implementation: a) a completely GPU accelerated quantum simulator, b) GPU accelerated genetic operators and fitness evaluation and finally c) a set of GPU implemented optimizations for GPU accelerated evolutionary search optimization for the synthesis of quantum circuits. The reason for using EM pulses model for synthesis is the observation that this model requires the largest amount of elementary rotations to implement quantumlogic gates and thus provides a good measure to evaluate the efficiency of the acceleration by the GPU processor. The reason to use a GA is the advantage of pseudo evolutionary search in very large problem space such as the one defined by the Ising model where the EM realized quantum circuits are evolved. As a result of the several GPU optimizations several new circuits implementations are presented and their cost is compared to thecurrently known Ising model implementations.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125705286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An Algorithm for Constraint Satisfaction Problem 约束满足问题的一种算法
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.20
Dmitriy Zhuk
{"title":"An Algorithm for Constraint Satisfaction Problem","authors":"Dmitriy Zhuk","doi":"10.1109/ISMVL.2017.20","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.20","url":null,"abstract":"Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on theform of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The mainproblem is to classify those subclasses that are solvable in polynomial time and those that are NP-complete. It was conjectured that if a core of a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NP-complete. In the paper we present an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128669020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Properties of the Two-Sided RMF Spectrum of Matrices 矩阵的双边RMF谱的性质
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.37
C. Moraga, R. Stankovic
{"title":"Properties of the Two-Sided RMF Spectrum of Matrices","authors":"C. Moraga, R. Stankovic","doi":"10.1109/ISMVL.2017.37","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.37","url":null,"abstract":"The Reed-Muller-Fourier transform, defined in a q-valued domain, is applied to obtain two-sided spectra of classes of matrices, which may be interpreted as representing pixels of pictures or patterns. Operations on matrices, representing operations on pictures are considered, and their effect in the spectral domain is analyzed. It is shown that the transform is very effective to calculate the spectrum of mosaics and is sensitive to the existence and position of a pixel-noise. Moreover, there are some matrices which are fixed points of the transform.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128681567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Study of Reversible Ternary Functions with Homogeneous Component Functions 具有齐次分量函数的可逆三元函数的研究
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.54
P. Kerntopf, K. Podlaski, C. Moraga, R. Stankovic
{"title":"Study of Reversible Ternary Functions with Homogeneous Component Functions","authors":"P. Kerntopf, K. Podlaski, C. Moraga, R. Stankovic","doi":"10.1109/ISMVL.2017.54","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.54","url":null,"abstract":"Reversible computation is one of the intensively developing research areas nowadays in the field of computer science and engineering. Although the field of reversible circuit synthesis has been studied during the last 15 years few attempts have been published to propose classification of reversible functions. In an earlier paper we considered whether all component functions of a reversible Boolean function either can have the same property in the sense of classical logic synthesis or can belong to the same equivalent class under some equivalence relations. This problem has a direct relationship to studying different aspects of classification of reversible functions. In this paper we present reversible ternary functions of any number of variables with all component functions having the same property or belonging to the same equivalence class.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129374371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Index Generation Functions: Minimization Methods 索引生成函数:最小化方法
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.22
Tsutomu Sasao
{"title":"Index Generation Functions: Minimization Methods","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL.2017.22","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.22","url":null,"abstract":"Incompletely specified index generation functions can often be represented with fewer variables than original functions by appropriately assigning values to don't cares. The number of variables can be further reduced by using a linear transformation to the input variables. Minimization of variables under such conditions was considered to be a very hard problem. This paper surveys minimization methods for index generation functions. Major topics include 1) An upper bound on the number of variables to represent index generation functions,2) A heuristic minimization method using an ambiguity measure,3) A heuristic minimization method using remainders of a polynomial on GF(2),4) An exact minimization method using a SAT solver, and 5) Comparison of minimization methods.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114140739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Nomura Parameters for S-Threshold Functions S-Threshold函数的野村参数
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.53
I. Prokić, J. Pantović
{"title":"Nomura Parameters for S-Threshold Functions","authors":"I. Prokić, J. Pantović","doi":"10.1109/ISMVL.2017.53","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.53","url":null,"abstract":"A multilevel S-threshold function characterizes a partition of a discrete point set (the domain of the function)into nonempty subsets. Each subset is labeled by one element (level) of the image set. We propose an encoding that converts a multilevel S-threshold function into a tuple of positive integers. The components of this code are generalisation of well known Chow and Nomura parameters. We derive upper bounds for the number of linear, the number of multilinear and the number of polynomial threshold functions. Comparing the encoding proposed in this paper with the one that uses discrete moments, we show that there are cases when we can get lower upper bounds for the number of considered functions.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125233076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The Groupoid-Based Logic for Lattice Effect Algebras 基于groupoid的格效应代数逻辑
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2017-05-01 DOI: 10.1109/ISMVL.2017.15
I. Chajda, H. Länger, Jan Paseka
{"title":"The Groupoid-Based Logic for Lattice Effect Algebras","authors":"I. Chajda, H. Länger, Jan Paseka","doi":"10.1109/ISMVL.2017.15","DOIUrl":"https://doi.org/10.1109/ISMVL.2017.15","url":null,"abstract":"The aim of the paper is to establish a certain logic corresponding to lattice effect algebras. First, we answer a natural question whether a lattice effect algebra can be represented by means of a groupoid-like structure. We establish a one-to-one correspondence between lattice effect algebras and certain groupoids with an antitone involution. Using these groupoids, we are able to introduce a suitable logic for lattice effect algebras.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127721195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信