Synthesizing genetic sequential logic circuit with clock pulse generator.
Chuang, Chia-Hua; Lin, Chun-Liang
2014-05-28
Rhythmic clock widely occurs in biological systems which controls several aspects of cell physiology. For the different cell types, it is supplied with various rhythmic frequencies. How to synthesize a specific clock signal is a preliminary but a necessary step to further development of a biological computer in the future. This paper presents a genetic sequential logic circuit with a clock pulse generator based on a synthesized genetic oscillator, which generates a consecutive clock signal whose frequency is an inverse integer multiple to that of the genetic oscillator. An analogous electronic waveform-shaping circuit is constructed by a series of genetic buffers to shape logic high/low levels of an oscillation input in a basic sinusoidal cycle and generate a pulse-width-modulated (PWM) output with various duty cycles. By controlling the threshold level of the genetic buffer, a genetic clock pulse signal with its frequency consistent to the genetic oscillator is synthesized. A synchronous genetic counter circuit based on the topology of the digital sequential logic circuit is triggered by the clock pulse to synthesize the clock signal with an inverse multiple frequency to the genetic oscillator. The function acts like a frequency divider in electronic circuits which plays a key role in the sequential logic circuit with specific operational frequency. A cascaded genetic logic circuit generating clock pulse signals is proposed. Based on analogous implement of digital sequential logic circuits, genetic sequential logic circuits can be constructed by the proposed approach to generate various clock signals from an oscillation signal.
Sequential operators in computability logic
Japaridze, Giorgi
2007-01-01
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more traditionally been. Formulas in CL stand for (interactive) computational problems, understood as games between a machine and its environment; logical operators represent operations on such entities; and "truth" is understood as existence of an effective solution, i.e., of an algorithmic winning strategy. The formalism of CL is open-ended, and may undergo series of extensions as the study of the subject advances. The main groups of operators on which CL has been focused so far are the parallel, choice, branching, and blind operators. The present paper introduces a new important group of operators, called sequential. The latter come in the form of sequential conjunction and disjunction, sequential quantifiers, and sequential recurrences. As the name may suggest, the algorithmic ...
Amplifying genetic logic gates.
Bonnet, Jerome; Yin, Peter; Ortiz, Monica E; Subsoontorn, Pakpoom; Endy, Drew
2013-05-03
Organisms must process information encoded via developmental and environmental signals to survive and reproduce. Researchers have also engineered synthetic genetic logic to realize simpler, independent control of biological processes. We developed a three-terminal device architecture, termed the transcriptor, that uses bacteriophage serine integrases to control the flow of RNA polymerase along DNA. Integrase-mediated inversion or deletion of DNA encoding transcription terminators or a promoter modulates transcription rates. We realized permanent amplifying AND, NAND, OR, XOR, NOR, and XNOR gates actuated across common control signal ranges and sequential logic supporting autonomous cell-cell communication of DNA encoding distinct logic-gate states. The single-layer digital logic architecture developed here enables engineering of amplifying logic gates to control transcription rates within and across diverse organisms.
Nonlinear interferometry approach to photonic sequential logic
Mabuchi, Hideo
2011-01-01
Motivated by rapidly advancing capabilities for extensive nanoscale patterning of optical materials, I propose an approach to implementing photonic sequential logic that exploits circuit-scale phase coherence for efficient realizations of fundamental components such as a NAND-gate-with-fanout and a bistable latch. Kerr-nonlinear optical resonators are utilized in combination with interference effects to drive the binary logic. Quantum-optical input-output models are characterized numerically using design parameters that yield attojoule-scale energy separation between the latch states.
An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory
Hirai, Yoichi
In the celebrated Gödel Prize winning papers, Herlihy, Shavit, Saks and Zaharoglou gave topological characterization of waitfree computation. In this paper, we characterize waitfree communication logically. First, we give an intuitionistic epistemic logic k∨ for asynchronous communication. The semantics for the logic k∨ is an abstraction of Herlihy and Shavit's topological model. In the same way Kripke model for intuitionistic logic informally describes an agent increasing its knowledge over time, the semantics of k∨ describes multiple agents passing proofs around and developing their knowledge together. On top of the logic k∨, we give an axiom type that characterizes sequential consistency on shared memory. The advantage of intuitionistic logic over classical logic then becomes apparent as the axioms for sequential consistency are meaningless for classical logic because they are classical tautologies. The axioms are similar to the axiom type for prelinearity (ϕ ⊃ ψ) ∨ (ψ ⊃ ϕ). This similarity reflects the analogy between sequential consistency for shared memory scheduling and linearity for Kripke frames: both require total order on schedules or models. Finally, under sequential consistency, we give soundness and completeness between a set of logical formulas called waitfree assertions and a set of models called waitfree schedule models.
DNA Sequential Logic Gate Using Two-Ring DNA.
Zhang, Cheng; Shen, Linjing; Liang, Chao; Dong, Yafei; Yang, Jing; Xu, Jin
2016-04-13
Sequential DNA detection is a fundamental issue for elucidating the interactive relationships among complex gene systems. Here, a sequential logic DNA gate was achieved by utilizing the two-ring DNA structure, with the ability to recognize "before" and "after" triggering sequences of DNA signals. By taking advantage of a "loop-open" mechanism, separations of two-ring DNAs were controlled. Three triggering pathways with different sequential DNA treatments were distinguished by comparing fluorescent outputs. Programmed nanoparticle arrangement guided by "interlocked" two-ring DNA was also constructed to demonstrate the achievement of designed nanostrucutres. Such sequential logic DNA operation may guide future molecular sensors to monitor more complex gene network in biological systems.
Sequential logic model deciphers dynamic transcriptional control of gene expressions.
Directory of Open Access Journals (Sweden)
Zhen Xuan Yeo
Full Text Available BACKGROUND: Cellular signaling involves a sequence of events from ligand binding to membrane receptors through transcription factors activation and the induction of mRNA expression. The transcriptional-regulatory system plays a pivotal role in the control of gene expression. A novel computational approach to the study of gene regulation circuits is presented here. METHODOLOGY: Based on the concept of finite state machine, which provides a discrete view of gene regulation, a novel sequential logic model (SLM is developed to decipher control mechanisms of dynamic transcriptional regulation of gene expressions. The SLM technique is also used to systematically analyze the dynamic function of transcriptional inputs, the dependency and cooperativity, such as synergy effect, among the binding sites with respect to when, how much and how fast the gene of interest is expressed. PRINCIPAL FINDINGS: SLM is verified by a set of well studied expression data on endo16 of Strongylocentrotus purpuratus (sea urchin during the embryonic midgut development. A dynamic regulatory mechanism for endo16 expression controlled by three binding sites, UI, R and Otx is identified and demonstrated to be consistent with experimental findings. Furthermore, we show that during transition from specification to differentiation in wild type endo16 expression profile, SLM reveals three binary activities are not sufficient to explain the transcriptional regulation of endo16 expression and additional activities of binding sites are required. Further analyses suggest detailed mechanism of R switch activity where indirect dependency occurs in between UI activity and R switch during specification to differentiation stage. CONCLUSIONS/SIGNIFICANCE: The sequential logic formalism allows for a simplification of regulation network dynamics going from a continuous to a discrete representation of gene activation in time. In effect our SLM is non-parametric and model-independent, yet
An Undergraduate Survey Course on Asynchronous Sequential Logic, Ladder Logic, and Fuzzy Logic
Foster, D. L.
2012-01-01
For a basic foundation in computer engineering, universities traditionally teach synchronous sequential circuit design, using discrete gates or field programmable gate arrays, and a microcomputers course that includes basic I/O processing. These courses, though critical, expose students to only a small subset of tools. At co-op schools like…
An Undergraduate Survey Course on Asynchronous Sequential Logic, Ladder Logic, and Fuzzy Logic
Foster, D. L.
2012-01-01
For a basic foundation in computer engineering, universities traditionally teach synchronous sequential circuit design, using discrete gates or field programmable gate arrays, and a microcomputers course that includes basic I/O processing. These courses, though critical, expose students to only a small subset of tools. At co-op schools like…
Design of Asynchronous Sequential Circuits using Reversible Logic Gates
Directory of Open Access Journals (Sweden)
Bahram Dehghan
2012-09-01
Full Text Available In recent literature, Reversible logic has become one of the promising arena in low power dissipating circuit design in the past few years and has found its applications in low power CMOS circuits ,optical information processing and nanotechnology. The reversible circuits form the basic building block of quantum computers as all quantum operations are reversible. This paper presents asynchronoussequential circuits and circuits without hazard effect using reversible logic gates. I illustrate that we can produce AND, OR, NAND, NOR, EXOR and EXNOR outputs in one design using reversible logic gates. Also, I will evaluate the proposed circuits. The results show that reversible logic can be used to design these circuits. In this paper, the number of gates and garbage outputs is considered.
Design of Reversible Sequential Circuit Using Reversible Logic Synthesis
Directory of Open Access Journals (Sweden)
Md. Belayet Ali
2011-12-01
Full Text Available Reversible logic is one of the most vital issue at present time and it has different areas for its application,those are low power CMOS, quantum computing, nanotechnology, cryptography, optical computing, DNA computing, digital signal processing (DSP, quantum dot cellular auto meta, communication, computer graphics. It is not possible to realize quantum computing without implementation of reversible logic. The main purposes of designing reversible logic are to decrease quantum cost, depth of the circuits and the number of garbage outputs. In this paper, we have proposed a new reversible gate. And we have designed RS flip flop and D flip flop by using our proposed gate and Peres gate. The proposed designs are better than the existing proposed ones in terms of number of reversible gates and garbage outputs. So, this realization is more efficient and less costly than other realizations.
Design of Reversible Sequential Circuit Using Reversible Logic Synthesis
Directory of Open Access Journals (Sweden)
Md. Mosharof Hossin
2012-01-01
Full Text Available Reversible logic is one of the most vital issue at present time and it has different areas for its application, those are low power CMOS, quantum computing, nanotechnology, cryptography, optical computing, DNA computing, digital signal processing (DSP, quantum dot cellular automata, communication, computer graphics. It is not possible to realize quantum computing without implementation of reversible logic. The main purposes of designing reversible logic are to decrease quantum cost, depth of the circuits and the number of garbage outputs. In this paper, we have proposed a new reversible gate. And we have designedRS flip flop and D flip flop by using our proposed gate and Peres gate. The proposed designs are better than the existing proposed ones in terms of number of reversible gates and garbage outputs. So, this realization is more efficient and less costly than other realizations.
Hybrid Genetic Algorithms with Fuzzy Logic Controller
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.``
Simulation Approach for Timing Analysis of Genetic Logic Circuits.
Baig, Hasan; Madsen, Jan
2017-02-01
Constructing genetic logic circuits is an application of synthetic biology in which parts of the DNA of a living cell are engineered to perform a dedicated Boolean function triggered by an appropriate concentration of certain proteins or by different genetic components. These logic circuits work in a manner similar to electronic logic circuits, but they are much more stochastic and hence much harder to characterize. In this article, we introduce an approach to analyze the threshold value and timing of genetic logic circuits. We show how this approach can be used to analyze the timing behavior of single and cascaded genetic logic circuits. We further analyze the timing sensitivity of circuits by varying the degradation rates and concentrations. Our approach can be used not only to characterize the timing behavior but also to analyze the timing constraints of cascaded genetic logic circuits, a capability that we believe will be important for design automation in synthetic biology.
Logic analysis and verification of n-input genetic logic circuits
DEFF Research Database (Denmark)
Baig, Hasan; Madsen, Jan
2017-01-01
Nature is using genetic logic circuits to regulate the fundamental processes of life. These genetic logic circuits are triggered by a combination of external signals, such as chemicals, proteins, light and temperature, to emit signals to control other gene expressions or metabolic pathways...... accordingly. As compared to electronic circuits, genetic circuits exhibit stochastic behavior and do not always behave as intended. Therefore, there is a growing interest in being able to analyze and verify the logical behavior of a genetic circuit model, prior to its physical implementation in a laboratory....... In this paper, we present an approach to analyze and verify the Boolean logic of a genetic circuit from the data obtained through stochastic analog circuit simulations. The usefulness of this analysis is demonstrated through different case studies illustrating how our approach can be used to verify the expected...
Simulation Approach for Timing Analysis of Genetic Logic Circuits
DEFF Research Database (Denmark)
Baig, Hasan; Madsen, Jan
2017-01-01
in a manner similar to electronic logic circuits, but they are much more stochastic and hence much harder to characterize. In this article, we introduce an approach to analyze the threshold value and timing of genetic logic circuits. We show how this approach can be used to analyze the timing behavior...
A reconfigurable NAND/NOR genetic logic gate.
Goñi-Moreno, Angel; Amos, Martyn
2012-09-18
Engineering genetic Boolean logic circuits is a major research theme of synthetic biology. By altering or introducing connections between genetic components, novel regulatory networks are built in order to mimic the behaviour of electronic devices such as logic gates. While electronics is a highly standardized science, genetic logic is still in its infancy, with few agreed standards. In this paper we focus on the interpretation of logical values in terms of molecular concentrations. We describe the results of computational investigations of a novel circuit that is able to trigger specific differential responses depending on the input standard used. The circuit can therefore be dynamically reconfigured (without modification) to serve as both a NAND/NOR logic gate. This multi-functional behaviour is achieved by a) varying the meanings of inputs, and b) using branch predictions (as in computer science) to display a constrained output. A thorough computational study is performed, which provides valuable insights for the future laboratory validation. The simulations focus on both single-cell and population behaviours. The latter give particular insights into the spatial behaviour of our engineered cells on a surface with a non-homogeneous distribution of inputs. We present a dynamically-reconfigurable NAND/NOR genetic logic circuit that can be switched between modes of operation via a simple shift in input signal concentration. The circuit addresses important issues in genetic logic that will have significance for more complex synthetic biology applications.
Timing Analysis of Genetic Logic Circuits using D-VASim
DEFF Research Database (Denmark)
Baig, Hasan; Madsen, Jan
A genetic logic circuit is a gene regulator network implemented by re-engineering the DNA of a cell, in order to controlgene expression or metabolic pathways, through a logic combination of external signals, such as chemicals or proteins. As for electroniclogic circuits, timing and propagation...... delay analysis may play a very significant role in the designing of genetic logic circuits. In thisdemonstration, we present the capability of D-VASim (Dynamic Virtual Analyzer and Simulator) to perform the timing and propagationdelay analysis of genetic logic circuits. Using D-VASim, the timing...... and propagation delay analysis of single as well as cascaded geneticlogic circuits can be performed. D-VASim allows user to change the circuit parameters during runtime simulation to observe its effectson circuit’s timing behavior. The results obtained from D-VASim can be used not only to characterize the timing...
Genetic Algorithm Tuned Fuzzy Logic for Gliding Return Trajectories
Burchett, Bradley T.
2003-01-01
The problem of designing and flying a trajectory for successful recovery of a reusable launch vehicle is tackled using fuzzy logic control with genetic algorithm optimization. The plant is approximated by a simplified three degree of freedom non-linear model. A baseline trajectory design and guidance algorithm consisting of several Mamdani type fuzzy controllers is tuned using a simple genetic algorithm. Preliminary results show that the performance of the overall system is shown to improve with genetic algorithm tuning.
时序逻辑电路设计的Petri网方法%Design of Sequential Logic Circuit Based on Petri Net
Institute of Scientific and Technical Information of China (English)
张继军; 吴哲辉
2002-01-01
A new method for designing sequential logic circuits is put forward in this paper. The method is that driv-ing condition for flip-flops is obtained by means of the transition firing condition of petri net and that designing asyn-chronous sequential circuits and synchronous sequential circuits can be unified.
Identifying Interacting Genetic Variations by Fish-Swarm Logic Regression
Yang, Aiyuan; Yan, Chunxia; Zhu, Feng; Zhao, Zhongmeng; Cao, Zhi
2013-01-01
Understanding associations between genotypes and complex traits is a fundamental problem in human genetics. A major open problem in mapping phenotypes is that of identifying a set of interacting genetic variants, which might contribute to complex traits. Logic regression (LR) is a powerful multivariant association tool. Several LR-based approaches have been successfully applied to different datasets. However, these approaches are not adequate with regard to accuracy and efficiency. In this paper, we propose a new LR-based approach, called fish-swarm logic regression (FSLR), which improves the logic regression process by incorporating swarm optimization. In our approach, a school of fish agents are conducted in parallel. Each fish agent holds a regression model, while the school searches for better models through various preset behaviors. A swarm algorithm improves the accuracy and the efficiency by speeding up the convergence and preventing it from dropping into local optimums. We apply our approach on a real screening dataset and a series of simulation scenarios. Compared to three existing LR-based approaches, our approach outperforms them by having lower type I and type II error rates, being able to identify more preset causal sites, and performing at faster speeds. PMID:23984382
Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms
Directory of Open Access Journals (Sweden)
L. M. Galantucci
2004-06-01
Full Text Available The authors propose the implementation of hybrid Fuzzy Logic-Genetic Algorithm (FL-GA methodology to plan the automatic assembly and disassembly sequence of products. The GA-Fuzzy Logic approach is implemented onto two levels. The first level of hybridization consists of the development of a Fuzzy controller for the parameters of an assembly or disassembly planner based on GAs. This controller acts on mutation probability and crossover rate in order to adapt their values dynamically while the algorithm runs. The second level consists of the identification of the optimal assembly or disassembly sequence by a Fuzzy function, in order to obtain a closer control of the technological knowledge of the assembly/disassembly process. Two case studies were analyzed in order to test the efficiency of the Fuzzy-GA methodologies.
Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms
Directory of Open Access Journals (Sweden)
L.M. Galantucci
2008-11-01
Full Text Available The authors propose the implementation of hybrid Fuzzy Logic-Genetic Algorithm (FL-GA methodology to plan the automatic assembly and disassembly sequence of products. The GA-Fuzzy Logic approach is implemented onto two levels. The first level of hybridization consists of the development of a Fuzzy controller for the parameters of an assembly or disassembly planner based on GAs. This controller acts on mutation probability and crossover rate in order to adapt their values dynamically while the algorithm runs. The second level consists of the identification of the optimal assembly or disassembly sequence by a Fuzzy function, in order to obtain a closer control of the technological knowledge of the assembly/disassembly process. Two case studies were analyzed in order to test the efficiency of the Fuzzy-GA methodologies.
A Sequential Logic iLab Utilizing NI ELVIS II+ and the Interactive iLab Architecture
Directory of Open Access Journals (Sweden)
Cosmas Mwikirize
2012-08-01
Full Text Available Recent trends in development and utilization of online laboratories have resulted into standard platforms that are not lab-specific, which can be leveraged to develop laboratories in diverse fields. One such platform is the Massachusetts Institute of Technology (MIT interactive iLab Shared Architecture. This paper presents work undertaken at Makerere University to develop a synchronous sequential logic iLab based on this architecture. The research was carried out by a Graduate researcher, under joint supervision in the confines of the iLab Africa Graduate Fellowship Programme. The research builds on previous work undertaken by the same researcher, in which a combinational digital logic iLab was developed. The sequential logic iLab utilizes the National Instruments Educational Laboratory Virtual Instrumentation Suite (NI ELVIS II+ hardware, with its interactive user interface developed using the Laboratory Virtual Instrument Engineering Workbench (LabVIEW. The generic platform supports experiments in the fields of counters, shift registers, frequency dividers and digital clocks, with appropriate electronic component selection and configuration. The design methodologies and implementation strategies for each experiment category are presented as well as the respective test runs. The laboratory has been used to support courses in the curricula of the Bachelor of Science (B.Sc in Computer, Electrical and Telecommunication Engineering Programmes at Makerere University.
Adaptive process control using fuzzy logic and genetic algorithms
Karr, C. L.
1993-01-01
Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.
Wang, Baojun; Buck, Martin
2014-10-11
We designed and constructed versatile modular genetic logic gates in bacterial cells. These function as digital logic 1-input Buffer gate, 2-input and 3-input AND gates with one inverted input and integrate multiple chemical input signals in customised logic manners. Such rapidly engineered devices serve to achieve increased sensing signal selectivity.
Articulated Human Motion Tracking Using Sequential Immune Genetic Algorithm
Directory of Open Access Journals (Sweden)
Yi Li
2013-01-01
Full Text Available We formulate human motion tracking as a high-dimensional constrained optimization problem. A novel generative method is proposed for human motion tracking in the framework of evolutionary computation. The main contribution is that we introduce immune genetic algorithm (IGA for pose optimization in latent space of human motion. Firstly, we perform human motion analysis in the learnt latent space of human motion. As the latent space is low dimensional and contents the prior knowledge of human motion, it makes pose analysis more efficient and accurate. Then, in the search strategy, we apply IGA for pose optimization. Compared with genetic algorithm and other evolutionary methods, its main advantage is the ability to use the prior knowledge of human motion. We design an IGA-based method to estimate human pose from static images for initialization of motion tracking. And we propose a sequential IGA (S-IGA algorithm for motion tracking by incorporating the temporal continuity information into the traditional IGA. Experimental results on different videos of different motion types show that our IGA-based pose estimation method can be used for initialization of motion tracking. The S-IGA-based motion tracking method can achieve accurate and stable tracking of 3D human motion.
Access Network Selection Based on Fuzzy Logic and Genetic Algorithms
Directory of Open Access Journals (Sweden)
Mohammed Alkhawlani
2008-01-01
Full Text Available In the next generation of heterogeneous wireless networks (HWNs, a large number of different radio access technologies (RATs will be integrated into a common network. In this type of networks, selecting the most optimal and promising access network (AN is an important consideration for overall networks stability, resource utilization, user satisfaction, and quality of service (QoS provisioning. This paper proposes a general scheme to solve the access network selection (ANS problem in the HWN. The proposed scheme has been used to present and design a general multicriteria software assistant (SA that can consider the user, operator, and/or the QoS view points. Combined fuzzy logic (FL and genetic algorithms (GAs have been used to give the proposed scheme the required scalability, flexibility, and simplicity. The simulation results show that the proposed scheme and SA have better and more robust performance over the random-based selection.
Noise-aided Logic in an Electronic Analog of Synthetic Genetic Networks
Hellen, Edward H; Kurths, Jurgen; Sinha, Sudeshna
2012-01-01
We report the experimental verification of noise-enhanced logic behaviour in an electronic analog of a synthetic genetic network, composed of two repressors and two constructive promoters. We observe good agreement between circuit measurements and numerical prediction, with the circuit allowing for robust logic operations in an optimal window of noise. Namely, the input-output characteristics of a logic gate is reproduced faithfully under moderate noise, which is a manifestation of the phenomenon known as Logical Stochastic Resonance. Interestingly, the two dynamical variables in the system yield complementary logic behaviour simultaneously, indicating strong potential for parallel processing.
Moini, A
2002-01-01
In this paper, genetic algorithms are used in the design and robustification various mo el-ba ed/non-model-based fuzzy-logic controllers for robotic manipulators. It is demonstrated that genetic algorithms provide effective means of designing the optimal set of fuzzy rules as well as the optimal domains of associated fuzzy sets in a new class of model-based-fuzzy-logic controllers. Furthermore, it is shown that genetic algorithms are very effective in the optimal design and robustification of non-model-based multivariable fuzzy-logic controllers for robotic manipulators.
Selection Shapes Transcriptional Logic and Regulatory Specialization in Genetic Networks.
Directory of Open Access Journals (Sweden)
Karl Fogelmark
Full Text Available Living organisms need to regulate their gene expression in response to environmental signals and internal cues. This is a computational task where genes act as logic gates that connect to form transcriptional networks, which are shaped at all scales by evolution. Large-scale mutations such as gene duplications and deletions add and remove network components, whereas smaller mutations alter the connections between them. Selection determines what mutations are accepted, but its importance for shaping the resulting networks has been debated.To investigate the effects of selection in the shaping of transcriptional networks, we derive transcriptional logic from a combinatorially powerful yet tractable model of the binding between DNA and transcription factors. By evolving the resulting networks based on their ability to function as either a simple decision system or a circadian clock, we obtain information on the regulation and logic rules encoded in functional transcriptional networks. Comparisons are made between networks evolved for different functions, as well as with structurally equivalent but non-functional (neutrally evolved networks, and predictions are validated against the transcriptional network of E. coli.We find that the logic rules governing gene expression depend on the function performed by the network. Unlike the decision systems, the circadian clocks show strong cooperative binding and negative regulation, which achieves tight temporal control of gene expression. Furthermore, we find that transcription factors act preferentially as either activators or repressors, both when binding multiple sites for a single target gene and globally in the transcriptional networks. This separation into positive and negative regulators requires gene duplications, which highlights the interplay between mutation and selection in shaping the transcriptional networks.
Boumediene ALLAOUA; Laoufi, Abdellah; Brahim GASBAOUI; Nasri, Abdelfatah; Abdessalam ABDERRAHMANI
2008-01-01
In this paper, an intelligent controller of the DC (Direct current) Motor drive is designed using fuzzy logic-genetic algorithms optimization. First, a controller is designed according to fuzzy rules such that the systems are fundamentally robust. To obtain the globally optimal values, parameters of the fuzzy controller are improved by genetic algorithms optimization model. Computer MATLAB work space demonstrate that the fuzzy controller associated to the genetic algorithms approach became ve...
Design of adaptive fuzzy logic controller based on linguistic-hedge concepts and genetic algorithms.
Liu, B D; Chen, C Y; Tsao, J Y
2001-01-01
In this paper, we propose a novel fuzzy logic controller, called linguistic hedge fuzzy logic controller, to simplify the membership function constructions and the rule developments. The design methodology of linguistic hedge fuzzy logic controller is a hybrid model based on the concepts of the linguistic hedges and the genetic algorithms. The linguistic hedge operators are used to adjust the shape of the system membership functions dynamically, and ran speed up the control result to fit the system demand. The genetic algorithms are adopted to search the optimal linguistic hedge combination in the linguistic hedge module, According to the proposed methodology, the linguistic hedge fuzzy logic controller has the following advantages: 1) it needs only the simple-shape membership functions rather than the carefully designed ones for characterizing the related variables; 2) it is sufficient to adopt a fewer number of rules for inference; 3) the rules are developed intuitionally without heavily depending on the endeavor of experts; 4) the linguistic hedge module associated with the genetic algorithm enables it to be adaptive; 5) it performs better than the conventional fuzzy logic controllers do; and 6) it can be realized with low design complexity and small hardware overhead. Furthermore, the proposed approach has been applied to design three well-known nonlinear systems. The simulation and experimental results demonstrate the effectiveness of this design.
Genetic program based data mining to reverse engineer digital logic
Smith, James F., III; Nguyen, Thanh Vu H.
2006-04-01
A data mining based procedure for automated reverse engineering and defect discovery has been developed. The data mining algorithm for reverse engineering uses a genetic program (GP) as a data mining function. A genetic program is an algorithm based on the theory of evolution that automatically evolves populations of computer programs or mathematical expressions, eventually selecting one that is optimal in the sense it maximizes a measure of effectiveness, referred to as a fitness function. The system to be reverse engineered is typically a sensor. Design documents for the sensor are not available and conditions prevent the sensor from being taken apart. The sensor is used to create a database of input signals and output measurements. Rules about the likely design properties of the sensor are collected from experts. The rules are used to create a fitness function for the genetic program. Genetic program based data mining is then conducted. This procedure incorporates not only the experts' rules into the fitness function, but also the information in the database. The information extracted through this process is the internal design specifications of the sensor. Uncertainty related to the input-output database and the expert based rule set can significantly alter the reverse engineering results. Significant experimental and theoretical results related to GP based data mining for reverse engineering will be provided. Methods of quantifying uncertainty and its effects will be presented. Finally methods for reducing the uncertainty will be examined.
Energy Technology Data Exchange (ETDEWEB)
Larbes, C.; Ait Cheikh, S.M.; Obeidi, T.; Zerguerras, A. [Laboratoire des Dispositifs de Communication et de Conversion Photovoltaique, Departement d' Electronique, Ecole Nationale Polytechnique, 10, Avenue Hassen Badi, El Harrach, Alger 16200 (Algeria)
2009-10-15
This paper presents an intelligent control method for the maximum power point tracking (MPPT) of a photovoltaic system under variable temperature and irradiance conditions. First, for the purpose of comparison and because of its proven and good performances, the perturbation and observation (P and O) technique is briefly introduced. A fuzzy logic controller based MPPT (FLC) is then proposed which has shown better performances compared to the P and O MPPT based approach. The proposed FLC has been also improved using genetic algorithms (GA) for optimisation. Different development stages are presented and the optimized fuzzy logic MPPT controller (OFLC) is then simulated and evaluated, which has shown better performances. (author)
Genetic Fuzzy Logic Control Technique for a Mobile Robot Tracking a Moving Target
Directory of Open Access Journals (Sweden)
Karim Benbouabdallah
2013-01-01
Full Text Available Target tracking is a crucial function for an autonomous mobile robot navigating in unknown environments. This paper presents a mobile robot target tracking approach based on artificial intelligence techniques. The proposed controller calculates both the mobile robot linear and angular velocities from the distance and angle that separate it to the moving target. The controller was designed using fuzzy logics theory and then, a genetic algorithm was applied to optimize the scaling factors of the fuzzy logic controller for better accuracy and smoothness of the robot trajectory. Simulation results illustrate that the proposed controller leads to good performances in terms of computational time and tracking errors convergence.
Directory of Open Access Journals (Sweden)
Boumediene ALLAOUA
2008-12-01
Full Text Available In this paper, an intelligent controller of the DC (Direct current Motor drive is designed using fuzzy logic-genetic algorithms optimization. First, a controller is designed according to fuzzy rules such that the systems are fundamentally robust. To obtain the globally optimal values, parameters of the fuzzy controller are improved by genetic algorithms optimization model. Computer MATLAB work space demonstrate that the fuzzy controller associated to the genetic algorithms approach became very strong, gives a very good results and possesses good robustness.
A Genetic Algorithm and Fuzzy Logic Approach for Video Shot Boundary Detection
Directory of Open Access Journals (Sweden)
Dalton Meitei Thounaojam
2016-01-01
Full Text Available This paper proposed a shot boundary detection approach using Genetic Algorithm and Fuzzy Logic. In this, the membership functions of the fuzzy system are calculated using Genetic Algorithm by taking preobserved actual values for shot boundaries. The classification of the types of shot transitions is done by the fuzzy system. Experimental results show that the accuracy of the shot boundary detection increases with the increase in iterations or generations of the GA optimization process. The proposed system is compared to latest techniques and yields better result in terms of F1score parameter.
Chaotic queue-based genetic algorithm for design of a self-tuning fuzzy logic controller
Saini, Sanju; Saini, J. S.
2012-11-01
This paper employs a chaotic queue-based method using logistic equation in a non-canonical genetic algorithm for optimizing the performance of a self-tuning Fuzzy Logic Controller, used for controlling a nonlinear double-coupled system. A comparison has been made with a standard canonical genetic algorithm implemented on the same plant. It has been shown that chaotic queue-method brings an improvement in the performance of the FLC for wide range of set point changes by a more profound initial population spread in the search space.
A Genetic Algorithm and Fuzzy Logic Approach for Video Shot Boundary Detection.
Thounaojam, Dalton Meitei; Khelchandra, Thongam; Manglem Singh, Kh; Roy, Sudipta
2016-01-01
This paper proposed a shot boundary detection approach using Genetic Algorithm and Fuzzy Logic. In this, the membership functions of the fuzzy system are calculated using Genetic Algorithm by taking preobserved actual values for shot boundaries. The classification of the types of shot transitions is done by the fuzzy system. Experimental results show that the accuracy of the shot boundary detection increases with the increase in iterations or generations of the GA optimization process. The proposed system is compared to latest techniques and yields better result in terms of F1score parameter.
Directory of Open Access Journals (Sweden)
A. Belloufi*
2013-01-01
Full Text Available The determination of optimal cutting parameters is one of the most important elements in any process planning ofmetal parts. In this paper, a new hybrid genetic algorithm by using sequential quadratic programming is used for theoptimization of cutting conditions. It is used for the resolution of a multipass turning optimization case by minimizingthe production cost under a set of machining constraints. The genetic algorithm (GA is the main optimizer of thisalgorithm whereas SQP Is used to fine tune the results obtained from the GA. Furthermore, the convergencecharacteristics and robustness of the proposed method have been explored through comparisons with resultsreported in literature. The obtained results indicate that the proposed hybrid genetic algorithm by using a sequentialquadratic programming is effective compared to other techniques carried out by different researchers.
Saini, J. S.; Jain, V.
2015-03-01
This paper presents a genetic algorithm (GA)-based design and optimization of fuzzy logic controller (FLC) for automatic generation control (AGC) for a single area. FLCs are characterized by a set of parameters, which are optimized using GA to improve their performance. The design of input and output membership functions (mfs) of an FLC is carried out by automatically tuning (off-line) the parameters of the membership functions. Tuning is based on maximization of a comprehensive fitness function constructed as inverse of a weighted average of three performance indices, i.e., integral square deviation (ISD), the integral of square of the frequency deviation and peak overshoot (Mp), and settling time (ts). The GA-optimized FLC (GAFLC) shows better performance as compared to a conventional proportional integral (PI) and a hand-designed fuzzy logic controller not only for a standard system (displaying frequency deviations) but also under parametric and load disturbances.
Yan, Gang; Zhou, Lily L.
2006-09-01
This study presents a design strategy based on genetic algorithms (GA) for semi-active fuzzy control of structures that have magnetorheological (MR) dampers installed to prevent damage from severe dynamic loads such as earthquakes. The control objective is to minimize both the maximum displacement and acceleration responses of the structure. Interactive relationships between structural responses and input voltages of MR dampers are established by using a fuzzy controller. GA is employed as an adaptive method for design of the fuzzy controller, which is here known as a genetic adaptive fuzzy (GAF) controller. The multi-objectives are first converted to a fitness function that is used in standard genetic operations, i.e. selection, crossover, and mutation. The proposed approach generates an effective and reliable fuzzy logic control system by powerful searching and self-learning adaptive capabilities of GA. Numerical simulations for single and multiple damper cases are given to show the effectiveness and efficiency of the proposed intelligent control strategy.
Reversible logic gates on Physarum Polycephalum
Energy Technology Data Exchange (ETDEWEB)
Schumann, Andrew [University of Information Technology and Management, Sucharskiego 2, Rzeszow, 35-225 (Poland)
2015-03-10
In this paper, we consider possibilities how to implement asynchronous sequential logic gates and quantum-style reversible logic gates on Physarum polycephalum motions. We show that in asynchronous sequential logic gates we can erase information because of uncertainty in the direction of plasmodium propagation. Therefore quantum-style reversible logic gates are more preferable for designing logic circuits on Physarum polycephalum.
Fuzzy logic and genetic algorithms for intelligent control of structures using MR dampers
Yan, Gang; Zhou, Lily L.
2004-07-01
Fuzzy logic control (FLC) and genetic algorithms (GA) are integrated into a new approach for the semi-active control of structures installed with MR dampers against severe dynamic loadings such as earthquakes. The interactive relationship between the structural response and the input voltage of MR dampers is established by using a fuzzy controller rather than the traditional way by introducing an ideal active control force. GA is employed as an adaptive method for optimization of parameters and for selection of fuzzy rules of the fuzzy control system, respectively. The maximum structural displacement is selected and used as the objective function to be minimized. The objective function is then converted to a fitness function to form the basis of genetic operations, i.e. selection, crossover, and mutation. The proposed integrated architecture is expected to generate an effective and reliable fuzzy control system by GA"s powerful searching and self-learning adaptive capability.
Project Scheduling Using Hybrid Genetic Algorithm with Fuzzy Logic Controller in SCM Environment
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
In supply chain management (SCM) environment, we consider a resource-constrained project scheduling problem (rcPSP) model as one of advanced scheduling problems considered by a constraint programming technique. We develop a hybrid genetic algorithm (hGA) with a fuzzy logic controller (FLC) to solve the rcPSP which is the well known NP-hard problem. This new approach is based on the design of genetic operators with FLC through initializing the serial method which is superior for a large rcPSP scale. For solving these rcPSP problems, we first demonstrate that our hGA with FLC (flc-hGA) yields better results than several heuristic procedures presented in the literature. We have revealed a fact that flc-hGA has the evolutionary behaviors of average fitness better than hGA without FLC.
Genetic optimization of neural network and fuzzy logic for oil bubble point pressure modeling
Energy Technology Data Exchange (ETDEWEB)
Afshar, Mohammad [Islamic Azad University, Kharg (Iran, Islamic Republic of); Gholami, Amin [Petroleum University of Technology, Abadan (Iran, Islamic Republic of); Asoodeh, Mojtaba [Islamic Azad University, Birjand (Iran, Islamic Republic of)
2014-03-15
Bubble point pressure is a critical pressure-volume-temperature (PVT) property of reservoir fluid, which plays an important role in almost all tasks involved in reservoir and production engineering. We developed two sophisticated models to estimate bubble point pressure from gas specific gravity, oil gravity, solution gas oil ratio, and reservoir temperature. Neural network and adaptive neuro-fuzzy inference system are powerful tools for extracting the underlying dependency of a set of input/output data. However, the mentioned tools are in danger of sticking in local minima. The present study went further by optimizing fuzzy logic and neural network models using the genetic algorithm in charge of eliminating the risk of being exposed to local minima. This strategy is capable of significantly improving the accuracy of both neural network and fuzzy logic models. The proposed methodology was successfully applied to a dataset of 153 PVT data points. Results showed that the genetic algorithm can serve the neural network and neuro-fuzzy models from local minima trapping, which might occur through back-propagation algorithm.
A genetic algorithms approach for altering the membership functions in fuzzy logic controllers
Shehadeh, Hana; Lea, Robert N.
1992-01-01
Through previous work, a fuzzy control system was developed to perform translational and rotational control of a space vehicle. This problem was then re-examined to determine the effectiveness of genetic algorithms on fine tuning the controller. This paper explains the problems associated with the design of this fuzzy controller and offers a technique for tuning fuzzy logic controllers. A fuzzy logic controller is a rule-based system that uses fuzzy linguistic variables to model human rule-of-thumb approaches to control actions within a given system. This 'fuzzy expert system' features rules that direct the decision process and membership functions that convert the linguistic variables into the precise numeric values used for system control. Defining the fuzzy membership functions is the most time consuming aspect of the controller design. One single change in the membership functions could significantly alter the performance of the controller. This membership function definition can be accomplished by using a trial and error technique to alter the membership functions creating a highly tuned controller. This approach can be time consuming and requires a great deal of knowledge from human experts. In order to shorten development time, an iterative procedure for altering the membership functions to create a tuned set that used a minimal amount of fuel for velocity vector approach and station-keep maneuvers was developed. Genetic algorithms, search techniques used for optimization, were utilized to solve this problem.
Genetic and logic networks with the signal-inhibitor-activator structure are dynamically robust
Institute of Scientific and Technical Information of China (English)
LI Fangting; TAN Ning
2006-01-01
The proteins, DNA and RNA interaction networks govern various biological functions in living cells, these networks should be dynamically robust in the intracellular and environmental fluctuations. Here, we use Boolean network to study the robust structure of both genetic and logic networks. First, SOS network in bacteria E. coli, which regulates cell survival and repair after DNA damage, is shown to be dynamically robust. Comparing with cell cycle network in budding yeast and flagella network in E. coli, we find the signal-inhibitor-activator (SIA) structure in transcription regulatory networks. Second, under the dynamical rule that inhibition is much stronger than activation, we have searched 3-node non-self-loop logical networks that are dynamically robust, and that if the attractive basin of a final attractor is as large as seven, and the final attractor has only one active node, then the active node acts as inhibitor, and the SIA and signal-inhibitor (SI) structures are fundamental architectures of robust networks. SIA and SI networks with dynamic robustness against environment uncertainties may be selected and maintained over the course of evolution, rather than blind trial-error testing and be ing an accidental consequence of particular evolutionary history. SIA network can perform a more complex process than SI network, andSIA might be used to design robust artificial genetic network. Our results provide dynamical support for why the inhibitors and SIA/SI structures are frequently employed in cellular regulatory networks.
Design and Implementation of an Optimal Fuzzy Logic Controller Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
S. Khan
2008-01-01
Full Text Available All control systems suffer from problems related to undesirable overshoot, longer settling times and vibrations while going form one state to another state. Most of relevant techniques had been in the form of suggesting modification and improvement in the instrumentation or interfacing part of the control system and the results reported, remain suffering from shortcomings related to hardware parameter dependence and maintenance and operational complexities. Present study was based on a software approach which was focusing on an algorithmic approach for programming a PIC16F877A microcontroller, for eliminating altogether the parametric dependence issues while adding the benefits of easier modification to suit a given control system to changing operational conditions. Said approach was first simulated using MATLAB/SIMULINK using the techniques of Proportional Derivative Fuzzy Logic Controller (PD-FLC whose membership function, fuzzy logic rules and scaling gains were optimized by the genetic algorithm technique. Simulated results were verified by programming the PIC16F877A microcontroller with the algorithm and using it on a temperature control system where a fan was regulated in response to variations in the ambient system temperature. Resulting tabulated performance indices showed a considerable improvement in rising and settling time besides reducing overshoot and steady state error.
Ephzibah, E P
2011-01-01
A way to enhance the performance of a model that combines genetic algorithms and fuzzy logic for feature selection and classification is proposed. Early diagnosis of any disease with less cost is preferable. Diabetes is one such disease. Diabetes has become the fourth leading cause of death in developed countries and there is substantial evidence that it is reaching epidemic proportions in many developing and newly industrialized nations. In medical diagnosis, patterns consist of observable symptoms along with the results of diagnostic tests. These tests have various associated costs and risks. In the automated design of pattern classification, the proposed system solves the feature subset selection problem. It is a task of identifying and selecting a useful subset of pattern-representing features from a larger set of features. Using fuzzy rule-based classification system, the proposed system proves to improve the classification accuracy.
Comparative evaluation of fuzzy logic and genetic algorithms models for portfolio optimization
Directory of Open Access Journals (Sweden)
Heidar Masoumi Soureha
2017-05-01
Full Text Available Selection of optimum methods which have appropriate speed and precision for planning and de-cision-making has always been a challenge for investors and managers. One the most important concerns for them is investment planning and optimization for acquisition of desirable wealth under controlled risk with the best return. This paper proposes a model based on Markowitz the-orem by considering the aforementioned limitations in order to help effective decisions-making for portfolio selection. Then, the model is investigated by fuzzy logic and genetic algorithms, for the optimization of the portfolio in selected active companies listed in Tehran Stock Exchange over the period 2012-2016 and the results of the above models are discussed. The results show that the two studied models had functional differences in portfolio optimization, its tools and the possibility of supplementing each other and their selection.
Directory of Open Access Journals (Sweden)
José Alonso Borba
2010-04-01
Full Text Available There are problems in Finance and Accounting that can not be easily solved by means of traditional techniques (e.g. bankruptcy prediction and strategies for investing in common stock. In these situations, it is possible to use methods of Artificial Intelligence. This paper analyzes empirical works published in international journals between 2000 and 2007 that present studies about the application of Neural Networks, Fuzzy Logic and Genetic Algorithms to problems in Finance and Accounting. The objective is to identify and quantify the relationships established between the available techniques and the problems studied by the researchers. Analyzing 258 papers, it was noticed that the most used technique is the Artificial Neural Network. The most researched applications are from the field of Finance, especially those related to stock exchanges (forecasting of common stock and indices prices.
Design of synthetic biological logic circuits based on evolutionary algorithm.
Chuang, Chia-Hua; Lin, Chun-Liang; Chang, Yen-Chang; Jennawasin, Tanagorn; Chen, Po-Kuei
2013-08-01
The construction of an artificial biological logic circuit using systematic strategy is recognised as one of the most important topics for the development of synthetic biology. In this study, a real-structured genetic algorithm (RSGA), which combines general advantages of the traditional real genetic algorithm with those of the structured genetic algorithm, is proposed to deal with the biological logic circuit design problem. A general model with the cis-regulatory input function and appropriate promoter activity functions is proposed to synthesise a wide variety of fundamental logic gates such as NOT, Buffer, AND, OR, NAND, NOR and XOR. The results obtained can be extended to synthesise advanced combinational and sequential logic circuits by topologically distinct connections. The resulting optimal design of these logic gates and circuits are established via the RSGA. The in silico computer-based modelling technology has been verified showing its great advantages in the purpose.
Sunal, Cynthia Szymanski; Karr, Charles L.; Sunal, Dennis W.
2003-01-01
Students' conceptions of three major artificial intelligence concepts used in the modeling of systems in science, fuzzy logic, neural networks, and genetic algorithms were investigated before and after a higher education science course. Students initially explored their prior ideas related to the three concepts through active tasks. Then,…
Energy Technology Data Exchange (ETDEWEB)
Klymenko, M. V.; Remacle, F., E-mail: fremacle@ulg.ac.be [Department of Chemistry, B6c, University of Liege, B4000 Liege (Belgium)
2014-10-28
A methodology is proposed for designing a low-energy consuming ternary-valued full adder based on a quantum dot (QD) electrostatically coupled with a single electron transistor operating as a charge sensor. The methodology is based on design optimization: the values of the physical parameters of the system required for implementing the logic operations are optimized using a multiobjective genetic algorithm. The searching space is determined by elements of the capacitance matrix describing the electrostatic couplings in the entire device. The objective functions are defined as the maximal absolute error over actual device logic outputs relative to the ideal truth tables for the sum and the carry-out in base 3. The logic units are implemented on the same device: a single dual-gate quantum dot and a charge sensor. Their physical parameters are optimized to compute either the sum or the carry out outputs and are compatible with current experimental capabilities. The outputs are encoded in the value of the electric current passing through the charge sensor, while the logic inputs are supplied by the voltage levels on the two gate electrodes attached to the QD. The complex logic ternary operations are directly implemented on an extremely simple device, characterized by small sizes and low-energy consumption compared to devices based on switching single-electron transistors. The design methodology is general and provides a rational approach for realizing non-switching logic operations on QD devices.
Klymenko, M. V.; Remacle, F.
2014-10-01
A methodology is proposed for designing a low-energy consuming ternary-valued full adder based on a quantum dot (QD) electrostatically coupled with a single electron transistor operating as a charge sensor. The methodology is based on design optimization: the values of the physical parameters of the system required for implementing the logic operations are optimized using a multiobjective genetic algorithm. The searching space is determined by elements of the capacitance matrix describing the electrostatic couplings in the entire device. The objective functions are defined as the maximal absolute error over actual device logic outputs relative to the ideal truth tables for the sum and the carry-out in base 3. The logic units are implemented on the same device: a single dual-gate quantum dot and a charge sensor. Their physical parameters are optimized to compute either the sum or the carry out outputs and are compatible with current experimental capabilities. The outputs are encoded in the value of the electric current passing through the charge sensor, while the logic inputs are supplied by the voltage levels on the two gate electrodes attached to the QD. The complex logic ternary operations are directly implemented on an extremely simple device, characterized by small sizes and low-energy consumption compared to devices based on switching single-electron transistors. The design methodology is general and provides a rational approach for realizing non-switching logic operations on QD devices.
Hybrid Genetic Algorithm with Fuzzy Logic Controller for Obstacle Location-Allocation Problem
Taniguchi, Jyunichi; Wang, Xiaodong; Gen, Mitsuo; Yokota, Takao
Location-allocation problem is known as one of the important problems faced in Industrial Engineering/Operations Research fields. One of important logistic tasks is transfer of manufactured products from plants to customers. If there is a need to supply products to large number of customers in a wide area, it is disadvantageous to deliver products from the only central distribution center or direct from plants. It is suitable to build up local distribution centers. In literature, different location models have been used according to characteristics of a distribution area. However, most of them related the location problem without obstacle. In this paper, an extended location-allocation problem with obstacles is considered. Since this problem is very complex and with many infeasible solutions, no direct method is effective to solve it, we propose a hybrid Genetic Algorithm (hGA) for effectively solving this problem. The proposed hGA combines two efficient methods based on Lagrangian relaxation and Dijkstra’s shortest path algorithm. To improve the performance of the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequential Genetic Algorithm
Directory of Open Access Journals (Sweden)
B.Shantha Kumari
2014-10-01
Full Text Available Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access and CDMA (code division multiple access technologies are used in the second generation (2G to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this
A hybrid neural networks-fuzzy logic-genetic algorithm for grade estimation
Tahmasebi, Pejman; Hezarkhani, Ardeshir
2012-05-01
The grade estimation is a quite important and money/time-consuming stage in a mine project, which is considered as a challenge for the geologists and mining engineers due to the structural complexities in mineral ore deposits. To overcome this problem, several artificial intelligence techniques such as Artificial Neural Networks (ANN) and Fuzzy Logic (FL) have recently been employed with various architectures and properties. However, due to the constraints of both methods, they yield the desired results only under the specific circumstances. As an example, one major problem in FL is the difficulty of constructing the membership functions (MFs).Other problems such as architecture and local minima could also be located in ANN designing. Therefore, a new methodology is presented in this paper for grade estimation. This method which is based on ANN and FL is called "Coactive Neuro-Fuzzy Inference System" (CANFIS) which combines two approaches, ANN and FL. The combination of these two artificial intelligence approaches is achieved via the verbal and numerical power of intelligent systems. To improve the performance of this system, a Genetic Algorithm (GA) - as a well-known technique to solve the complex optimization problems - is also employed to optimize the network parameters including learning rate, momentum of the network and the number of MFs for each input. A comparison of these techniques (ANN, Adaptive Neuro-Fuzzy Inference System or ANFIS) with this new method (CANFIS-GA) is also carried out through a case study in Sungun copper deposit, located in East-Azerbaijan, Iran. The results show that CANFIS-GA could be a faster and more accurate alternative to the existing time-consuming methodologies for ore grade estimation and that is, therefore, suggested to be applied for grade estimation in similar problems.
Institute of Scientific and Technical Information of China (English)
Sven Lohmann; Sebastian Engell
2008-01-01
Today's automation industry is driven by the need for an increased productivity, higher flexibility, and higher individuality, and characterized by tailor-made and more complex control solutions. In the processing indus-try, logic controller design is often a manual, experience-based, and thus an error-prone procedure. Typically, the specifications are given by a set of informal requirements and a technical flowchart and both are used to be directly translated into the control code. This paper proposes a method in which the control program is constructed as a se-quential function chart (SFC) by transforming the requirements v/a clearly defined intermediate formats. For the purpose of analysis, the resulting SFC can be translated algorithmically into timed automata. A rigorous verification can be used to determine whether all specifications are satisfied if a formal model of the plant is available which is then composed with the automata model of the logic controller (LC).
Liu, Xiaojia; An, Haizhong; Wang, Lijun; Guan, Qing
2017-09-01
The moving average strategy is a technical indicator that can generate trading signals to assist investment. While the trading signals tell the traders timing to buy or sell, the moving average cannot tell the trading volume, which is a crucial factor for investment. This paper proposes a fuzzy moving average strategy, in which the fuzzy logic rule is used to determine the strength of trading signals, i.e., the trading volume. To compose one fuzzy logic rule, we use four types of moving averages, the length of the moving average period, the fuzzy extent, and the recommend value. Ten fuzzy logic rules form a fuzzy set, which generates a rating level that decides the trading volume. In this process, we apply genetic algorithms to identify an optimal fuzzy logic rule set and utilize crude oil futures prices from the New York Mercantile Exchange (NYMEX) as the experiment data. Each experiment is repeated for 20 times. The results show that firstly the fuzzy moving average strategy can obtain a more stable rate of return than the moving average strategies. Secondly, holding amounts series is highly sensitive to price series. Thirdly, simple moving average methods are more efficient. Lastly, the fuzzy extents of extremely low, high, and very high are more popular. These results are helpful in investment decisions.
Van Otterlo, M
2009-01-01
Markov decision processes have become the de facto standard in modeling and solving sequential decision making problems under uncertainty. This book studies lifting Markov decision processes, reinforcement learning and dynamic programming to the first-order (or, relational) setting.
Tan, Chao; Xu, Rongxin; Wang, Zhongbin; Si, Lei; Liu, Xinhua
2016-01-01
In order to reduce the enlargement of coal floor deformation and the manual adjustment frequency of rocker arms, an improved approach through integration of improved genetic algorithm and fuzzy logic control (GFLC) method is proposed. The enlargement of coal floor deformation is analyzed and a model is built. Then, the framework of proposed approach is built. Moreover, the constituents of GA such as tangent function roulette wheel selection (Tan-RWS) selection, uniform crossover, and nonuniform mutation are employed to enhance the performance of GFLC. Finally, two simulation examples and an industrial application example are carried out and the results indicate that the proposed method is feasible and efficient.
Methods in Logic Based Control
DEFF Research Database (Denmark)
Christensen, Georg Kronborg
1999-01-01
Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC-design met......Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...
A sequential threshold cure model for genetic analysis of time-to-event data
DEFF Research Database (Denmark)
Ødegård, J; Madsen, Per; Labouriau, Rodrigo S.
2011-01-01
pathogens, which is a common procedure in aquaculture breeding schemes. A cure model is a survival model accounting for a fraction of nonsusceptible individuals in the population. This study proposes a mixed cure model for time-to-event data, measured as sequential binary records. In a simulation study......In analysis of time-to-event data, classical survival models ignore the presence of potential nonsusceptible (cured) individuals, which, if present, will invalidate the inference procedures. Existence of nonsusceptible individuals is particularly relevant under challenge testing with specific...... survival data were generated through 2 underlying traits: susceptibility and endurance (risk of dying per time-unit), associated with 2 sets of underlying liabilities. Despite considerable phenotypic confounding, the proposed model was largely able to distinguish the 2 traits. Furthermore, if selection...
Intelligent control a hybrid approach based on fuzzy logic, neural networks and genetic algorithms
Siddique, Nazmul
2014-01-01
Intelligent Control considers non-traditional modelling and control approaches to nonlinear systems. Fuzzy logic, neural networks and evolutionary computing techniques are the main tools used. The book presents a modular switching fuzzy logic controller where a PD-type fuzzy controller is executed first followed by a PI-type fuzzy controller thus improving the performance of the controller compared with a PID-type fuzzy controller. The advantage of the switching-type fuzzy controller is that it uses one rule-base thus minimises the rule-base during execution. A single rule-base is developed by merging the membership functions for change of error of the PD-type controller and sum of error of the PI-type controller. Membership functions are then optimized using evolutionary algorithms. Since the two fuzzy controllers were executed in series, necessary further tuning of the differential and integral scaling factors of the controller is then performed. Neural-network-based tuning for the scaling parameters of t...
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students......A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students...
Methods in Logic Based Control
DEFF Research Database (Denmark)
Christensen, Georg Kronborg
1999-01-01
Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...
Directory of Open Access Journals (Sweden)
Sahbi Marrouchi
2014-01-01
Full Text Available Due to the continuous increase of the population and the perpetual progress of industry, the energy management presents nowadays a relevant topic that concerns researchers in electrical engineering. Indeed, in order to establish a good exploitation of the electrical grid, it is necessary to solve technical and economic problems. This can only be done through the resolution of the Unit Commitment Problem. Unit Commitment Problem allows optimizing the combination of the production units’ states and determining their production planning, in order to satisfy the expected consumption with minimal cost during a specified period which varies usually from 24 hours to one week. However, each production unit has some constraints that make this problem complex, combinatorial, and nonlinear. This paper presents a comparative study between a strategy based on hybrid gradient-genetic algorithm method and two strategies based on metaheuristic methods, fuzzy logic, and genetic algorithm, in order to predict the combinations and the unit commitment scheduling of each production unit in one side and to minimize the total production cost in the other side. To test the performance of the optimization proposed strategies, strategies have been applied to the IEEE electrical network 14 busses and the obtained results are very promising.
Directory of Open Access Journals (Sweden)
Abbas Shoulaie
2010-07-01
Full Text Available Torsional torques on turbine-generator shaft which are yields of disturbances in power systems, can reduce the useful lifetime of shaft. In this paper, these oscillations will be damped and controlled by novel Power System Stabilizers (PSSs. Complex PSS which is used in this paper will act on the excitation system in generator set and also on the controller of in High Voltage Direct Current (HVDC system. This PSS uses three terms (generator angle deviation, frequency oscillation and capacitor voltage deviation in HVDC system of the study system which includes two ties AC and DC. This is the reason that this PSS is named novel one against the conventional PSSs. In order to adjust the PSS parameters to damp the oscillations, genetic algorithm is used. To improve the application of this PSS, fuzzy logic control methods are also used which has notable effect on controlling the oscillations in study system. The simulation results show the effectiveness of designed PSS in controlling the torsional torques in turbine-generator shaft.
Smullyan, Raymond
2008-01-01
This book features a unique approach to the teaching of mathematical logic by putting it in the context of the puzzles and paradoxes of common language and rational thought. It serves as a bridge from the author's puzzle books to his technical writing in the fascinating field of mathematical logic. Using the logic of lying and truth-telling, the author introduces the readers to informal reasoning preparing them for the formal study of symbolic logic, from propositional logic to first-order logic, a subject that has many important applications to philosophy, mathematics, and computer science. T
Kleene, Stephen Cole
2002-01-01
Undergraduate students with no prior instruction in mathematical logic will benefit from this multi-part text. Part I offers an elementary but thorough overview of mathematical logic of 1st order. Part II introduces some of the newer ideas and the more profound results of logical research in the 20th century. 1967 edition.
Zhang, Lihua; Chen, Xianzhong; Chen, Zhen; Wang, Zezheng; Jiang, Shan; Li, Li; Pötter, Markus; Shen, Wei; Fan, You
2016-11-01
The diploid yeast Candida tropicalis, which can utilize n-alkane as a carbon and energy source, is an attractive strain for both physiological studies and practical applications. However, it presents some characteristics, such as rare codon usage, difficulty in sequential gene disruption, and inefficiency in foreign gene expression, that hamper strain improvement through genetic engineering. In this work, we present a simple and effective method for sequential gene disruption in C. tropicalis based on the use of an auxotrophic mutant host defective in orotidine monophosphate decarboxylase (URA3). The disruption cassette, which consists of a functional yeast URA3 gene flanked by a 0.3 kb gene disruption auxiliary sequence (gda) direct repeat derived from downstream or upstream of the URA3 gene and of homologous arms of the target gene, was constructed and introduced into the yeast genome by integrative transformation. Stable integrants were isolated by selection for Ura(+) and identified by PCR and sequencing. The important feature of this construct, which makes it very attractive, is that recombination between the flanking direct gda repeats occurs at a high frequency (10(-8)) during mitosis. After excision of the URA3 marker, only one copy of the gda sequence remains at the recombinant locus. Thus, the resulting ura3 strain can be used again to disrupt a second allelic gene in a similar manner. In addition to this effective sequential gene disruption method, a codon-optimized green fluorescent protein-encoding gene (GFP) was functionally expressed in C. tropicalis. Thus, we propose a simple and reliable method to improve C. tropicalis by genetic manipulation.
Tugué, Tosiyuki; Slaman, Theodore
1989-01-01
These proceedings include the papers presented at the logic meeting held at the Research Institute for Mathematical Sciences, Kyoto University, in the summer of 1987. The meeting mainly covered the current research in various areas of mathematical logic and its applications in Japan. Several lectures were also presented by logicians from other countries, who visited Japan in the summer of 1987.
2014-10-03
that must be woven into proofs of security statements. 03-10-2014 Memorandum Report Logic System-on-a-Chip Distributed systems 9888 ASDR&EAssistant...can be removed without damaging the logic. For all propositional letters p, E1. p ⊃ [r] p From now on, a distributed logic contains at least the...a ∈ x iff 〈h〉 ∈ x. These same definitions work for the canonical relation R for r : h y k where now a ∈ MA(k), [r] a, 〈r〉 a ∈ MA(h), x ∈ CF(h), and
Wald, Abraham
2013-01-01
In 1943, while in charge of Columbia University's Statistical Research Group, Abraham Wald devised Sequential Design, an innovative statistical inference system. Because the decision to terminate an experiment is not predetermined, sequential analysis can arrive at a decision much sooner and with substantially fewer observations than equally reliable test procedures based on a predetermined number of observations. The system's immense value was immediately recognized, and its use was restricted to wartime research and procedures. In 1945, it was released to the public and has since revolutio
Directory of Open Access Journals (Sweden)
Nguyen Thanh Long
2015-02-01
Full Text Available MANET (short for Mobile Ad-Hoc Network consists of a set of mobile network nodes, network configuration changes very fast. In content based routing, data is transferred from source node to request nodes is not based on destination addresses. Therefore, it is very flexible and reliable, because source node does not need to know destination nodes. If We can find multiple paths that satisfies bandwidth requirement, split the original message into multiple smaller messages to transmit concurrently on these paths. On destination nodes, combine separated messages into the original message. Hence it can utilize better network resources, causes data transfer rate to be higher, load balancing, failover. Service Oriented Routing is inherited from the model of content based routing (CBR, combined with several advanced techniques such as Multicast, multiple path routing, Genetic algorithm to increase the data rate, and data encryption to ensure information security. Fuzzy logic is a logical field study evaluating the accuracy of the results based on the approximation of the components involved, make decisions based on many factors relative accuracy based on experimental or mathematical proof. This article presents some techniques to support multiple path routing from one network node to a set of nodes with guaranteed quality of service. By using these techniques can decrease the network load, congestion, use network resources efficiently.
Lengyel, Florian
2012-01-01
We define Denial Logic DL, a system of justification logic that models an agent whose justified beliefs are false, who cannot avow his own propositional attitudes and who can believe contradictions but not tautologies of classical propositional logic. Using Artemov's natural semantics for justification logic JL, in which justifications are interpreted as sets of formulas, we provide an inductive construction of models of DL, and prove soundness and completeness results for DL. Some logical notions developed for JL, such as constant specifications and the internalization property, are inconsistent with DL. This leads us to define negative constant specifications for DL, which can be used to model agents with justified false beliefs. Denial logic can therefore be relevant to philosophical skepticism. We use DL with what we call coherent negative constant specifications to model a Putnamian brain in a vat with the justified false belief that it is not a brain in a vat, and derive a model of JL in which "I am a b...
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area.......Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area....
Institute of Scientific and Technical Information of China (English)
Hongsheng QI; Daizhan CHENG
2008-01-01
This paper gives a matrix expression of logic. Under the matrix expression, a general description of the logical operators is proposed. Using the semi-tensor product of matrices, the proofs of logical equivalences, implications, etc., can be simplified a lot. Certain general properties are revealed. Then, based on matrix expression, the logical operators are extended to multi-valued logic, which provides a foundation for fuzzy logical inference. Finally, we propose a new type of logic, called mix-valued logic, and a new design technique, called logic-based fuzzy control. They provide a numerically computable framework for the application of fuzzy logic for the control of fuzzy systems.
Nucleic acid based logical systems.
Han, Da; Kang, Huaizhi; Zhang, Tao; Wu, Cuichen; Zhou, Cuisong; You, Mingxu; Chen, Zhuo; Zhang, Xiaobing; Tan, Weihong
2014-05-12
Researchers increasingly visualize a significant role for artificial biochemical logical systems in biological engineering, much like digital logic circuits in electrical engineering. Those logical systems could be utilized as a type of servomechanism to control nanodevices in vitro, monitor chemical reactions in situ, or regulate gene expression in vivo. Nucleic acids (NA), as carriers of genetic information with well-regulated and predictable structures, are promising materials for the design and engineering of biochemical circuits. A number of logical devices based on nucleic acids (NA) have been designed to handle various processes for technological or biotechnological purposes. This article focuses on the most recent and important developments in NA-based logical devices and their evolution from in vitro, through cellular, even towards in vivo biological applications.
Liu, Hua-Long; Liu, Hua-Dong
2014-10-01
Partial discharge (PD) in power transformers is one of the prime reasons resulting in insulation degradation and power faults. Hence, it is of great importance to study the techniques of the detection and localization of PD in theory and practice. The detection and localization of PD employing acoustic emission (AE) techniques, as a kind of non-destructive testing, plus due to the advantages of powerful capability of locating and high precision, have been paid more and more attention. The localization algorithm is the key factor to decide the localization accuracy in AE localization of PD. Many kinds of localization algorithms exist for the PD source localization adopting AE techniques including intelligent and non-intelligent algorithms. However, the existed algorithms possess some defects such as the premature convergence phenomenon, poor local optimization ability and unsuitability for the field applications. To overcome the poor local optimization ability and easily caused premature convergence phenomenon of the fundamental genetic algorithm (GA), a new kind of improved GA is proposed, namely the sequence quadratic programming-genetic algorithm (SQP-GA). For the hybrid optimization algorithm, SQP-GA, the sequence quadratic programming (SQP) algorithm which is used as a basic operator is integrated into the fundamental GA, so the local searching ability of the fundamental GA is improved effectively and the premature convergence phenomenon is overcome. Experimental results of the numerical simulations of benchmark functions show that the hybrid optimization algorithm, SQP-GA, is better than the fundamental GA in the convergence speed and optimization precision, and the proposed algorithm in this paper has outstanding optimization effect. At the same time, the presented SQP-GA in the paper is applied to solve the ultrasonic localization problem of PD in transformers, then the ultrasonic localization method of PD in transformers based on the SQP-GA is proposed. And
Liao, Wei-Ching; Chuang, Min-Chieh; Ho, Ja-An Annie
2013-12-15
Genetically modified (GM) technique, one of the modern biomolecular engineering technologies, has been deemed as profitable strategy to fight against global starvation. Yet rapid and reliable analytical method is deficient to evaluate the quality and potential risk of such resulting GM products. We herein present a biomolecular analytical system constructed with distinct biochemical activities to expedite the computational detection of genetically modified organisms (GMOs). The computational mechanism provides an alternative to the complex procedures commonly involved in the screening of GMOs. Given that the bioanalytical system is capable of processing promoter, coding and species genes, affirmative interpretations succeed to identify specified GM event in terms of both electrochemical and optical fashions. The biomolecular computational assay exhibits detection capability of genetically modified DNA below sub-nanomolar level and is found interference-free by abundant coexistence of non-GM DNA. This bioanalytical system, furthermore, sophisticates in array fashion operating multiplex screening against variable GM events. Such a biomolecular computational assay and biosensor holds great promise for rapid, cost-effective, and high-fidelity screening of GMO. Copyright © 2013 Elsevier B.V. All rights reserved.
Zadeh, Lofti A.
1988-01-01
The author presents a condensed exposition of some basic ideas underlying fuzzy logic and describes some representative applications. The discussion covers basic principles; meaning representation and inference; basic rules of inference; and the linguistic variable and its application to fuzzy control.
Genetic Parallel Programming: design and implementation.
Cheang, Sin Man; Leung, Kwong Sak; Lee, Kin Hong
2006-01-01
This paper presents a novel Genetic Parallel Programming (GPP) paradigm for evolving parallel programs running on a Multi-Arithmetic-Logic-Unit (Multi-ALU) Processor (MAP). The MAP is a Multiple Instruction-streams, Multiple Data-streams (MIMD), general-purpose register machine that can be implemented on modern Very Large-Scale Integrated Circuits (VLSIs) in order to evaluate genetic programs at high speed. For human programmers, writing parallel programs is more difficult than writing sequential programs. However, experimental results show that GPP evolves parallel programs with less computational effort than that of their sequential counterparts. It creates a new approach to evolving a feasible problem solution in parallel program form and then serializes it into a sequential program if required. The effectiveness and efficiency of GPP are investigated using a suite of 14 well-studied benchmark problems. Experimental results show that GPP speeds up evolution substantially.
DEFF Research Database (Denmark)
Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker
2012-01-01
We present a logical relation for showing the correctness of program transformations based on a new type-and-eﬀect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number...... of interesting program transformations that rely on eﬀect annotations. In particular, we prove a Parallelization Theorem, which expresses when it is sound to run two expressions in parallel instead of sequentially. The conditions are expressed solely in terms of the types and eﬀects of the expressions....... To the best of our knowledge, this is the ﬁrst such result for a concurrent higher-order language with higher-order store and dynamic memory allocation....
Institute of Scientific and Technical Information of China (English)
林作铨; 李未
1995-01-01
Parametric logic is introduced. The language, semantics and axiom system of parametric logic are defined. Completeness theorem of parametric logic is provided. Parametric logic has formal ability powerful enough to capture a wide class of logic as its special cases, and therefore can be viewed as a uniform basis for modern logics.
Directory of Open Access Journals (Sweden)
Hossein Ghayoumi Zadeh
2012-10-01
Full Text Available Background: Breast cancer is one of the most prevalent cancers among women today. The importance of breast cancer screening, its role in the timely identification of patients, and the reduction in treatment expenses are considered to be among the highest sanitary priorities of a modern country. Thermal imaging clearly possesses a special role in this stage due to rapid diagnosis and use of harmless rays.Methods: We used a thermal camera for imaging of the patients. Important parameters were derived from the images for their posterior analysis with the aid of a genetic algorithm. The principal components that were entered in a fuzzy neural network for clustering breast cancer were identified.Results: The number of images considered for the test included a database of 200 patients out of whom 15 were diagnosed with breast cancer via mammography. Results of the base method show a sensitivity of 93%. The selection of parameters in the combination module gave rise measured errors, which in training of the fuzzy-neural network were of the order of clustering 1.0923×10-5, which reached 2%.Conclusion: The study indicates that thermal image scanning coupled with the presented method based on artificial intelligence can possess a special status in screening women for breast cancer due to the use of harmless non-radiation rays. There are cases where physicians cannot decisively say that the observed pattern in theimage is benign or malignant. In such cases, the response of the computer model can be a valuable support tool for the physician enabling an accurate diagnosis based on the type of imaging pattern as a response from the computer model.
Reversible logic synthesis methodologies with application to quantum computing
Taha, Saleem Mohammed Ridha
2016-01-01
This book opens the door to a new interesting and ambitious world of reversible and quantum computing research. It presents the state of the art required to travel around that world safely. Top world universities, companies and government institutions are in a race of developing new methodologies, algorithms and circuits on reversible logic, quantum logic, reversible and quantum computing and nano-technologies. In this book, twelve reversible logic synthesis methodologies are presented for the first time in a single literature with some new proposals. Also, the sequential reversible logic circuitries are discussed for the first time in a book. Reversible logic plays an important role in quantum computing. Any progress in the domain of reversible logic can be directly applied to quantum logic. One of the goals of this book is to show the application of reversible logic in quantum computing. A new implementation of wavelet and multiwavelet transforms using quantum computing is performed for this purpose. Rese...
Malcolm, Norman; Altuner, Ilyas
2015-01-01
The paper deals exclusively with the doctrine called ‘Logical Behaviorism’. Although this position does not vogue it enjoyed in the 1930s and 1940s, it will always possess a compelling attraction for anyone who is perplexed by the psychological concepts, who has become aware of worthlessness of an appeal to introspection as an account of how we learn those concepts, and he has no inclination to identify mind with brain. There, of course, are other forms of behaviorism, and of reductionism, wh...
Designing asynchronous circuits using NULL convention logic (NCL)
Smith, Scott
2009-01-01
Designing Asynchronous Circuits using NULL Convention Logic (NCL) begins with an introduction to asynchronous (clockless) logic in general, and then focuses on delay-insensitive asynchronous logic design using the NCL paradigm. The book details design of input-complete and observable dual-rail and quad-rail combinational circuits, and then discusses implementation of sequential circuits, which require datapath feedback. Next, throughput optimization techniques are presented, including pipelining, embedding registration, early completion, and NULL cycle reduction. Subsequently, low-power design
Smart molecules at work-mimicking advanced logic operations
2010-01-01
Molecular logic is an interdisciplinary research field, which has captured worldwide interest. This tutorial review gives a brief introduction into molecular logic and Boolean algebra. This serves as the basis for a discussion of the state-of-the-art and future challenges in the field. Representative examples from the most recent literature including adders/subtractors, multiplexers/demultiplexers, encoders/decoders, and sequential logic devices (keypad locks) are highlighted. Other horizons,...
DEFF Research Database (Denmark)
Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume...... is the proceedings of the conference of record in its fi eld, Advances in Modal Logic. Its contributions are state-of-the-art papers. The topics include decidability and complexity results for specifi c modal logics, proof theory of modal logic, logics for reasoning about time and space, provability logic, dynamic...... epistemic logic, and the logic of evidence....
Carlton, David Bryan
The exponential improvements in speed, energy efficiency, and cost that the computer industry has relied on for growth during the last 50 years are in danger of ending within the decade. These improvements all have relied on scaling the size of the silicon-based transistor that is at the heart of every modern CPU down to smaller and smaller length scales. However, as the size of the transistor reaches scales that are measured in the number of atoms that make it up, it is clear that this scaling cannot continue forever. As a result of this, there has been a great deal of research effort directed at the search for the next device that will continue to power the growth of the computer industry. However, due to the billions of dollars of investment that conventional silicon transistors have received over the years, it is unlikely that a technology will emerge that will be able to beat it outright in every performance category. More likely, different devices will possess advantages over conventional transistors for certain applications and uses. One of these emerging computing platforms is nanomagnetic logic (NML). NML-based circuits process information by manipulating the magnetization states of single-domain nanomagnets coupled to their nearest neighbors through magnetic dipole interactions. The state variable is magnetization direction and computations can take place without passing an electric current. This makes them extremely attractive as a replacement for conventional transistor-based computing architectures for certain ultra-low power applications. In most work to date, nanomagnetic logic circuits have used an external magnetic clocking field to reset the system between computations. The clocking field is then subsequently removed very slowly relative to the magnetization dynamics, guiding the nanomagnetic logic circuit adiabatically into its magnetic ground state. In this dissertation, I will discuss the dynamics behind this process and show that it is greatly
Institute of Scientific and Technical Information of China (English)
小雨
2006-01-01
A teacher was giving her pu- pils a lesson on logic(逻辑)．“Here is the situation(情景),”she said,“a man is stand- ing up in a boat in the middle of a river,fishing．He loses his bal- ance(平衡),falls in,and begins splashing(泼水)and yelling(叫喊)for help．His wife hears the commotion(喧闹),knows that he can’t swim,and runs down to the bank (河岸)．Why did she run to the bank?” A girl raised her hand and asked,“To draw out(提取)all of his savings(存款)．”
Paraconsistent Computational Logic
DEFF Research Database (Denmark)
Jensen, Andreas Schmidt; Villadsen, Jørgen
2012-01-01
In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....
Doberkat, Ernst-Erich
2009-01-01
Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles of coalgebraic logic from a categorical perspective. Modal logics are also discussed, including probabilistic interpretations and an analysis of Kripke models.
Eskolemization in intuitionistic logic
Baaz, Matthias; Iemhoff, R.
In [2] an alternative skolemization method called eskolemization was introduced that is sound and complete for existence logic with respect to existential quantifiers. Existence logic is a conservative extension of intuitionistic logic by an existence predicate. Therefore eskolemization provides a
Paraconsistent Computational Logic
DEFF Research Database (Denmark)
Jensen, Andreas Schmidt; Villadsen, Jørgen
2012-01-01
In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study.......In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....
Three-valued logics in modal logic
Kooi, Barteld; Tamminga, Allard
2013-01-01
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we
Quantum reversible logic circuits synthesis based on genetic algorithm%基于遗传算法的量子可逆逻辑电路综合方法研究
Institute of Scientific and Technical Information of China (English)
吕洪君; 乐亮; 韩良顺; 解光军
2011-01-01
量子可逆逻辑电路综合主要是研究在给定的量子门和量子电路的约束条件及限制下,找到最小或较小的量子代价实现所需量子逻辑功能的电路.把量子逻辑门的功能用矩阵的数学模型表示,用遗传算法作全局搜索工具,将遗传算法应用于量子可逆逻辑电路综合,是一种全新的可逆逻辑电路综合方法,实现了合成、优化同步进行.四阶量子电路实验已取得了很好的效果,并进一步分析了此方法在高阶量子电路综合问题上的应用前景.%Reversible quantum logic synthesis is to study given quantum gates and quantum circuits of the constraints and limitations and find the smallest or smaller quantum cost to achieve the desired quantum logic circuits. The quantum logic gate functions of the matrix is indicated by the mathematical model. The synthesis and optimization are achieved simultaneously by the genetic algorithm as global search tool. Genetic algorithm is applied to quantum reversible logic synthesis. The fourth-order quantum circuit experiment has achieved good results, and further analysis of this method in high-level synthesis of quantum circuits and its application is completed.
Asynchronous sequential machine design and analysis
Tinder, Richard
2009-01-01
Asynchronous Sequential Machine Design and Analysis provides a lucid, in-depth treatment of asynchronous state machine design and analysis presented in two parts: Part I on the background fundamentals related to asynchronous sequential logic circuits generally, and Part II on self-timed systems, high-performance asynchronous programmable sequencers, and arbiters.Part I provides a detailed review of the background fundamentals for the design and analysis of asynchronous finite state machines (FSMs). Included are the basic models, use of fully documented state diagrams, and the design and charac
DEFF Research Database (Denmark)
Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume i...... epistemic logic, and the logic of evidence.......Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume...... is the proceedings of the conference of record in its fi eld, Advances in Modal Logic. Its contributions are state-of-the-art papers. The topics include decidability and complexity results for specifi c modal logics, proof theory of modal logic, logics for reasoning about time and space, provability logic, dynamic...
Smart molecules at work--mimicking advanced logic operations.
Andréasson, Joakim; Pischel, Uwe
2010-01-01
Molecular logic is an interdisciplinary research field, which has captured worldwide interest. This tutorial review gives a brief introduction into molecular logic and Boolean algebra. This serves as the basis for a discussion of the state-of-the-art and future challenges in the field. Representative examples from the most recent literature including adders/subtractors, multiplexers/demultiplexers, encoders/decoders, and sequential logic devices (keypad locks) are highlighted. Other horizons, such as the utility of molecular logic in bio-related applications, are discussed as well.
Institute of Scientific and Technical Information of China (English)
蒋伟进; 蒋星军; 姚丽娜
2012-01-01
借助于组织学思想,将自适应系统中的自主运行单元抽象为Agent,把复杂自适应系统视为多Agent组织,从时间和状态角度,对复杂动态系统的行为进行描述.提出了基于时序活动逻辑的多Agent动态协作任务求解自适应机制和构造模型；详细分析了任务求解BDIAgent的信念、愿望、意图的产生过程和实现方法；深入讨论了协商推理的语义规则和行为规则；给出了协作群组的选择算法,包括从群组的建立、选择任务Agent、分解和分配子任务；从任务求解Agent的心智变化角度,详细描述了动态协作任务求解模型实现的6个阶段:任务动态分配、协作意愿产生、协作群体生成、共同计划制定、协作群体行动和结果评估.通过在MAGE等平台上的实验和仿真测试,验证了方法的可行性和有效性.%From the ideas of tissue,the running unit of the self-adaptive system was abstracted as Agent.The complex adaptive system was regarded as a multi-Agent organization. From the perspective of time and status the behavior of the complex dynamic systems was described. Temporal logic multi-Agent based dynamic adaptive mechanisms and the task solving cooperation structure model were proposed. Detailed a-nalysis was made of the task to solve BDI Agenfs belief, desire, intention and realization of the production process. The negotiation of rules and semantic inference rules of conduct was fully discussed. The collaborative group selection algorithm was presented, including the establishment from the group. Selection of the Task Agent, decomposition and allocation of subtasks. From the changing angle of the Agenfs mind to solve the task, a detailed description was given of the task to solve the model to achieve dynamic collaboration of six stages: dynamic allocation of tasks, collaboration production, collaborative groups generation, common planning, collaborative groups, action and evaluation of results
Probabilistic Dynamic Epistemic Logic
Kooi, B.P.
2003-01-01
In this paper I combine the dynamic epistemic logic of Gerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1999). The result is a new probabilistic dynamic epistemic logic, a logic for reasoning about probability, information, and information change that takes higher order informatio
Metamathematics of fuzzy logic
Hájek, Petr
1998-01-01
This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. Some important systems of real-valued propositional and predicate calculus are defined and investigated. The aim is to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named `fuzzy inference' can be naturally understood as logical deduction.
DEFF Research Database (Denmark)
Bentzen, Martin Mose
2014-01-01
A new deontic logic, Action Type Deontic Logic, is presented. To motivate this logic, a number of benchmark cases are shown, representing inferences a deontic logic should validate. Some of the benchmark cases are singled out for further comments and some formal approaches to deontic reasoning ar...... the benchmarks. Finally, possibilities for further research are indicated. In the appendix, decidability of the satisfiability of formulas is proved via a technique known from monadic First Order Logic....
2005-07-01
a constant factor of K + 2. (To see this, note sequential stacking requires training K+2 classifiers: the classifiers f1, . . . , fK used in cross...on the non- sequential learners (ME and VP) but improves per- formance of the sequential learners (CRFs and VPH - MMs) less consistently. This pattern
Logic Circuit Design Selected Methods
Vingron, Shimon P
2012-01-01
In three main divisions the book covers combinational circuits, latches, and asynchronous sequential circuits. Combinational circuits have no memorising ability, while sequential circuits have such an ability to various degrees. Latches are the simplest sequential circuits, ones with the shortest memory. The presentation is decidedly non-standard. The design of combinational circuits is discussed in an orthodox manner using normal forms and in an unorthodox manner using set-theoretical evaluation formulas relying heavily on Karnaugh maps. The latter approach allows for a new design technique called composition. Latches are covered very extensively. Their memory functions are expressed mathematically in a time-independent manner allowing the use of (normal, non-temporal) Boolean logic in their calculation. The theory of latches is then used as the basis for calculating asynchronous circuits. Asynchronous circuits are specified in a tree-representation, eac...
Temporal logic runtime verification of dynamic systems
CSIR Research Space (South Africa)
Seotsanyana, M
2010-07-01
Full Text Available linear temporal logic as well as extended regular expressions. Java with assertion (Jass) [8] is a general monitoring methodology implemented for sequential, concurrent and reactive systems written in java. The tool Jass is a pre- compiler... that translates annotations into a pure java code in which a compliance with specification is tested dynamically at runtime. Assertions extends the Design by Contract [11], that allows specification of assertions in the form of pre- and post-conditions, class...
Optimization of reversible sequential circuits
Sayem, Abu Sadat Md
2010-01-01
In recent years reversible logic has been considered as an important issue for designing low power digital circuits. It has voluminous applications in the present rising nanotechnology such as DNA computing, Quantum Computing, low power VLSI and quantum dot automata. In this paper we have proposed optimized design of reversible sequential circuits in terms of number of gates, delay and hardware complexity. We have designed the latches with a new reversible gate and reduced the required number of gates, garbage outputs, and delay and hardware complexity. As the number of gates and garbage outputs increase the complexity of reversible circuits, this design will significantly enhance the performance. We have proposed reversible D-latch and JK latch which are better than the existing designs available in literature.
DEFF Research Database (Denmark)
Schürmann, Carsten; Sarnat, Jeffrey
2008-01-01
, such as Twelf, and yet they are often straightforward in proof assistants with stronger meta-logics. In this paper, we propose structural logical relations as a technique for conducting these proofs in systems with limited meta-logical strength by explicitly representing and reasoning about an auxiliary logic......Tait's method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed lambda-calculi. Historically, these proofs have been extremely difficult to formalize in proof assistants with weak meta-logics...
A Survey of Paraconsistent Logics
Middelburg, C A
2011-01-01
A survey of paraconsistent logics that are prominent representatives of the different approaches that have been followed to develop paraconsistent logics is provided. The paraconsistent logics that will be discussed are an enrichment of Priest's logic LP, the logic RM3 from the school of relevance logic, da Costa's logics Cn, Jaskowski's logic D2, and Subrahmanian's logics Ptau. A deontic logic based on the first of these logics will be discussed as well. Moreover, some proposed adaptations of the AGM theory of belief revision to paraconsistent logics will be mentioned.
Institute of Scientific and Technical Information of China (English)
林作铨
1996-01-01
A modal nonmonotonic logic is presented based on an experiential modal semantics on typicality and exception.The syntactic and semantics of modal nonmonotonic logic are provided,and the completeness theorem and the theorems relating it to major nonmonotonic logics are proved.It directly formalizes the intuition of nonmonotonic reasoning.Among other things,it provides us a first-order extension of default logic and autoepistemic logic,and simultaneously has the capability of circumscription to infer universal statement.It has important applications in logic programming and deductive data base.As a result,it provides a uniform basis for various nonmonotonic logics,from which the correspondent relationship among major nonmonotonic logics can coincide.
Newton-Smith, WH
2003-01-01
A complete introduction to logic for first-year university students with no background in logic, philosophy or mathematics. In easily understood steps it shows the mechanics of the formal analysis of arguments.
Bolc, Leonard
1992-01-01
Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of excluded middle" in classical logic. The first many-valued formal systems were developed by J. Lukasiewicz in Poland and E.Post in the U.S.A. in the 1920s, and since then the field has expanded dramatically as the applicability of the systems to other philosophical and semantic problems was recognized. Intuitionisticlogic, for example, arose from deep problems in the foundations of mathematics. Fuzzy logics, approximation logics, and probability logics all address questions that classical logic alone cannot answer. All these interpretations of many-valued calculi motivate specific formal systems thatallow detailed mathematical treatment. In this volume, the authors are concerned with finite-valued logics, and especially with three-valued logical calculi. Matrix constructions, axiomatizations of propositional and predicate calculi, syntax, semantic structures, and methodology are discussed. Separate chapters deal w...
Yang, Fan; Väänänen, Jouko
2016-01-01
We consider team semantics for propositional logic, continuing our previous work (Yang & V\\"a\\"an\\"anen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an individual valuation. This offers the possibility to give meaning to concepts such as dependence, independence and inclusion. We define an expressively maximal propositional team logic, called full propositional team logic. This requires going beyond the logic...
DEFF Research Database (Denmark)
Aiello, Marco; Bezhanishvili, Guram; Bloch, Isabelle
2012-01-01
of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones in the logical representation of space and investigate current trends. In doing so......, we do not only consider classical logic, but we indulge ourselves with modal logics. These present themselves naturally by providing simple axiomatizations of different geometries, topologies, space-time causality, and vector spaces....
Institutional Logics in Action
DEFF Research Database (Denmark)
Lounsbury, Michael; Boxenbaum, Eva
2013-01-01
This double volume presents state-of-the-art research and thinking on the dynamics of actors and institutional logics. In the introduction, we briefly sketch the roots and branches of institutional logics scholarship before turning to the new buds of research on the topic of how actors engage ins...... prolific stream of research on institutional logics by deepening our insight into the active use of institutional logics in organizational action and interaction, including the institutional effects of such (inter)actions....
Hierarchies in Dependence Logic
Durand, Arnaud
2011-01-01
We study fragments of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these fragments of dependence logic. We also show that these both ways of defining fragments of dependence logic give rise to a hierarchy in expressive power with respect to k.
Superconductive combinational logic circuit using magnetically coupled SQUID array
Energy Technology Data Exchange (ETDEWEB)
Yamanashi, Y., E-mail: yamanasi@ynu.ac.j [Interdisciplinary Research Center, Yokohama National University, Tokiwadai 79-5, Hodogaya-ku, Yokohama 240-8501 (Japan); Umeda, K.; Sai, K. [Department of Electrical and Computer Engineering, Yokohama National University, Tokiwadai 79-5, Hodogaya-ku, Yokohama 240-8501 (Japan)
2010-11-01
In this paper, we propose the development of superconductive combinational logic circuits. One of the difficulties in designing superconductive single-flux-quantum (SFQ) digital circuits can be attributed to the fundamental nature of the SFQ circuits, in which all logic gates have latching functions and are based on sequential logic. The design of ultralow-power superconductive digital circuits can be facilitated by the development of superconductive combinational logic circuits in which the output is a function of only the present input. This is because superconductive combinational logic circuits do not require determination of the timing adjustment and clocking scheme. Moreover, semiconductor design tools can be used to design digital circuits because CMOS logic gates are based on combinational logic. The proposed superconductive combinational logic circuits comprise a magnetically coupled SQUID array. By adjusting the circuit parameters and coupling strengths between neighboring SQUIDs, fundamental combinational logic gates, including the AND, OR, and NOT gates, can be built. We have verified the accuracy of the operations of the fundamental logic gates by analog circuit simulations.
Institute of Scientific and Technical Information of China (English)
刘叙华; 邓安生
1994-01-01
A new approach of operator fuzzy logic, Boolean operator fuzzy logic (BOFL) based on Boolean algebra, is presented. The resolution principle is also introduced into BOFL. BOFL is a natural generalization of classical logic and can be applied to the qualitative description of fuzzy knowledge.
DEFF Research Database (Denmark)
Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian
2015-01-01
We introduce Concurrent Weighted Logic (CWL), a multimodal logic for concurrent labeled weighted transition systems (LWSs). The synchronization of LWSs is described using dedicated functions that, in various concurrency paradigms, allow us to encode the compositionality of LWSs. To reflect these......-completeness results for this logic. To complete these proofs we involve advanced topological techniques from Model Theory....
DEFF Research Database (Denmark)
Berg Johansen, Christina; Waldorff, Susanne Boch
This study presents new insights into the explanatory power of the institutional logics perspective. With outset in a discussion of seminal theory texts, we identify two fundamental topics that frame institutional logics: overarching institutional orders guides by institutional logics, as well...
DEFF Research Database (Denmark)
Jantzen, Jan
1998-01-01
A logic based on the two truth values True and False is sometimes inadequate when describing human reasoning. Fuzzy logic uses the whole interval between 0 (False) and 1 (True) to describe human reasoning. As a result, fuzzy logic is being applied in rule based automatic controllers, and this paper...
Regular database update logics
Spruit, Paul; Wieringa, Roel; Meyer, John-Jules
2001-01-01
We study regular first-order update logic (FUL), which is a variant of regular dynamic logic in which updates to function symbols as well as to predicate symbols are possible. We fi1rst study FUL without making assumptions about atomic updates. Second, we look at relational algebra update logic (RAU
Uckelman, S.L.
2009-01-01
This dissertation is an exercise in conceptual archeology. Using the tools of contemporary logic we analyse texts in medieval logic and reconstruct their logical theories by creating a formal framework which models them. Our focus is medieval texts which deal with various modalities: the writings on
DEFF Research Database (Denmark)
Christiansen, Henning; Dahl, Veronica
2009-01-01
By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting....... We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also -- in a significant departure from...
Design of 4:16 decoder using reversible logic gates
Directory of Open Access Journals (Sweden)
Santhi Chebiyyam
2016-04-01
Full Text Available Reversible logic has received great importance in the recent years because of its feature of reduction in power dissipation. It finds application in low power digital designs, quantum computing, nanotechnology, DNA computing etc. Large number of researches are currently ongoing on sequential and combinational circuits using reversible logic. Decoders are one of the most important circuits used in combinational logic. Different approaches have been proposed for their design. In this article, we have proposed a novel design of 4:16.
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Huertas, Antonia; Manzano, Maria;
2014-01-01
Leon Henkin was not a modal logician, but there is a branch of modal logic that has been deeply influenced by his work. That branch is hybrid logic, a family of logics that extend orthodox modal logic with special proposition symbols (called nominals) that name worlds. This paper explains why...... Henkin’s techniques are so important in hybrid logic. We do so by proving a completeness result for a hybrid type theory called HTT, probably the strongest hybrid logic that has yet been explored. Our completeness result builds on earlier work with a system called BHTT, or basic hybrid type theory...... is due to the first-order perspective, which lies at the heart of Henin’s best known work and hybrid logic....
Calculating Contingencies in Natural Environments: Issues in the Application of Sequential Analysis
McComas, Jennifer J.; Moore, Timothy; Dahl, Norm; Hartman, Ellie; Hoch, John; Symons, Frank
2009-01-01
Analysis and interpretation of behavior-environment relations are increasingly being conducted with data that have been derived descriptively. This paper provides an overview of the logic that underlies a sequential analytic approach to the analysis of descriptive data. Several methods for quantifying sequential relations are reviewed along with…
ON EQUIVALENCE BETWEEN THE SEQUENTIAL CIRCUITS IN SERIES AND IN PARALLEL
Institute of Scientific and Technical Information of China (English)
姚天忠; 胡铮浩
1990-01-01
Propose the sequential circuits with the ternary D-ffs in series1. Discuss the equivalence between the sequential circuits with the p-valued flip-flops in series and in parallel as a part of studying the multiple valued logic circuits.
Molecules with a sense of logic: a progress report.
Andréasson, Joakim; Pischel, Uwe
2015-03-07
In this tutorial review, the most recent developments in the field of molecular logic and information processing are discussed. Special emphasis is given to the report of progress in the concatenation of molecular logic devices and switches, the design of memory systems working according to the principles of sequential logic, the mimicking of transistors, and the research on photochromic platforms with an unprecedented degree of functional integration. Furthermore, a series of achievements that add up to the conceptual diversity of molecular logic is introduced, such as the realization of highly complex and logically reversible Toffoli and Fredkin gates by the action of DNAzymes or the use of a multifluorophoric platform as a viable approach towards keypad lock functions.
Surface-confined assemblies and polymers for molecular logic.
de Ruiter, Graham; van der Boom, Milko E
2011-08-16
Stimuli responsive materials are capable of mimicking the operation characteristics of logic gates such as AND, OR, NOR, and even flip-flops. Since the development of molecular sensors and the introduction of the first AND gate in solution by de Silva in 1993, Molecular (Boolean) Logic and Computing (MBLC) has become increasingly popular. In this Account, we present recent research activities that focus on MBLC with electrochromic polymers and metal polypyridyl complexes on a solid support. Metal polypyridyl complexes act as useful sensors to a variety of analytes in solution (i.e., H(2)O, Fe(2+/3+), Cr(6+), NO(+)) and in the gas phase (NO(x) in air). This information transfer, whether the analyte is present, is based on the reversible redox chemistry of the metal complexes, which are stable up to 200 °C in air. The concurrent changes in the optical properties are nondestructive and fast. In such a setup, the input is directly related to the output and, therefore, can be represented by one-input logic gates. These input-output relationships are extendable for mimicking the diverse functions of essential molecular logic gates and circuits within a set of Boolean algebraic operations. Such a molecular approach towards Boolean logic has yielded a series of proof-of-concept devices: logic gates, multiplexers, half-adders, and flip-flop logic circuits. MBLC is a versatile and, potentially, a parallel approach to silicon circuits: assemblies of these molecular gates can perform a wide variety of logic tasks through reconfiguration of their inputs. Although these developments do not require a semiconductor blueprint, similar guidelines such as signal propagation, gate-to-gate communication, propagation delay, and combinatorial and sequential logic will play a critical role in allowing this field to mature. For instance, gate-to-gate communication by chemical wiring of the gates with metal ions as electron carriers results in the integration of stand-alone systems: the
Sequentializing Parameterized Programs
Directory of Open Access Journals (Sweden)
Salvatore La Torre
2012-07-01
Full Text Available We exhibit assertion-preserving (reachability preserving transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program is that it tracks the local variables of only one thread at any point, and uses only O(k copies of shared variables (it does not use extra counters, not even one counter to keep track of the number of threads. Sequentialization is achieved using the concept of a linear interface that captures the effect an unbounded block of processes have on the shared state in a k-round schedule. Our transformation utilizes linear interfaces to sequentialize the program, and to ensure the sequential program explores only reachable states and preserves local invariants.
Liu, Lihong; Castillo-Olivares, Javier; Davis-Poynter, Nick J; Baule, Claudia; Xia, Hongyan; Belák, Sándor
2008-06-22
Samples from horses experimentally infected with the "large plaque variant (LP3A+)" of equine arteritis virus were analysed. These included 182 nasal swabs collected from day 1 to 14 post-infection (p.i.), and 21 virus isolates obtained from white blood cells of animals that showed a prolonged viraemia between days 30 to 72 p.i. In order to determine the genetic stability of the virus and particularly to characterise the genetic variants found during the prolonged viraemia, partial sequences of open reading frame 5 (ORF5) encoding glycoprotein 5 (GP5) were generated. Viruses with amino acid substitutions in GP5 were used for further amplification and sequencing of a fragment encompassing ORFs 2b, 3, and 4. The ORF5 nucleotide sequences of the virus present in 65 out of 66 nasal swabs were identical to that of the inoculated virus, suggesting that the ORF5 gene of LP3A+ was genetically stable during the first 2 weeks p.i. Contrary to this, a number of mutations were found in the ORF5 of virus isolates obtained from day 30 p.i. The mutations mainly clustered in antigenic neutralization site C within variable region 1 of the GP5 ectodomain. Sequence variability was also identified in ORFs 2b, 3 and 4, with ORF 4 having the highest proportion of non-synonymous changes (4/6).
Dalen, Dirk
1983-01-01
A book which efficiently presents the basics of propositional and predicate logic, van Dalen’s popular textbook contains a complete treatment of elementary classical logic, using Gentzen’s Natural Deduction. Propositional and predicate logic are treated in separate chapters in a leisured but precise way. Chapter Three presents the basic facts of model theory, e.g. compactness, Skolem-Löwenheim, elementary equivalence, non-standard models, quantifier elimination, and Skolem functions. The discussion of classical logic is rounded off with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, one chapter is devoted to intuitionistic logic. Completeness is established for Kripke semantics. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property have been incorporated. The power and elegance of natural deduction is demonstrated best in the part of proof theory cal...
Logical database design principles
Garmany, John; Clark, Terry
2005-01-01
INTRODUCTION TO LOGICAL DATABASE DESIGNUnderstanding a Database Database Architectures Relational Databases Creating the Database System Development Life Cycle (SDLC)Systems Planning: Assessment and Feasibility System Analysis: RequirementsSystem Analysis: Requirements Checklist Models Tracking and Schedules Design Modeling Functional Decomposition DiagramData Flow Diagrams Data Dictionary Logical Structures and Decision Trees System Design: LogicalSYSTEM DESIGN AND IMPLEMENTATION The ER ApproachEntities and Entity Types Attribute Domains AttributesSet-Valued AttributesWeak Entities Constraint
2009-01-01
This dissertation is an exercise in conceptual archeology. Using the tools of contemporary logic we analyse texts in medieval logic and reconstruct their logical theories by creating a formal framework which models them. Our focus is medieval texts which deal with various modalities: the writings on alethic modalities by William of Sherwood, Pseudo-Aquinas, and St. Thomas Aquinas in the 13th century, St. Anselm of Canterbury’s writings on facere and debere in the late 11th century; Lambert of...
Separation Logic and Concurrency
Bornat, Richard
Concurrent separation logic is a development of Hoare logic adapted to deal with pointers and concurrency. Since its inception, it has been enhanced with a treatment of permissions to enable sharing of data between threads, and a treatment of variables as resource alongside heap cells as resource. An introduction to the logic is given with several examples of proofs, culminating in a treatment of Simpson's 4-slot algorithm, an instance of racy non-blocking concurrency.
Embedding Description Logic Programs into Default Logic
Wang, Yisong; Yuan, Li Yan; Shen, Yi-Dong; Eiter, Thomas
2011-01-01
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter {\\em et al.} have been considered as a prominent formalism for integrating rules and ontology knowledge bases. A question of interest has been whether dl-programs can be captured in a general formalism of nonmonotonic logic. In this paper, we study the possibility of embedding dl-programs into default logic. We show that dl-programs under the strong and weak answer set semantics can be embedded in default logic by combining two translations, one of which eliminates the constraint operator from nonmonotonic dl-atoms and the other translates a dl-program into a default theory. For dl-programs without nonmonotonic dl-atoms but with the negation-as-failure operator, our embedding is polynomial, faithful, and modular. In addition, our default logic encoding can be extended in a simple way to capture recently proposed weakly well-supported answer set semantics, for arbitrary dl-programs. These results reinforce the argument ...
Introduction to mathematical logic
Mendelson, Elliott
2015-01-01
The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.The sixth edition incorporates recent work on Gödel's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition. It is offered in th
Crossley, J N; Brickhill, CJ; Stillwell, JC
2010-01-01
Although mathematical logic can be a formidably abstruse topic, even for mathematicians, this concise book presents the subject in a lively and approachable fashion. It deals with the very important ideas in modern mathematical logic without the detailed mathematical work required of those with a professional interest in logic.The book begins with a historical survey of the development of mathematical logic from two parallel streams: formal deduction, which originated with Aristotle, Euclid, and others; and mathematical analysis, which dates back to Archimedes in the same era. The streams beg
Ferrite logic reliability study
Baer, J. A.; Clark, C. B.
1973-01-01
Development and use of digital circuits called all-magnetic logic are reported. In these circuits the magnetic elements and their windings comprise the active circuit devices in the logic portion of a system. The ferrite logic device belongs to the all-magnetic class of logic circuits. The FLO device is novel in that it makes use of a dual or bimaterial ferrite composition in one physical ceramic body. This bimaterial feature, coupled with its potential for relatively high speed operation, makes it attractive for high reliability applications. (Maximum speed of operation approximately 50 kHz.)
DEFF Research Database (Denmark)
Lopez, Hugo Andres; Carbone, Marco; Hildebrandt, Thomas
2010-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for speciﬁcation and veriﬁcation of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL...... ), a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service speciﬁcations. Finally, we show that, despite GL is undecidable, there is a signiﬁcant decidable fragment which we provide with a sound and complete proof...
Carbone, Marco; Hildebrandt, Thomas T; López, Hugo A; 10.4204/EPTCS.69.3
2011-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL), a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a significant decidable fragment which we provide with a sound and complete proof system for checking validity of formulae.
Directory of Open Access Journals (Sweden)
Marco Carbone
2011-10-01
Full Text Available We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL, a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a significant decidable fragment which we provide with a sound and complete proof system for checking validity of formulae.
Howard, Ayanna
2005-01-01
The Fuzzy Logic Engine is a software package that enables users to embed fuzzy-logic modules into their application programs. Fuzzy logic is useful as a means of formulating human expert knowledge and translating it into software to solve problems. Fuzzy logic provides flexibility for modeling relationships between input and output information and is distinguished by its robustness with respect to noise and variations in system parameters. In addition, linguistic fuzzy sets and conditional statements allow systems to make decisions based on imprecise and incomplete information. The user of the Fuzzy Logic Engine need not be an expert in fuzzy logic: it suffices to have a basic understanding of how linguistic rules can be applied to the user's problem. The Fuzzy Logic Engine is divided into two modules: (1) a graphical-interface software tool for creating linguistic fuzzy sets and conditional statements and (2) a fuzzy-logic software library for embedding fuzzy processing capability into current application programs. The graphical- interface tool was developed using the Tcl/Tk programming language. The fuzzy-logic software library was written in the C programming language.
... Inheritance; Heterozygous; Inheritance patterns; Heredity and disease; Heritable; Genetic markers ... The chromosomes are made up of strands of genetic information called DNA. Each chromosome contains sections of ...
Institute of Scientific and Technical Information of China (English)
王晖; 刘大有; 等
1994-01-01
In this paper we consider the problem of sequential processing and present a sequential model based on the back-propagation algorithm.This model is intended to deal with intrinsically sequential problems,such as word recognition,speech recognition,natural language understanding.This model can be used to train a network to learn the sequence of input patterns,in a fixed order or a random order.Besides,this model is open- and partial-associative,characterized as “resognizing while accumulating”, which, as we argue, is mental cognition process oriented.
Understanding Social Media Logic
Directory of Open Access Journals (Sweden)
José van Dijck
2013-08-01
Full Text Available Over the past decade, social media platforms have penetrated deeply into the mechanics of everyday life, affecting people's informal interactions, as well as institutional structures and professional routines. Far from being neutral platforms for everyone, social media have changed the conditions and rules of social interaction. In this article, we examine the intricate dynamic between social media platforms, mass media, users, and social institutions by calling attention to social media logic—the norms, strategies, mechanisms, and economies—underpinning its dynamics. This logic will be considered in light of what has been identified as mass media logic, which has helped spread the media's powerful discourse outside its institutional boundaries. Theorizing social media logic, we identify four grounding principles—programmability, popularity, connectivity, and datafication—and argue that these principles become increasingly entangled with mass media logic. The logic of social media, rooted in these grounding principles and strategies, is gradually invading all areas of public life. Besides print news and broadcasting, it also affects law and order, social activism, politics, and so forth. Therefore, its sustaining logic and widespread dissemination deserve to be scrutinized in detail in order to better understand its impact in various domains. Concentrating on the tactics and strategies at work in social media logic, we reassess the constellation of power relationships in which social practices unfold, raising questions such as: How does social media logic modify or enhance existing mass media logic? And how is this new media logic exported beyond the boundaries of (social or mass media proper? The underlying principles, tactics, and strategies may be relatively simple to identify, but it is much harder to map the complex connections between platforms that distribute this logic: users that employ them, technologies that
Directory of Open Access Journals (Sweden)
Nasri Abdelfatah
2011-01-01
Full Text Available The Reactive power flow’s is one of the most electrical distribution systems problem wich have great of interset of the electrical network researchers, it’s cause’s active power transmission reduction, power losses decreasing, and the drop voltage’s increase. In this research we described the efficiency of the FLC-GAO approach to solve the optimal power flow (OPF combinatorial problem. The proposed approach employ tow algorithms, Fuzzy logic controller (FLC algorithm for critical nodal detection and gentic algorithm optimization (GAO algorithm for optimal seizing capacitor.GAO method is more efficient in combinatory problem solutions. The proposed approach has been examined and tested on the standard IEEE 57-bus the resulats show the power loss minimization denhancement, voltage profile, and stability improvement. The proposed approach results have been compared to those that reported in the literature recently. The results are promising and show the effectiveness and robustness of the proposed approach.
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates of the ...
Ponse, A.; Zwaag, M.B. van der
2002-01-01
We distinguish two interpretations for the truth value `undefined' in Kleene's three-valued logic. Combining these two interpretations leads to a four-valued propositional logic that characterizes two particular ingredients of process algebra: ``choice' and ``inaction'. We study two different bases
S.L. Uckelman
2009-01-01
The origins of treating agency as a modal concept go back at least to the 11th century when Anselm, Archbishop of Canterbury, provided a modal explication of the Latin facere ‘to do’, which can be formalized within the context of modern modal logic and neighborhood semantics. The agentive logic indu
Logic via Computer Programming.
Wieschenberg, Agnes A.
This paper proposed the question "How do we teach logical thinking and sophisticated mathematics to unsophisticated college students?" One answer among many is through the writing of computer programs. The writing of computer algorithms is mathematical problem solving and logic in disguise and it may attract students who would otherwise stop…
Boyd, Robert
1995-01-01
This article proposes that within the discipline of logic, college students can learn the important elements of persuasive writing. Characteristics of and distinctions between deductive and inductive logic are outlined, and the appropriateness and usefulness of each for different kinds of persuasion are discussed. (MSE)
Inductive Logic and Statistics
Romeijn, J. -W.
2009-01-01
This chapter concerns inductive logic in relation to mathematical statistics. I start by introducing a general notion of probabilistic induc- tive inference. Then I introduce Carnapian inductive logic, and I show that it can be related to Bayesian statistical inference via de Finetti's representatio
Logic of Algorithmic Knowledge
Directory of Open Access Journals (Sweden)
Surowik Dariusz
2015-09-01
Full Text Available In this paper we consider the construction of a LAK system of temporal-epistemic logic which is used to formally describe algorithmic knowledge. We propose an axiom system of LAK and discuss the basic properties of this logic.
Programmable Logic Controllers.
Insolia, Gerard; Anderson, Kathleen
This document contains a 40-hour course in programmable logic controllers (PLC), developed for a business-industry technology resource center for firms in eastern Pennsylvania by Northampton Community College. The 10 units of the course cover the following: (1) introduction to programmable logic controllers; (2) DOS primer; (3) prerequisite…
Yopp, David
2010-01-01
Understanding logical necessity is an important component of proof and reasoning for teachers of grades K-8. The ability to determine exactly where young students' arguments are faulty offers teachers the chance to give youngsters feedback as they progress toward writing mathematically valid deductive proofs. As defined, logical necessity is the…
Directory of Open Access Journals (Sweden)
Evandro Agazzi
2011-06-01
Full Text Available Humans have used arguments for defending or refuting statements long before the creation of logic as a specialized discipline. This can be interpreted as the fact that an intuitive notion of "logical consequence" or a psychic disposition to articulate reasoning according to this pattern is present in common sense, and logic simply aims at describing and codifying the features of this spontaneous capacity of human reason. It is well known, however, that several arguments easily accepted by common sense are actually "logical fallacies", and this indicates that logic is not just a descriptive, but also a prescriptive or normative enterprise, in which the notion of logical consequence is defined in a precise way and then certain rules are established in order to maintain the discourse in keeping with this notion. Yet in the justification of the correctness and adequacy of these rules commonsense reasoning must necessarily be used, and in such a way its foundational role is recognized. Moreover, it remains also true that several branches and forms of logic have been elaborated precisely in order to reflect the structural features of correct argument used in different fields of human reasoning and yet insufficiently mirrored by the most familiar logical formalisms.
Blackburn, P.; Rijke, M. de
1995-01-01
Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailored made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standar
CSIR Research Space (South Africa)
Klarman, S
2013-05-01
Full Text Available We introduce Description Logics of Context (DLCs) - an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy's tradition of treating contexts as formal objects over which one can quantify...
Directory of Open Access Journals (Sweden)
Daniel Durante Pereira Alves
2011-04-01
Full Text Available Analyzing the position of two philosophers whose views are recognizably divergent, W. O. Quine and M. Dummett, we intend to support a striking point of agreement between them: the idea that our logical principles constitute our principles about what there is, and therefore, that logic is metaphysics.
Daniel Durante Pereira Alves
2011-01-01
Analyzing the position of two philosophers whose views are recognizably divergent, W. O. Quine and M. Dummett, we intend to support a striking point of agreement between them: the idea that our logical principles constitute our principles about what there is, and therefore, that logic is metaphysics.
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2012-01-01
In this paper we explore the logic of now, yesterday, today and tomorrow by combining the semantic approach to indexicality pioneered by Hans Kamp [9] and refined by David Kaplan [10] with hybrid tense logic. We first introduce a special now nominal (our @now corresponds to Kamp’s original now...
Microelectromechanical reprogrammable logic device
Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.
2016-03-01
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
DEFF Research Database (Denmark)
Klose, Karl; Ostermann, Klaus
2010-01-01
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze the probl......In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze...... the problems inhibiting separate checking and propose a class of logics that reconcile logic metaprogramming and separate checking. We have formalized the resulting module system and have proven the soundness of separate checking. We validate its feasibility by presenting the design and implementation...... of a specific logic that is able to express many metaprogramming examples from the literature....
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
The purpose of the article is to demonstrate that in order to understand competition as a socially organizing phenomenon, we should not examine competition in isolation, but as constellations of heterogeneous logics. More precisely, the article is based on two main theoretical points: (1) Logics...... of competition are only realized as particular forms of social organization by virtue of interplaying with other kinds of logics, like legal logics. (2) Competition logics enjoy a peculiar status in-between constructedness and givenness; although competition depends on laws and mechanisms of socialization, we...... still experience competition as an expression of spontaneous human activities. On the basis of these perspectives, a study of fundamental rights of EU law, springing from the principle of ‘free movement of people’, is conducted. The first part of the empirical analysis seeks to detect the presence...
Malhas, Othman Qasim
1993-10-01
The concept of “abacus logic” has recently been developed by the author (Malhas, n.d.). In this paper the relation of abacus logic to the concept of fuzziness is explored. It is shown that if a certain “regularity” condition is met, concepts from fuzzy set theory arise naturally within abacus logics. In particular it is shown that every abacus logic then has a “pre-Zadeh orthocomplementation”. It is also shown that it is then possible to associate a fuzzy set with every proposition of abacus logic and that the collection of all such sets satisfies natural conditions expected in systems of fuzzy logic. Finally, the relevance to quantum mechanics is discussed.
Microelectromechanical reprogrammable logic device
Hafiz, M. A. A.
2016-03-29
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
Dynamic Logic with Trace Semantics
Beckert, Bernhard; Bruns, Daniel
2013-01-01
Dynamic logic is an established instrument for program verification and for reasoning about the semantics of programs and programming languages. In this paper, we define an extension of dynamic logic, called Dynamic Trace Logic (DTL), which combines the expressiveness of program logics such as dynamic logic with that of temporal logic. And we present a sound and relatively complete sequent calculus for proving validity of DTL formulae. Due to its expressiveness, DTL can serve as a basis for p...
Mathematical logic for computer science
Zhong Wan Lu
1998-01-01
Mathematical logic is essentially related to computer science. This book describes the aspects of mathematical logic that are closely related to each other, including classical logic, constructive logic, and modal logic. This book is intended to attend to both the peculiarities of logical systems and the requirements of computer science.In this edition, the revisions essentially involve rewriting the proofs, increasing the explanations, and adopting new terms and notations.
Arthur Prior and medieval logic
2012-01-01
Though Arthur Prior is now best known for his founding of modern temporal logic and hybrid logic, much of his early philosophical career was devoted to history of logic and historical logic. This interest laid the foundations for both of his ground-breaking innovations in the 1950s and 1960s. Because of the important rôle played by Prior’s research in ancient and medieval logic in his development of temporal and hybrid logic, any student of Prior, temporal logic, or hybrid logic should be fam...
Bozzelli, Laura; French, Tim; Hales, James; Pinchinat, Sophie
2012-01-01
In this paper we present refinement modal logic. A refinement is like a bisimulation, except that from the three relational requirements only 'atoms' and 'back' need to be satisfied. Our logic contains a new operator 'forall' in additional to the standard modalities 'Box' for each agent. The operator 'forall' acts as a quantifier over the set of all refinements of a given model. We call it the refinement operator. As a variation on a bisimulation quantifier, it can be seen as a refinement quantifier over a variable not occurring in the formula bound by the operator. The logic combines the simplicity of multi-agent modal logic with some powers of monadic second order quantification. We present a sound and complete axiomatization of multiagent refinement modal logic. We also present an extension of the logic to the modal mu-calculus, and an axiomatization for the single-agent version of this logic. Examples and applications are also discussed: to software verification and design (the set of agents can also be s...
Metaphysics of Logical Realism
Directory of Open Access Journals (Sweden)
Mohammadreza Abdollahnejad
2015-08-01
Full Text Available Despite the often false impression that the analytic philosophy as an anti-metaphysical movement has nothing to do with metaphysics, there can be found good reasons to grant the metaphysical dispositions of analytic philosophers, and thereby, to minimize the anti-metaphysical nature of analytic philosophy in its all phases. Since analytic philosophy is a historical movement the main nature of which developed through several stages, the very kinds of metaphysical dispositions within each one of its various stages can be easily portrayed. In the meantime, logical realism as the early stage of analytic philosophy contains plenty of metaphysical dispositions. Undoubtedly, one cannot say that analytic philosophy in this period was not committed to metaphysical theses about the plurality of entities, the ultimate nature of reality and the logical structure of the world. In this paper, then, after giving a relatively complete explanation of the logical realism, we claimed that although logical realists rejected the traditional speculative metaphysics of their predecessors, they also replaced it by the metaphysics of logic that pursues the metaphysical aims, this time, by logical means. So, we portrayed this kind of metaphysics as Bolzano’s Semantic Platonism, Frege’s and Russell’s Pluralistic Platonism, Russell’s Pluralistic Atomism, and Wittgenstein’s logical atomism.
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...... of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method....
DEFF Research Database (Denmark)
Filipiuk, Piotr; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions...... are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping of analyses and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases...
Logic in elementary mathematics
Exner, Robert M
2011-01-01
This applications-related introductory treatment explores facets of modern symbolic logic useful in the exposition of elementary mathematics. The authors convey the material in a manner accessible to those trained in standard elementary mathematics but lacking any formal background in logic. Topics include the statement calculus, proof and demonstration, abstract mathematical systems, and the restricted predicate calculus. The final chapter draws upon the methods of logical reasoning covered in previous chapters to develop solutions of linear and quadratic equations, definitions of order and
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates...... characterizes stochastic bisimilarity and it supports the definition of a quantified extension of the satisfiability relation that measures the "compatibility" between a model and a property. In this context, the metaproperties allows us to prove two robustness theorems for the logic stating that one can...
Propositional Dynamic Logic as a Logic of Belief Revision
D.J.N. van Eijck (Jan); Y. Wang (Yanjing)
2008-01-01
htmlabstractThis paper shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from
Fisher, Michael; Gabbay, Dov; Gough, Graham
2000-01-01
Time is a fascinating subject that has captured mankind's imagination from ancient times to the present. It has been, and continues to be studied across a wide range of disciplines, from the natural sciences to philosophy and logic. More than two decades ago, Pnueli in a seminal work showed the value of temporal logic in the specification and verification of computer programs. Today, a strong, vibrant international research community exists in the broad community of computer science and AI. This volume presents a number of articles from leading researchers containing state-of-the-art results in such areas as pure temporal/modal logic, specification and verification, temporal databases, temporal aspects in AI, tense and aspect in natural language, and temporal theorem proving. Earlier versions of some of the articles were given at the most recent International Conference on Temporal Logic, University of Manchester, UK. Readership: Any student of the area - postgraduate, postdoctoral or even research professor ...
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study of inform......Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...... of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method....
Directory of Open Access Journals (Sweden)
Schumann Andrew
2016-03-01
Full Text Available The paper considers main features of two groups of logics for biological devices, called Physarum Chips, based on the plasmodium. Let us recall that the plasmodium is a single cell with many diploid nuclei. It propagates networks by growing pseudopodia to connect scattered nutrients (pieces of food. As a result, we deal with a kind of computing. The first group of logics for Physarum Chips formalizes the plasmodium behaviour under conditions of nutrient-poor substrate. This group can be defined as standard storage modification machines. The second group of logics for Physarum Chips covers the plasmodium computing under conditions of nutrient-rich substrate. In this case the plasmodium behaves in a massively parallel manner and propagates in all possible directions. The logics of the second group are unconventional and deal with non-well-founded data such as infinite streams.
Dialectic operator fuzzy logic
Institute of Scientific and Technical Information of China (English)
程晓春; 姜云飞; 刘叙华
1996-01-01
Dialectic operator fuzzy logic (DOFL) is presented which is relevant,paraconsistent and nonmonotonic.DOFL can vividly describe the belief revision in the cognitive process and can infer reasonably well while the knowledge is inconsistent,imprecise or incomplete.
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
The purpose of the article is to demonstrate that in order to understand competition as a socially organizing phenomenon, we should not examine competition in isolation, but as constellations of heterogeneous logics. More precisely, the article is based on two main theoretical points: (1) Logics...... still experience competition as an expression of spontaneous human activities. On the basis of these perspectives, a study of fundamental rights of EU law, springing from the principle of ‘free movement of people’, is conducted. The first part of the empirical analysis seeks to detect the presence...... of a presumed logic of competition within EU law, whereas the second part focuses on particular legal logics. In this respect, the so-called ‘real link criterion’ (determining the access to transnational social rights for certain groups of unemployed people) is given special attention. What is particularly...
Geneves, Pierre
2008-01-01
This thesis describes the theoretical and practical foundations of a system for the static analysis of XML processing languages. The system relies on a fixpoint temporal logic with converse, derived from the mu-calculus, where models are finite trees. This calculus is expressive enough to capture regular tree types along with multi-directional navigation in trees, while having a single exponential time complexity. Specifically the decidability of the logic is proved in time 2^O(n) where n is the size of the input formula. Major XML concepts are linearly translated into the logic: XPath navigation and node selection semantics, and regular tree languages (which include DTDs and XML Schemas). Based on these embeddings, several problems of major importance in XML applications are reduced to satisfiability of the logic. These problems include XPath containment, emptiness, equivalence, overlap, coverage, in the presence or absence of regular tree type constraints, and the static type-checking of an annotated query....
Reasoning, logic, and psychology.
Stenning, Keith; van Lambalgen, Michiel
2011-09-01
We argue that reasoning has been conceptualized so narrowly in what is known as 'psychology of reasoning' that reasoning's relevance to cognitive science has become well-nigh invisible. Reasoning is identified with determining whether a conclusion follows validly from given premises, where 'valid' is taken to mean 'valid according to classical logic'. We show that there are other ways to conceptualize reasoning, more in line with current logical theorizing, which give it a role in psychological processes ranging from (verbal) discourse comprehension to (nonverbal) planning. En route we show that formal logic, at present marginalized in cognitive science, can be an extremely valuable modeling tool. In particular, there are cases in which probabilistic modeling must fail, whereas logical models do well. WIREs Cogni Sci 2011 2 555-567 DOI: 10.1002/wcs.134 For further resources related to this article, please visit the WIREs website.
Extending Value Logic Thinking to Value Logic Portfolios
DEFF Research Database (Denmark)
Ritter, Thomas; Andersen, Poul Houman
Based on value creation logic theory (Stabell & Fjeldstad, 1998), this paper suggests an extension of the original Stabell & Fjeldstad model by an additional fourth value logic, the value system logic. Furthermore, instead of only allowing one dominant value creation logic for a given firm...... or transaction, an understanding of firms and transactions as a portfolio of value logics (i.e. an interconnected coexistence of different value creation logics) is proposed. These additions to the original value creation logic theory imply interesting avenues for both, strategic decision making in firms...
Tan, Yong
2013-01-01
In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover shows a new method of cutting graph. Around this model, there are six algorithms in this paper including exact graph traversal, Algebra calculation of natural number, graph partition and graph coloring.
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
1999-01-01
Conceptual spaces have been proposed as topological or geometric means for establishing conceptual structures and models. This paper, after briey reviewing conceptual spaces, focusses on the relationship between conceptual spaces and logical concept languages with operations for combining concepts...... to form concepts. Speci cally is introduced an algebraic concept logic, for which conceptual spaces are installed as semantic domain as replacement for, or enrichment of, the traditional....
Logic and declarative language
Downward, M
2004-01-01
Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.
Institute of Scientific and Technical Information of China (English)
Simon Mumford takes a more 'logical' view of gramm
2010-01-01
@@ Many people enjoy puzzles and solving prob lems,and the use of an element of logic can make grammar exercises more interesting.Exercises such as putting words in order and clozes can be consid ered forms of puzzles,but there are many more op portunities to challenge more logically-minded stu dents.Here are some language puzzles for students and teachers alike.
Yanushkevich, Svetlana N
2008-01-01
Preface Design Process and Technology Theory of logic design Analysis and synthesis Implementation technologies Predictable technologies Contemporary CAD of logic networks Number Systems Positional numbers Counting in a positional number system Basic arithmetic operations in various number systems Binary arithmetic Radix-complement representations Techniques for conversion of numbers in various radices Overflow Residue arithmetic Other binary codes Redundancy and reliability Graphical Data Structures Graphs in discrete devices and systems design Basic definitions T
Towards a Formal Occurrence Logic based on Predicate Logic
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
2015-01-01
In this discussion we will concentrate on the main characteristics of an alternative kind of logic invented by Hans Götzsche: Occurrence Logic, which is not based on truth functionality. Our approach is based on temporal logic developed and elaborated by A. N. Prior. We will focus on characterising...... argumentation based on formal Occurrence Logic concerning events and occurrences, and illustrate the relations between Predicate Logic and Occurrence Logic. The relationships (and dependencies) is conducive to an approach that can analyse the occurrences of ”logical statements based on different logical...... principles” in different moments. We will also conclude that the elaborated Götzsche’s Occurrence Logic could be able to direct us to a truth-functional independent computer-based logic for analysing argumentation based on events and occurrences....
Sequential stochastic optimization
Cairoli, Renzo
1996-01-01
Sequential Stochastic Optimization provides mathematicians and applied researchers with a well-developed framework in which stochastic optimization problems can be formulated and solved. Offering much material that is either new or has never before appeared in book form, it lucidly presents a unified theory of optimal stopping and optimal sequential control of stochastic processes. This book has been carefully organized so that little prior knowledge of the subject is assumed; its only prerequisites are a standard graduate course in probability theory and some familiarity with discrete-paramet
Energy Technology Data Exchange (ETDEWEB)
Bulsara, Adi R., E-mail: bulsara@spawar.navy.mil [SPAWAR Systems Center Pacific, San Diego, CA 92152-5001 (United States); Dari, Anna, E-mail: adari@asu.edu [Ira A. Fulton School of Engineering, Arizona State University, Tempe, AZ 85287-9309 (United States); Ditto, William L., E-mail: william.ditto@asu.edu [Ira A. Fulton School of Engineering, Arizona State University, Tempe, AZ 85287-9309 (United States); Murali, K., E-mail: kmurali@annauniv.edu [Department of Physics, Anna University, Chennai 600 025 (India); Sinha, Sudeshna, E-mail: sudeshna@imsc.res.in [Institute of Mathematical Sciences, Taramani, Chennai 600 113 (India); Indian Institute of Science Education and Research, Mohali, Transit Campus: MGSIPAP Complex, Sector 26 Chandigarh (India)
2010-10-05
In a recent publication it was shown that, when one drives a two-state system with two square waves as input, the response of the system mirrors a logical output (NOR/OR). The probability of obtaining the correct logic response is controlled by the interplay between the noise-floor and the nonlinearity. As one increases the noise intensity, the probability of the output reflecting a NOR/OR operation increases to unity and then decreases. Varying the nonlinearity (or the thresholds) of the system allows one to morph the output into another logic operation (NAND/AND) whose probability displays analogous behavior. Thus, the outcome of the interplay of nonlinearity and noise is a flexible logic gate with enhanced performance. Here we review this concept of 'Logical Stochastic Resonance' (LSR) and provide details of an electronic circuit system demonstrating LSR. Our proof-of-principle experiment involves a particularly simple realization of a two-state system realized by two adjustable thresholds. We also review CMOS implementations of a simple LSR circuit, and the concatenation of these LSR modules to emulate combinational logic, such as data flip-flop and full adder operations.
Arthur Prior and medieval logic
Uckelman, S.L.
2012-01-01
Though Arthur Prior is now best known for his founding of modern temporal logic and hybrid logic, much of his early philosophical career was devoted to history of logic and historical logic. This interest laid the foundations for both of his ground-breaking innovations in the 1950s and 1960s. Becaus
Relational Parametricity and Separation Logic
DEFF Research Database (Denmark)
Birkedal, Lars; Yang, Hongseok
2008-01-01
Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types. Our interpretation is based on Reynolds's relational...... parametricity, and it provides a formal connection between separation logic and data abstraction. Udgivelsesdato: 2008...
Agnati, Luigi Francesco; Agnati, Achille; Mora, Francisco; Fuxe, Kjell
2007-08-01
Starting from the assumption that philosophers carry out "experiments" not on concrete objects, but on concepts and relationships between concepts, it could be postulated that the philosopher's way to proceed is not basically different from that followed by scientists. From this similarity of approaches it can be considered that some philosophical problems and theories have a high impact on how to address scientific investigations. One of these issues is certainly the philosophical debate over innate ideas, which is central to the conflict between rationalist and empiricist epistemologies. We started our reflections on the possible presence of innate ideas in the human brain from the observation that there exists strong experimental support for the view that not only complex behaviours (e.g., sexual courtship, parental care) but also aesthetic and ethic judgements can be, at least in part, genetically determined. On these grounds it is suggested that neurobiological findings can give important contributions to the philosophical debate on innatism by putting forward possible explanatory models and heuristic hypotheses.
Logical Varieties in Normative Reasoning
Burgin, Mark; Mestdagh, de Vey
2011-01-01
Although conventional logical systems based on logical calculi have been successfully used in mathematics and beyond, they have definite limitations that restrict their application in many cases. For instance, the principal condition for any logical calculus is its consistency. At the same time, knowledge about large object domains (in science or in practice) is essentially inconsistent. Logical prevarieties and varieties were introduced to eliminate these limitations in a logically correct way. In this paper, the Logic of Reasonable Inferences is described. This logic has been applied successfully to model legal reasoning with inconsistent knowledge. It is demonstrated that this logic is a logical variety and properties of logical varieties related to legal reasoning are developed.
Sequential circuit design for radiation hardened multiple voltage integrated circuits
Clark, Lawrence T.; McIver, III, John K.
2009-11-24
The present invention includes a radiation hardened sequential circuit, such as a bistable circuit, flip-flop or other suitable design that presents substantial immunity to ionizing radiation while simultaneously maintaining a low operating voltage. In one embodiment, the circuit includes a plurality of logic elements that operate on relatively low voltage, and a master and slave latches each having storage elements that operate on a relatively high voltage.
Forced Sequence Sequential Decoding
DEFF Research Database (Denmark)
Jensen, Ole Riis; Paaske, Erik
1998-01-01
the iteration process provides the sequential decoders with side information that allows a smaller average load and minimizes the probability of computational overflow. Analytical results for the probability that the first RS word is decoded after C computations are presented. These results are supported...
Sequential memory: Binding dynamics
Afraimovich, Valentin; Gong, Xue; Rabinovich, Mikhail
2015-10-01
Temporal order memories are critical for everyday animal and human functioning. Experiments and our own experience show that the binding or association of various features of an event together and the maintaining of multimodality events in sequential order are the key components of any sequential memories—episodic, semantic, working, etc. We study a robustness of binding sequential dynamics based on our previously introduced model in the form of generalized Lotka-Volterra equations. In the phase space of the model, there exists a multi-dimensional binding heteroclinic network consisting of saddle equilibrium points and heteroclinic trajectories joining them. We prove here the robustness of the binding sequential dynamics, i.e., the feasibility phenomenon for coupled heteroclinic networks: for each collection of successive heteroclinic trajectories inside the unified networks, there is an open set of initial points such that the trajectory going through each of them follows the prescribed collection staying in a small neighborhood of it. We show also that the symbolic complexity function of the system restricted to this neighborhood is a polynomial of degree L - 1, where L is the number of modalities.
Discourse Preferences in Dynamic Logic
Jaspars, J; Jaspars, Jan; Kameyama, Megumi
1997-01-01
In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with additional preferential operators in the underlying static logic, which enables us to define defeasible (pragmatic) entailments over a given piece of discourse. We will show how this setting can be used for a dynamic logical analysis of preferential resolutions of ambiguous pronouns in discourse.
Kumar, Santosh; Chauhan, Chanderkanta; Bedi, Amna
2016-12-01
In recent years, it has been shown that reversible logic can play an important role in power optimization for computer design. The various reversible logic gates such as Feynman, Fredkin, Peres, and Toffoli gates have been discussed by researchers, but very little work has been done on reversible sequential circuits. Design of reversible sequential circuits using lithium-niobate-based Mach-Zehnder interferometers is proposed. Here, flip-flops are designed with the help of basic reversible logic gates such as Feynman, Fredkin, and Peres gates. Theoretical descriptions along with mathematical formulation of the devices are provided. The devices are also analyzed through finite difference-beam propagation method and MATLAB® simulation.
Non-logic devices in logic processes
Ma, Yanjun
2017-01-01
This book shows readers how to design semiconductor devices using the most common and lowest cost logic CMOS processes. Readers will benefit from the author’s extensive, industrial experience and the practical approach he describes for designing efficiently semiconductor devices that typically have to be implemented using specialized processes that are expensive, time-consuming, and low-yield. The author presents an integrated picture of semiconductor device physics and manufacturing techniques, as well as numerous practical examples of device designs that are tried and true.
Logic and truth: Some logics without theorems
Directory of Open Access Journals (Sweden)
Jayanta Sen
2008-08-01
Full Text Available Two types of logical consequence are compared: one, with respect to matrix and designated elements and the other with respect to ordering in a suitable algebraic structure. Particular emphasis is laid on algebraic structures in which there is no top-element relative to the ordering. The significance of this special condition is discussed. Sequent calculi for a number of such structures are developed. As a consequence it is re-established that the notion of truth as such, not to speak of tautologies, is inessential in order to define validity of an argument.
Characterising equilibrium logic and nested logic programs: Reductions and complexity
Pearce, David; Woltran, Stefan
2009-01-01
Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules, as special kinds of theories. In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs into quantified propositional logic, an extension of classical propositional logic where quantifications over atomic formulas are permitted. We provide reductions not only for decision problems, but also for the central semantical concepts of equilibrium logic and nested logic programs. In particular, our encodings map a given decision problem into some formula such that the latter is valid precisely in case the former holds. The basic tasks we deal with here are the consistency problem, brave reasoning, and skeptical reasoning. Additionally, we also provide encoding...
Hermenegildo, Manuel V.
1986-01-01
The term "Logic Programming" refers to a variety of computer languages and execution models which are based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in Artificial Intelligence, Knowledge-based systems, and many other areas of computing. The sequential execution speed of logic programs has been greatly improved sinc...
Matrosova, A. Yu.; Kirienko, I. E.; Tomkov, V. V.; Miryutov, A. A.
2016-12-01
Reliability of physical systems is provided by reliability of their parts including logical ones. Insertion of malicious subcircuits that can destroy logical circuit or cause leakage of confidential information from a system necessitates the detection of such subcircuits followed by their masking if possible. We suggest a method of finding a set of sequential circuit nodes in which Trojan Circuits can be inserted. The method is based on random estimations of controllability and observability of combinational nodes calculated using a description of sequential circuit working area and an evidence of existence of a transfer sequence for the proper set of internal states without finding the sequence itself. The method allows cutting calculations using operations on Reduced Ordered Binary Decision Diagrams (ROBDDs) that can depend only on the state variables of the circuit. The approach, unlike traditional ones, does not require preliminary sequential circuit simulation but can use its results. It can be used when malicious circuits cannot be detected during sequential circuit verification.
Diagnosable structured logic array
Whitaker, Sterling (Inventor); Miles, Lowell (Inventor); Gambles, Jody (Inventor); Maki, Gary K. (Inventor)
2009-01-01
A diagnosable structured logic array and associated process is provided. A base cell structure is provided comprising a logic unit comprising a plurality of input nodes, a plurality of selection nodes, and an output node, a plurality of switches coupled to the selection nodes, where the switches comprises a plurality of input lines, a selection line and an output line, a memory cell coupled to the output node, and a test address bus and a program control bus coupled to the plurality of input lines and the selection line of the plurality of switches. A state on each of the plurality of input nodes is verifiably loaded and read from the memory cell. A trusted memory block is provided. The associated process is provided for testing and verifying a plurality of truth table inputs of the logic unit.
Prakash, Manu; Gershenfeld, Neil
2007-02-09
We demonstrate universal computation in an all-fluidic two-phase microfluidic system. Nonlinearity is introduced into an otherwise linear, reversible, low-Reynolds number flow via bubble-to-bubble hydrodynamic interactions. A bubble traveling in a channel represents a bit, providing us with the capability to simultaneously transport materials and perform logical control operations. We demonstrate bubble logic AND/OR/NOT gates, a toggle flip-flop, a ripple counter, timing restoration, a ring oscillator, and an electro-bubble modulator. These show the nonlinearity, gain, bistability, synchronization, cascadability, feedback, and programmability required for scalable universal computation. With increasing complexity in large-scale microfluidic processors, bubble logic provides an on-chip process control mechanism integrating chemistry and computation.
Carlsson, Christer; Fullér, Robert
2004-01-01
Fuzzy Logic in Management demonstrates that difficult problems and changes in the management environment can be more easily handled by bringing fuzzy logic into the practice of management. This explicit theme is developed through the book as follows: Chapter 1, "Management and Intelligent Support Technologies", is a short survey of management leadership and what can be gained from support technologies. Chapter 2, "Fuzzy Sets and Fuzzy Logic", provides a short introduction to fuzzy sets, fuzzy relations, the extension principle, fuzzy implications and linguistic variables. Chapter 3, "Group Decision Support Systems", deals with group decision making, and discusses methods for supporting the consensus reaching processes. Chapter 4, "Fuzzy Real Options for Strategic Planning", summarizes research where the fuzzy real options theory was implemented as a series of models. These models were thoroughly tested on a number of real life investments, and validated in 2001. Chapter 5, "Soft Computing Methods for Reducing...
Giordano, Paolo
2009-01-01
We introduce the ring of Fermat reals, an extension of the real field containing nilpotent infinitesimals. The construction takes inspiration from Smooth Infinitesimal Analysis (SIA), but provides a powerful theory of actual infinitesimals without any need of a background in mathematical logic. In particular, on the contrary with respect to SIA, which admits models only in intuitionistic logic, the theory of Fermat reals is consistent with classical logic. We face the problem to decide if the product of powers of nilpotent infinitesimals is zero or not, the identity principle for polynomials, the definition and properties of the total order relation. The construction is highly constructive, and every Fermat real admits a clear and order preserving geometrical representation. Using nilpotent infinitesimals, every smooth functions becomes a polynomial because in Taylor's formulas the rest is now zero. Finally, we present several applications to informal classical calculations used in Physics: now all these calc...
Rushton, Andrew
2011-01-01
Many engineers encountering VHDL (very high speed integrated circuits hardware description language) for the first time can feel overwhelmed by it. This book bridges the gap between the VHDL language and the hardware that results from logic synthesis with clear organisation, progressing from the basics of combinational logic, types, and operators; through special structures such as tristate buses, register banks and memories, to advanced themes such as developing your own packages, writing test benches and using the full range of synthesis types. This third edition has been substantially rewritten to include the new VHDL-2008 features that enable synthesis of fixed-point and floating-point hardware. Extensively updated throughout to reflect modern logic synthesis usage, it also contains a complete case study to demonstrate the updated features. Features to this edition include: * a common VHDL subset which will work across a range of different synthesis systems, targeting a very wide range of technologies...
Logic Programming for Linguistics
DEFF Research Database (Denmark)
Christiansen, Henning
2010-01-01
This article gives a short introduction on how to get started with logic pro- gramming in Prolog that does not require any previous programming expe- rience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what...... a computer is, can follow the text. I cannot, of course, cover all aspects of logic programming in this text, and so we give references to other sources with more details. Students of linguistics must have a very good motivation to spend time on programming, and I show here how logic programming can be used...... for modelling different linguistic phenomena. When modelling language in this way, as opposed to using only paper and pencil, your models go live: you can run and test your models and you can use them as automatic language analyzers. This way you will get a better understanding of the dynamics of languages...
Sequential measurements of conjugate observables
Energy Technology Data Exchange (ETDEWEB)
Carmeli, Claudio [Dipartimento di Fisica, Universita di Genova, Via Dodecaneso 33, 16146 Genova (Italy); Heinosaari, Teiko [Department of Physics and Astronomy, Turku Centre for Quantum Physics, University of Turku, 20014 Turku (Finland); Toigo, Alessandro, E-mail: claudio.carmeli@gmail.com, E-mail: teiko.heinosaari@utu.fi, E-mail: alessandro.toigo@polimi.it [Dipartimento di Matematica ' Francesco Brioschi' , Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano (Italy)
2011-07-15
We present a unified treatment of sequential measurements of two conjugate observables. Our approach is to derive a mathematical structure theorem for all the relevant covariant instruments. As a consequence of this result, we show that every Weyl-Heisenberg covariant observable can be implemented as a sequential measurement of two conjugate observables. This method is applicable both in finite- and infinite-dimensional Hilbert spaces, therefore covering sequential spin component measurements as well as position-momentum sequential measurements.
Introduction to mathematical logic
Mendelson, Elliott
2009-01-01
The Propositional CalculusPropositional Connectives. Truth TablesTautologies Adequate Sets of Connectives An Axiom System for the Propositional Calculus Independence. Many-Valued LogicsOther AxiomatizationsFirst-Order Logic and Model TheoryQuantifiersFirst-Order Languages and Their Interpretations. Satisfiability and Truth. ModelsFirst-Order TheoriesProperties of First-Order Theories Additional Metatheorems and Derived Rules Rule C Completeness Theorems First-Order Theories with EqualityDefinitions of New Function Letters and Individual Constants Prenex Normal Forms Isomorphism of Interpretati
Stoll, Robert R
1979-01-01
Set Theory and Logic is the result of a course of lectures for advanced undergraduates, developed at Oberlin College for the purpose of introducing students to the conceptual foundations of mathematics. Mathematics, specifically the real number system, is approached as a unity whose operations can be logically ordered through axioms. One of the most complex and essential of modern mathematical innovations, the theory of sets (crucial to quantum mechanics and other sciences), is introduced in a most careful concept manner, aiming for the maximum in clarity and stimulation for further study in
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artifacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D-algebra....
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artefacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D -algebra....
Reactive standard deontic logic
Gabbay, Dov M.; Straßer, Christian
2015-01-01
We introduce a reactive variant of SDL (standard deontic logic): SDLR1 (reactive standard deontic logic). Given a Kripkean view on the semantics of SDL in terms of directed graphs where arrows -> represent the accessibility relation between worlds, reactive models add two elements: arrows -> are labelled as 'active' or 'inactive', and double arrows a dagger connect arrows, e.g. (x(1) -> x(2)) a dagger (x(3) -> x(4)). The idea is that passing through x(1) -> x(2) activates a switch represented...
Rebuschi, Manuel
2009-01-01
One of the highlights of recent informal epistemology is its growing theoretical emphasis upon various notions of context. The present paper addresses the connections between knowledge and context within a formal approach. To this end, a "contextual epistemic logic", CEL, is proposed, which consists of an extension of standard S5 epistemic modal logic with appropriate reduction axioms to deal with an extra contextual operator. We describe the axiomatics and supply both a Kripkean and a dialogical semantics for CEL. An illustration of how it may fruitfully be applied to informal epistemological matters is provided.
Evens, Aden
2015-01-01
Building a foundational understanding of the digital, Logic of the Digital reveals a unique digital ontology. Beginning from formal and technical characteristics, especially the binary code at the core of all digital technologies, Aden Evens traces the pathways along which the digital domain of abstract logic encounters the material, human world. How does a code using only 0s and 1s give rise to the vast range of applications and information that constitutes a great and growing portion of our world? Evens' analysis shows how any encounter between the actual and the digital must cross an ontolo
Gibson, J
2013-01-01
Most branches of organizing utilize digital electronic systems. This book introduces the design of such systems using basic logic elements as the components. The material is presented in a straightforward manner suitable for students of electronic engineering and computer science. The book is also of use to engineers in related disciplines who require a clear introduction to logic circuits. This third edition has been revised to encompass the most recent advances in technology as well as the latest trends in components and notation. It includes a wide coverage of application specific integrate
Linear Logical Voting Protocols
DEFF Research Database (Denmark)
DeYoung, Henry; Schürmann, Carsten
2012-01-01
. In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW- FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise......Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification...... implementations that closely correspond to their legal specification, thereby increasing trust....
Modelling sequentially scored item responses
Akkermans, W.
2000-01-01
The sequential model can be used to describe the variable resulting from a sequential scoring process. In this paper two more item response models are investigated with respect to their suitability for sequential scoring: the partial credit model and the graded response model. The investigation is c
Sequential cloning of chromosomes
Energy Technology Data Exchange (ETDEWEB)
Lacks, S.A.
1991-12-31
A method for sequential cloning of chromosomal DNA and chromosomal DNA cloned by this method are disclosed. The method includes the selection of a target organism having a segment of chromosomal DNA to be sequentially cloned. A first DNA segment, having a first restriction enzyme site on either side. homologous to the chromosomal DNA to be sequentially cloned is isolated. A first vector product is formed by ligating the homologous segment into a suitably designed vector. The first vector product is circularly integrated into the target organism`s chromosomal DNA. The resulting integrated chromosomal DNA segment includes the homologous DNA segment at either end of the integrated vector segment. The integrated chromosomal DNA is cleaved with a second restriction enzyme and ligated to form a vector-containing plasmid, which is replicated in a host organism. The replicated plasmid is then cleaved with the first restriction enzyme. Next, a DNA segment containing the vector and a segment of DNA homologous to a distal portion of the previously isolated DNA segment is isolated. This segment is then ligated to form a plasmid which is replicated within a suitable host. This plasmid is then circularly integrated into the target chromosomal DNA. The chromosomal DNA containing the circularly integrated vector is treated with a third, retrorestriction enzyme. The cleaved DNA is ligated to give a plasmid that is used to transform a host permissive for replication of its vector. The sequential cloning process continues by repeated cycles of circular integration and excision. The excision is carried out alternately with the second and third enzymes.
Sequential cloning of chromosomes
Lacks, S.A.
1995-07-18
A method for sequential cloning of chromosomal DNA of a target organism is disclosed. A first DNA segment homologous to the chromosomal DNA to be sequentially cloned is isolated. The first segment has a first restriction enzyme site on either side. A first vector product is formed by ligating the homologous segment into a suitably designed vector. The first vector product is circularly integrated into the target organism`s chromosomal DNA. The resulting integrated chromosomal DNA segment includes the homologous DNA segment at either end of the integrated vector segment. The integrated chromosomal DNA is cleaved with a second restriction enzyme and ligated to form a vector-containing plasmid, which is replicated in a host organism. The replicated plasmid is then cleaved with the first restriction enzyme. Next, a DNA segment containing the vector and a segment of DNA homologous to a distal portion of the previously isolated DNA segment is isolated. This segment is then ligated to form a plasmid which is replicated within a suitable host. This plasmid is then circularly integrated into the target chromosomal DNA. The chromosomal DNA containing the circularly integrated vector is treated with a third, retrorestriction (class IIS) enzyme. The cleaved DNA is ligated to give a plasmid that is used to transform a host permissive for replication of its vector. The sequential cloning process continues by repeated cycles of circular integration and excision. The excision is carried out alternately with the second and third enzymes. 9 figs.
From logic design to logic programming
Energy Technology Data Exchange (ETDEWEB)
Snyers, D.; Thayse, A.
1987-01-01
The main purpose of the present book is to show that in the same way as P-functions can lead to algorithmic or imperative implementations via the algorithmic state machine model or via the parallel program schema, they can also lead to a declarative type of implementation via the theorem proving model. As P-functions are used for synthesizing algorithms, the result of the synthesis can be interpreted in terms of implementation tools. To the hardware, microprogrammed and programmed (in an algorithmic or imperative programming environment using fortran-like or pascal-like languages) implementations the authors can thus add logic programmed implementation as a possible result of the P-function calculus.
Radiation tolerant combinational logic cell
Maki, Gary R. (Inventor); Gambles, Jody W. (Inventor); Whitaker, Sterling (Inventor)
2009-01-01
A system has a reduced sensitivity to Single Event Upset and/or Single Event Transient(s) compared to traditional logic devices. In a particular embodiment, the system includes an input, a logic block, a bias stage, a state machine, and an output. The logic block is coupled to the input. The logic block is for implementing a logic function, receiving a data set via the input, and generating a result f by applying the data set to the logic function. The bias stage is coupled to the logic block. The bias stage is for receiving the result from the logic block and presenting it to the state machine. The state machine is coupled to the bias stage. The state machine is for receiving, via the bias stage, the result generated by the logic block. The state machine is configured to retain a state value for the system. The state value is typically based on the result generated by the logic block. The output is coupled to the state machine. The output is for providing the value stored by the state machine. Some embodiments of the invention produce dual rail outputs Q and Q'. The logic block typically contains combinational logic and is similar, in size and transistor configuration, to a conventional CMOS combinational logic design. However, only a very small portion of the circuits of these embodiments, is sensitive to Single Event Upset and/or Single Event Transients.
Greek, Indian and Arabic logic
Gabbay, Dov M
2004-01-01
Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and Renaissance Logic and Logic: A History of its Central. In designing the Handbook of the History of Logic, the Editors have taken the view that the history of logic holds more than an antiquarian interest, and that a knowledge of logic's rich and sophisticated development is, in various respects, relevant to the research programmes of the present day. Ancient logic is no exception. The present volume attests to the distant origins of some of modern logic's most important features, such as can be found in the claim by the authors of t...
Mapping Individual Logical Processes
Smetana, Frederick O.
1975-01-01
A technique to measure and describe concisely a certain class of individual mental reasoning processes has been developed. The measurement is achieved by recording the complete dialog between a large, varied computerized information system with a broad range of logical operations and options and a human information seeker. (Author/RC)
Logicism, intuitionism, and formalism
Symons, John
2008-01-01
Aims to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. This work is suitable for researchers and graduate students of philosophy, logic, mathematics and theoretical computer science.
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Welty, Gordon A.
The logic of the evaluation of educational and other action programs is discussed from a methodological viewpoint. However, no attempt is made to develop methods of evaluating programs. In Part I, the structure of an educational program is viewed as a system with three components--inputs, transformation of inputs into outputs, and outputs. Part II…
Krötzsch, Markus; Horrocks, Ian
2012-01-01
This paper provides a self-contained first introduction to description logics (DLs). The main concepts and features are explained with examples before syntax and semantics of the DL SROIQ are defined in detail. Additional sections review light-weight DL languages, discuss the relationship to the Web Ontology Language OWL and give pointers to further reading.
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2014-01-01
We study the international standard XACML 3.0 for describing security access control policies in a compositional way. Our main contributions are (i) to derive a logic that precisely captures the intentions of the standard, (ii) to formally define a semantics for the XACML 3.0 component evaluation...
Nonmonotonic logics and algebras
Institute of Scientific and Technical Information of China (English)
CHAKRABORTY Mihir Kr; GHOSH Sujata
2008-01-01
Several nonmonotonie logic systems together with their algebraic semantics are discussed. NM-algebra is defined.An elegant construction of an NM-algebra starting from a Boolean algebra is described which gives rise to a few interesting algebraic issues.
DEFF Research Database (Denmark)
Jensen, Jonas Buhrkal; Birkedal, Lars
2012-01-01
, separation means physical separation. In this paper, we introduce \\emph{fictional separation logic}, which includes more general forms of fictional separating conjunctions P * Q, where "*" does not require physical separation, but may also be used in situations where the memory resources described by P and Q...
Logic Programming for Linguistics
DEFF Research Database (Denmark)
Christiansen, Henning
2010-01-01
This article gives a short introduction on how to get started with logic pro- gramming in Prolog that does not require any previous programming expe- rience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what...
LOGICAL SEMANTICS OF MODULARIZATION
DELAVALETTE, GRR
1992-01-01
An algebra of theories, signatures, renamings and the operations import and export is investigated. A normal form theorem for terms of this algebra is proved. Another algebraic approach and the relation with a fragment of second order logic are also considered.
Bergstra, J.A.; Ponse, A.
2010-01-01
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. A short-circuit logic is a variant of p
Quantum probabilistic logic programming
Balu, Radhakrishnan
2015-05-01
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
SynBioLGDB: a resource for experimentally validated logic gates in synthetic biology
Wang, Liqiang; Qian, Kun; Huang, Yan; Jin, Nana; Lai, Hongyan; Zhang, Ting; Li, Chunhua; Zhang, Chunrui; Bi, Xiaoman; Wu, Deng; Wang, Changliang; Wu, Hao; Tan, Puwen; Lu, Jianping; Chen, Liqun; Li, Kongning; Li, Xia; Wang, Dong
2015-01-01
Synthetic biologists have developed DNA/molecular modules that perform genetic logic operations in living cells to track key moments in a cell's life or change the fate of a cell. Increasing evidence has also revealed that diverse genetic logic gates capable of generating a Boolean function play critically important roles in synthetic biology. Basic genetic logic gates have been designed to combine biological science with digital logic. SynBioLGDB (http://bioinformatics.ac.cn/synbiolgdb/) aims to provide the synthetic biology community with a useful resource for efficient browsing and visualization of genetic logic gates. The current version of SynBioLGDB documents more than 189 genetic logic gates with experimental evidence involving 80 AND gates and 16 NOR gates, etc. in three species (Human, Escherichia coli and Bacillus clausii). SynBioLGDB provides a user-friendly interface through which conveniently to query and browse detailed information about these genetic logic gates. SynBioLGDB will enable more comprehensive understanding of the connection of genetic logic gates to execute complex cellular functions in living cells.
Design and verification of distributed logic controllers with application of Petri nets
Energy Technology Data Exchange (ETDEWEB)
Wiśniewski, Remigiusz; Grobelna, Iwona; Grobelny, Michał; Wiśniewska, Monika [University of Zielona Góra, Licealna 9, 65-417 Zielona Góra (Poland)
2015-12-31
The paper deals with the designing and verification of distributed logic controllers. The control system is initially modelled with Petri nets and formally verified against structural and behavioral properties with the application of the temporal logic and model checking technique. After that it is decomposed into separate sequential automata that are working concurrently. Each of them is re-verified and if the validation is successful, the system can be finally implemented.
Logical analysis of biological systems
DEFF Research Database (Denmark)
Mardare, Radu Iulian
2005-01-01
R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005.......R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005....
Preferential reasoning for modal logics
CSIR Research Space (South Africa)
Britz, K
2011-11-01
Full Text Available Modal logic is the foundation for a versatile and well-established class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with non-monotonic reasoning capabilities such as preferential reasoning as developed...
Grzegorczyk, Dawid; Mulawka, Jan J.; Nieznański, Edward
In this article there are presented a few methods of proving that can be adopted for epistemic logic. Those methods are used for proving sample thesis in a certain considered epistemic logic also described briefly in this work.
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Hybrid logic is an extension of modal logic which allows us to refer explicitly to points of the model in the syntax of formulas. It is easy to justify interest in hybrid logic on applied grounds, with the usefulness of the additional expressive power. For example, when reasoning about time one...... often wants to build up a series of assertions about what happens at a particular instant, and standard modal formalisms do not allow this. What is less obvious is that the route hybrid logic takes to overcome this problem often actually improves the behaviour of the underlying modal formalism....... For example, it becomes far simpler to formulate proof-systems for hybrid logic, and completeness results can be proved of a generality that is simply not available in modal logic. That is, hybridization is a systematic way of remedying a number of known deficiencies of modal logic. First-order hybrid logic...
Wansing, Heinrich; Willkommen, Caroline; Recent Trends in Philosophical Logic
2014-01-01
This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism, and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University ...
Finding Unity in Computational Logic
Miller, Dale
2010-01-01
International audience; While logic was once developed to serve philosophers and mathematicians, it is increasingly serving the varied needs of computer scientists. In fact, recent decades have witnessed the creation of the new discipline of Computational Logic. While Computation Logic can claim involvement in diverse areas of computing, little has been done to systematize the foundations of this new discipline. Here, we envision a unity for Computational Logic organized around the proof theo...
Nguyen, Hung T
2005-01-01
THE CONCEPT OF FUZZINESS Examples Mathematical modeling Some operations on fuzzy sets Fuzziness as uncertainty Exercises SOME ALGEBRA OF FUZZY SETS Boolean algebras and lattices Equivalence relations and partitions Composing mappings Isomorphisms and homomorphisms Alpha-cuts Images of alpha-level sets Exercises FUZZY QUANTITIES Fuzzy quantities Fuzzy numbers Fuzzy intervals Exercises LOGICAL ASPECTS OF FUZZY SETS Classical two-valued logic A three-valued logic Fuzzy logic Fuzzy and Lukasiewi
Modal Logics for Cryptographic Processes
DEFF Research Database (Denmark)
Frendrup, U.; Huttel, Hans; Jensen, N. J.
2002-01-01
We present three modal logics for the spi-calculus and show that they capture strong versions of the environment sensitive bisimulation introduced by Boreale et al. Our logics differ from conventional modal logics for process calculi in that they allow us to describe the knowledge of an attacker ...
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
This article shows how individual Petri nets form models of Girard's intuitionistic linear logic. It explores questions of expressiveness and completeness of linear logic with respect to this interpretation. An aim is to use Petri nets to give an understanding of linear logic and give some apprai...
Forced Sequence Sequential Decoding
DEFF Research Database (Denmark)
Jensen, Ole Riis
In this thesis we describe a new concatenated decoding scheme based on iterations between an inner sequentially decoded convolutional code of rate R=1/4 and memory M=23, and block interleaved outer Reed-Solomon codes with non-uniform profile. With this scheme decoding with good performance is pos...... of computational overflow. Analytical results for the probability that the first Reed-Solomon word is decoded after C computations are presented. This is supported by simulation results that are also extended to other parameters....
DEFF Research Database (Denmark)
Christensen, Kaare; McGue, Matt
2016-01-01
The sequenced genomes of individuals aged ≥80 years, who were highly educated, self-referred volunteers and with no self-reported chronic diseases were compared to young controls. In these data, healthy ageing is a distinct phenotype from exceptional longevity and genetic factors that protect...
Pascal, Robert; Pross, Addy
2016-04-01
In this paper we propose a logical connection between the physical and biological worlds, one resting on a broader understanding of the stability concept. We propose that stability manifests two facets - time and energy, and that stability's time facet, expressed as persistence, is more general than its energy facet. That insight leads to the logical formulation of the Persistence Principle, which describes the general direction of material change in the universe, and which can be stated most simply as: nature seeks persistent forms. Significantly, the principle is found to express itself in two mathematically distinct ways: in the replicative world through Malthusian exponential growth, and in the `regular' physical/chemical world through Boltzmann's probabilistic considerations. By encompassing both `regular' and replicative worlds, the principle appears to be able to help reconcile two of the major scientific theories of the 19th century - the Second Law of Thermodynamics and Darwin's theory of evolution - within a single conceptual framework.
Pascal, Robert; Pross, Addy
2016-11-01
In this paper we propose a logical connection between the physical and biological worlds, one resting on a broader understanding of the stability concept. We propose that stability manifests two facets - time and energy, and that stability's time facet, expressed as persistence, is more general than its energy facet. That insight leads to the logical formulation of the Persistence Principle, which describes the general direction of material change in the universe, and which can be stated most simply as: nature seeks persistent forms. Significantly, the principle is found to express itself in two mathematically distinct ways: in the replicative world through Malthusian exponential growth, and in the `regular' physical/chemical world through Boltzmann's probabilistic considerations. By encompassing both `regular' and replicative worlds, the principle appears to be able to help reconcile two of the major scientific theories of the 19th century - the Second Law of Thermodynamics and Darwin's theory of evolution - within a single conceptual framework.
DEFF Research Database (Denmark)
Friche, Nanna; Normann Andersen, Vibeke
combined with state funding through a taximeter scheme (pay per student). Secondly, party governance system involving labor market partners at both national and local level formalized through a national Council for Vocational Training and 50 local trade committees as well as local education committees......For the last fifteen years completion rates in Danish vocational education and training (VET) has stayed on a rather low level. In 2014, only half of the students enrolled in a vocational program on upper secondary level, graduated from the program (Flarup et al 2016). In Denmark, like in other...... and well-being of students enrolled in the VETs must be strengthened. We focus on target 1, 2 and 4. The reform is being implemented in a field of VET that can be characterized by four logics of governance. Firstly, a governance logic characterized by institutional independence of vocational colleges...
Franceschet, Massimo
2010-01-01
Networks are pervasive in the real world. Nature, society, economy, and technology are supported by ostensibly different networks that in fact share an amazing number of interesting structural properties. Network thinking exploded in the last decade, boosted by the availability of large databases on the topology of various real networks, mainly the Web and biological networks, and converged to the new discipline of network analysis - the holistic analysis of complex systems through the study of the network that wires their components. Physicists mainly drove the investigation, studying the structure and function of networks using methods and tools of statistical mechanics. Here, we give an alternative perspective on network analysis, proposing a logic for specifying general properties of networks and a modular algorithm for checking these properties. The logic borrows from two intertwined computing fields: XML databases and model checking.
Pascal, Robert; Pross, Addy
2016-11-01
In this paper we propose a logical connection between the physical and biological worlds, one resting on a broader understanding of the stability concept. We propose that stability manifests two facets - time and energy, and that stability's time facet, expressed as persistence, is more general than its energy facet. That insight leads to the logical formulation of the Persistence Principle, which describes the general direction of material change in the universe, and which can be stated most simply as: nature seeks persistent forms. Significantly, the principle is found to express itself in two mathematically distinct ways: in the replicative world through Malthusian exponential growth, and in the 'regular' physical/chemical world through Boltzmann's probabilistic considerations. By encompassing both 'regular' and replicative worlds, the principle appears to be able to help reconcile two of the major scientific theories of the 19th century - the Second Law of Thermodynamics and Darwin's theory of evolution - within a single conceptual framework.
Delay modeling in logic simulation
Energy Technology Data Exchange (ETDEWEB)
Acken, J. M.; Goldstein, L. H.
1980-01-01
As digital integrated circuit size and complexity increases, the need for accurate and efficient computer simulation increases. Logic simulators such as SALOGS (SAndia LOGic Simulator), which utilize transition states in addition to the normal stable states, provide more accurate analysis than is possible with traditional logic simulators. Furthermore, the computational complexity of this analysis is far lower than that of circuit simulation such as SPICE. An eight-value logic simulation environment allows the use of accurate delay models that incorporate both element response and transition times. Thus, timing simulation with an accuracy approaching that of circuit simulation can be accomplished with an efficiency comparable to that of logic simulation. 4 figures.
Strong Completeness for Markovian Logics
DEFF Research Database (Denmark)
Kozen, Dexter; Mardare, Radu Iulian; Panangaden, Prakash
2013-01-01
In this paper we present Hilbert-style axiomatizations for three logics for reasoning about continuous-space Markov processes (MPs): (i) a logic for MPs defined for probability distributions on measurable state spaces, (ii) a logic for MPs defined for sub-probability distributions and (iii) a logic...... defined for arbitrary distributions. These logics are not compact so one needs infinitary rules in order to obtain strong completeness results. We propose a new infinitary rule that replaces the so-called Countable Additivity Rule (CAR) currently used in the literature to address the problem of proving...
Bisimulations, games, and logic
DEFF Research Database (Denmark)
Nielsen, Mogens; Clausen, Christian
1994-01-01
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically a......-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extensions of corresponding characterizations of interleaving bisimulation....
Magnetoresistive logic and biochip
Energy Technology Data Exchange (ETDEWEB)
Brueckl, Hubert E-mail: brueckl@physik.uni-bielefeld.de; Brzeska, Monika; Brinkmann, Dirk; Schotter, J.Joerg; Reiss, Guenter; Schepper, Willi; Kamp, P.-B.; Becker, Anke
2004-11-01
While some magnetoresistive devices based on giant magnetoresistance or spin-dependent tunneling are already commercialized, a new branch of development is evolving towards magnetoresistive logic with magnetic tunnel junctions. Furthermore, the new magnetoelectronic effects show promising properties in magnetoresistive biochips, which are capable of detecting even single molecules (e.g. DNA) by functionalized magnetic markers. The unclear limits of this approach are discussed with two model systems.
Teslenko, Maxim
2008-01-01
This dissertation is in the area of Computer-Aided Design (CAD) of digital Integrated Circuits (ICs). Today's digital ICs, such as microprocessors, memories, digital signal processors (DSPs), etc., range from a few thousands to billions of logic gates, flip-flops, and other components, packed in a few millimeters of area. The creation of such highly complex systems would not be possible without the use of CAD tools. CAD tools play the key role in determining the area, speed and power consumpt...
Energy Technology Data Exchange (ETDEWEB)
Rudin, M.J. [Univ. of Nevada, Las Vegas NV (United States); O`Brien, M.C. [Univ. of Arizona, Tucson, AZ (United States)
1995-04-01
A planning and management tool was developed that relates environmental restoration and waste management problems to technologies that can be used to remediate these problems. Although the Technology Logic Diagram has been widely used within the US Department of Energy`s Office of Environmental Restoration and Waste Management, it can be modified for use during the planning of any waste management and environmental cleanup effort.
Probabilistic Logical Characterization
DEFF Research Database (Denmark)
Hermanns, Holger; Parma, Augusto; Segala, Roberto;
2011-01-01
Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance model...... modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata....
1986-12-01
determining the consequences of assumptions about the behavior of a system . If the space of behaviors is represented by an envisionment , many such...consequences can be represented by pruning states from the envisionment . This paper provides a formal logic of occurrence which justifies the...algorithms involved and provides a language for relating specific histories to envisionments . The concepts and axioms are general enough to be applicable to
Fuzzy Logic in Inverse Continuous Method
Directory of Open Access Journals (Sweden)
Víťazoslav Krúpa
2004-12-01
Full Text Available In the field of geotechnics, certain vagueness and ambiquity appears. We might not be able to design a mathematically accuratedescription of rock, whose properties change during the excavation (rock strength, discontinuities direction, dislocations, rock type.Furthermore, the excavation regime (thrust, revolutions, torque changes too, as well as the edge angle of cutting tools (due to wear andworking ability of cutterhead as result of sequential exchanges of worn-out cutterhead discs. All of these facts cause that the cutterheadoperates using the discs with different wear stage. The above mentioned problems led us to the decision to use the fuzzy logic and fuzzy sets,e.g. techniques operating with vagueness and ambiguity.
Modeling of Non-Coherent Sequential Acquisition Process for DS/SS Signals
Institute of Scientific and Technical Information of China (English)
李艳; 马雨出; 张中兆
2003-01-01
A modified non-coherent sequential detection decision logic based on continuous accumulation to achieve fast PN code acquisition is proposed. To simplify the design and analysis, the equivalent relationship between the likelihood ratio of the current sample and that of all the previous samples is deduced. The scheme is proved to be an optimum sequential detection under certain assumptions. Because the average sample number (ASN) can not be calculated through the methods applied to the conventional sequential detection, an algorithm is also provided, which can estimate both the probability density function (pdf) and the upper threshole of ASN. The desired probabilities of false alarm and detection,as well as faster PN code acquisition compared to the conventional sequential detection can be achieved by employing this structure . In addition, Rayeigh-faded reception case is also taken into consideration. Performances of the proposed schemes are obtained, which suggest that the proposed non-coherent sequential detection is more desirable.
Complexity of validity for propositional dependence logics
Jonni Virtema
2014-01-01
We study the validity problem for propositional dependence logic, modal dependence logic and extended modal dependence logic. We show that the validity problem for propositional dependence logic is NEXPTIME-complete. In addition, we establish that the corresponding problem for modal dependence logic and extended modal dependence logic is NEXPTIME-hard and in NEXPTIME^NP.
Dynamic Logics of Dynamical Systems
Platzer, André
2012-01-01
We survey dynamic logics for specifying and verifying properties of dynamical systems, including hybrid systems, distributed hybrid systems, and stochastic hybrid systems. A dynamic logic is a first-order modal logic with a pair of parametrized modal operators for each dynamical system to express necessary or possible properties of their transition behavior. Due to their full basis of first-order modal logic operators, dynamic logics can express a rich variety of system properties, including safety, controllability, reactivity, liveness, and quantified parametrized properties, even about relations between multiple dynamical systems. In this survey, we focus on some of the representatives of the family of differential dynamic logics, which share the ability to express properties of dynamical systems having continuous dynamics described by various forms of differential equations. We explain the dynamical system models, dynamic logics of dynamical systems, their semantics, their axiomatizations, and proof calcul...
Evolutionary causes and consequences of sequential polyandry in anuran amphibians.
Byrne, Phillip G; Roberts, J Dale
2012-02-01
Among anuran amphibians (frogs and toads), there are two types of polyandry: simultaneous polyandry, where sperm from multiple males compete to fertilize eggs, and sequential polyandry, where eggs from a single female are fertilized by multiple males in a series of temporally separate mating events, and sperm competition is absent. Here we review the occurrence of sequential polyandry in anuran amphibians, outline theoretical explanations for the evolution of this mating system and discuss potential evolutionary implications. Sequential polyandry has been reported in a limited number of anurans, but its widespread taxonomic and geographic distribution suggests it may be common. There have been no empirical studies that have explicitly investigated the evolutionary consequences of sequential polyandry in anurans, but species with this mating pattern share an array of behavioural, morphological and physiological characteristics, suggesting that there has been common sexual selection on their reproductive system. Sequential polyandry may have a number of adaptive benefits, including spreading the risk of brood failure in unpredictable environments, insuring against male infertility, or providing genetic benefits, either through good genes, intrinsic compatibility or genetic diversity effects. Anurans with sequential polyandry provide untapped opportunities for innovative research approaches that will contribute significantly to understanding anuran evolution and also, more broadly, to the development of sexual-selection and life-history theory. © 2011 The Authors. Biological Reviews © 2011 Cambridge Philosophical Society.
Active Sequential Hypothesis Testing
Naghshvar, Mohammad
2012-01-01
Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information in a speedy manner about an underlying phenomena of interest while accounting for the penalty of wrong declaration. The special cases of the problem are shown to be that of variable-length coding with feedback and noisy dynamic search. Due to the sequential nature of the problem, the decision maker relies on his current information state to adaptively select the most "informative" sensing action among the available ones. In this paper, using results in dynamic programming, a lower bound for the optimal total cost is established. Moreover, upper bounds are obtained via an analysis of heuristic policies for dynamic selection of actions. It is shown that the proposed heuristics achieve asymptotic optimality in many practically relevant problems including the problems of variable-length coding with feedback and noisy dynamic search; where asymptotic optimality implies that the relative difference betw...
Disjunctive logic and semantics of disjunctive logic programs
Institute of Scientific and Technical Information of China (English)
沈一栋
1997-01-01
In common sense reasoning with incomplete knowledge bases, conclusions are made by defaultHowever, it is observed that when the negation-by-default operator not is defined as not provable , the disjunctive logic program { a V b, not a, not b} should be consistent because a being not provable and b being nor provable does not imply a V b being riot provable. Such an observation is significant for non-monotonic reasoning, but none of the major current semantics for disjunctive logic programs is able to support it because they are all based on classical first-order logic in which assuming not a and not b implies assuming no: (a V b) A new first-order logic (disjunctive logic ) is developed that fully complies with this observation and new semantics for disjunctive logic programs are established This theory is able to formalize and solve some paradoxical problems, such as the lottery paradox
Instantaneous noise-based logic
Kish, Laszlo B; Peper, Ferdinand
2010-01-01
We show two universal, Boolean, deterministic logic schemes based on binary noise timefunctions that can be realized without time averaging units. The first scheme is based on a new bipolar random telegraph wave scheme and the second one makes use of the recent noise-based logic which is conjectured to be the brain's method of logic operations [Physics Letters A 373 (2009) 2338-2342, arXiv:0902.2033]. For binary-valued logic operations, the two simple Boolean schemes presented in this paper use zero (no noise) for the logic Low (L) state. In the random telegraph wave-based scheme, for multi-valued logic operations, additive superpositions of logic states must be avoided, while multiplicative superpositions utilizing hyperspace base vectors can still be utilized. These modifications, while keeping the information richness of multi-valued (noise-based) logic, result in a significant speedup of logic operations for the same signal bandwidth. The logic hyperspace of the first scheme results random telegraph waves...
Classical Mathematical Logic The Semantic Foundations of Logic
Epstein, Richard L
2011-01-01
In Classical Mathematical Logic, Richard L. Epstein relates the systems of mathematical logic to their original motivations to formalize reasoning in mathematics. The book also shows how mathematical logic can be used to formalize particular systems of mathematics. It sets out the formalization not only of arithmetic, but also of group theory, field theory, and linear orderings. These lead to the formalization of the real numbers and Euclidean plane geometry. The scope and limitations of modern logic are made clear in these formalizations. The book provides detailed explanations of all proo
T Atanassov, Krassimir
2017-01-01
The book offers a comprehensive survey of intuitionistic fuzzy logics. By reporting on both the author’s research and others’ findings, it provides readers with a complete overview of the field and highlights key issues and open problems, thus suggesting new research directions. Starting with an introduction to the basic elements of intuitionistic fuzzy propositional calculus, it then provides a guide to the use of intuitionistic fuzzy operators and quantifiers, and lastly presents state-of-the-art applications of intuitionistic fuzzy sets. The book is a valuable reference resource for graduate students and researchers alike.
Flexible programmable logic module
Energy Technology Data Exchange (ETDEWEB)
Robertson, Perry J. (Albuquerque, NM); Hutchinson, Robert L. (Albuquerque, NM); Pierson, Lyndon G. (Albuquerque, NM)
2001-01-01
The circuit module of this invention is a VME board containing a plurality of programmable logic devices (PLDs), a controlled impedance clock tree, and interconnecting buses. The PLDs are arranged to permit systolic processing of a problem by offering wide data buses and a plurality of processing nodes. The board contains a clock reference and clock distribution tree that can drive each of the PLDs with two critically timed clock references. External clock references can be used to drive additional circuit modules all operating from the same synchronous clock reference.
Krötzsch, M
2010-01-01
Ontological modelling today is applied in many areas of science and technology,including the Semantic Web. The W3C standard OWL defines one of the most important ontology languages based on the semantics of description logics. An alternative is to use rule languages in knowledge modelling, as proposed in the W3C's RIF standard. So far, it has often been unclear how to combine both technologies without sacrificing essential computational properties. This book explains this problem and presents new solutions that have recently been proposed. Extensive introductory chapters provide the necessary
Computability, complexity, logic
Börger, Egon
1989-01-01
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes an
Substructural Logical Specifications
2012-11-14
a more natural correspondence with our physical intuitions about consumable resources. Linear conjunction A ⊗ B (“A tensor B”) represents the...sketch a radically different, vaguely Feynman - diagram-inspired, way of presenting traces in Figure 4.14. Resources are the edges in the DAG and steps or...70th Birthday, volume 17 of Studies in Logic. College Publications, 2008. 3.3.3, 4.1.2, 4.7.3 [Pfe12a] Frank Pfenning. Lecture notes on backtracking
Bright, Liam Kofi
2017-07-10
The logical empiricists expressed a consistent attitude to racial categorisation in both the ethical and scientific spheres. Their attitude may be captured in the following slogan: human racial taxonomy is an empirically meaningful mode of classifying persons that we should refrain from deploying. I offer an interpretation of their position that would render coherent their remarks on race with positions they adopted on the scientific status of taxonomy in general, together with their potential moral or political motivations for adopting that position. Copyright © 2017. Published by Elsevier Ltd.
Multi-Attribute Sequential Search
Bearden, J. Neil; Connolly, Terry
2007-01-01
This article describes empirical and theoretical results from two multi-attribute sequential search tasks. In both tasks, the DM sequentially encounters options described by two attributes and must pay to learn the values of the attributes. In the "continuous" version of the task the DM learns the precise numerical value of an attribute when she…
PM 3655 PHILIPS Logic analyzer
A logic analyzer is an electronic instrument that captures and displays multiple signals from a digital system or digital circuit. A logic analyzer may convert the captured data into timing diagrams, protocol decodes, state machine traces, assembly language, or may correlate assembly with source-level software. Logic Analyzers have advanced triggering capabilities, and are useful when a user needs to see the timing relationships between many signals in a digital system.
Generalized logic in experience thinking
Institute of Scientific and Technical Information of China (English)
何华灿; 刘永怀; 何大庆; 成华
1996-01-01
The thinking and mathematical background of raising GL is explained first,then the main definitions and basic features of GL are presented,and finally the relationship between GL and other logic and the GL family are discussed.Although the research of GL just began,it may become the logic of all other logic.GL will be one of the basic theories in AI research,and has promising application.
Design of the Sequential System Automata using Temporal Equivalence Classes
Directory of Open Access Journals (Sweden)
A. Ursu
1997-10-01
Full Text Available A design method of sequential system automata using temporal logic specifications is proposed in this paper. The method is based on well-known Z.Manna and P.Wolper temporal logic satisfiability analysis procedure [1] and is extended to include past time temporal operators. A new specification method which uses temporal equivalence classes is proposed to specify the behaviour of large digital circuits. The impact of the composition and decomposition operations of the temporal equivalence classes on the final automata has been studied. A case study is carried out which deals with the design of the synchronous bus arbiter circuit element. The SMV tool has been used to verify the temporal properties of the obtained automata.
A sequential tree approach for incremental sequential pattern mining
Indian Academy of Sciences (India)
RAJESH KUMAR BOGHEY; SHAILENDRA SINGH
2016-12-01
‘‘Sequential pattern mining’’ is a prominent and significant method to explore the knowledge and innovation from the large database. Common sequential pattern mining algorithms handle static databases.Pragmatically, looking into the functional and actual execution, the database grows exponentially thereby leading to the necessity and requirement of such innovation, research, and development culminating into the designing of mining algorithm. Once the database is updated, the previous mining result will be incorrect, and we need to restart and trigger the entire mining process for the new updated sequential database. To overcome and avoid the process of rescanning of the entire database, this unique system of incremental mining of sequential pattern is available. The previous approaches, system, and techniques are a priori-based frameworks but mine patterns is an advanced and sophisticated technique giving the desired solution. We propose and incorporate an algorithm called STISPM for incremental mining of sequential patterns using the sequence treespace structure. STISPM uses the depth-first approach along with backward tracking and the dynamic lookahead pruning strategy that removes infrequent and irregular patterns. The process and approach from the root node to any leaf node depict a sequential pattern in the database. The structural characteristic of the sequence tree makes it convenient and appropriate for incremental sequential pattern mining. The sequence tree also stores all the sequential patterns with its count and statistics, so whenever the support system is withdrawn or changed, our algorithm using frequent sequence tree as the storage structure can find and detect all the sequential patternswithout mining the database once again.
Admissibility of logical inference rules
Rybakov, VV
1997-01-01
The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and
Optimization methods for logical inference
Chandru, Vijay
2011-01-01
Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in
Barriers in Concurrent Separation Logic
Hobor, Aquinas; Gherghina, Cristian
We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two. Unlike locks and critical sections, Pthreads barriers enable simultaneous resource redistribution between multiple threads and are inherently stateful, leading to significant complications in the design of the logic and its soundness proof. We show how our logic can be applied to a specific example program in a modular way. Our proofs are machine-checked in Coq.
Popular lectures on mathematical logic
Wang, Hao
2014-01-01
A noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. Author Hao Wang surveys the central concepts and theories of the discipline in a historical and developmental context, and then focuses on the four principal domains of contemporary mathematical logic: set theory, model theory, recursion theory and constructivism, and proof theory.Topics include the place of problems in the development of theories of logic and logic's relation to computer science. Specific attention is given to Gödel's incomplete
Sequential Design of Experiments
Energy Technology Data Exchange (ETDEWEB)
Anderson-Cook, Christine Michaela [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-06-30
A sequential design of experiments strategy is being developed and implemented that allows for adaptive learning based on incoming results as the experiment is being run. The plan is to incorporate these strategies for the NCCC and TCM experimental campaigns to be run in the coming months. This strategy for experimentation has the advantages of allowing new data collected during the experiment to inform future experimental runs based on their projected utility for a particular goal. For example, the current effort for the MEA capture system at NCCC plans to focus on maximally improving the quality of prediction of CO_{2} capture efficiency as measured by the width of the confidence interval for the underlying response surface that is modeled as a function of 1) Flue Gas Flowrate [1000-3000] kg/hr; 2) CO_{2} weight fraction [0.125-0.175]; 3) Lean solvent loading [0.1-0.3], and; 4) Lean solvent flowrate [3000-12000] kg/hr.
Automatic test pattern generation for logic circuits using the Boolean tree
Energy Technology Data Exchange (ETDEWEB)
Jeong Taegwon.
1991-01-01
The goal of this study was to develop an algorithm that can generate test patterns for combinational circuits and sequential logic circuits automatically. The new proposed algorithm generates a test pattern by using a special tree called a modified Boolean tree. In this algorithm, the construction of a modified Boolean tree is the most time-consuming step. Following the construction of a modified Boolean tree, a test pattern can be found by simply assigning a logic value 1 for even primary inputs and a logic value 0 for odd primary inputs of the constructed modified Boolean tree. The algorithm is applied to several benchmark circuits. The results showed the following: (1) for combinational circuits, the algorithm can generate test patterns 10-15% faster than the FAN algorithm, which is known as one of the most efficient algorithms to-date; (2) for sequential circuits, the algorithm shows more fault coverage than the nine valued algorithm.
Meta-Logical Reasoning in Higher-Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen; Schlichtkrull, Anders; Hess, Andreas Viktor
The semantics of first-order logic (FOL) can be described in the meta-language of higher-order logic (HOL). Using HOL one can prove key properties of FOL such as soundness and completeness. Furthermore, one can prove sentences in FOL valid using the formalized FOL semantics. To aid in the constru...
Sequential biases in accumulating evidence
Huggins, Richard; Dogo, Samson Henry
2015-01-01
Whilst it is common in clinical trials to use the results of tests at one phase to decide whether to continue to the next phase and to subsequently design the next phase, we show that this can lead to biased results in evidence synthesis. Two new kinds of bias associated with accumulating evidence, termed ‘sequential decision bias’ and ‘sequential design bias’, are identified. Both kinds of bias are the result of making decisions on the usefulness of a new study, or its design, based on the previous studies. Sequential decision bias is determined by the correlation between the value of the current estimated effect and the probability of conducting an additional study. Sequential design bias arises from using the estimated value instead of the clinically relevant value of an effect in sample size calculations. We considered both the fixed‐effect and the random‐effects models of meta‐analysis and demonstrated analytically and by simulations that in both settings the problems due to sequential biases are apparent. According to our simulations, the sequential biases increase with increased heterogeneity. Minimisation of sequential biases arises as a new and important research area necessary for successful evidence‐based approaches to the development of science. © 2015 The Authors. Research Synthesis Methods Published by John Wiley & Sons Ltd. PMID:26626562
Towards an arithmetical logic the arithmetical foundations of logic
Gauthier, Yvon
2015-01-01
This book offers an original contribution to the foundations of logic and mathematics, and focuses on the internal logic of mathematical theories, from arithmetic or number theory to algebraic geometry. Arithmetical logic is the term used to refer to the internal logic of classical arithmetic, here called Fermat-Kronecker arithmetic, and combines Fermat’s method of infinite descent with Kronecker’s general arithmetic of homogeneous polynomials. The book also includes a treatment of theories in physics and mathematical physics to underscore the role of arithmetic from a constructivist viewpoint. The scope of the work intertwines historical, mathematical, logical and philosophical dimensions in a unified critical perspective; as such, it will appeal to a broad readership from mathematicians to logicians, to philosophers interested in foundational questions. Researchers and graduate students in the fields of philosophy and mathematics will benefit from the author’s critical approach to the foundations of l...
2005-01-01
A new all-electronic Particle Image Velocimetry technique that can efficiently map high speed gas flows has been developed in-house at the NASA Lewis Research Center. Particle Image Velocimetry is an optical technique for measuring the instantaneous two component velocity field across a planar region of a seeded flow field. A pulsed laser light sheet is used to illuminate the seed particles entrained in the flow field at two instances in time. One or more charged coupled device (CCD) cameras can be used to record the instantaneous positions of particles. Using the time between light sheet pulses and determining either the individual particle displacements or the average displacement of particles over a small subregion of the recorded image enables the calculation of the fluid velocity. Fuzzy logic minimizes the required operator intervention in identifying particles and computing velocity. Using two cameras that have the same view of the illumination plane yields two single exposure image frames. Two competing techniques that yield unambiguous velocity vector direction information have been widely used for reducing the single-exposure, multiple image frame data: (1) cross-correlation and (2) particle tracking. Correlation techniques yield averaged velocity estimates over subregions of the flow, whereas particle tracking techniques give individual particle velocity estimates. For the correlation technique, the correlation peak corresponding to the average displacement of particles across the subregion must be identified. Noise on the images and particle dropout result in misidentification of the true correlation peak. The subsequent velocity vector maps contain spurious vectors where the displacement peaks have been improperly identified. Typically these spurious vectors are replaced by a weighted average of the neighboring vectors, thereby decreasing the independence of the measurements. In this work, fuzzy logic techniques are used to determine the true
Questions and dependency in intuitionistic logic
Ciardelli, Ivano; Iemhoff, Rosalie; Yang, Fan
2017-01-01
In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and
A beginner's guide to mathematical logic
Smullyan, Raymond M
2014-01-01
Combining stories of great philosophers, quotations, and riddles with the fundamentals of mathematical logic, this new textbook for first courses in mathematical logic was written by the subject's creative master. Raymond Smullyan offers clear, incremental presentations of difficult logic concepts with creative explanations and unique problems related to proofs, propositional logic and first-order logic, undecidability, recursion theory, and other topics.
Logical entropy of quantum dynamical systems
Directory of Open Access Journals (Sweden)
Ebrahimzadeh Abolfazl
2016-01-01
Full Text Available This paper introduces the concepts of logical entropy and conditional logical entropy of hnite partitions on a quantum logic. Some of their ergodic properties are presented. Also logical entropy of a quantum dynamical system is dehned and ergodic properties of dynamical systems on a quantum logic are investigated. Finally, the version of Kolmogorov-Sinai theorem is proved.
Sequential Testing: Basics and Benefits
1978-03-01
103-109 44. A. Wald , Sequential Analysis, John Wiley and Sons, 1947 45. A Wald and J. Wolfowitz , "Optimum Character of The Sequential Probability Ratio...work done by A. Wald [44].. Wald’s work on sequential analysis can be used virtually’without modification in a situation where decisions are made... Wald can be used. The decision to accept, reject, or continue the test depends on: 8 < (8 0/el)r exp [-(1/01 - 1/0 0 )V(t)] < A (1) where 0 and A are
Whitfield, J D; Biamonte, J D
2012-01-01
Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedded and annealed in experimentally controllable spin Hamiltonians. Using an approach based on group theory and symmetries, we examine the embedding of Boolean logic gates into the ground state subspace of such spin systems. We describe parameterized families of diagonal Hamiltonians and symmetry operations which preserve the ground state subspace encoding the truth tables of Boolean formulas. The ground state embeddings of adder circuits are used to illustrate how gates are combined and simplified using symmetry. Our work is relevant for experimental demonstrations of ground state embeddings found in both classical optimization as well as adiabatic quantum optimization.
Cleaveland, Rance; Luettgen, Gerald; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, LPC extends Milner's Calculus of Communicating Systems with operators from the alternation-free linear-time mu-calculus (LT(mu)). Semantically, LPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must-testing preorder as well as LT(mu's) satisfaction relation, while being compositional for all LPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of: (1) both minimal and maximal fixed-point operators and (2) an unimple-mentability predicate on process terms, which tags inconsistent specifications. The utility of LPC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification.
Balzani, Vincenzo; Credi, Alberto; Venturi, Margherita
2003-01-13
Miniaturization has been an essential ingredient in the outstanding progress of information technology over the past fifty years. The next, perhaps ultimate, limit of miniaturization is that of molecules, which are the smallest entities with definite size, shape, and properties. Recently, great effort has been devoted to design and investigate molecular-level systems that are capable of transferring, processing, and storing information in binary form. Some of these nanoscale devices can, in fact, perform logic operations of remarkable complexity. This research--although far from being transferred into technology--is attracting interest, as the nanometer realm seems to be out of reach for the "top-down" techniques currently available to microelectronics industry. Moreover, such studies introduce new concepts in the "old" field of chemistry and stimulate the ingenuity of researchers engaged in the "bottom-up" approach to nanotechnology.
Borresen, Jon; Lynch, Stephen
2012-01-01
In the 1940s, the first generation of modern computers used vacuum tube oscillators as their principle components, however, with the development of the transistor, such oscillator based computers quickly became obsolete. As the demand for faster and lower power computers continues, transistors are themselves approaching their theoretical limit and emerging technologies must eventually supersede them. With the development of optical oscillators and Josephson junction technology, we are again presented with the possibility of using oscillators as the basic components of computers, and it is possible that the next generation of computers will be composed almost entirely of oscillatory devices. Here, we demonstrate how coupled threshold oscillators may be used to perform binary logic in a manner entirely consistent with modern computer architectures. We describe a variety of computational circuitry and demonstrate working oscillator models of both computation and memory.
DEFF Research Database (Denmark)
Jensen, Lars Bang
The problematic this thesis investigates, through a specific kind of structuralism derived from a reading of Michel Foucault, Pierre Bourdieu and Gilles Deleuze, concerns how the subject becomes a science subject and potentially a scientist, with interest and literacy in science. The Logic...... of Science – a vivisection of monsters is thus an exploration of Being and Becoming in relation to Science and its Education. The investigation has been derived from, in, and connected to the Youth-to-Youth Project, a regional bridge building project in Northern Jutland in Denmark. The Youth-to-Youth Project...... (2011-2015) attempts to facilitate contact and provide a different kind of counselling and guidance between youths and youths who are ‘one step ahead’ in their educational trajectory. The meetings between the youths are both social and science subject oriented, and the intention is to establish...
Logical Modelling of Physarum Polycephalum
Schumann, Andrew
2011-01-01
We propose a novel model of unconventional computing where a structural part of computation is presented by dynamics of plasmodium of Physarum polycephalum, a large single cell. We sketch a new logical approach combining conventional logic with process calculus to demonstrate how to employ formal methods in design of unconventional computing media presented by Physarum polycephalum.
Flat coalgebraic fixed point logics
Schröder, Lutz
2010-01-01
Fixed point logics have a wide range of applications in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the mu-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the mu-calculus. The family of such flat fixed point logics includes, e.g., CTL, the *-nesting-free fragment of PDL, and the logic of common knowledge. Here, we extend this notion to the generic semantic framework of coalgebraic logic, thus covering a wide range of logics beyond the standard mu-calculus including, e.g., flat fragments of the graded mu-calculus and the alternating-time mu-calculus (such as ATL), as well as probabilistic and monotone fixed point logics. Our main results are completeness of the Kozen-Park axiomatization and a timed-out tableaux method that matches EXPTIME upper bounds inherited from the coalgebraic mu-calculus but avo...
A Paraconsistent Higher Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen
2004-01-01
of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens. Many non-classical logics are, at the propositional level, funny toys which work quite good, but when one wants...
Sasao, Tsutomu
2011-01-01
This book describes the synthesis of logic functions using memories. It is useful to design field programmable gate arrays (FPGAs) that contain both small-scale memories, called look-up tables (LUTs), and medium-scale memories, called embedded memories. This is a valuable reference for both FPGA system designers and CAD tool developers, concerned with logic synthesis for FPGAs.
A Paraconsistent Higher Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen
2004-01-01
of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens. Many non-classical logics are, at the propositional level, funny toys which work quite good, but when one wants...
Simulated Laboratory in Digital Logic.
Cleaver, Thomas G.
Design of computer circuits used to be a pencil and paper task followed by laboratory tests, but logic circuit design can now be done in half the time as the engineer accesses a program which simulates the behavior of real digital circuits, and does all the wiring and testing on his computer screen. A simulated laboratory in digital logic has been…
Logical Modelling of Physarum Polycephalum
Schumann, Andrew; Adamatzky, Andrew
2011-01-01
We propose a novel model of unconventional computing where a structural part of computation is presented by dynamics of plasmodium of Physarum polycephalum, a large single cell. We sketch a new logical approach combining conventional logic with process calculus to demonstrate how to employ formal methods in design of unconventional computing media presented by Physarum polycephalum.
Institute of Scientific and Technical Information of China (English)
修勤
1995-01-01
In the red corner, Aristotle. In the blue corner, Buddha.It’s the fight of the century, and it’s a grudge match. "Fuzzy theory is wrong, wrong, and pernicious. What we need is more logical thinking, not less," fulminates Professor William Kahan of Berkeley. "Fuzzy logic is the cocaine of science. "
Propositional inquisitive logic: a survey
Directory of Open Access Journals (Sweden)
Ivano Ciardelli
2016-12-01
Full Text Available This paper provides a concise survey of a body of recent work on propositional inquisitive logic. We review the conceptual foundations of inquisitive semantics, introduce the propositional system, discuss its relations with classical, intuitionistic, and dependence logic, and describe an important feature of inquisitive proofs.
Logical Querying of Relational Databases
Directory of Open Access Journals (Sweden)
Luminita Pistol
2016-12-01
Full Text Available This paper aims to demonstrate the usefulness of formal logic and lambda calculus in database programming. After a short introduction in propositional and first order logic, we implement dynamically a small database and translate some SQL queries in filtered java 8 streams, enhanced with Tuples facilities from jOOλ library.
Marketing Logics, Ambidexterity and Influence
DEFF Research Database (Denmark)
Tollin, Karin; Schmidt, Marcus
2012-01-01
The duties of companies' chief marketing officers (CMOs) seem incompatible. They are expected to ensure that their company's market assets are properly exploited and recorded, while simultaneously enacting a proactive role in the company's business development. This study shows that about one...... in four CMOs have taken on this challenge, or adopted a marketing logic which could be referred to as ambidextrous. Furthermore, the study shows that this logic exerts a stronger impact on marketing's influence, compared to logics related to assuring brand consistency and measuring the performance...... of marketing processes. Three other ways to enact marketing management were also revealed, namely: an innovation; a communication; and a supporting marketing logic. This leads us to conclude that the influence of companies' marketing functions show up a heterogeneous picture within which the marketing logics...
Logical independence and quantum randomness
Energy Technology Data Exchange (ETDEWEB)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C [Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna (Austria); Prevedel, R; Klimek, P [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)], E-mail: tomasz.paterek@univie.ac.at
2010-01-15
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Institute of Scientific and Technical Information of China (English)
无
1995-01-01
This paper presents a neural network approach,based on high-order twodimension temporal and dynamically clustering competitive activation mechanisms,to implement parallel searching algorithm and many other symbolic logic algorithms.This approach is superior in many respects to both the common sequential algorithms of symbolic logic and the common neural network used for optimization problems.Simulations of problem solving examples prove the effectiveness of the approach.
Realization of morphing logic gates in a repressilator with quorum sensing feedback
Agrawal, Vidit; Kang, Shivpal Singh; Sinha, Sudeshna
2014-03-01
We demonstrate how a genetic ring oscillator network with quorum sensing feedback can operate as a robust logic gate. Specifically we show how a range of logic functions, namely AND/NAND, OR/NOR and XOR/XNOR, can be realized by the system, thus yielding a versatile unit that can morph between different logic operations. We further demonstrate the capacity of this system to yield complementary logic operations in parallel. Our results then indicate the computing potential of this biological system, and may lead to bio-inspired computing devices.
A biomolecular implementation of logically reversible computation with minimal energy dissipation.
Klein, J P; Leete, T H; Rubin, H
1999-10-01
Energy dissipation associated with logic operations imposes a fundamental physical limit on computation and is generated by the entropic cost of information erasure, which is a consequence of irreversible logic elements. We show how to encode information in DNA and use DNA amplification to implement a logically reversible gate that comprises a complete set of operators capable of universal computation. We also propose a method using this design to connect, or 'wire', these gates together in a biochemical fashion to create a logic network, allowing complex parallel computations to be executed. The architecture of the system permits highly parallel operations and has properties that resemble well known genetic regulatory systems.
Realization of Morphing Logic Gates in a Repressilator with Quorum Sensing Feedback
Agrawal, Vidit; Sinha, Sudeshna
2013-01-01
We demonstrate how a genetic ring oscillator network with quorum sensing feedback can operate as a robust logic gate. Specifically we show how a range of logic functions, namely AND/NAND, OR/NOR and XOR/XNOR, can be realized by the system, thus yielding a versatile unit that can morph between different logic operations. We further demonstrate the capacity of this system to yield complementary logic operations in parallel. Our results then indicate the computing potential of this biological system, and may lead to bio-inspired computing devices.
Cooperative Distributed Sequential Spectrum Sensing
S, Jithin K; Gopalarathnam, Raghav
2010-01-01
We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.
Complementary sequential measurements generate entanglement
Coles, Patrick J.; Piani, Marco
2013-01-01
We present a new paradigm for capturing the complementarity of two observables. It is based on the entanglement created by the interaction between the system observed and the two measurement devices used to measure the observables sequentially. Our main result is a lower bound on this entanglement and resembles well-known entropic uncertainty relations. Besides its fundamental interest, this result directly bounds the effectiveness of sequential bipartite operations---corresponding to the mea...
Sequentially pulsed traveling wave accelerator
Caporaso, George J.; Nelson, Scott D.; Poole, Brian R.
2009-08-18
A sequentially pulsed traveling wave compact accelerator having two or more pulse forming lines each with a switch for producing a short acceleration pulse along a short length of a beam tube, and a trigger mechanism for sequentially triggering the switches so that a traveling axial electric field is produced along the beam tube in synchronism with an axially traversing pulsed beam of charged particles to serially impart energy to the particle beam.
Reversible logic gate using adiabatic superconducting devices
National Research Council Canada - National Science Library
Takeuchi, N; Yamanashi, Y; Yoshikawa, N
2014-01-01
.... However, until now, no practical reversible logic gates have been demonstrated. One of the problems is that reversible logic gates must be built by using extremely energy-efficient logic devices...
View Dependent Sequential Point Trees
Institute of Scientific and Technical Information of China (English)
Wen-Cheng Wang; Feng Wei; En-Hua Wu
2006-01-01
Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.
The Logic of Practice in the Practice of Logics
DEFF Research Database (Denmark)
Raviola, Elena; Dubini, Paola
2016-01-01
of logics through a six months full-time ethnographic study at Il Sole-24 Ore, the largest Italian financial newspaper, between 2007 and 2008. An original conceptual framework is developed to analyse how the logic of journalism is enacted vis-à-vis that of advertising in a setting in which an old technology...... for news production – print newspaper – coexists with a new one – website – and thus encounters between new and old technological possibilities make workings of institutional logics particularly visible. The findings point out different mechanisms of institutional work dealing with actions that, made...
Biological Signal Processing with a Genetic Toggle Switch
Hillenbrand, Patrick; Fritz, Georg; Gerland, Ulrich
2013-01-01
Complex gene regulation requires responses that depend not only on the current levels of input signals but also on signals received in the past. In digital electronics, logic circuits with this property are referred to as sequential logic, in contrast to the simpler combinatorial logic without such internal memory. In molecular biology, memory is implemented in various forms such as biochemical modification of proteins or multistable gene circuits, but the design of the regulatory interface, which processes the input signals and the memory content, is often not well understood. Here, we explore design constraints for such regulatory interfaces using coarse-grained nonlinear models and stochastic simulations of detailed biochemical reaction networks. We test different designs for biological analogs of the most versatile memory element in digital electronics, the JK-latch. Our analysis shows that simple protein-protein interactions and protein-DNA binding are sufficient, in principle, to implement genetic circuits with the capabilities of a JK-latch. However, it also exposes fundamental limitations to its reliability, due to the fact that biological signal processing is asynchronous, in contrast to most digital electronics systems that feature a central clock to orchestrate the timing of all operations. We describe a seemingly natural way to improve the reliability by invoking the master-slave concept from digital electronics design. This concept could be useful to interpret the design of natural regulatory circuits, and for the design of synthetic biological systems. PMID:23874595
Probabilistic Logic Programming under Answer Sets Semantics
Institute of Scientific and Technical Information of China (English)
王洁; 鞠实儿
2003-01-01
Although traditional logic programming languages provide powerful tools for knowledge representation, they cannot deal with uncertainty information (e. g. probabilistic information). In this paper, we propose a probabilistic logic programming language by introduce probability into a general logic programming language. The work combines 4-valued logic with probability. Conditional probability can be easily represented in a probabilistic logic program. The semantics of such a probabilistic logic program i...
Reconfigurable Optical Directed-Logic Circuits
2015-11-20
and their switching delays do not accumulate. This is in contrast to conventional logic circuits where gate delays are cascaded, resulting in a...transistor logic circuits wherein gate delays are cascaded resulting in increased latencies with increased logic elements. Thus directed- logic ... reverse biased at -5 V ( logic ‘1’) and the transmission is high when the bias voltage is zero ( logic ‘0’). So the switch works in the block/pass mode
Modeling and Implementation of Reliable Ternary Arithmetic and Logic Unit Design Using Vhdl
Directory of Open Access Journals (Sweden)
Meruva Kumar Raja
2014-06-01
Full Text Available Multivalve logic is a reliable method for defining, analyzing, testing and implementing the basic combinational circuitry with VHDL simulator. It offers better utilization of transmission channels because of its high speed for higher information carried out and it gives more efficient performance. One of the main realizing of the MVL (ternary logic is that reduces the number of required computation steps, simplicity and energy efficiency in digital logic design. This paper using reliable method is brought out for implementing the basic combinational, sequential and TALU (Ternary Arithmetic and Logic Unit circuitry with minimum number of ternary switching circuits (Multiplexers. In this the potential of VHDL modelling and simulation that can be applied to ternary switching circuits to verify its functionality and timing specifications. An intention is to show how proposed simulator can be used to simulate MVL circuits and to evaluate system performance.
Modelling object typicality in description logics - [Workshop on Description Logics
CSIR Research Space (South Africa)
Britz, K
2009-07-01
Full Text Available The authors presents a semantic model of typicality of concept members in description logics that accords well with a binary, globalist cognitive model of class membership and typicality. The authors define a general preferential semantic framework...
Designable DNA-binding domains enable construction of logic circuits in mammalian cells.
Gaber, Rok; Lebar, Tina; Majerle, Andreja; Šter, Branko; Dobnikar, Andrej; Benčina, Mojca; Jerala, Roman
2014-03-01
Electronic computer circuits consisting of a large number of connected logic gates of the same type, such as NOR, can be easily fabricated and can implement any logic function. In contrast, designed genetic circuits must employ orthogonal information mediators owing to free diffusion within the cell. Combinatorial diversity and orthogonality can be provided by designable DNA- binding domains. Here, we employed the transcription activator-like repressors to optimize the construction of orthogonal functionally complete NOR gates to construct logic circuits. We used transient transfection to implement all 16 two-input logic functions from combinations of the same type of NOR gates within mammalian cells. Additionally, we present a genetic logic circuit where one input is used to select between an AND and OR function to process the data input using the same circuit. This demonstrates the potential of designable modular transcription factors for the construction of complex biological information-processing devices.
Formalized Epistemology, Logic, and Grammar
Bitbol, Michel
The task of a formal epistemology is defined. It appears that a formal epistemology must be a generalization of "logic" in the sense of Wittgenstein's Tractatus. The generalization is required because, whereas logic presupposes a strict relation between activity and language, this relation may be broken in some domains of experimental enquiry (e.g., in microscopic physics). However, a formal epistemology should also retain a major feature of Wittgenstein's "logic": It must not be a discourse about scientific knowledge, but rather a way of making manifest the structures usually implicit in knowledge-gaining activity. This strategy is applied to the formalism of quantum mechanics.
Aristotelian logic and its perspectives
Directory of Open Access Journals (Sweden)
Manuel Correia
2017-05-01
Full Text Available The legitimacy of Aristotelian logic was questioned in the twentieth century. As a result, the question of whether it should be replaced or restored remains unanswered. To resolve this dilemma there have been new findings that show that it is a theory with internal development, which is independent from the provisions of mathematical logic. In this article, I show how to restore its internal unity, development prospects and independence, through the use of three axioms or rules allowing to incorporate indefinite terms in classical categorical and hypothetical syllogistic, which gives it a capacity able to be compared to monadic first order logic.
Coherence in Linear Predicate Logic
Dosen, K
2007-01-01
Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classical linear logic, a fragment lacking negation. These results extend results published in previous two books by the authors, where coherence was established for categories of the corresponding fragments of propositional classical linear logic, which are related to proof nets, and which could be described as star-autonomous categories without unit objects.
Handling Pressures of Community Logic
DEFF Research Database (Denmark)
Minbaeva, Dana; Hotho, Jasper; Muratbekova-Touron, Maral
2013-01-01
The paper aims at investigating how in pluralistic societies, such as emerging economies and countries in transition, organizational decision-makers respond to pressures of community logics in non-community settings, such as the work place. We theorize that in non-community settings, social...... relations and interactions with community members can act as social cues that induce and expose individuals to community logics. We subsequently propose that properties of these relations – immediacy and relatedness - will affect individual response strategies towards community logics. We test these ideas...
Kral, M J
1994-01-01
Although suicide is not viewed as a mental disorder per se, it is viewed by many if not most clinicians, researchers, and lay people as a real or natural symptom of depression. It is at least most typically seen as the unfortunate, severe, yet logical end result of a chain of negative self-appraisals, negative events, and hopelessness. Extending an approach articulated by the early French sociologist Gabriel Tarde, in this paper I argue that suicide is merely an idea, albeit a very bad one, having more in common with societal beliefs and norms regarding such things as divorce, abortion, sex, politics, consumer behavior, and fashion. I make a sharp contrast between perturbation and lethality, concepts central to Edwin S. Shneidman's theory of suicide. Evidence supportive of suicide as an idea is discussed based on what we are learning from the study of history and culture, and about contagion/cluster phenomena, media/communication, and choice of method. It is suggested that certain individuals are more vulnerable to incorporate the idea and act of suicide into their concepts of self, based on the same principles by which ideas are spread throughout society. Just as suicide impacts on society, so does society impact on suicide.
Remmel, Jeffrey; Shore, Richard; Sweedler, Moss; Progress in Computer Science and Applied Logic
1993-01-01
The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematica...
Optimization of Fuzzy Logic Controller for Supervisory Power System Stabilizers
Directory of Open Access Journals (Sweden)
Y. A. Al-Turki
2012-01-01
Full Text Available This paper presents a powerful supervisory power system stabilizer (PSS using an adaptive fuzzy logic controller driven by an adaptive fuzzy set (AFS. The system under study consists of two synchronous generators, each fitted with a PSS, which are connected via double transmission lines. Different types of PSS-controller techniques are considered. The proposed genetic adaptive fuzzy logic controller (GAFLC-PSS, using 25 rules, is compared with a static fuzzy logic controller (SFLC driven by a fixed fuzzy set (FFS which has 49 rules. Both fuzzy logic controller (FLC algorithms utilize the speed error and its rate of change as an input vector. The adaptive FLC algorithm uses a genetic algorithmto tune the parameters of the fuzzy set of each PSS. The FLC’s are simulated and tested when the system is subjected to different disturbances under a wide range of operating points. The proposed GAFLC using AFS reduced the computational time of the FLC, where the number of rules is reduced from 49 to 25 rules. In addition, the proposed adaptive FLC driven by a genetic algorithm also reduced the complexity of the fuzzy model, while achieving a good dynamic response of the system under study.
Development of computer-aided software engineering tool for sequential control of JT-60U
Energy Technology Data Exchange (ETDEWEB)
Shimono, M.; Akasaka, H.; Kurihara, K.; Kimura, T. [Japan Atomic Energy Research Inst., Naka, Ibaraki (Japan). Naka Fusion Research Establishment
1995-12-31
Discharge sequential control (DSC) is an essential control function for the intermittent and pulse discharge operation of a tokamak device, so that many subsystems may work with each other in correct order and/or synchronously. In the development of the DSC program, block diagrams of logical operation for sequential control are illustrated in its design at first. Then, the logical operators and I/O`s which are involved in the block diagrams are compiled and converted to a certain particular form. Since the block diagrams of the sequential control amounts to about 50 sheets in the case of the JT-60 upgrade tokamak (JT-60U) high power discharge and the above steps of the development have been performed manually so far, a great effort has been required for the program development. In order to remove inefficiency in such development processes, a computer-aided software engineering (CASE) tool has been developed on a UNIX workstation. This paper reports how the authors design it for the development of the sequential control programs. The tool is composed of the following three tools: (1) Automatic drawing tool, (2) Editing tool, and (3) Trace tool. This CASE tool, an object-oriented programming tool having graphical formalism, can powerfully accelerate the cycle for the development of the sequential control function commonly associated with pulse discharge in a tokamak fusion device.
Logical Theories for Agent Introspection
DEFF Research Database (Denmark)
Bolander, Thomas
2004-01-01
Artificial intelligence systems (agents) generally have models of the environments they inhabit which they use for representing facts, for reasoning about these facts and for planning actions. Much intelligent behaviour seems to involve an ability to model not only one's external environment...... by self-reference. In the standard approach taken in artificial intelligence, the model that an agent has of its environment is represented as a set of beliefs. These beliefs are expressed as logical formulas within a formal, logical theory. When the logical theory is expressive enough to allow...... introspective reasoning, the presence of self-reference causes the theory to be prone to inconsistency. The challenge therefore becomes to construct logical theories supporting introspective reasoning while at the same time ensuring that consistency is retained. In the thesis, we meet this challenge by devising...
Impossible Worlds and Logical Omniscience
DEFF Research Database (Denmark)
Bjerring, Jens Christian Krarup
2013-01-01
the use of impossible worlds where the truths of logic can be false. As we shall see, if we admit impossible worlds where “anything goes” in modal space, it is easy to model extremely non-ideal agents that are incapable of performing even the most elementary logical deductions. A much harder...... falsehoods, they are nevertheless able to rule out blatantly impossible worlds that verify obvious logical falsehoods. To model moderately ideal agents, I argue, the job is to construct a modal space that contains only possible and non-trivially impossible worlds where it is not the case that “anything goes......In this paper, I investigate whether we can use a world-involving framework to model the epistemic states of non-ideal agents. The standard possible-world framework falters in this respect because of a commitment to logical omniscience. A familiar attempt to overcome this problem centers around...
Logic Gates with Ion Transistors
Grebel, Haim
2016-01-01
Electronic logic gates are the basic building blocks of every computing and micro controlling system. Logic gates are made of switches, such as diodes and transistors. Ion-selective, ionic switches may emulate electronic switches [1-8]. If we ever want to create artificial bio-chemical circuitry, then we need to move a step further towards ion-logic circuitry. Here we demonstrate ion XOR and OR gates with electrochemical cells, and specifically, with two wet-cell batteries. In parallel to vacuum tubes, the batteries were modified to include a third, permeable and conductive mid electrode (the gate), which was placed between the anode and cathode in order to affect the ion flow through it. The key is to control the cell output with a much smaller biasing power, as demonstrated here. A successful demonstration points to self-powered ion logic gates.
Logical Theories for Agent Introspection
DEFF Research Database (Denmark)
Bolander, Thomas
2004-01-01
Artificial intelligence systems (agents) generally have models of the environments they inhabit which they use for representing facts, for reasoning about these facts and for planning actions. Much intelligent behaviour seems to involve an ability to model not only one's external environment...... by self-reference. In the standard approach taken in artificial intelligence, the model that an agent has of its environment is represented as a set of beliefs. These beliefs are expressed as logical formulas within a formal, logical theory. When the logical theory is expressive enough to allow...... introspective reasoning, the presence of self-reference causes the theory to be prone to inconsistency. The challenge therefore becomes to construct logical theories supporting introspective reasoning while at the same time ensuring that consistency is retained. In the thesis, we meet this challenge by devising...
A profile of mathematical logic
DeLong, Howard
2012-01-01
This introduction to mathematical logic explores philosophical issues and Gödel's Theorem. Its widespread influence extends to the author of Gödel, Escher, Bach, whose Pulitzer Prize-winning book was inspired by this work.
Dependence logic theory and applications
Kontinen, Juha; Väänänen, Jouko; Vollmer, Heribert
2016-01-01
In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning ...
Flow Logics and Operational Semantics
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1998-01-01
Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analysis...... correct. Our main conclusion is that environment based semantics is more flexible than either substitution based semantics or semantics making use of structural congruences (like alpha-renaming)....
A logic generator and validator
Energy Technology Data Exchange (ETDEWEB)
Szabo, J.; Cain, D.G.; Okrent, D.
1985-05-01
The on-line monitoring of a power plant (or any process plant) has three primary functions: data acquisition, data analysis, and data presentation. Relative to the second of these functions, advanced methods for generating reliable data analysis computer codes are presented. The results are illustrated for a safety parameter display system that provides operators with a computer-graphic summary of a nuclear power plant's safety status. In the conventional method of analysis code production, the systems analyst or designer generates rules by which the plant status is being evaluated, while the transcription of those rules to a computer code is done separately by a programmer. Subsequently, the analysis code produced by the programmer must be validated against the specifications prepared by the systems analyst. A logic generator and logic validator are presented to streamline these processes. The logic generator acquires the relevant specifications through a systematic dialogue with the designer and then translates them automatically into an efficient computer logic code, thus solvin the problem of a designer who is not a programmer interfacing with a programmer who is not a designer. The logic generator enhances code reliability in two ways. First, it encourages the systems analyst to produce more reliable and relevant specifications because of the logical structured order in which the interactive session is being conducted. Second, because of the mass production mode b which the logic codes are being generated, proving once the correctness of the code production process ensures the accuracy of all codes to be generated in the future. In the postproduction stage, a logic validator enhances code reliability by displaying a structura overview of the data analysis code, allowing the user an additional opportunity for code evaluation.
The Progression of Sequential Reactions
Directory of Open Access Journals (Sweden)
Jack McGeachy
2010-01-01
Full Text Available Sequential reactions consist of linked reactions in which the product of the first reaction becomes the substrate of a second reaction. Sequential reactions occur in industrially important processes, such as the chlorination of methane. A generalized series of three sequential reactions was analyzed in order to determine the times at which each chemical species reaches its maximum. To determine the concentration of each species as a function of time, the differential rate laws for each species were solved. The solution of each gave the concentration curve of the chemical species. The concentration curves of species A1 and A2 possessed discreet maxima, which were determined through slope-analysis. The concentration curve of the final product, A3, did not possess a discreet maximum, but rather approached a finite limit.
Development of RPS trip logic based on PLD technology
Energy Technology Data Exchange (ETDEWEB)
Choi, Jong Gyun; Lee, Dong Young [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2012-08-15
The majority of instrumentation and control (I and C) systems in today's nuclear power plants (NPPs) are based on analog technology. Thus, most existing I and C systems now face obsolescence problems. Existing NPPs have difficulty in repairing and replacing devices and boards during maintenance because manufacturers no longer produce the analog devices and boards used in the implemented I and C systems. Therefore, existing NPPs are replacing the obsolete analog I and C systems with advanced digital systems. New NPPs are also adopting digital I and C systems because the economic efficiencies and usability of the systems are higher than the analog I and C systems. Digital I and C systems are based on two technologies: a microprocessor based system in which software programs manage the required functions and a programmable logic device (PLD) based system in which programmable logic devices, such as field programmable gate arrays, manage the required functions. PLD based systems provide higher levels of performance compared with microprocessor based systems because PLD systems can process the data in parallel while microprocessor based systems process the data sequentially. In this research, a bistable trip logic in a reactor protection system (RPS) was developed using very high speed integrated circuits hardware description language (VHDL), which is a hardware description language used in electronic design to describe the behavior of the digital system. Functional verifications were also performed in order to verify that the bistable trip logic was designed correctly and satisfied the required specifications. For the functional verification, a random testing technique was adopted to generate test inputs for the bistable trip logic.
Measuring logic complexity can guide pattern discovery in empirical systems
Gherardi, Marco
2016-01-01
We explore a definition of complexity based on logic functions, which are widely used as compact descriptions of rules in diverse fields of contemporary science. Detailed numerical analysis shows that (i) logic complexity is effective in discriminating between classes of functions commonly employed in modelling contexts; (ii) it extends the notion of canalisation, used in the study of genetic regulation, to a more general and detailed measure; (iii) it is tightly linked to the resilience of a function's output to noise affecting its inputs. We demonstrate its utility by measuring it in empirical data on gene regulation, digital circuitry, and propositional calculus. Logic complexity is exceptionally low in these systems. The asymmetry between "on" and "off" states in the data correlates with the complexity in a non-null way; a model of random Boolean networks clarifies this trend and indicates a common hierarchical architecture in the three systems.
Structural completeness in propositional logics of dependence
Iemhoff, Rosalie; Yang, Fan
2016-01-01
In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed. We obtain an analogous
Hybrid logics with infinitary proof systems
Kooi, Barteld; Renardel de Lavalette, Gerard; Verbrugge, Rineke
2006-01-01
We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic a
On Structural Completeness of Tabular Superintuitionistic Logics
Citkin, Alexander
2015-01-01
As usual, the superintuitionistic (propositional) logics (that is, logics extending intuitionistic logic) are being studied “modulo derivability”, meaning such logics are viewed extensionally — they are identified with the set of formulae that are valid (derivable in the corresponding calculus) in
Transistor switching and sequential circuits
Sparkes, John J
1969-01-01
Transistor Switching and Sequential Circuits presents the basic ideas involved in the construction of computers, instrumentation, pulse communication systems, and automation. This book discusses the design procedure for sequential circuits. Organized into two parts encompassing eight chapters, this book begins with an overview of the ways on how to generate the types of waveforms needed in digital circuits, principally ramps, square waves, and delays. This text then considers the behavior of some simple circuits, including the inverter, the emitter follower, and the long-tailed pair. Other cha
Complementary sequential measurements generate entanglement
Coles, Patrick J.; Piani, Marco
2014-01-01
We present a paradigm for capturing the complementarity of two observables. It is based on the entanglement created by the interaction between the system observed and the two measurement devices used to measure the observables sequentially. Our main result is a lower bound on this entanglement and resembles well-known entropic uncertainty relations. Besides its fundamental interest, this result directly bounds the effectiveness of sequential bipartite operations—corresponding to the measurement interactions—for entanglement generation. We further discuss the intimate connection of our result with two primitives of information processing, namely, decoupling and coherent teleportation.
Sequential Divestiture and Firm Asymmetry
Directory of Open Access Journals (Sweden)
Wen Zhou
2013-01-01
Full Text Available Simple Cournot models of divestiture tend to generate incentives to divest which are too strong, predicting that firms will break up into an infinite number of divisions resulting in perfect competition. This paper shows that if the order of divestitures is endogenized, firms will always choose sequential, and hence very limited, divestitures. Divestitures favor the larger firm and the follower in a sequential game. Divestitures in which the larger firm is the follower generate greater industry profit and social welfare, but a smaller consumer surplus.
Sequential pattern formation governed by signaling gradients
Jörg, David J; Jülicher, Frank
2016-01-01
Rhythmic and sequential segmentation of the embryonic body plan is a vital developmental patterning process in all vertebrate species. However, a theoretical framework capturing the emergence of dynamic patterns of gene expression from the interplay of cell oscillations with tissue elongation and shortening and with signaling gradients, is still missing. Here we show that a set of coupled genetic oscillators in an elongating tissue that is regulated by diffusing and advected signaling molecules can account for segmentation as a self-organized patterning process. This system can form a finite number of segments and the dynamics of segmentation and the total number of segments formed depend strongly on kinetic parameters describing tissue elongation and signaling molecules. The model accounts for existing experimental perturbations to signaling gradients, and makes testable predictions about novel perturbations. The variety of different patterns formed in our model can account for the variability of segmentatio...
Sequential pattern formation governed by signaling gradients
Jörg, David J.; Oates, Andrew C.; Jülicher, Frank
2016-10-01
Rhythmic and sequential segmentation of the embryonic body plan is a vital developmental patterning process in all vertebrate species. However, a theoretical framework capturing the emergence of dynamic patterns of gene expression from the interplay of cell oscillations with tissue elongation and shortening and with signaling gradients, is still missing. Here we show that a set of coupled genetic oscillators in an elongating tissue that is regulated by diffusing and advected signaling molecules can account for segmentation as a self-organized patterning process. This system can form a finite number of segments and the dynamics of segmentation and the total number of segments formed depend strongly on kinetic parameters describing tissue elongation and signaling molecules. The model accounts for existing experimental perturbations to signaling gradients, and makes testable predictions about novel perturbations. The variety of different patterns formed in our model can account for the variability of segmentation between different animal species.
PSPACE Bounds for Rank-1 Modal Logics
Schröder, Lutz
2007-01-01
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank-1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACE-bounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant proof-theoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way.
Digital Repository Service at National Institute of Oceanography (India)
Anas, A.; Jiya, J.; Rameez, M.J.; Anand, P.B.; Anantharaman, M.R.; Nair, S.
The study was carried out to understand the effect of silver-silica nanocomposite (Ag-SiO sub(2)NC) on the cell wall integrity, metabolism and genetic stability of Pseudomonas aeruginosa, a multiple drug-resistant bacterium Bacterial sensitivity...
Continuous first order logic and local stability
Yaacov, Itaï Ben
2008-01-01
We develop continuous first order logic, a variant of the logic described in \\cite{Chang-Keisler:ContinuousModelTheory}. We show that this logic has the same power of expression as the framework of open Hausdorff cats, and as such extends Henson's logic for Banach space structures. We conclude with the development of local stability, for which this logic is particularly well-suited.
Multiple fault analysis in synchronous sequential circuits by means of vector Boolean difference
Energy Technology Data Exchange (ETDEWEB)
Goldstein, L.H.
1977-01-01
The Boolean difference is an elegant mathematical concept which has found significant application in the study of single faults of a stuck-at nature in combinational logic circuits. Recently, several authors have extended this technique to the analysis of multiple faults in combinational circuits. The concept of vector Boolean difference is further extended to the analysis of multiple stuck-at faults in synchronous sequential circuits.
Sequential triangulation of orbital photography
Rajan, M.; Junkins, J. L.; Turner, J. D.
1979-01-01
The feasibility of structuring the satellite photogrammetric triangulation as an iterative Extended Kalman estimation algorithm is demonstrated. Comparative numerical results of the sequential against batch estimation algorithm are presented. Difficulty of accurately modeling of the attitude motion is overcome by utilizing the on-board angular rate measurements. Solutions of the differential equations and the evaluation of state transition matrix are carried out numerically.
Attack Trees with Sequential Conjunction
Jhawar, Ravi; Kordy, Barbara; Mauw, Sjouke; Radomirović, Sasa; Trujillo-Rasua, Rolando
2015-01-01
We provide the first formal foundation of SAND attack trees which are a popular extension of the well-known attack trees. The SAND at- tack tree formalism increases the expressivity of attack trees by intro- ducing the sequential conjunctive operator SAND. This operator enables the modeling of
Sequential triangulation of orbital photography
Rajan, M.; Junkins, J. L.; Turner, J. D.
1979-01-01
The feasibility of structuring the satellite photogrammetric triangulation as an iterative Extended Kalman estimation algorithm is demonstrated. Comparative numerical results of the sequential against batch estimation algorithm are presented. Difficulty of accurately modeling of the attitude motion is overcome by utilizing the on-board angular rate measurements. Solutions of the differential equations and the evaluation of state transition matrix are carried out numerically.
Competencies assessment using fuzzy logic
Directory of Open Access Journals (Sweden)
Matej Jevšček
2016-06-01
Full Text Available Research Question: Competencies evaluation is complex. The question is how to evaluate a competency which was assessed with 360° feedback, in one result using fuzzy logic tools so the result represents an actual competency development in an individual. Purpose: The purpose and goal of the study is to determine a possible process of competency evaluation that would enable creating a single competency assessment using fuzzy logic methods. Method: The theoretical part examines the current state and terminology of competencies and fuzzy logic. The empirical part consists of a quantitative research study. Data from the survey questionnaire was used for model testing. Results: An example of an »Initiative« competency evaluation model is created and tested in the research study. Testing confirmed that evaluation using fuzzy logic is efficient. Organization: The study directly affects the development of the HR function in organizations. It enables an easier and more oriented competency evaluation. Society: The study enables easier orientation in competencies development that can improve the social order as well as social responsibility and the environment indirectly. Originality: The study presents a new competency evaluation model using fuzzy logic. Limitations/Future Research: The study is restricted to one competency and certain assessors. Further research could explore the model with several assessors of the same rank.
Fuzzy logic of Aristotelian forms
Energy Technology Data Exchange (ETDEWEB)
Perlovsky, L.I. [Nichols Research Corp., Lexington, MA (United States)
1996-12-31
Model-based approaches to pattern recognition and machine vision have been proposed to overcome the exorbitant training requirements of earlier computational paradigms. However, uncertainties in data were found to lead to a combinatorial explosion of the computational complexity. This issue is related here to the roles of a priori knowledge vs. adaptive learning. What is the a-priori knowledge representation that supports learning? I introduce Modeling Field Theory (MFT), a model-based neural network whose adaptive learning is based on a priori models. These models combine deterministic, fuzzy, and statistical aspects to account for a priori knowledge, its fuzzy nature, and data uncertainties. In the process of learning, a priori fuzzy concepts converge to crisp or probabilistic concepts. The MFT is a convergent dynamical system of only linear computational complexity. Fuzzy logic turns out to be essential for reducing the combinatorial complexity to linear one. I will discuss the relationship of the new computational paradigm to two theories due to Aristotle: theory of Forms and logic. While theory of Forms argued that the mind cannot be based on ready-made a priori concepts, Aristotelian logic operated with just such concepts. I discuss an interpretation of MFT suggesting that its fuzzy logic, combining a-priority and adaptivity, implements Aristotelian theory of Forms (theory of mind). Thus, 2300 years after Aristotle, a logic is developed suitable for his theory of mind.
Implementation of Optimized Reversible Sequential and Combinational Circuits for VLSI Applications
Directory of Open Access Journals (Sweden)
P. Mohan Krishna
2014-04-01
Full Text Available Reversible logic has emerged as one of the most important approaches for the power optimization with its application in low power VLSI design. They are also the fundamental requirement for the emerging field of the Quantum computing having with applications in the domains like Nano-technology, Digital signal processing, Cryptography, Communications. Implementing the reversible logic has the advantages of reducing gate counts, garbage outputs as well as constant inputs. In this project we present sequential and combinational circuit with reversible logic gates which are simulated in Xilinx ISE and by writing the code in VHDL . we have proposed a new design technique of BCD Adder using newly constructed reversible gates are based on CMOS with pass transistor gates . Here the total reversible Adder is designed using EDA tools. We will analyze the VLSI limitations like power consumption and area of designed circuits.
Directory of Open Access Journals (Sweden)
Beni Majid Davoody
2015-09-01
Full Text Available The relationship between Carnap’s Logical Syntax of Language (hereafter LSL ([1934] 1937 and Wittgenstein’s Tractatus Logico-Philosophicus (TLP ([1921] 1922 has been interpreted in several ways during past decades. One of the interpretations has gained keen advocates among Carnap scholars. It was originally provoked by what Caranp said in LSL, and it consists of two parts. First, it indicates that in TLP the possibility of speaking about the logical form of a language within the same language (which happens to be the only language that there is had been foresworn by Wittgenstein, but Carnap proved him wrong by producing a book (LSL written exactly in the manner which had been proscribed by Wittgenstein. This is the debate about the possibility of speaking about logical form.
Modal Calculus of Illocutionary Logic
Schumann, Andrew
2011-01-01
The aim of illocutionary logic is to explain how context can affect the meaning of certain special kinds of performative utterances. Recall that performative utterances are understood as follows: a speaker performs the illocutionary act (e.g. act of assertion, of conjecture, of promise) with the illocutionary force (resp. assertion, conjecture, promise) named by an appropriate performative verb in the way of representing himself as performing that act. In the paper I proposed many-valued interpretation of illocutionary forces understood as modal operators. As a result, I built up a non-Archimedean valued logic for formalizing illocutionary acts. A formal many-valued approach to illocutionary logic was offered for the first time.
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
have a tendency correctly to assess valid syllogisms as such more often than correctly assessing invalid syllogisms as such. It is also investigated to what extent the students have improved their skills in practical reasoning by attending the logic courses. Finally, some open questions regarding......This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy students...... and two groups of students of informatics. The skills of the students in syllogistic reasoning before and after the logic courses have been studied and are discussed. The empirical observations made with the program make it possible to identify syllogisms which are found difficult by the students...
Fuzzy logic particle tracking velocimetry
Wernet, Mark P.
1993-01-01
Fuzzy logic has proven to be a simple and robust method for process control. Instead of requiring a complex model of the system, a user defined rule base is used to control the process. In this paper the principles of fuzzy logic control are applied to Particle Tracking Velocimetry (PTV). Two frames of digitally recorded, single exposure particle imagery are used as input. The fuzzy processor uses the local particle displacement information to determine the correct particle tracks. Fuzzy PTV is an improvement over traditional PTV techniques which typically require a sequence (greater than 2) of image frames for accurately tracking particles. The fuzzy processor executes in software on a PC without the use of specialized array or fuzzy logic processors. A pair of sample input images with roughly 300 particle images each, results in more than 200 velocity vectors in under 8 seconds of processing time.
Logic, probability, and human reasoning.
Johnson-Laird, P N; Khemlani, Sangeet S; Goodwin, Geoffrey P
2015-04-01
This review addresses the long-standing puzzle of how logic and probability fit together in human reasoning. Many cognitive scientists argue that conventional logic cannot underlie deductions, because it never requires valid conclusions to be withdrawn - not even if they are false; it treats conditional assertions implausibly; and it yields many vapid, although valid, conclusions. A new paradigm of probability logic allows conclusions to be withdrawn and treats conditionals more plausibly, although it does not address the problem of vapidity. The theory of mental models solves all of these problems. It explains how people reason about probabilities and postulates that the machinery for reasoning is itself probabilistic. Recent investigations accordingly suggest a way to integrate probability and deduction.
Reversible logic gate using adiabatic superconducting devices
Takeuchi, N.; Yamanashi, Y.; Yoshikawa, N.
2014-09-01
Reversible computing has been studied since Rolf Landauer advanced the argument that has come to be known as Landauer's principle. This principle states that there is no minimum energy dissipation for logic operations in reversible computing, because it is not accompanied by reductions in information entropy. However, until now, no practical reversible logic gates have been demonstrated. One of the problems is that reversible logic gates must be built by using extremely energy-efficient logic devices. Another difficulty is that reversible logic gates must be both logically and physically reversible. Here we propose the first practical reversible logic gate using adiabatic superconducting devices and experimentally demonstrate the logical and physical reversibility of the gate. Additionally, we estimate the energy dissipation of the gate, and discuss the minimum energy dissipation required for reversible logic operations. It is expected that the results of this study will enable reversible computing to move from the theoretical stage into practical usage.
nLukac, Maarti; Kameyama, Michitaka
2011-01-01
It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a Parallel Genetic Algorithm that synthesizes Boolean reversible circuits realized with a variety of quantum gates on qudits with various radices. In order to allow synthesizing circuits of medium sizes in the higher radix quantum space we performed the experiments using a GPU accelerated Genetic Algorithm. Using the accelerated GA we compare heuristic improvements to the mutation process based on cost minimization, on the adaptive cost of the primitives and improvements due to Baldwinian vs. Lamarckian GA. We also describe various fitness function formulations that allowed for various realizations of well known universal Boolean reversible or quantum-probabilistic circuits.
The formation of sense organs in Drosophila: a logical approach.
Ghysen, Alain; Thomas, René
2003-08-01
The genetic analysis of development has revealed the importance of small sets of interacting genes in most morphogenetic processes. The results of gene interactions have so far been examined intuitively. This approach is largely sufficient when one deals with simple interactions, a feedback circuit for example. As more components become involved, however, it is difficult to make sure that the intuitive approach gives a comprehensive view of the behaviour of the system. In this paper, we illustrate the use of a logical approach to describe the genetic circuit that underlies the singling out of sense organ precursor cells in Drosophila. We show how to apply logical modelling to a realistic problem, and how this approach allows an easy assessment of the dynamic properties of the system, i.e., of its possible evolutions and of its reactions to fluctuations and perturbations.
The logical foundations of mathematics
Hatcher, William S
1981-01-01
The Logical Foundations of Mathematics offers a study of the foundations of mathematics, stressing comparisons between and critical analyses of the major non-constructive foundational systems. The position of constructivism within the spectrum of foundational philosophies is discussed, along with the exact relationship between topos theory and set theory.Comprised of eight chapters, this book begins with an introduction to first-order logic. In particular, two complete systems of axioms and rules for the first-order predicate calculus are given, one for efficiency in proving metatheorems, and
Directory of Open Access Journals (Sweden)
Anatoly D. Plotnikov
2001-01-01
Full Text Available For an arbitrary undirected graph G, we are designing a logical model for the Hamiltonian Cycle Problem (HCP, using tools of Boolean algebra only. The obtained model is a logic formulation of the conditions for the existence of the Hamiltonian cycle, and uses m Boolean variables, where m is the number of the edges of a graph. This Boolean expression is true if and only if an initial graph is Hamiltonian. In general, the obtained Boolean expression may have an exponential length (the number of Boolean literals and may be used for construction of the solution algorithm.
Lectures on Logic and Computation
DEFF Research Database (Denmark)
foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. During two weeks, around 50 courses and 10 workshops are offered to the attendants, each of 1.......5 hours per day during a five days week, with up to seven parallel sessions. ESSLLI also includes a student session (papers and posters by students only, 1.5 hour per day during the two weeks) and four evening lectures by senior scientists in the covered areas. The 6 course notes were carefully reviewed...
Ruspini, Enrique H.
1991-01-01
Summarized here are the results of recent research on the conceptual foundations of fuzzy logic. The focus is primarily on the principle characteristics of a model that quantifies resemblance between possible worlds by means of a similarity function that assigns a number between 0 and 1 to every pair of possible worlds. Introduction of such a function permits one to interpret the major constructs and methods of fuzzy logic: conditional and unconditional possibility and necessity distributions and the generalized modus ponens of Zadeh on the basis of related metric relationships between subsets of possible worlds.
Logic programming with social features
Buccafurri, Francesco
2008-01-01
In everyday life it happens that a person has to reason about what other people think and how they behave, in order to achieve his goals. In other words, an individual may be required to adapt his behaviour by reasoning about the others' mental state. In this paper we focus on a knowledge representation language derived from logic programming which both supports the representation of mental states of individual communities and provides each with the capability of reasoning about others' mental states and acting accordingly. The proposed semantics is shown to be translatable into stable model semantics of logic programs with aggregates.
Handbook of logic and language
van Benthem, Johan
2010-01-01
This is an expanding field and the logical study of language is becoming more interdisciplinary playing a role in disciplines such as computer science, artificial intelligence, cognitive science and game theory. Completely revised and updated, this new edition, written by the leading experts in the field, presents an overview of the latest developments at the interface of logic and linguistics as well as providing a historical perspective. It is divided into three parts covering Frameworks, General Topics and Descriptive Themes. Completely revised a
A Logical Approach to Entanglement
Das, Abhishek
2016-10-01
In this paper we innovate a logical approach to develop an intuition regarding the phenomenon of quantum entanglement. In the vein of the logic introduced we substantiate that particles that were entangled in the past will be entangled in perpetuity and thereby abide a rule that restricts them to act otherwise. We also introduce a game and by virtue of the concept of Nash equilibrium we have been able to show that entangled particles will mutually correspond to an experiment that is performed on any one of the particle.
Challenging institutional logics in Gourmet
DEFF Research Database (Denmark)
Nickelsen, Niels Christian Mossfeldt; Scheuer, John Damm
2015-01-01
This paper focuses on the initial phase of an organizational transformation. More precisely the paper analyses the moment where an institutional entrepreneur produces ideas, which have the capacity to break with existing logics and thus produces the potential for change by challenging existing fi...... field logics. The empirical case is the gastronomic field in Denmark and in the Nordic countries - more specifically the paper discusses the cook and entrepreneur Claus Meyers ambitions to realize a food-political vision; The New Nordic Kitchen. The theoretical contribution of the paper...
Logical Characterisation of Ontology Construction using Fuzzy Description Logics
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
Ontologies based on Description Logics (DLs) have proved to be effective in formally sharing knowledge across semantic technologies, e.g. Semantic Web, Natural Language Processing, Text Analytics, Business intelligence. Our main goal is analysing ontology construction considering vagueness. We have...
A detection method for logic functions suitable for dual-logic synthesis
Institute of Scientific and Technical Information of China (English)
Yinshui Xia; Fei Sun; Keyi Mao
2009-01-01
Logic functions can be implemented in either AND/OR/NOT-based traditional Boolean (TB) logic or AND/XOR-based Reed-Mul-ler (RM) logic. To the majority of logic functions, it will be beneficial to be partially implemented in both TB logic and RM logic, called dual-logic. In this paper, a detection condition favoring dual-logic synthesis is proposed. A corresponding detection algorithm is devel-oped and implemented in C. The algorithm is applied to test a set of MCNC91 benchmarks for verifying the algorithm. The results show that the proposed algorithm is more efficient than published ones.
National Research Council Canada - National Science Library
Asassfeh, Sahail M
2014-01-01
The label of 'logical connectors' (LCs) or 'conjunction' suggests that these expressions constitute an area where linguistic intelligence and logical/mathematical intelligence are likely to intersect...
Tom Hagström; Kristian Stålne
2015-01-01
Human development theories differ in “context sensitivity,” covering those stressing development stages and those stressing continuously progressing changes. The former theories differ in whether, how and why the stages are regarded as being generalized across domains, i.e. their generality claims. Piaget’s developmental stage theory of logical complexity of children and adolescents fulfill “strong” such claims, including fixed stage sequentiality of increasing complexity levels and higher st...
Microelectromechanical resonator based digital logic elements
Hafiz, Md Abdullah Al
2016-10-20
Micro/nano-electromechanical resonator based mechanical computing has recently attracted significant attention. However, its full realization has been hindered by the difficulty in realizing complex combinational logics, in which the logic function is constructed by cascading multiple smaller logic blocks. In this work we report an alternative approach for implementation of digital logic core elements, multiplexer and demultiplexer, which can be used to realize combinational logic circuits by suitable concatenation. Toward this, shallow arch shaped microresonators are electrically connected and their resonance frequencies are tuned based on an electrothermal frequency modulation scheme. This study demonstrates that by reconfiguring the same basic building block, the arch microresonator, complex logic circuits can be realized.
Aspects and modular reasoning in nonmonotonic logic
DEFF Research Database (Denmark)
Ostermann, Klaus
2008-01-01
Nonmonotonic logic is a branch of logic that has been developed to model situations with incomplete information. We argue that there is a connection between AOP and nonmonotonic logic which deserves further study. As a concrete technical contribution and "appetizer", we outline an AO semantics de...... defined in default logic (a form of nonmonotonic logic), propose a definition of modular reasoning, and show that the default logic version of the language semantics admits modular reasoning whereas a conventional language semantics based on weaving does not....
Sequential Detection of Digital Watermarking
Institute of Scientific and Technical Information of China (English)
LI Li; YU Yu-lian; WANG Pei
2005-01-01
The paper analyzed a new watermarking detection paradigm including double detection thresholds based on sequential hypothesis testing. A joint design of watermarking encoding and detection was proposed. The paradigm had good immunity to noisy signal attacks and high detection probability. Many experiments proved that the above algorithm can detect watermarks about 66% faster than popular detectors, which could have significant impact on many applications such as video watermarking detection and watermark-searching in a large database of digital contents.
Generic physical protection logic trees
Energy Technology Data Exchange (ETDEWEB)
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle.
Fuzzy Logic Indoor Positioning System
Directory of Open Access Journals (Sweden)
Roberto García Sánz
2008-12-01
Full Text Available The GPS system is not valid for positioning indoors, thus positioning systems are designed using Wi-Fi technology that allows location of a device inside buildings. The use of fuzzy logic is argued by the failure to find positioning systems based on this technology, which seeks toobserve how their use in this field
Program Theory Evaluation: Logic Analysis
Brousselle, Astrid; Champagne, Francois
2011-01-01
Program theory evaluation, which has grown in use over the past 10 years, assesses whether a program is designed in such a way that it can achieve its intended outcomes. This article describes a particular type of program theory evaluation--logic analysis--that allows us to test the plausibility of a program's theory using scientific knowledge.…
Symmetric Structure in Logic Programming
Institute of Scientific and Technical Information of China (English)
Jin-Zhao Wu; Harald Fecher
2004-01-01
It is argued that some symmetric structure in logic programs could be taken into account when implementing semantics in logic programming. This may enhance the declarative ability or expressive power of the semantics. The work presented here may be seen as representative examples along this line. The focus is on the derivation of negative information and some other classic semantic issues. We first define a permutation group associated with a given logic program. Since usually the canonical models used to reflect the common sense or intended meaning are minimal or completed models of the program, we expose the relationships between minimal models and completed models of the original program and its so-called G-reduced form newly-derived via the permutation group defined. By means of this G-reduced form, we introduce a rule to assume negative information termed G-CWA, which is actually a generalization of the GCWA. We also develop the notions of G-definite, G-hierarchical and G-stratified logic programs, which are more general than definite, hierarchical and stratified programs, and extend some well-known declarative and procedural semantics to them, respectively.
Boggle Logic Puzzles: Minimal Solutions
Needleman, Jonathan
2013-01-01
Boggle logic puzzles are based on the popular word game Boggle played backwards. Given a list of words, the problem is to recreate the board. We explore these puzzles on a 3 x 3 board and find the minimum number of three-letter words needed to create a puzzle with a unique solution. We conclude with a series of open questions.
The Logic of Quantum Measurements
Vanni, Leonardo; Laura, Roberto
2013-07-01
We apply our previously developed formalism of contexts of histories, suitable to deal with quantum properties at different times, to the measurement process. We explore the logical implications which are allowed by the quantum theory, about the realization of properties of the microscopic measured system, before and after the measurement process with a given pointer value.
Martin, Donald; Steel, John
1988-01-01
This is the fourth volume of the proceeding of the Caltech-UCLA Logic Seminar, based mainly on material which was presented and discussed in the period 1981-85, but containing also some very recent results. It includes research papers dealing with determinacy hypotheses and their consequences in descriptive set theory. An appendix contains the new Victoria Delfino Problems.
Handling Pressures of Community Logic
DEFF Research Database (Denmark)
Minbaeva, Dana; Hotho, Jasper; Muratbekova-Touron, Maral
2013-01-01
The paper aims at investigating how in pluralistic societies, such as emerging economies and countries in transition, organizational decision-makers respond to pressures of community logics in non-community settings, such as the work place. We theorize that in non-community settings, social relat...
Logic Programming and Knowledge Maintenance.
1987-08-13
the literature , and became convinced that many of the advantages of frames and semantic nets can be captured in logic programming systems by a...consists of: needs(john,money). married_to(john,mary). loves(john,mary). (mary is the dead victim in this thriller .) The victim’s sister sara consists of
Mathematical Induction: Deductive Logic Perspective
Dogan, Hamide
2016-01-01
Many studies mentioned the deductive nature of Mathematical Induction (MI) proofs but almost all fell short in explaining its potential role in the formation of the misconceptions reported in the literature. This paper is the first of its kind looking at the misconceptions from the perspective of the abstract of the deductive logic from one's…
Energy Technology Data Exchange (ETDEWEB)
Olbright, G.R.; Bryan, R.P.; Brennan, T.M.; Lear, K.; Poirier, G.E.; Fu, W.S. (Sandia National Labs., Albuquerque, NM (USA)); Jewell, J.L.; Lee, Y.H. (AT and T Bell Labs., Holmdel, NJ (USA))
1990-10-31
We describe a new class of optical logic devices which consist of integrated phototransistors and surface-emitting lasers. The devices function as optical neurons having high gain and, as arrays, are ideal for neural networks, parallel optical signal processing and optical computing applications. 3 refs., 3 figs.
Model checking mobile stochastic logic.
De Nicola, Rocco; Katoen, Joost P.; Latella, Diego; Loreti, Michele; Massink, Mieke
2007-01-01
The Temporal Mobile Stochastic Logic (MOSL) has been introduced in previous work by the authors for formulating properties of systems specified in STOKLAIM, a Markovian extension of KLAIM. The main purpose of MOSL is to address key functional aspects of global computing such as distribution
Model checking mobile stochastic logic.
De Nicola, Rocco; Katoen, Joost-Pieter; Latella, Diego; Loreti, Michele; Massink, Mieke
2007-01-01
The Temporal Mobile Stochastic Logic (MOSL) has been introduced in previous work by the authors for formulating properties of systems specified in STOKLAIM, a Markovian extension of KLAIM. The main purpose of MOSL is to address key functional aspects of global computing such as distribution awarenes
Fuzzy logic controllers on chip
Acosta, Nelson; Simonelli, Daniel Horacio
2002-01-01
This paper analyzes a fuzzy logic (FL) oriented instruction set (micro)controller and their implementations on FIPSOC1. VHDL code is synthesized using a small portion of FIPSOC FPGA2. This circuits are used from the mP8051 FIPSOC built-in microcontroller to provide efficient arithmetic operations such as multipliers, dividers, minimums and maximums.
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy student...
Logical Empiricism, Politics, and Professionalism
Edgar, Scott
2009-01-01
This paper considers George A. Reisch's account of the role of Cold War political forces in shaping the apolitical stance that came to dominate philosophy of science in the late 1940s and 1950s. It argues that at least as early as the 1930s, Logical Empiricists such as Rudolf Carnap already held that philosophy of science could not properly have…
Institute of Scientific and Technical Information of China (English)
沈理
1997-01-01
A fuzzy logic control VLSI chip,F100,for industry process real-time control has been designed and fabricated with 0.8μm CMOS technology.The chip has the features of simplicity,felexibility and generality.This paper presents the Fuzzy control inrerence method of the chip,its VLSI implementation,and testing esign consideration.
Logical Empiricism, Politics, and Professionalism
Edgar, Scott
2009-01-01
This paper considers George A. Reisch's account of the role of Cold War political forces in shaping the apolitical stance that came to dominate philosophy of science in the late 1940s and 1950s. It argues that at least as early as the 1930s, Logical Empiricists such as Rudolf Carnap already held that philosophy of science could not properly have…
Covering, Packing and Logical Inference
1993-10-01
of Operations Research 43 (1993). [34] *Hooker, J. N., Generalized resolution for 0-1 linear inequalities, Annals of Mathematics and A 16 271-286. [35...Hooker, J. N. and C. Fedjki, Branch-and-cut solution of inference prob- lems in propositional logic, Annals of Mathematics and AI 1 (1990) 123-140. [40
Mathematical Programming and Logical Inference
1990-12-01
solution of inference problems in propositional logic, to appear in Annals of Mathematics and Al. (271 Howard, R. A., and J. E. Matheson, Influence...1981). (281 Jeroslow, R., and J. Wang, Solving propositional satisfiability problems, to appear in Annals of Mathematics and Al. [29] Nilsson, N. J
PTL: A Propositional Typicality Logic
CSIR Research Space (South Africa)
Booth, R
2012-09-01
Full Text Available in which a formula holds. The semantics is in terms of ranked models as studied in KLM-style preferential reasoning. This allows us to show that rational consequence relations can be embedded in our logic. Moreover we show that we can define consequence...
Awodey, Steve
2010-01-01
From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models. The situation can be cast as a formal duality relating two categories of syntax and semantics, mediated by homming into a common dualizing object, in this case $2$. In the present work, we generalize the entire arrangement from propositional to first-order logic. Boolean algebras are replaced by Boolean categories presented by theories in first-order logic, and spaces of models are replaced by topological groupoids of models and their isomorphisms. A duality between the resulting categories of syntax and semantics, expressed first in the form of a contravariant adjunction, is established by homming into a common dualizing object, now $\\Sets$, regarded once as a boolean category, and...
Learning fuzzy logic control system
Lung, Leung Kam
1994-01-01
The performance of the Learning Fuzzy Logic Control System (LFLCS), developed in this thesis, has been evaluated. The Learning Fuzzy Logic Controller (LFLC) learns to control the motor by learning the set of teaching values that are generated by a classical PI controller. It is assumed that the classical PI controller is tuned to minimize the error of a position control system of the D.C. motor. The Learning Fuzzy Logic Controller developed in this thesis is a multi-input single-output network. Training of the Learning Fuzzy Logic Controller is implemented off-line. Upon completion of the training process (using Supervised Learning, and Unsupervised Learning), the LFLC replaces the classical PI controller. In this thesis, a closed loop position control system of a D.C. motor using the LFLC is implemented. The primary focus is on the learning capabilities of the Learning Fuzzy Logic Controller. The learning includes symbolic representation of the Input Linguistic Nodes set and Output Linguistic Notes set. In addition, we investigate the knowledge-based representation for the network. As part of the design process, we implement a digital computer simulation of the LFLCS. The computer simulation program is written in 'C' computer language, and it is implemented in DOS platform. The LFLCS, designed in this thesis, has been developed on a IBM compatible 486-DX2 66 computer. First, the performance of the Learning Fuzzy Logic Controller is evaluated by comparing the angular shaft position of the D.C. motor controlled by a conventional PI controller and that controlled by the LFLC. Second, the symbolic representation of the LFLC and the knowledge-based representation for the network are investigated by observing the parameters of the Fuzzy Logic membership functions and the links at each layer of the LFLC. While there are some limitations of application with this approach, the result of the simulation shows that the LFLC is able to control the angular shaft position of the
FUZZY LOGIC IN LEGAL EDUCATION
Directory of Open Access Journals (Sweden)
Z. Gonul BALKIR
2011-04-01
Full Text Available The necessity of examination of every case within its peculiar conditions in social sciences requires different approaches complying with the spirit and nature of social sciences. Multiple realities require different and various perceptual interpretations. In modern world and social sciences, interpretation of perception of valued and multi-valued have been started to be understood by the principles of fuzziness and fuzzy logic. Having the verbally expressible degrees of truthness such as true, very true, rather true, etc. fuzzy logic provides the opportunity for the interpretation of especially complex and rather vague set of information by flexibility or equivalence of the variables’ of fuzzy limitations. The methods and principles of fuzzy logic can be benefited in examination of the methodological problems of law, especially in the applications of filling the legal loopholes arising from the ambiguities and interpretation problems in order to understand the legal rules in a more comprehensible and applicable way and the efficiency of legal implications. On the other hand, fuzzy logic can be used as a technical legal method in legal education and especially in legal case studies and legal practice applications in order to provide the perception of law as a value and the more comprehensive and more quality perception and interpretation of value of justice, which is the core value of law. In the perception of what happened as it has happened in legal relationships and formations, the understanding of social reality and sociological legal rules with multi valued sense perspective and the their applications in accordance with the fuzzy logic’s methods could create more equivalent and just results. It can be useful for the young lawyers and law students as a facilitating legal method especially in the materialization of the perception and interpretation of multi valued and variables. Using methods and principles of fuzzy logic in legal
On sequential countably compact topological semigroups
Gutik, Oleg V; RepovÅ¡, DuÅ¡an
2008-01-01
We study topological and algebraic properties of sequential countably compact topological semigroups similar to compact topological semigroups. We prove that a sequential countably compact topological semigroup does not contain the bicyclic semigroup. Also we show that the closure of a subgroup in a sequential countably compact topological semigroup is a topological group, that the inversion in a Clifford sequential countably compact topological semigroup is continuous and we prove the analogue of the Rees-Suschkewitsch Theorem for simple regular sequential countably compact topological semigroups.
Preface. Philosophy and History of Talmudic Logic
Directory of Open Access Journals (Sweden)
Schumann Andrew
2017-06-01
Full Text Available This volume contains the papers presented at the Philosophy and History of Talmudic Logic Affiliated Workshop of Krakow Conference on History of Logic (KHL2016, held on October 27, 2016, in Krakow, Poland.
Logic functions and equations examples and exercises
Steinbach, Bernd
2009-01-01
With a free, downloadable software package available to help solve the exercises, this book focuses on practical and relevant problems that arise in the field of binary logics, with its two main applications - digital circuit design, and propositional logics.
Mathematical logic foundations for information science
Li, Wei
2010-01-01
This book presents the basic principles and formal calculus of mathematical logic. It covers core contents, extensions and developments of classical mathematical logic, and it offers formal proofs and concrete examples for all theoretical results.
Process algebra with four-valued logic
Bergstra, J.A.; Ponse, A.
2000-01-01
We propose a combination of a fragment of four-valued logic and process algebra. We present an operational semantics in SOS-style, and a completeness result for ACP with conditionals and four-valued logic.
Towards practical defeasible reasoning for description logics
CSIR Research Space (South Africa)
Casini, G
2013-07-01
Full Text Available The formalisation of defeasible reasoning in automated systems is becoming increasingly important. Description Logics (DLs) are nowadays the main logical formalism in the field of formal ontologies. Our focus in this paper is to devise a practical...
A predicate spatial logic for mobile processes
Institute of Scientific and Technical Information of China (English)
LIN Huimin
2004-01-01
A modal logic for describing temporal as well as spatial properties of mobile processes, expressed in the asynchronous π-calculus, is presented. The logic has recursive constructs built upon predicate-variables. The semantics of the logic is established and shown to be monotonic, thus guarantees the existence of fixpoints. An algorithm is developed to automatically check if a mobile process has properties described as formulas in the logic. The correctness of the algorithm is proved.
Symbolic logic syntax, semantics, and proof
Agler, David
2012-01-01
Brimming with visual examples of concepts, derivation rules, and proof strategies, this introductory text is ideal for students with no previous experience in logic. Symbolic Logic: Syntax, Semantics, and Proof introduces students to the fundamental concepts, techniques, and topics involved in deductive reasoning. Agler guides students through the basics of symbolic logic by explaining the essentials of two classical systems, propositional and predicate logic. Students will learn translation both from formal language into
A Logic for Diffusion in Social Networks
Christoff, Z.; Hansen, J.U.
2015-01-01
This paper introduces a general logical framework for reasoning about diffusion processes within social networks. The new "Logic for Diffusion in Social Networks" is a dynamic extension of standard hybrid logic, allowing to model complex phenomena involving several properties of agents. We provide a
Set Constraints and Logic Programming (Preprint)
2016-02-24
Assoc Comput Sci Logic Springer September A Aiken D Kozen and E Wimmers Decidability of systems of set constraints with negative...Extensions of Logic Programming ELP volume of Lect Notes Articial Intell pages Springer February J Englefriet Tree... Springer September D Kozen Set constraints and logic programming abstract In JP Jouannaud editor Proc First Conf Constraints in
Weak Completeness of Coalgebraic Dynamic Logics
Kupke, C.; Hansen, H.H.
2015-01-01
We present a coalgebraic generalisation of Fischer and Ladner’s Propositional Dynamic Logic (PDL) and Parikh’s Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a m
Weak Completeness of Coalgebraic Dynamic Logics
Hansen, H.H.; Kupke, C.A.
2015-01-01
We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a m
Dialogues as a dynamic framework for logic
Rückert, Helge
2007-01-01
Dialogical logic is a game-theoretical approach to logic. Logic is studied with the help of certain games, which can be thought of as idealized argumentations. Two players, the Proponent, who puts forward the initial thesis and tries to defend it, and the Opponent, who tries to attack the
Hybrid Logical Analyses of the Ambient Calculus
DEFF Research Database (Denmark)
Bolander, Thomas; Hansen, Rene Rydhof
2010-01-01
In this paper, hybrid logic is used to formulate three control flow analyses for Mobile Ambients, a process calculus designed for modelling mobility. We show that hybrid logic is very well-suited to express the semantic structure of the ambient calculus and how features of hybrid logic can...
Piaget's Logic of Meanings: Still Relevant Today
Wavering, Michael James
2011-01-01
In his last book, "Toward a Logic of Meanings" (Piaget & Garcia, 1991), Jean Piaget describes how thought can be categorized into a form of propositional logic, a logic of meanings. The intent of this article is to offer this analysis by Piaget as a means to understand the language and teaching of science. Using binary propositions, conjunctions,…
Logics of Business Education for Sustainability
Andersson, Pernilla; Öhman, Johan
2016-01-01
This paper explores various kinds of logics of "business education for sustainability" and how these "logics" position the subject business person, based on eight teachers' reasoning of their own practices. The concept of logics developed within a discourse theoretical framework is employed to analyse the teachers' reasoning.…
Piaget's Logic of Meanings: Still Relevant Today
Wavering, Michael James
2011-01-01
In his last book, "Toward a Logic of Meanings" (Piaget & Garcia, 1991), Jean Piaget describes how thought can be categorized into a form of propositional logic, a logic of meanings. The intent of this article is to offer this analysis by Piaget as a means to understand the language and teaching of science. Using binary propositions, conjunctions,…
Connecting Logics of Choice and Change
van Benthem, J.; Pacuit, E.; Müller, T.
2014-01-01
This chapter is an attempt at clarifying the current scene of sometimes competing action logics, looking for compatibilities and convergences. Current paradigms for deliberate action fall into two broad families: dynamic logics of events, and STIT logics of achieving specified effects. We compare th
An Adequate First Order Logic of Intervals
DEFF Research Database (Denmark)
Chaochen, Zhou; Hansen, Michael Reichhardt
1998-01-01
This paper introduces left and right neighbourhoods as primitive interval modalities to define other unary and binary modalities of intervals in a first order logic with interval length. A complete first order logic for the neighbourhood modalities is presented. It is demonstrated how the logic c...
Lakoff on Linguistics and Natural Logic.
Wilks, Yorick
This paper examines and criticizes Lakoff's notions of a natural logic and of a generative semantics described in terms of logic. The author argues that the relationship of these notions to logic as normally understood is unclear but suggests a number of possible interpretations of the thesis of generative semantics. Further, on these…
A Framed Temporal Logic Programming Language
Institute of Scientific and Technical Information of China (English)
Zhen-Hua Duan; Maciej Koutny
2004-01-01
We discuss the projection temporal logic (PTL), based on a primitive projection operator, prj. A framing technique is also presented, using which a synchronization operator, await, is defined within the underlying logic. A framed temporal logic programming language (FTLL) is presented. To illustrate how to use both the language and framing technique, some examples are given.
The dynamic turn in quantum logic
Baltag, Alexandru; Smets, Sonja
In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the
Logics of Business Education for Sustainability
Andersson, Pernilla; Öhman, Johan
2016-01-01
This paper explores various kinds of logics of "business education for sustainability" and how these "logics" position the subject business person, based on eight teachers' reasoning of their own practices. The concept of logics developed within a discourse theoretical framework is employed to analyse the teachers' reasoning.…
Applications of Logic Coverage Criteria and Logic Mutation to Software Testing
Kaminski, Garrett K.
2011-01-01
Logic is an important component of software. Thus, software logic testing has enjoyed significant research over a period of decades, with renewed interest in the last several years. One approach to detecting logic faults is to create and execute tests that satisfy logic coverage criteria. Another approach to detecting faults is to perform mutation…
Sequential Beamforming Synthetic Aperture Imaging
DEFF Research Database (Denmark)
Kortbek, Jacob; Jensen, Jørgen Arendt; Gammelmark, Kim Løkke
2013-01-01
Synthetic aperture sequential beamforming (SASB) is a novel technique which allows to implement synthetic aperture beamforming on a system with a restricted complexity, and without storing RF-data. The objective is to improve lateral resolution and obtain a more depth independent resolution...... and a range independent lateral resolution is obtained. The SASB method has been investigated using simulations in Field II and by off-line processing of data acquired with a commercial scanner. The lateral resolution increases with a decreasing F#. Grating lobes appear if F# 6 2 for a linear array with k-pitch...
Fuzzy Versions of Epistemic and Deontic Logic
Gounder, Ramasamy S.; Esterline, Albert C.
1998-01-01
Epistemic and deontic logics are modal logics, respectively, of knowledge and of the normative concepts of obligation, permission, and prohibition. Epistemic logic is useful in formalizing systems of communicating processes and knowledge and belief in AI (Artificial Intelligence). Deontic logic is useful in computer science wherever we must distinguish between actual and ideal behavior, as in fault tolerance and database integrity constraints. We here discuss fuzzy versions of these logics. In the crisp versions, various axioms correspond to various properties of the structures used in defining the semantics of the logics. Thus, any axiomatic theory will be characterized not only by its axioms but also by the set of properties holding of the corresponding semantic structures. Fuzzy logic does not proceed with axiomatic systems, but fuzzy versions of the semantic properties exist and can be shown to correspond to some of the axioms for the crisp systems in special ways that support dependency networks among assertions in a modal domain. This in turn allows one to implement truth maintenance systems. For the technical development of epistemic logic, and for that of deontic logic. To our knowledge, we are the first to address fuzzy epistemic and fuzzy deontic logic explicitly and to consider the different systems and semantic properties available. We give the syntax and semantics of epistemic logic and discuss the correspondence between axioms of epistemic logic and properties of semantic structures. The same topics are covered for deontic logic. Fuzzy epistemic and fuzzy deontic logic discusses the relationship between axioms and semantic properties for these logics. Our results can be exploited in truth maintenance systems.
Flow Logic for Process Calculi
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Nielson, Flemming; Pilegaard, Henrik
2012-01-01
Flow Logic is an approach to statically determining the behavior of programs and processes. It borrows methods and techniques from Abstract Interpretation, Data Flow Analysis and Constraint Based Analysis while presenting the analysis in a style more reminiscent of Type Systems. Traditionally...... developed for programming languages, this article provides a tutorial development of the approach of Flow Logic for process calculi based on a decade of research. We first develop a simple analysis for the π-calculus; this consists of the specification, semantic soundness (in the form of subject reduction...... and adequacy results), and a Moore Family result showing that a least solution always exists, as well as providing insights on how to implement the analysis. We then show how to strengthen the analysis technology by introducing reachability components, interaction points, and localized environments...
Logic circuits from zero forcing
Burgarth, Daniel; Hogben, Leslie; Severini, Simone; Young, Michael
2011-01-01
We design logical circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices to encode each logical bit, we obtain universal computation. We also highlight a phenomenon of "back forcing" as a property of each function. Such a phenomenon occurs in a circuit when the input of gates which have been already used at a given time step is further modified by a computation actually performed at a later stage. Finally, we show that zero forcing can be also used to implement reversible computation. The model introduced here provides a potentially new tool in the analysis of Boolean functions, with particular attention to monotonicity.
Symmetric normalisation for intuitionistic logic
DEFF Research Database (Denmark)
Guenot, Nicolas; Straßburger, Lutz
2014-01-01
, but using a non-local rewriting. The second system is the symmetric completion of the first, as normally given in deep inference for logics with a DeMorgan duality: all inference rules have duals, as cut is dual to the identity axiom. We prove a generalisation of cut elimination, that we call symmetric...... normalisation, where all rules dual to standard ones are permuted up in the derivation. The result is a decomposition theorem having cut elimination and interpolation as corollaries.......We present two proof systems for implication-only intuitionistic logic in the calculus of structures. The first is a direct adaptation of the standard sequent calculus to the deep inference setting, and we describe a procedure for cut elimination, similar to the one from the sequent calculus...
Programming Games for Logical Thinking
Directory of Open Access Journals (Sweden)
H. Tsalapatas
2013-03-01
Full Text Available Analytical thinking is a transversal skill that helps learners synthesize knowledge across subject areas; from mathematics, science, and technology to critical reading, critical examination, and evaluation of lessons. While most would not doubt the importance of analytical capacity in academic settings and its growing demand for the skill in professional environments, school curricula do not comprehensively address its development. As a result, the responsibility for structuring related learning activities falls to teachers. This work examines learning paradigms that can be integrated into mathematics and science school education for developing logical thinking through game-based exercises based on programming. The proposed learning design promotes structured algorithmic mindsets, is based on inclusive universal logic present in all cultures, and promotes constructivism educational approaches encouraging learners to drive knowledge building by composing past and emerging experiences.
The Logic Behind Feynman's Paths
García Álvarez, Edgardo T.
The classical notions of continuity and mechanical causality are left in order to reformulate the Quantum Theory starting from two principles: (I) the intrinsic randomness of quantum process at microphysical level, (II) the projective representations of symmetries of the system. The second principle determines the geometry and then a new logic for describing the history of events (Feynman's paths) that modifies the rules of classical probabilistic calculus. The notion of classical trajectory is replaced by a history of spontaneous, random and discontinuous events. So the theory is reduced to determining the probability distribution for such histories accordingly with the symmetries of the system. The representation of the logic in terms of amplitudes leads to Feynman rules and, alternatively, its representation in terms of projectors results in the Schwinger trace formula.
Contextual Validity in Hybrid Logic
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2013-01-01
interpretations. Moreover, such indexicals give rise to a special kind of validity—contextual validity—that interacts with ordinary logi- cal validity in interesting and often unexpected ways. In this paper we model these interactions by combining standard techniques from hybrid logic with insights from the work...... of Hans Kamp and David Kaplan. We introduce a simple proof rule, which we call the Kamp Rule, and first we show that it is all we need to take us from logical validities involving now to contextual validities involving now too. We then go on to show that this deductive bridge is strong enough to carry us...... to contextual validities involving yesterday, today and tomorrow as well....
The logic of medical diagnosis.
Stanley, Donald E; Campos, Daniel G
2013-01-01
Establishing diagnoses is a crucial aspect of medical practice. However, this process has received comparatively little logical and pedagogical attention when compared to statistical methods for evaluating evidence. This article investigates the logic of medical diagnosis in order to fill this void. It is organized in three parts: the first attempts to explain why more attention ought to be paid to diagnosis, at least as much as to evidence; the second calls attention to the method of diagnosis by abductive reasoning developed in the 19th century by Charles Sanders Peirce (1839-1914); and the third demonstrates the use and pervasiveness of abduction by any other name in clinical diagnosis. We examine six diagnostic strategies in common use that contain most, if not all, of Peirce's structure of inquiry in science.
Logic and discrete mathematics a concise introduction
Conradie, Willem
2015-01-01
A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy
Logical design for computers and control
Dodd, Kenneth N
1972-01-01
Logical Design for Computers and Control Logical Design for Computers and Control gives an introduction to the concepts and principles, applications, and advancements in the field of control logic. The text covers topics such as logic elements; high and low logic; kinds of flip-flops; binary counting and arithmetic; and Boolean algebra, Boolean laws, and De Morgan's theorem. Also covered are topics such as electrostatics and atomic theory; the integrated circuit and simple control systems; the conversion of analog to digital systems; and computer applications and control. The book is recommend
Parallel optical logic operations on reversible networks
Shamir, Joseph
2013-03-01
A generic optical network architecture is proposed for the implementation of programmable logic operations. Based on reversible optical gate elements the processor is highly energy efficient and intrinsically fast. In this architecture the whole logic operation is executed by light propagating through the system with no energy dissipation. Energy must be spent only at the input interface and at discrete locations where the logic operation results are to be detected. As a consequence, the theoretical lower limit for energy dissipation in logic operations must be reconsidered. The strength of this approach is demonstrated by examples showing the implementation of various lossless logic operations, including Half Adder and Full Adder.
Institute of Scientific and Technical Information of China (English)
林允清
2014-01-01
The notion of logical form plays a central role in the philosophy of language and in linguistics . But what logical form is has not been clear . In this paper I first survey the uses of logical form , and show that this notion has no well-defined meaning . I then discuss three main motivations behind invoking logical form , and argue that two of them are unwarranted , and the third can be satisfied by an approach to the logic of ordinary language that is based on the idea of sentence frames , rather than on the traditional idea of subject and predicate .
Functional Interpretations of Intuitionistic Linear Logic
Ferreira, Gilda
2010-01-01
We present three different functional interpretations of intuitionistic linear logic ILL and show how these correspond to well-known functional interpretations of intuitionistic logic IL via embeddings of IL into ILL. The main difference from previous work of the second author is that in intuitionistic linear logic (as opposed to classical linear logic) the interpretations of !A are simpler and simultaneous quantifiers are no longer needed for the characterisation of the interpretations. We then compare our approach in developing these three proof interpretations with the one of de Paiva around the Dialectica category model of linear logic.
Moot, Richard
2007-01-01
This paper explores several extensions of proof nets for the Lambek calculus in order to handle the different connectives of display logic in a natural way. The new proof net calculus handles some recent additions to the Lambek vocabulary such as Galois connections and Grishin interactions. It concludes with an exploration of the generative capacity of the Lambek-Grishin calculus, presenting an embedding of lexicalized tree adjoining grammars into the Lambek-Grishin calculus.
Logic, Probability, and Human Reasoning
2015-01-01
3–6] and they underlie mathematics , science, and tech- nology [7–10]. Plato claimed that emotions upset reason - ing. However, individuals in the grip...Press 10 Nickerson, R. (2011) Mathematical Reasoning : Patterns, Problems, Conjectures, and Proofs, Taylor & Francis 11 Blanchette, E. and Richards, A...Logic, probability, and human reasoning P.N. Johnson-Laird1,2, Sangeet S. Khemlani3, and Geoffrey P. Goodwin4 1 Princeton University, Princeton, NJ
Session Types in Abelian Logic
Directory of Open Access Journals (Sweden)
Yoichi Hirai
2013-12-01
Full Text Available There was a PhD student who says "I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes." We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky's linear lambda calculus LF and characterizes Abelian logic.
Logical impossibilities in biological networks
Directory of Open Access Journals (Sweden)
Monendra Grover
2011-10-01
Full Text Available Biological networks are complex and involve several kinds of molecules. For proper biological function it is important for these biomolecules to act at an individual level and act at the level of interaction of these molecules. In this paper some of the logical impossibilities that may arise in the biological networks and their possible solutions are discussed. It may be important to understand these paradoxes and their possible solutions in order to develop a holistic view of biological function.
Anaesthesia monitoring using fuzzy logic.
Baig, Mirza Mansoor; Gholamhosseini, Hamid; Kouzani, Abbas; Harrison, Michael J
2011-10-01
Humans have a limited ability to accurately and continuously analyse large amount of data. In recent times, there has been a rapid growth in patient monitoring and medical data analysis using smart monitoring systems. Fuzzy logic-based expert systems, which can mimic human thought processes in complex circumstances, have indicated potential to improve clinicians' performance and accurately execute repetitive tasks to which humans are ill-suited. The main goal of this study is to develop a clinically useful diagnostic alarm system based on fuzzy logic for detecting critical events during anaesthesia administration. The proposed diagnostic alarm system called fuzzy logic monitoring system (FLMS) is presented. New diagnostic rules and membership functions (MFs) are developed. In addition, fuzzy inference system (FIS), adaptive neuro fuzzy inference system (ANFIS), and clustering techniques are explored for developing the FLMS' diagnostic modules. The performance of FLMS which is based on fuzzy logic expert diagnostic systems is validated through a series of off-line tests. The training and testing data set are selected randomly from 30 sets of patients' data. The accuracy of diagnoses generated by the FLMS was validated by comparing the diagnostic information with the one provided by an anaesthetist for each patient. Kappa-analysis was used for measuring the level of agreement between the anaesthetist's and FLMS's diagnoses. When detecting hypovolaemia, a substantial level of agreement was observed between FLMS and the human expert (the anaesthetist) during surgical procedures. The diagnostic alarm system FLMS demonstrated that evidence-based expert diagnostic systems can diagnose hypovolaemia, with a substantial degree of accuracy, in anaesthetized patients and could be useful in delivering decision support to anaesthetists.
Conceptual Modeling via Logic Programming
1990-01-01
interfaces. nism which does not depend on Unix file The object-oriented nature of ProWIN- descriptors. One of the significant problems DOWS (which...Sweet, to CLOS. Reading, Mass.: Addison-Wesley, "Evaluating Alternative Air Defense 1988. Architectures," Signal, January 1987. Kernighan , B., and D...and sity of Waterloo, 1977. Sons, 1988. Robinson, J., "A Machine-Oriented Logic Unix Interface Overview. Mountain View, Based on the Resolution
Skelton, R M
1995-04-01
This paper introduces the reader to modern logic, more particularly the branch of logic called 'Model Theory', which is extensively used by Bion. Logic today is no longer described as the study of 'valid inference', but rather by the notion of consistency of beliefs. This central concern of the logician with consistency is also seen to be that of the psychoanalyst when he aims for eventual resolution of conflict between a patient's contradictory beliefs. Models are explained as the use of the already familiar to explain the unfamiliar, as when, for example, we invoke our familiar planetary system to understand the complex structure of the atom. In psychoanalysis we seek to find the old childhood models underpinning a patient's contemporary model of himself and others. Thus both Model Theory and psychoanalysis are interested in how we 'see the new in terms of the old'. Finally, the creation of models is assimilated to the integrative tendency of depressive activity and the dissolving or collapsing of models linked to paranoid-schizoid activity. As these two processes in the individual are linked by Bion we can see human beings as continually oscillating between creating and destroying models of their inner and outer worlds.
Cosmic logic: a computational model
Vanchurin, Vitaly
2016-02-01
We initiate a formal study of logical inferences in context of the measure problem in cosmology or what we call cosmic logic. We describe a simple computational model of cosmic logic suitable for analysis of, for example, discretized cosmological systems. The construction is based on a particular model of computation, developed by Alan Turing, with cosmic observers (CO), cosmic measures (CM) and cosmic symmetries (CS) described by Turing machines. CO machines always start with a blank tape and CM machines take CO's Turing number (also known as description number or Gödel number) as input and output the corresponding probability. Similarly, CS machines take CO's Turing number as input, but output either one if the CO machines are in the same equivalence class or zero otherwise. We argue that CS machines are more fundamental than CM machines and, thus, should be used as building blocks in constructing CM machines. We prove the non-computability of a CS machine which discriminates between two classes of CO machines: mortal that halts in finite time and immortal that runs forever. In context of eternal inflation this result implies that it is impossible to construct CM machines to compute probabilities on the set of all CO machines using cut-off prescriptions. The cut-off measures can still be used if the set is reduced to include only machines which halt after a finite and predetermined number of steps.
Kramer, Simon
2012-01-01
We propose a logic of interactive proofs as the first and main step towards an intuitionistic foundation for interactive computation to be obtained via an interactive analog of the G\\"odel-Kolmogorov-Art\\"emov definition of intuitionistic logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs effectuate a persistent epistemic impact in their intended communities of peer reviewers that consists in the induction of the (propositional) knowledge of their proof goal by means of the (individual) knowledge of the proof with the interpreting reviewer. That is, interactive proofs effectuate a transfer of propositional knowledge---(to-be-)known facts---via the transfer of certain individual knowledge---(to-be-)known proofs---in distributed and multi-agent systems. In other words, we as a community can have the formal common knowledge that a proof is that which if known to one of our peer members would induce...
MEMS Logic Using Mixed-Frequency Excitation
Ilyas, Saad
2017-06-22
We present multi-function microelectromechanical systems (MEMS) logic device that can perform the fundamental logic gate AND, OR, universal logic gates NAND, NOR, and a tristate logic gate using mixed-frequency excitation. The concept is based on exciting combination resonances due to the mixing of two or more input signals. The device vibrates at two steady states: a high state when the combination resonance is activated and a low state when no resonance is activated. These vibration states are assigned to logical value 1 or 0 to realize the logic gates. Using ac signals to drive the resonator and to execute the logic inputs unifies the input and output wave forms of the logic device, thereby opening the possibility for cascading among logic devices. We found that the energy consumption per cycle of the proposed logic resonator is higher than those of existing technologies. Hence, integration of such logic devices to build complex computational system needs to take into consideration lowering the total energy consumption. [2017-0041
Reversible Logic Elements with Memory and Their Universality
Directory of Open Access Journals (Sweden)
Kenichi Morita
2013-09-01
Full Text Available Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM, which can be used to build reversible computing systems, and their universality. An RLEM is called universal, if any reversible sequential machine (RSM can be realized as a circuit composed only of it. Since a finite-state control and a tape cell of a reversible Turing machine (RTM are formalized as RSMs, any RTM can be constructed from a universal RLEM. Here, we investigate 2-state RLEMs, and show that infinitely many kinds of non-degenerate RLEMs are all universal besides only four exceptions. Non-universality of these exceptional RLEMs is also argued.
Parallel transport quantum logic gates with trapped ions
de Clercq, Ludwig; Marinelli, Matteo; Nadlinger, David; Oswald, Robin; Negnevitsky, Vlad; Kienzler, Daniel; Keitch, Ben; Home, Jonathan P
2015-01-01
Quantum information processing will require combinations of gate operations and communication, with each applied in parallel to large numbers of quantum systems. These tasks are often performed sequentially, with gates implemented by pulsed fields and information transported either by moving the physical qubits or using photonic links. For trapped ions, an alternative approach is to implement quantum logic gates by transporting the ions through static laser beams, combining qubit operations with transport. This has significant advantages for scalability since the voltage waveforms required for transport can potentially be generated using micro-electronics integrated into the trap structure itself, while both optical and microwave control elements are significantly more bulky. Using a multi-zone ion trap, we demonstrate transport gates on a qubit encoded in the hyperfine structure of a beryllium ion. We show the ability to perform sequences of operations, and to perform parallel gates on two ions transported t...
Interpolation Methods for Dunn Logics and Their Extensions
S. Wintein (Stefan); Muskens, R. (Reinhard)
2017-01-01
textabstractThe semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these
The open logic and its relation to circumscription
Institute of Scientific and Technical Information of China (English)
林作铨; 李未
1999-01-01
The open logic is defined by model theory which can be viewed as a process-based nonmonotonic logic. Some new notions and results of open logic are introduced. The relation of open logic to circumscription is studied, and the relationship between open logic and other nonmonotonic logics is pointed out as well.
Introduction to fuzzy logic using Matlab
Sivanandam, SN; Deepa, S N
2006-01-01
Fuzzy Logic, at present is a hot topic, among academicians as well various programmers. This book is provided to give a broad, in-depth overview of the field of Fuzzy Logic. The basic principles of Fuzzy Logic are discussed in detail with various solved examples. The different approaches and solutions to the problems given in the book are well balanced and pertinent to the Fuzzy Logic research projects. The applications of Fuzzy Logic are also dealt to make the readers understand the concept of Fuzzy Logic. The solutions to the problems are programmed using MATLAB 6.0 and the simulated results are given. The MATLAB Fuzzy Logic toolbox is provided for easy reference.
All-photonic multifunctional molecular logic device.
Andréasson, Joakim; Pischel, Uwe; Straight, Stephen D; Moore, Thomas A; Moore, Ana L; Gust, Devens
2011-08-03
Photochromes are photoswitchable, bistable chromophores which, like transistors, can implement binary logic operations. When several photochromes are combined in one molecule, interactions between them such as energy and electron transfer allow design of simple Boolean logic gates and more complex logic devices with all-photonic inputs and outputs. Selective isomerization of individual photochromes can be achieved using light of different wavelengths, and logic outputs can employ absorption and emission properties at different wavelengths, thus allowing a single molecular species to perform several different functions, even simultaneously. Here, we report a molecule consisting of three linked photochromes that can be configured as AND, XOR, INH, half-adder, half-subtractor, multiplexer, demultiplexer, encoder, decoder, keypad lock, and logically reversible transfer gate logic devices, all with a common initial state. The system demonstrates the advantages of light-responsive molecules as multifunctional, reconfigurable nanoscale logic devices that represent an approach to true molecular information processing units.
Strong Completeness of Coalgebraic Modal Logics
Schröder, Lutz
2009-01-01
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics often present subtle difficulties - up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a generic canonical model construction in the semantic framework of coalgebraic modal logic, which pinpoints coherence conditions between syntax and semantics of modal logics that guarantee strong completeness. We apply this method to reconstruct canonical model theorems that are either known or folklore, and moreover instantiate our method to obtain new strong completeness results. In particular, we prove strong completeness of graded modal logic with finite multiplicities, and of the modal logic of exact probabilities.
Properties of Measure-based Fuzzy Logic
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Measure-based fuzzy logic, which is constructed on the basis of eight axioms, is a seemingly powerful fuzzy logic. It possesses several remarkable properties. (1) It is an extended Boolean logic, satisfying all the properties of Boolean algebra, including the law of excluded middle and the law of contradiction. (2) It is conditional. Conditional membership functions play an important role in this logic. (3) The negation operator is not independently defined with the conjunction and disjunction operators, but on the contrary, it is derived from them. (4) Zadehs fuzzy logic is included in it as a particular case. (5) It gives more hints to the relationship between fuzzy logic and probability logic.
Probabilistic Dynamic Logic of Phenomena and Cognition
Vityaev, Evgenii; Perlovsky, Leonid; Smerdov, Stanislav
2011-01-01
The purpose of this paper is to develop further the main concepts of Phenomena Dynamic Logic (P-DL) and Cognitive Dynamic Logic (C-DL), presented in the previous paper. The specific character of these logics is in matching vagueness or fuzziness of similarity measures to the uncertainty of models. These logics are based on the following fundamental notions: generality relation, uncertainty relation, simplicity relation, similarity maximization problem with empirical content and enhancement (learning) operator. We develop these notions in terms of logic and probability and developed a Probabilistic Dynamic Logic of Phenomena and Cognition (P-DL-PC) that relates to the scope of probabilistic models of brain. In our research the effectiveness of suggested formalization is demonstrated by approximation of the expert model of breast cancer diagnostic decisions. The P-DL-PC logic was previously successfully applied to solving many practical tasks and also for modelling of some cognitive processes.
Lukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems
Directory of Open Access Journals (Sweden)
James F. Glazebrook
2010-06-01
Full Text Available The fundamentals of Lukasiewicz-Moisil logic algebras and their applications to complex genetic network dynamics and highly complex systems are presented in the context of a categorical ontology theory of levels, Medical Bioinformatics and self-organizing, highly complex systems. Quantum Automata were defined in refs.[2] and [3] as generalized, probabilistic automata with quantum state spaces [1]. Their next-state functions operate through transitions between quantum states defined by the quantum equations of motions in the SchrÄodinger representation, with both initial and boundary conditions in space-time. A new theorem is proven which states that the category of quantum automata and automata-homomorphisms has both limits and colimits. Therefore, both categories of quantum automata and classical automata (sequential machines are bicomplete. A second new theorem establishes that the standard automata category is a subcategory of the quantum automata category. The quantum automata category has a faithful representation in the category of Generalized (M,R-Systems which are open, dynamic biosystem networks [4] with de¯ned biological relations that represent physiological functions of primordial(s, single cells and the simpler organisms. A new category of quantum computers is also defined in terms of reversible quantum automata with quantum state spaces represented by topological groupoids that admit a local characterization through unique, quantum Lie algebroids. On the other hand, the category of n-Lukasiewicz algebras has a subcategory of centered n-Lukasiewicz algebras (as proven in ref. [2] which can be employed to design and construct subcategories of quantum automata based on n-Lukasiewicz diagrams of existing VLSI. Furthermore, as shown in ref. [2] the category of centered n-Lukasiewicz algebras and the category of Boolean algebras are naturally equivalent. A `no-go' conjecture is also proposed which states that Generalized (M
The logic of relations and the logic of management.
Buntinx, W
2008-07-01
Increasing emphasis on financial and administrative control processes is affecting service culture in support organisations for persons with intellectual disability. This phenomenon is currently obvious in Dutch service organisations that find themselves in transition towards more community care and at the same time under pressure from new administrative and funding managerial bureaucracy. As a result, the logic of management is becoming more dominant in direct support settings and risk to overshadow the logic of relationships between staff and clients. The article presents a reflection on this phenomenon, starting from a description of service team characteristics as found in the literature. Next, findings about direct support staff (DSS) continuity are summarised from four Dutch studies. Following up these findings, the concept of 'microsystems' is explored as a possible answer to the organisational challenges demonstrated in the studies. Team characteristics, especially team size and membership continuity for DSS, appear relevant factors for assuring supportive relationships and service quality in direct support teams. The structure of the primary support team shows to be of special interest. The organisational concept of 'microsystems' is explored with respect to transcending the present conflict between bureaucratic managerial pressure and the need for supportive relationships. Service organisations need to create structural conditions for the efficacy of direct support teams in terms of client relationships and relevant client outcomes. At the same time, the need for administrative and control processes can not be denied. The concept of 'microsystems', application of a Quality of Life framework and the use of new instruments, such as the Supports Intensity Scale, can contribute to an organisational solution for the present conflicting logic of relations and management.
Serial DNA relay in DNA logic gates by electrical fusion and mechanical splitting of droplets
Kawano, Ryuji; Takinoue, Masahiro; Osaki, Toshihisa; Kamiya, Koki; Miki, Norihisa
2017-01-01
DNA logic circuits utilizing DNA hybridization and/or enzymatic reactions have drawn increasing attention for their potential applications in the diagnosis and treatment of cellular diseases. The compartmentalization of such a system into a microdroplet considerably helps to precisely regulate local interactions and reactions between molecules. In this study, we introduced a relay approach for enabling the transfer of DNA from one droplet to another to implement multi-step sequential logic operations. We proposed electrical fusion and mechanical splitting of droplets to facilitate the DNA flow at the inputs, logic operation, output, and serial connection between two logic gates. We developed Negative-OR operations integrated by a serial connection of the OR gate and NOT gate incorporated in a series of droplets. The four types of input defined by the presence/absence of DNA in the input droplet pair were correctly reflected in the readout at the Negative-OR gate. The proposed approach potentially allows for serial and parallel logic operations that could be used for complex diagnostic applications. PMID:28700641
Rhee, Minsoung; Burns, Mark A
2009-11-07
We have developed pneumatic logic circuits and microprocessors built with microfluidic channels and valves in polydimethylsiloxane (PDMS). The pneumatic logic circuits perform various combinational and sequential logic calculations with binary pneumatic signals (atmosphere and vacuum), producing cascadable outputs based on Boolean operations. A complex microprocessor is constructed from combinations of various logic circuits and receives pneumatically encoded serial commands at a single input line. The device then decodes the temporal command sequence by spatial parallelization, computes necessary logic calculations between parallelized command bits, stores command information for signal transportation and maintenance, and finally executes the command for the target devices. Thus, such pneumatic microprocessors will function as a universal on-chip control platform to perform complex parallel operations for large-scale integrated microfluidic devices. To demonstrate the working principles, we have built 2-bit, 3-bit, 4-bit, and 8-bit microprocessors to control various target devices for applications such as four color dye mixing, and multiplexed channel fluidic control. By significantly reducing the need for external controllers, the digital pneumatic microprocessor can be used as a universal on-chip platform to autonomously manipulate microfluids in a high throughput manner.
Logic synthesis strategy based on BDD decomposition and PAL-oriented optimization
Opara, Adam; Kania, Dariusz
2015-12-01
A new strategy of logic synthesis for PAL-based CPLDs is presented in the paper. This approach consists of an original method of two-stage BDD-based decomposition and a two-level PAL-oriented optimization. The aim of the proposed approach is oriented towards balanced (speed/area) optimization. The first element of the strategy is original PAL-oriented decomposition. This decomposition consists in the sequential search for an input partition providing the feasibility for implementation of the free block in one PAL-based logic block containing a predefined number of product terms. The presented non-standard decomposition provides a means to minimize the area of the implemented circuit and to reduce of the necessary logic blocks in the programmable structure. The second element of the proposed logic synthesis strategy is oriented towards speed optimization. This optimization is based on utilizing tri-state buffers. Results of experiments prove that the presented synthesis strategy is especially effective for CPLD structures, which consist of PAL-based logic blocks containing a low number of product terms.
Logic Gate Operation by DNA Translocation through Biological Nanopores.
Directory of Open Access Journals (Sweden)
Hiroki Yasuga
Full Text Available Logical operations using biological molecules, such as DNA computing or programmable diagnosis using DNA, have recently received attention. Challenges remain with respect to the development of such systems, including label-free output detection and the rapidity of operation. Here, we propose integration of biological nanopores with DNA molecules for development of a logical operating system. We configured outputs "1" and "0" as single-stranded DNA (ssDNA that is or is not translocated through a nanopore; unlabeled DNA was detected electrically. A negative-AND (NAND operation was successfully conducted within approximately 10 min, which is rapid compared with previous studies using unlabeled DNA. In addition, this operation was executed in a four-droplet network. DNA molecules and associated information were transferred among droplets via biological nanopores. This system would facilitate linking of molecules and electronic interfaces. Thus, it could be applied to molecular robotics, genetic engineering, and even medical diagnosis and treatment.
Fuzzy Logic in Traffic Engineering: A Review on Signal Control
Directory of Open Access Journals (Sweden)
Milan Koukol
2015-01-01
Full Text Available Since 1965 when the fuzzy logic and fuzzy algebra were introduced by Lotfi Zadeh, the fuzzy theory successfully found its applications in the wide range of subject fields. This is mainly due to its ability to process various data, including vague or uncertain data, and provide results that are suitable for the decision making. This paper aims to provide comprehensive overview of literature on fuzzy control systems used for the management of the road traffic flow at road junctions. Several theoretical approaches from basic fuzzy models from the late 1970s to most recent combinations of real-time data with fuzzy inference system and genetic algorithms are mentioned and discussed throughout the paper. In most cases, fuzzy logic controllers provide considerable improvements in the efficiency of traffic junctions’ management.
Structural features of sequential weak measurements
Diósi, Lajos
2016-07-01
We discuss the abstract structure of sequential weak measurement (WM) of general observables. In all orders, the sequential WM correlations without postselection yield the corresponding correlations of the Wigner function, offering direct quantum tomography through the moments of the canonical variables. Correlations in spin-1/2 sequential weak measurements coincide with those in strong measurements, they are constrained kinematically, and they are equivalent with single measurements. In sequential WMs with postselection, an anomaly occurs, different from the weak value anomaly of single WMs. In particular, the spread of polarization σ ̂ as measured in double WMs of σ ̂ will diverge for certain orthogonal pre- and postselected states.
Institute of Scientific and Technical Information of China (English)
申晓宁; 李涛; 张敏
2011-01-01
In order to solve the difficulty for users to select from many non-dominated solutions in multi-objective optimization, a multi-objective genetic algorithm incorporating preference information of the decision maker interactively is proposed. The algorithm makes use of a new nine-scale evaluation method to convert the linguistic preferences expressed by the decision maker to importance factors of objectives. A new outranking relation called "strength superior" which is based on the preference information is constructed via a fuzzy inference system to compare individuals instead of the commonly used "Pareto dominance" relation. The computational complexity of the algorithm is analyzed theoretically, and its ability to handle preference information is validated through simulation. Comparisons to two classical multi-objective genetic algorithms indicate that the proposed algorithm can search better solutions.%针对多目标优化存在多个非支配解、用户难以挑选的问题,该文提出一种交互式引入决策者偏好信息的多目标遗传算法.该算法使用一种新型的九级标度赋值法把决策者通过语言表达的偏好信息量化为各目标的重要性因子,采用模糊推理系统构造一种基于偏好信息的"强度优于"关系替代常规的"Pareto支配"关系,以比较个体之间的优劣.对算法的计算复杂度进行了理论分析.仿真实验表明,该算法具有实时处理偏好信息的能力,与2种经典多目标遗传算法相比,该算法能够搜索到质量更优的解.
Immediate Sequential Bilateral Cataract Surgery
DEFF Research Database (Denmark)
Kessel, Line; Andresen, Jens; Erngaard, Ditte
2015-01-01
The aim of the present systematic review was to examine the benefits and harms associated with immediate sequential bilateral cataract surgery (ISBCS) with specific emphasis on the rate of complications, postoperative anisometropia, and subjective visual function in order to formulate evidence......-based national Danish guidelines for cataract surgery. A systematic literature review in PubMed, Embase, and Cochrane central databases identified three randomized controlled trials that compared outcome in patients randomized to ISBCS or bilateral cataract surgery on two different dates. Meta-analyses were...... performed using the Cochrane Review Manager software. The quality of the evidence was assessed using the GRADE method (Grading of Recommendation, Assessment, Development, and Evaluation). We did not find any difference in the risk of complications or visual outcome in patients randomized to ISBCS or surgery...
Rethinking Service Companies’ Business Logic: Do We Need a Customer-Dominant Logic as a Guideline?
Heinonen, kristina; Strandvik, Tore; Mickelsson, Karl-Jacob; Edvardsson, Bo; Sundström, Erik; Andersson, Per
2009-01-01
Purpose –This paper explores and expands the roles of customers and companies in creating value by introducing a new a customer-based approach to service. The customer’s logic is examined as being the foundation of a customer-based marketing and business logic. Design/methodology/approach – The authors argue that both goods-dominant logics and service-dominant logics are provider-dominant. Contrasting the customer-dominant logic with provider-dominant logics, the paper examines the creation o...
Complete all-optical processing polarization-based binary logic gates and optical processors.
Zaghloul, Y A; Zaghloul, A R M
2006-10-16
-input gates, and sequential and non-sequential Boolean expressions are presented and discussed. The operation of each design is simply understood by a bullet train traveling at the speed of light on a railroad system preconditioned by the crossover states predetermined by the control inputs. The presented designs allow for optical processing of the information eliminating the need to convert it, back and forth, to an electronic signal for processing purposes. All gates with a truth table, including for example Fredkin, Toffoli, testable reversible logic, and threshold logic gates, can be designed and implemented using the railroad architecture. That includes any future gates not known today. Those designs and the quantum gates are not discussed in this paper.
Contributions to Logical Database Design
Directory of Open Access Journals (Sweden)
Vitalie COTELEA
2012-01-01
Full Text Available This paper treats the problems arising at the stage of logical database design. It comprises a synthesis of the most common inference models of functional dependencies, deals with the problems of building covers for sets of functional dependencies, makes a synthesizes of normal forms, presents trends regarding normalization algorithms and provides a temporal complexity of those. In addition, it presents a summary of the most known keys’ search algorithms, deals with issues of analysis and testing of relational schemes. It also summarizes and compares the different features of recognition of acyclic database schemas.
Logical inferences in discourse analysis
Institute of Scientific and Technical Information of China (English)
刘峰廷
2014-01-01
Cohesion and coherence are two important characteristics of discourses. Halliday and Hasan have pointed out that cohesion is the basis of coherence and coherence is the premise of forming discourse. The commonly used cohesive devices are: preference, ellipsis, substitution, etc. Discourse coherence is mainly manifested in sentences and paragraphs. However, in real discourse analysis environment, traditional methods on cohesion and coherence are not enough. This article talks about the conception of discourse analysis at the beginning. Then, we list some of the traditional cohesive devices and its uses. Following that, we make corpus analysis. Finally, we explore and find a new device in textual analysis:discourse logical inferences.
Universal Algebra and Mathematical Logic
Luo, Zhaohua
2011-01-01
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of parameters in a standard way. The free right algebra F(L, C) of formulas over T(L, C) is then generated by atomic formulas. Structures for L over C are represented as perfect valuations of F(L, C), and theories of L are represented as filters of F(L). Finally Godel's completeness theorem and first incompleteness theorem are stated as expected.
Klein, Moshe; Maimon, Oded
2016-11-01
We strive to understand, by using mathematical tools, the phenomena where the observer can interpret simultaneously opposite situations, such as the distinct interpretations of the Necker cube. In this study we present a new coordinate system that draws a distinction between -0 and +0. The central theorem presented here postulates that when divisions and multiplications of 0 are combined with real numbers, the Mobius strip provides a model for non-standard analysis. We also suggest that the axis 0 is the fifth dimension extension of the quaternions. We also propose to add the soft logic capability to humanoid type robots, as a way to overcome the Turing test.
Directory of Open Access Journals (Sweden)
P. Senthil Kumar
2015-07-01
Full Text Available We hypothesized that the free cortisol response to waking, believed to be genetically influenced, would be elevated in a significant percent age of cases, regard less of the afternoon Dexamethasone Suppression Test (DST value based on high-order fuzzy logical relationships. First, the proposed method fuzzifies the historical data into fuzzy sets to form high-order fuzzy logical relationships. Then, it calculates the value of the variable between the subscripts of adjacent fuzzy sets appearing in the antecedents of high-order fuzzy logical relationships. Finally, it chooses a modified high-order fuzzy logical relationships group to forecast the free cortisol response to walking and the short day time profile using various mean techniques like, Arithmetic Mean, Geometric Mean, Heronian Mean, Root Mean Square and Harmonic Mean.
5th World Congress of Paraconsistent Logic
Chakraborty, Mihir; Dutta, Soma
2015-01-01
The present book discusses all aspects of paraconsistent logic, including the latest findings, and its various systems. It includes papers by leading international researchers, which address the subject in many different ways: development of abstract paraconsistent systems and new theorems about them; studies of the connections between these systems and other non-classical logics, such as non-monotonic, many-valued, relevant, paracomplete and fuzzy logics; philosophical interpretations of these constructions; and applications to other sciences, in particular quantum physics and mathematics. Reasoning with contradictions is the challenge of paraconsistent logic. The book will be of interest to graduate students and researchers working in mathematical logic, computer science, philosophical logic, linguistics and physics.