Researches on Six Lattice-Valued Logic

Based on the direct product of Boolean algebra and Lukasiewicz algebra, six lattice-valued logic is put forward in this paper. The algebraic structure and properties of the lattice are analyzed profoundly and the tautologies of six-valued logic system L6P(X) are discussed deeply. The researches of this paper can be used in lattice-valued logic systems and can be helpful to automated reasoning systems.

Agents and Lattice-valued Logic

In fuzzy set theory, instead of the underlying membership set being a two-valued set it is a multi-valued set that generally has the structure of a lattice L with a minimal element O and the maximal element I. Furthermore if ∧, ∨, → and ┐ are defined in the set L, then we can use these operations to define, as in the ordinary set theory, operations on fuzzy subsets. In this paper we give a model of the Lattice-Valued Logic with set of agents. Any agents know the logic value of a sentence p. The logic value is compatible with all of the accessible conceptual models or worlds of p inside the agent. Agent can be rational or irrational in the use of the logic operation. Every agent of n agents can have the same set of conceptual models for p and know the same logic for p in this case the agents form a consistent group of agents. When agents have different conceptual models for p, different subgroup of agents know different logic value for p. In this case the n agents are inconsistent in the expression of the logic value for p. The valuation structure of set of agents can be used as a semantic model for the Lattice-valued Logic and fuzzy logic.

Closure Operators of Lattice-valued Propositional Logic LP(X)

In this paper, closure operators of lattice-valued propositional logic LP（X） are studied. A family of classical closure operators are defined and the relation between them and closure operators of LP（X） is investigated. At the same time, a tool for checking compactness of LP（X） is given.

Syntactic Extension of Lattice-valued Propositional Logic LP(X)

We have given a semantic extension of lattice-valued propositional logic LP（X） in [6]. In this paper, we investigate its corresponding syntactic extension of LP（X） and give the relations between these two extensions.

The Syntax of Lattice-Valued Propositional Logic System lp(X)

Lattice-valued logic plays an important role in multi-valued logic systems. A lattice valued logic system lp(X) is constructed. The syntax of lp(X) is discussed. It may be more convenient in application and study especially in the case that the valuation domain is finite lattice implication algebra.

Automata theory based on complete residuated lattice-valued logic

This paper establishes a fundamental framework of automata theory based on complete residuated lattice-valued logic. First it deals with how to extend the transition relation of states and par-ticularly presents a characterization of residuated lattice by fuzzy automata (called (?) valued automata). After that fuzzy subautomata (called (?) valued subautomata), successor and source operators are pro-posed and their basic properties as well as the equivalent relation among them are discussed, from which it follows that the two fuzzy operators are exactly fuzzy closure operators. Finally an L bifuzzy topological characterization of Q valued automata is presented, so a more generalized fuzzy automata theory is built.

Automata theory based on complete residuated lattice-valued logic (Ⅱ)

It reveals some equivalences between automata based on complete residuated lattice-valued logic (called (?) valued automata) and the truth-value lattice of the underlying logic (i.e. residuated lattice). In particular, it demonstrates several basic equivalent characterizations on the retriev-ability of (?) valued automata. Finally, the connections of the homomorphisms between two eeeeeeeeee valued automata to continuous mappings and open mappings are clarified. So this paper establishes further the more profound fuzzy automata theory.

Lattice-Valued Proposition Logic(Ⅱ)

In this paper, the syntactical problenss of lattice- valued proptnitional logicsystem LP(X) are discuased , the soundness theorem and the deduction thooremare given, and the adequaey problem of LP(X) is solved with slishtrestriction.

Fuzzy Topology Based on Residuated Lattice-Valued Logic

We use a semantical method of complete residuated lattice-valued logic to give a general- ization of fuzzy topology as a partial answer to a problem by Rosser and Turquette.

A 16-bit 18-MSPS flash-assisted SAR ADC with hybrid synchronous and asynchronous control logic

This paper presents a 16-bit,18-MSPS(million samples per second)flash-assisted successive-approximation-register(SAR)analog-to-digital converter(ADC)utilizing hybrid synchronous and asynchronous(HYSAS)timing control logic based on an on-chip delay-locked loop(DLL).The HYSAS scheme can provide a longer settling time for the capacitive digital-to-analog converter(CDAC)than the synchronous and asynchronous SAR ADC.Therefore,the issue of incomplete settling or ringing in the DAC voltage for cases of either on-chip or off-chip reference voltage can be solved to a large extent.In addition,the fore-ground calibration of the CDAC’s mismatch is performed with a finite-impulse-response bandpass filter(FIR-BPF)based least-mean-square(LMS)algorithm in an off-chip FPGA(field programmable gate array).Fabricated in 40-nm CMOS process,the proto-type ADC achieves 94.02-dB spurious-free dynamic range(SFDR),and 75.98-dB signal-to-noise-and-distortion ratio(SNDR)for a 2.88-MHz input under 18-MSPS sampling rate.

Declarative semantics of programming in residuated lattice-valued logic

We give two generalizations of Tarski’s fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski’s least fixpoint semantics for residuated lattice-valued logic programs.

A Survey on Type-3 Fuzzy Logic Systems and Their Control Applications

In this paper,we offer a review of type-3 fuzzy logic systems and their applications in control.The main objective of this work is to observe and analyze in detail the applications in the control area using type-3 fuzzy logic systems.In this case,we review their most important applications in control and other related topics with type-3 fuzzy systems.Intelligent algorithms have been receiving increasing attention in control and for this reason a review in this area is important.This paper reviews the main applications that make use of Intelligent Computing methods.Specifically,type-3 fuzzy logic systems.The aim of this research is to be able to appreciate,in detail,the applications in control systems and to point out the scientific trends in the use of Intelligent Computing techniques.This is done with the construction and visualization of bibliometric networks,developed with VosViewer Software,which it is a free Java-based program,mainly intended to be used for analyzing and visualizing bibliometric networks.With this tool,we can create maps of publications,authors,or journals based on a co-citation network or construct maps of keywords,countries based on a co-occurrence networks,research groups,etc.

A Formal Model for Analyzing Fair Exchange Protocols Based on Event Logic

Fair exchange protocols play a critical role in enabling two distrustful entities to conduct electronic data exchanges in a fair and secure manner.These protocols are widely used in electronic payment systems and electronic contract signing,ensuring the reliability and security of network transactions.In order to address the limitations of current research methods and enhance the analytical capabilities for fair exchange protocols,this paper proposes a formal model for analyzing such protocols.The proposed model begins with a thorough analysis of fair exchange protocols,followed by the formal definition of fairness.This definition accurately captures the inherent requirements of fair exchange protocols.Building upon event logic,the model incorporates the time factor into predicates and introduces knowledge set axioms.This enhancement empowers the improved logic to effectively describe the state and knowledge of protocol participants at different time points,facilitating reasoning about their acquired knowledge.To maximize the intruder’s capabilities,channel errors are translated into the behaviors of the intruder.The participants are further categorized into honest participants and malicious participants,enabling a comprehensive evaluation of the intruder’s potential impact.By employing a typical fair exchange protocol as an illustrative example,this paper demonstrates the detailed steps of utilizing the proposed model for protocol analysis.The entire process of protocol execution under attack scenarios is presented,shedding light on the underlying reasons for the attacks and proposing corresponding countermeasures.The developedmodel enhances the ability to reason about and evaluate the security properties of fair exchange protocols,thereby contributing to the advancement of secure network transactions.

Logical stochastic resonance in a cross-bifurcation non-smooth system

This paper investigates logical stochastic resonance(LSR)in a cross-bifurcation non-smooth system driven by Gaussian colored noise.In this system,a bifurcation parameter triggers a transition between monostability,bistability and tristability.By using Novikov's theorem and the unified colored noise approximation method,the approximate Fokker-Planck equation is obtained.Then we derive the generalized potential function and the transition rates to analyze the LSR phenomenon using numerical simulations.We simulate the logic operation of the system in the bistable and tristable regions respectively.We assess the impact of Gaussian colored noise on the LSR and discover that the reliability of the logic response depends on the noise strength and the bifurcation parameter.Furthermore,it is found that the bistable region has a more extensive parameter range to produce reliable logic operation compared with the tristable region,since the tristable region is more sensitive to noise than the bistable one.

RESTlogic: Detecting Logic Vulnerabilities in Cloud REST APIs

logical testing model and resource lifecycle information,generate test cases and complete parameters,and alleviate inconsistency issues through parameter inference.Once again,we propose a method of analyzing test results using joint state codes and call stack information,which compensates for the shortcomings of traditional analysis methods.We will apply our method to testing REST services,including OpenStack,an open source cloud operating platform for experimental evaluation.We have found a series of inconsistencies,known vulnerabilities,and new unknown logical defects.

Multi-modal knowledge graph inference via media convergence and logic rule

Media convergence works by processing information from different modalities and applying them to different domains.It is difficult for the conventional knowledge graph to utilise multi-media features because the introduction of a large amount of information from other modalities reduces the effectiveness of representation learning and makes knowledge graph inference less effective.To address the issue,an inference method based on Media Convergence and Rule-guided Joint Inference model(MCRJI)has been pro-posed.The authors not only converge multi-media features of entities but also introduce logic rules to improve the accuracy and interpretability of link prediction.First,a multi-headed self-attention approach is used to obtain the attention of different media features of entities during semantic synthesis.Second,logic rules of different lengths are mined from knowledge graph to learn new entity representations.Finally,knowledge graph inference is performed based on representing entities that converge multi-media features.Numerous experimental results show that MCRJI outperforms other advanced baselines in using multi-media features and knowledge graph inference,demonstrating that MCRJI provides an excellent approach for knowledge graph inference with converged multi-media features.

Spin logic devices based on negative differential resistance -enhanced anomalous Hall effect

Owing to rapid developments in spintronics,spin-based logic devices have emerged as promising tools for next-generation computing technologies.This paper provides a comprehensive review of recent advancements in spin logic devices,particularly focusing on fundamental device concepts rooted in nanomagnets,magnetoresistive random access memory,spin–orbit torques,electric-field modu-lation,and magnetic domain walls.The operation principles of these devices are comprehensively analyzed,and recent progress in spin logic devices based on negative differential resistance-enhanced anomalous Hall effect is summarized.These devices exhibit reconfigur-able logic capabilities and integrate nonvolatile data storage and computing functionalities.For current-driven spin logic devices,negative differential resistance elements are employed to nonlinearly enhance anomalous Hall effect signals from magnetic bits,enabling reconfig-urable Boolean logic operations.Besides,voltage-driven spin logic devices employ another type of negative differential resistance ele-ment to achieve logic functionalities with excellent cascading ability.By cascading several elementary logic gates,the logic circuit of a full adder can be obtained,and the potential of voltage-driven spin logic devices for implementing complex logic functions can be veri-fied.This review contributes to the understanding of the evolving landscape of spin logic devices and underscores the promising pro-spects they offer for the future of emerging computing schemes.

Implementation of Fuzzy Logic Control into an Equivalent Minimization Strategy for Adaptive Energy Management of A Parallel Hybrid Electric Vehicle

As government agencies continue to tighten emissions regulations due to the continued increase in greenhouse gas production, automotive industries are seeking to produce increasingly efficient vehicle technology. Hybrid electric vehicles (HEVs) have been introduced to mitigate problems while improving fuel economy. HEVs have led to the demand of creating more advanced controls software to consider multiple components for propulsive power in a vehicle. A large section in the software development process is the implementation of an optimal energy management strategy meant to improve the overall fuel efficiency of the vehicle. Optimal strategies can be implemented when driving conditions are known a prior. The Equivalent Consumption Minimization Strategy (ECMS) is an optimal control strategy that uses an equivalence factor to equate electrical to mechanical power when performing torque split determination between the internal combustion engine and electric motor for propulsive and regenerative torque. This equivalence factor is determined from offline vehicle simulations using a sensitivity analysis to provide optimal fuel economy results while maintaining predetermined high voltage battery state of charge (SOC) constraints. When the control hierarchy is modified or different driving styles are applied, the analysis must be redone to update the equivalence factor. The goal of this work is to implement a fuzzy logic controller that dynamically updates the equivalence factor to improve fuel economy, maintain a strict charge sustaining window of operation for the high voltage battery, and reduce computational time required during algorithm development. The adaptive algorithm is validated against global optimum fuel economy and charge sustaining results from a sensitivity analysis performed for multiple drive cycles. Results show a maximum fuel economy improvement of 9.82% when using a mild driving style and a 95% success rate when maintaining an ending SOC within 5% of the desired SOC regardless of starting SOC.

Hierarchical Controller Synthesis Under Linear Temporal Logic Specifications Using Dynamic Quantization

Linear temporal logic(LTL)is an intuitive and expressive language to specify complex control tasks,and how to design an efficient control strategy for LTL specification is still a challenge.In this paper,we implement the dynamic quantization technique to propose a novel hierarchical control strategy for nonlinear control systems under LTL specifications.Based on the regions of interest involved in the LTL formula,an accepting path is derived first to provide a high-level solution for the controller synthesis problem.Second,we develop a dynamic quantization based approach to verify the realization of the accepting path.The realization verification results in the necessity of the controller design and a sequence of quantization regions for the controller design.Third,the techniques of dynamic quantization and abstraction-based control are combined together to establish the local-to-global control strategy.Both abstraction construction and controller design are local and dynamic,thereby resulting in the potential reduction of the computational complexity.Since each quantization region can be considered locally and individually,the proposed hierarchical mechanism is more efficient and can solve much larger problems than many existing methods.Finally,the proposed control strategy is illustrated via two examples from the path planning and tracking problems of mobile robots.

A Neuro T-Norm Fuzzy Logic Based System

In this study, we are first examining well-known approach to improve fuzzy reasoning model (FRM) by use of the genetic-based learning mechanism [1]. Later we propose our alternative way to build FRM, which has significant precision advantages and does not require any adjustment/learning. We put together neuro-fuzzy system (NFS) to connect the set of exemplar input feature vectors (FV) with associated output label (target), both represented by their membership functions (MF). Next unknown FV would be classified by getting upper value of current output MF. After that the fuzzy truths for all MF upper values are maximized and the label of the winner is considered as the class of the input FV. We use the knowledge in the exemplar-label pairs directly with no training. It sets up automatically and then classifies all input FV from the same population as the exemplar FVs. We show that our approach statistically is almost twice as accurate, as well-known genetic-based learning mechanism FRM.