Miquel Bofill, F. Manyà, Amanda Vidal, Mateu Villaret
{"title":"Finding Hard Instances of Satisfiability in Lukasiewicz Logics","authors":"Miquel Bofill, F. Manyà, Amanda Vidal, Mateu Villaret","doi":"10.1109/ISMVL.2015.10","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.10","url":null,"abstract":"One aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Lukasiewicz (L-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical investigation that shows an easy-hard-easy pattern and a phase transition phenomenon when testing the satisfiability of L-clausal forms.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115405284","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}
{"title":"Valuations in Nilpotent Minimum Logic","authors":"P. Codara, Diego Valota","doi":"10.1109/ISMVL.2015.19","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.19","url":null,"abstract":"The Euler characteristic can be defined as a special kind of valuation on finite distributive lattices. This work begins with some brief consideration on the role of the Euler characteristic on NM algebras, the algebraic counterpart of Nilpotent Minimum logic. Then, we introduce a new valuation, a modified version of the Euler characteristic we call idempotent Euler characteristic. We show that the new valuation encodes information about the formulas in NM propositional logic.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126890730","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}
{"title":"An Examination of the NCV-|u1 > Quantum Library Based on Minimal Circuits","authors":"Arman Allahyari-Abhari, R. Wille, R. Drechsler","doi":"10.1109/ISMVL.2015.25","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.25","url":null,"abstract":"In the recent past, significant effort has been put on the investigation of design methods for quantum circuits. Based on different physical realizations, several gate libraries have been proposed for this purpose. Recently, the so-called NCV-|v1> library has been introduced in this context. In contrast to established libraries, the NCV-|v1> library seems to inherit some significant advantages compared to established ones, e.g. with respect to the mapping from reversible circuits or the satisfaction of nearest neighbour constraints. However, all these conclusions have been drawn based on heuristically results. In this work, we perform a more in-depth examination of the NCV-|v1> library based on minimal circuits. For this purpose, an exact synthesis scheme is proposed which utilizes the power of solvers for Boolean satisfiability. Our examination clearly unveiled that, from a logic design perspective, the NCV-|v1> library indeed superiors the currently established library.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115915005","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}
{"title":"Grading Evaluation Method in Character Drawing Study Support System","authors":"Ryuichi Murakami, N. Muranaka","doi":"10.1109/ISMVL.2015.35","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.35","url":null,"abstract":"We proposed already a construction of grading evaluation method (GEM) in character drawing study support system of the self-education type for beginners. However, our proposed system had an uncertainty about the grading item, and had the problems which can not be correctly evaluated about the foundation drawing ability and the progress degrees. In this research, we propose the GEM which applied multiple-valued logic. This GEM is highly reliable and it is near the human sense.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132112887","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}
{"title":"Using QMDD in Numerical Methods for Solving Linear Differential Equations via Walsh Functions","authors":"R. Stankovic, D. M. Miller","doi":"10.1109/ISMVL.2015.32","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.32","url":null,"abstract":"This paper discusses the acceleration of computations involved in methods for solving a certain class of differential equations by Walsh series. These methods are based on computations with matrices of relatively large dimensions but having a block structure and including also the dyadic convolution matrices. We propose to represent the involved matrices by Quantum multiple-valued decision diagrams (QMDDs) and perform the computations over them. The structure of the matrices means the QMDDs are reasonably compact and therefore offer possibilities to speed up the overall computations as well as to work with matrices of large dimension which improves accuracy of the approximation of the required solutions by finite Walsh series.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134229266","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}
{"title":"Towards Fuzzy Partial Logic","authors":"L. Behounek, V. Novák","doi":"10.1109/ISMVL.2015.43","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.43","url":null,"abstract":"In this paper, we discuss the possibility to develop fuzzy partial logics in which some formulas may have undefined truth values. The main idea is to consider semantics of these logics formed by algebras of truth values extended by a special value \"*\". This value may have several interpretations, such as \"undefined\", \"meaningless\", \"non-applicable\", etc. This approach requires extension of the original connectives to new ones that behave as the original ones if all of their arguments are defined. We also present a general method of defining the new connectives and outline axioms and deduction rules for these logics.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116419629","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}
{"title":"Contribution to the Study of Ternary Functions with a Bent Reed-Muller Spectrum","authors":"C. Moraga, M. Stankovic, R. Stankovic","doi":"10.1109/ISMVL.2015.31","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.31","url":null,"abstract":"Some properties of ternary functions with bent Reed-Muller spectra are studied. The main result is, that in three big classes of bent functions, for n > 1, a necessary condition for a ternary function to have a bent Reed-Muller spectrum is that the value vector of the function satisfies f ((3n -1)/2) = 0, in which case the bent Reed-Muller spectrum will have a modular weight congruent to 0 mod 3. A new Extended-Maiorana class of ternary bent functions/spectra is introduced, which improves the production of the standard Maiorana class by a factor (3!/2)n.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133465563","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}
{"title":"Computation Time Reduction to Speed-up the Database Searching Process","authors":"Talal Bonny, B. Soudan","doi":"10.1109/ISMVL.2015.24","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.24","url":null,"abstract":"Computation time is one of the major concerns in database sequence applications such as searching process. These kinds of applications need to process many sequences and as result, consume much computation time. The mean and standard deviation of the different codes in each sequence of the database are parameters which may be used for searching process. We introduce a novel and efficient technique which computes these parameters for each sequence of the database off-line (i.e. design time). Each time a new sequence is required to be searched in the database on-line (i.e. run time), these parameter are used for comparison. Using our technique, we explicitly accelerate the database sequence searching by 35% in comparison to the traditional known methods.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115034989","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}
{"title":"Online Testing for Three Fault Models in Reversible Circuits","authors":"Asif Nashiry, Gite Gaurav Bhaskar, J. Rice","doi":"10.1109/ISMVL.2015.36","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.36","url":null,"abstract":"In this paper we propose an approach for the design of online testable reversible circuits. A reversible circuit composed of Toffoli gates can be made online testable by adding two sets of CNOT gates and a single parity line. The performance of the proposed approach for detecting a single bit fault, a cross point fault and the family of missing gate faults has been observed. Discussion around the correctness of our approach and the overhead is also provided.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123883470","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}
{"title":"Using SPIN to Check Nondeterministic Simulink Stateflow Models","authors":"Chikatoshi Yamada, D. M. Miller","doi":"10.1109/ISMVL.2015.17","DOIUrl":"https://doi.org/10.1109/ISMVL.2015.17","url":null,"abstract":"In this paper, we consider model checking of nondeterministic finite state machine. Such a machine can be specified as a Simulink Stateflow model, but cannot be directly checked for properties such as reach ability. We present tool chains that use SPIN for checking Markov state machines given as Simulink state flow models. Existing tools and languages as well as new tools introduced here are used in this work. Experimental results comparing our approach to a Prism2PROMELA tool are resented and demonstrate that our approach is more efficient. We also show how a three-valued abstraction can be used to further improve checking efficiency.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122360493","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}