Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

Science.gov (United States)

Rosu, Grigore; Havelund, Klaus

2001-01-01

The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.

Predicting recycling behaviour: Comparison of a linear regression model and a fuzzy logic model.

Science.gov (United States)

Vesely, Stepan; Klöckner, Christian A; Dohnal, Mirko

2016-03-01

In this paper we demonstrate that fuzzy logic can provide a better tool for predicting recycling behaviour than the customarily used linear regression. To show this, we take a set of empirical data on recycling behaviour (N=664), which we randomly divide into two halves. The first half is used to estimate a linear regression model of recycling behaviour, and to develop a fuzzy logic model of recycling behaviour. As the first comparison, the fit of both models to the data included in estimation of the models (N=332) is evaluated. As the second comparison, predictive accuracy of both models for "new" cases (hold-out data not included in building the models, N=332) is assessed. In both cases, the fuzzy logic model significantly outperforms the regression model in terms of fit. To conclude, when accurate predictions of recycling and possibly other environmental behaviours are needed, fuzzy logic modelling seems to be a promising technique. Copyright © 2015 Elsevier Ltd. All rights reserved.

Was Ugo Foscolo (1778-1827) affected by alpha-1 antitrypsin deficiency?

Science.gov (United States)

Perciaccante, A; Negri, C; Coralli, A; Charlier, P; Appenzeller, O; Bianucci, R

2018-02-01

Niccolò Ugo Foscolo (1778-1827), known as Ugo, is one of the masters of the Italian poetry. A writer and a revolutionary, he embraced the ideals of the French Revolution and took part in the stormy political discussions, which the fall of the Republic of Venice had provoked. Despite his poor health, Foscolo lived an adventurous life serving as a volunteer in the Guardia Nazionale and in the Napoleonic army. Following Napoleon's fall (1814), he went into voluntary exile in early 1815. He reached London in Sept. 1816 and lived in poverty at Turnham Green (Chiswick) until his premature death. Foscolo's medical history has been poorly investigated and the cause of his death remains unclear. In an attempt to shed light on his clinical history, we analyzed his Correspondence (Epistolario), a series of more than 3000 letters written between 1794 and 1827. From the age of 26 (1808), Foscolo had frequent episodes of cough and dyspnea that progressively worsened. Four acute respiratory exacerbations occurred in 1812. Between September 1812 and April 1813, he had breathlessness as that of asthma. Frail and ailing, he developed a chronic liver disease in 1826. In August 1827, weakness, dyspepsia and drowsiness further increased and dropsy became manifest. He went into coma on September 7, 1827 and died aged 49 three days later. Based on a brief history of urethritis and urinary obstructions (1811-1812), previous scholars have suggested that Foscolo had urethral stenosis that caused a chronic bladder outlet obstruction and led to consequent renal failure. This hypothesis, however, does not mention the respiratory symptomatology present since 1804, which is a pivotal feature of Foscolo's illness. We surmise that Foscolo suffered from alpha-1 anti trypsin (AAT) deficiency, a rare genetic disease, which caused his premature death and support our interpretation with documental evidence. Copyright © 2017 Elsevier Ltd. All rights reserved.

Experimental investigation of a four-qubit linear-optical quantum logic circuit.

Science.gov (United States)

Stárek, R; Mičuda, M; Miková, M; Straka, I; Dušek, M; Ježek, M; Fiurášek, J

2016-09-20

We experimentally demonstrate and characterize a four-qubit linear-optical quantum logic circuit. Our robust and versatile scheme exploits encoding of two qubits into polarization and path degrees of single photons and involves two crossed inherently stable interferometers. This approach allows us to design a complex quantum logic circuit that combines a genuine four-qubit C(3)Z gate and several two-qubit and single-qubit gates. The C(3)Z gate introduces a sign flip if and only if all four qubits are in the computational state |1〉. We verify high-fidelity performance of this central four-qubit gate using Hofmann bounds on quantum gate fidelity and Monte Carlo fidelity sampling. We also experimentally demonstrate that the quantum logic circuit can generate genuine multipartite entanglement and we certify the entanglement with the use of suitably tailored entanglement witnesses.

Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings

DEFF Research Database (Denmark)

Bresolin, Davide; Della Monica, Dario; Goranko, Valentin

2010-01-01

. Still, decidability is the rule for the fragments of HS with only one modal operator, based on an Allen’s relation. In this paper, we show that the logic O of the Overlap relation, when interpreted over discrete linear orderings, is an exception. The proof is based on a reduction from the undecidable...

Linear Time Logics around PSL: Complexity, Expressiveness, and a little bit of Succinctness

DEFF Research Database (Denmark)

Lange, Martin

2007-01-01

We consider linear time temporal logic enriched with semi-extended regular expressions through various operators that have been proposed in the literature, in particular in Accelera's Property Specification Language. We obtain results about the expressive power of fragments of this logic when...... restricted to certain operators only: basically, all operators alone suffice for expressive completeness w.r.t.\\ omega-regular expressions, just the closure operator is too weak. We also obtain complexity results. Again, almost all operators alone suffice for EXPSPACE-completeness, just the closure operator...

Ritorno al futuro: memorie, orizzonti e riflessi dell'antropologia. Intervista a Ugo Fabietti

Directory of Open Access Journals (Sweden)

Alfonso Romaniello

2012-01-01

Full Text Available Abstract – IT Più che un’intervista, un incontro/discussione con una delle figure più autorevoli dell’antropologia italiana, il Prof. Ugo Fabietti. Le sue parole, oltre che offrirci notevoli spunti di riflessione su cosa sia e come debba orientarsi oggi l’antropologia, ci accompagnano in un percorso dove riemergono le radici stesse della disciplina: il viaggio, l’incontro con l’alterità culturale, l’epochè, la ricerca sul campo, il relativismo. Uno sguardo sui fondamenti teorici della disciplina, ma anche sulle sue prospettive di applicazione, sul suo riconoscimento sociale ed istituzionale. Il Professor Fabietti, presentandoci l’antropologia come “un mestiere solitario”, ci racconta con passione la ricchezza e gli strumenti che derivano “dall’incontro con l’altro”, e lo fa in un condensato di teoria ed esperienza…che è poi l’humus della disciplina stessa. Abstract – EN More than an interview, this is a meeting/discussion with one of the most important figures of Italian anthropology, Professor Ugo Fabietti. His words offer innumerable points of reflection about what anthropology is, and the direction it should take. They also accompany us along a path in which the roots of anthropology themselves re-emerge: travel, encountering cultural otherness, epochè, fieldwork and relativism. He provides a look at the theoretical structure of the discipline and also its potential applications, at its social and institutional recognition. Professor Fabietti, presenting anthropology as “solitary knowledge”, details with passion the richness and the instruments deriving “from the meeting with the other”. He presents it in an essence of theory and experience… which is after all the quintessence of anthropology itself.

CERN Library | Michael Dittmar presents "Extracted: How the Quest for Mineral Wealth Is Plundering the Planet" by Ugo Bardi (et al.) | 24 July

CERN Multimedia

2014-01-01

As we dig, drill and excavate to unearth the planet’s mineral bounty, the resources we exploit from ores, veins, seams and wells are gradually becoming exhausted. Mineral treasures that took millions, or even billions, of years to form are now being squandered in just centuries—or sometimes just decades.   Extracted: How the Quest for Mineral Wealth Is Plundering the Planet, by Ugo Bardi et al., Chelsea Green Publishing, 2014, ISBN 9781603585415. Will there come a time when we actually run out of minerals? Debates already soar over how we are going to obtain energy without oil, coal and gas. But what about the other mineral losses we face? Without metals, and semiconductors, how are we going to keep our industrial system running? Without mineral fertilisers and fuels, how are we going to produce the food we need? Ugo Bardi delivers a sweeping history of the mining industry, starting with its humble beginning when our early ancestors started digging underground to find the st...

In memorium: Ugo Fano (1912-2001)

International Nuclear Information System (INIS)

Inokuti, M.

2001-01-01

With the passing of Ugo Fano on 13 February 2001, the Radiation Research Society lost an influential founding member. A broader community dearly misses a great theoretical physicist. Ugo Fano was born a son of Rosa Cassin and Gino Fano (1871-1952), professor of mathematics at Turin, Italy, specializing in differential geometry. Having studied mathematics first at the University of Turin, the younger Fano turned to physics under the influence of his cousin, Giulio Racah (1909-1965), a physicist known for the powerful theory of angular momentum. Then Fano was fortunate to receive postdoctoral training from two giants in modern physics: Enrico Fermi at Rome in 1934-1936 and Werner Heisenberg at Leipzig in 1936-1937. Fano's American career began with pioneering work in 1940-1944 in what was later to be called radiation biology with M. Demerec and others at the Department of Genetics of the Carnegie Institution at Cold Spring Harbor. It is noteworthy that, after a seminar in Rome by P. Jordan on the effects of X rays on genetic material, Fermi had suggested to Fano that the biological action of radiation would be an important and suitable topic for study. Fano's papers in this period concerned chromosomal rearrangements, mutations, lethal effects, and genetic effects of X rays and neutrons on Drosophila melanogaster, as well as theoretical analysis of genetic data. His work also included the discovery of bacteriophage-resistant mutants in Escherichia coli, following up earlier studies by Salvador E. Luria. After a wartime effort at the U.S. Army Ballistic Research Laboratory in 1944-1945, Fano joined the staff of the National Bureau of Standards in 1946. Fano's two decades at NBS saw prolific and outstanding contributions to two major areas of research: radiation physics and the basic physics of atoms, molecules and condensed matter. Many of Fano's contributions to radiation physics are seminal to later developments. In 1946, he put forth the first general theory of the

Performance of Globally Linearized Controller and Two Region Fuzzy Logic Controller on a Nonlinear Process

Directory of Open Access Journals (Sweden)

N. Jaya

2008-10-01

Full Text Available In this work, a design and implementation of a Conventional PI controller, single region fuzzy logic controller, two region fuzzy logic controller and Globally Linearized Controller (GLC for a two capacity interacting nonlinear process is carried out. The performance of this process using single region FLC, two region FLC and GLC are compared with the performance of conventional PI controller about an operating point of 50 %. It has been observed that GLC and two region FLC provides better performance. Further, this procedure is also validated by real time experimentation using dSPACE.

Classical Mathematical Logic The Semantic Foundations of Logic

CERN Document Server

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

Microelectromechanical reprogrammable logic device

KAUST Repository

Hafiz, Md Abdullah Al; Kosuru, Lakshmoji; Younis, Mohammad I.

2016-01-01

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

Coherent quantum logic

International Nuclear Information System (INIS)

Finkelstein, D.

1987-01-01

The von Neumann quantum logic lacks two basic symmetries of classical logic, that between sets and classes, and that between lower and higher order predicates. Similarly, the structural parallel between the set algebra and linear algebra of Grassmann and Peano was left incomplete by them in two respects. In this work a linear algebra is constructed that completes this correspondence and is interpreted as a new quantum logic that restores these invariances, and as a quantum set theory. It applies to experiments with coherent quantum phase relations between the quantum and the apparatus. The quantum set theory is applied to model a Lorentz-invariant quantum time-space complex

Testing Linear Temporal Logic Formulae on Finite Execution Traces

Science.gov (United States)

Havelund, Klaus; Rosu, Grigore; Norvig, Peter (Technical Monitor)

2001-01-01

We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL. theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications. Such tests correspond to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property. We then suggest an optimized algorithm based on transforming LTL formulae. The work is done using the Maude rewriting system. which turns out to provide a perfect notation and an efficient rewriting engine for performing these experiments.

Talk | The impact of fundamental Physics on Medicine by Ugo Amaldi | 10 April

CERN Multimedia

2014-01-01

The impact of fundamental Physics on Medicine, by Ugo Amaldi, TERA Foundation and Technische Universität München.   Thursday 10 April 2014, at 7.30 p.m. Globe of Science and Innovation Route de Meyrin, 1211 Genève Talk in English with French translation. Abstract: It is clear to anybody who visits a hospital that Physics applications are everywhere. Medical doctors use Physics when they measure blood pressure, when they perform an ultrasound scan to determine the sex of an unborn child, when they take a radiography or a CT scan. Fundamental physics, which aims at understanding how particles and forces act in the subatomic world and are organized to form everything we observe around us, has numerous medical applications.  Everything started in 1895 with the discovery of X-rays by Röntgen, who was using the best particle accelerator of the time. In the lecture the theme of the title will be presented by following the 120 years long story of par...

THRESHOLD LOGIC IN ARTIFICIAL INTELLIGENCE

Science.gov (United States)

COMPUTER LOGIC, ARTIFICIAL INTELLIGENCE , BIONICS, GEOMETRY, INPUT OUTPUT DEVICES, LINEAR PROGRAMMING, MATHEMATICAL LOGIC, MATHEMATICAL PREDICTION, NETWORKS, PATTERN RECOGNITION, PROBABILITY, SWITCHING CIRCUITS, SYNTHESIS

Manipulating potential wells in Logical Stochastic Resonance to obtain XOR logic

International Nuclear Information System (INIS)

Storni, Remo; Ando, Hiroyasu; Aihara, Kazuyuki; Murali, K.; Sinha, Sudeshna

2012-01-01

Logical Stochastic Resonance (LSR) is the application of Stochastic Resonance to logic computation, namely the phenomenon where a nonlinear system driven by weak signals representing logic inputs, under optimal noise, can yield logic outputs. We extend the existing results, obtained in the context of bistable systems, to multi-stable dynamical systems, allowing us to obtain XOR logic, in addition to the AND (NAND) and OR (NOR) logic observed in earlier studies. This strategy widens the scope of LSR from the application point of view, as XOR forms the basis of ubiquitous bit-by-bit addition, and conceptually, showing the ability to yield non-monotonic input–output logic associations. -- Highlights: ► We generalize Logical Stochastic Resonance from bistable to multi-stable systems. ► We propose a tristable dynamical system formed of piecewise linear functions. ► The system can correctly reproduce XOR logic behavior using the LSR principle. ► The system yields different logic behavior without the need to change the dynamics.

ICTR-PHE Public Talk | Physics is beautiful and useful by Ugo Amaldi | 11 February

CERN Multimedia

2014-01-01

In the framework of the International Conference on Translational Research in Radiation Oncology – Physics for Health in Europe (ICTR-PHE, see here), which will take place at the Geneva International Conference Centre from 10 to 14 February 2014, the public is invited to attend an exceptional talk:   Physics is beautiful and useful by Ugo Amaldi Tuesday 11 February 2014, 6.30 p.m. Geneva International Conference Centre 17, rue de Varembé, Geneva *The talk will be in English with simultaneous translation into French* Abstract: The year 2014 marks the 60th anniversary of CERN and of the first cancer treatment with protons done at Berkeley. This is no coincidence: indeed, the beauty of particle physics has always gone hand in hand with useful applications. These “useful” activities follow from the technical developments in particle accelerators and radiation detectors that have brought about the discoveries of neutral currents (1973), of its mediator the...

A functional language for describing reversible logic

DEFF Research Database (Denmark)

Thomsen, Michael Kirkedal

2012-01-01

Reversible logic is a computational model where all gates are logically reversible and combined in circuits such that no values are lost or duplicated. This paper presents a novel functional language that is designed to describe only reversible logic circuits. The language includes high....... Reversibility of descriptions is guaranteed with a type system based on linear types. The language is applied to three examples of reversible computations (ALU, linear cosine transformation, and binary adder). The paper also outlines a design flow that ensures garbage- free translation to reversible logic...... circuits. The flow relies on a reversible combinator language as an intermediate language....

A multiplicity logic unit

International Nuclear Information System (INIS)

Bialkowski, J.; Moszynski, M.; Zagorski, A.

1981-01-01

The logic diagram principle of operation and some details of the design of the multiplicity logic unit are presented. This unit was specially designed to fulfil the requirements of a multidetector arrangement for gamma-ray multiplicity measurements. The unit is equipped with 16 inputs controlled by a common coincidence gate. It delivers a linear output pulse with the height proportional to the multiplicity of coincidences and logic pulses corresponding to 0, 1, ... up to >= 5-fold coincidences. These last outputs are used to steer the routing unit working with the multichannel analyser. (orig.)

A Current Logical Framework: The Propositional Fragment

National Research Council Canada - National Science Library

Watkins, Kevin

2003-01-01

We present the propositional fragment CLF of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language...

Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL

Directory of Open Access Journals (Sweden)

Martin Zimmermann

2015-09-01

Full Text Available We continue the investigation of parameterized extensions of Linear Temporal Logic (LTL that retain the attractive algorithmic properties of LTL: a polynomial space model checking algorithm and a doubly-exponential time algorithm for solving games. Alur et al. and Kupferman et al. showed that this is the case for Parametric LTL (PLTL and PROMPT-LTL respectively, which have temporal operators equipped with variables that bound their scope in time. Later, this was also shown to be true for Parametric LDL (PLDL, which extends PLTL to be able to express all omega-regular properties. Here, we generalize PLTL to systems with costs, i.e., we do not bound the scope of operators in time, but bound the scope in terms of the cost accumulated during time. Again, we show that model checking and solving games for specifications in PLTL with costs is not harder than the corresponding problems for LTL. Finally, we discuss PLDL with costs and extensions to multiple cost functions.

The dark side of Interval Temporal Logic: sharpening the undecidability border

DEFF Research Database (Denmark)

Bresolin, Davide; Monica, Dario Della; Goranko, Valentin

2011-01-01

on the class of models (in our case, the class of interval structures)in which it is interpreted. In this paper, we have identified several new minimal undecidable logics amongst the fragments of Halpern-Shoham logic HS, including the logic of the overlaps relation, over the classes of all and finite linear...... orders, as well as the logic of the meet and subinterval relations, over the class of dense linear orders. Together with previous undecid ability results, this work contributes to delineate the border of the dark side of interval temporal logics quite sharply....

Logic regression and its extensions.

Science.gov (United States)

Schwender, Holger; Ruczinski, Ingo

2010-01-01

Logic regression is an adaptive classification and regression procedure, initially developed to reveal interacting single nucleotide polymorphisms (SNPs) in genetic association studies. In general, this approach can be used in any setting with binary predictors, when the interaction of these covariates is of primary interest. Logic regression searches for Boolean (logic) combinations of binary variables that best explain the variability in the outcome variable, and thus, reveals variables and interactions that are associated with the response and/or have predictive capabilities. The logic expressions are embedded in a generalized linear regression framework, and thus, logic regression can handle a variety of outcome types, such as binary responses in case-control studies, numeric responses, and time-to-event data. In this chapter, we provide an introduction to the logic regression methodology, list some applications in public health and medicine, and summarize some of the direct extensions and modifications of logic regression that have been proposed in the literature. Copyright © 2010 Elsevier Inc. All rights reserved.

Microelectromechanical reprogrammable logic device

Science.gov (United States)

Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.

2016-01-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. PMID:27021295

Microelectromechanical reprogrammable logic device

KAUST Repository

Hafiz, Md Abdullah Al

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.

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.

Fuzzy Logic vs. Neutrosophic Logic: Operations Logic

Directory of Open Access Journals (Sweden)

Salah Bouzina

2016-12-01

Full Text Available The goal of this research is first to show how different, thorough, widespread and effective are the operations logic of the neutrosophic logic compared to the fuzzy logic’s operations logical. The second aim is to observe how a fully new logic, the neutrosophic logic, is established starting by changing the previous logical perspective fuzzy logic, and by changing that, we mean changing changing the truth values from the truth and falsity degrees membership in fuzzy logic, to the truth, falsity and indeterminacy degrees membership in neutrosophic logic; and thirdly, to observe that there is no limit to the logical discoveries - we only change the principle, then the system changes completely.

Bohrification of operator algebras and quantum logic

NARCIS (Netherlands)

Heunen, C.; Landsman, N.P.; Spitters, B.A.W.

2012-01-01

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by

Bohrification of operator algebras and quantum logic

NARCIS (Netherlands)

Heunen, C.; Landsman, N.P.; Spitters, B.A.W.

2009-01-01

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by

Linear contextual modal type theory

DEFF Research Database (Denmark)

Schack-Nielsen, Anders; Schürmann, Carsten

Abstract. When one implements a logical framework based on linear type theory, for example the Celf system [?], one is immediately con- fronted with questions about their equational theory and how to deal with logic variables. In this paper, we propose linear contextual modal type theory that gives...... a mathematical account of the nature of logic variables. Our type theory is conservative over intuitionistic contextual modal type theory proposed by Nanevski, Pfenning, and Pientka. Our main contributions include a mechanically checked proof of soundness and a working implementation....

Linear {GLP}-algebras and their elementary theories

Science.gov (United States)

Pakhomov, F. N.

2016-12-01

The polymodal provability logic {GLP} was introduced by Japaridze in 1986. It is the provability logic of certain chains of provability predicates of increasing strength. Every polymodal logic corresponds to a variety of polymodal algebras. Beklemishev and Visser asked whether the elementary theory of the free {GLP}-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable [1]. For every positive integer n we solve the corresponding question for the logics {GLP}_n that are the fragments of {GLP} with n modalities. We prove that the elementary theory of the free {GLP}_n-algebra generated by the constants \\mathbf{0}, \\mathbf{1} is decidable for all n. We introduce the notion of a linear {GLP}_n-algebra and prove that all free {GLP}_n-algebras generated by the constants \\mathbf{0}, \\mathbf{1} are linear. We also consider the more general case of the logics {GLP}_α whose modalities are indexed by the elements of a linearly ordered set α: we define the notion of a linear algebra and prove the latter result in this case.

Deskrypcja długości i szerokości stóp kobiet i mężczyzn w obciążeniu masą własną, w wieku od 4 do 18 lat w świetle mory projekcyjnej

Directory of Open Access Journals (Sweden)

Mirosław Mrozkowiak

2015-09-01

Mirosław Mrozkowiak   Uniwersytet Kazimierza Wielkiego, Instytut Kultury Fizycznej, Bydgoszcz e-mail: magmar54@interia.pl, strona: http://wadypostawy.republika.pl   Słowa kluczowe: długość i szerokość stopy.   Streszczenie   Wstęp. Długość i szerokość stopy to cechy, których przyśpieszony wzrost w okresie pokwitania pojawia się najwcześniej. U chłopców przypada na okres między 12,5 a13 r.ż., wg innych doniesień długość i szerokość stopy u chłopców wzrasta do 18 r.ż. Z wiekiem stopa zmienia się z szerokiej i krótkiej u noworodków, do pośredniej u dzieci starszych. Cel. Określenie przebiegu zmian średnich wartości długości i szerokości stóp, okresów gwałtownego wzrostu i spowolnienia przyrostu badanych parametrów w grupie dziewcząt i chłopców w wieku od 4 do 18 lat. Materiał i metodyka. Pomiarami długości i szerokości stóp objęto populację 9804 dziewcząt i 8699 chłopców w wieku od 4 do 18 lat, z losowo wybranych przedszkoli i szkół regionu warmińsko–mazurskiego. Do oceny wykorzystano stanowisko do komputerowej oceny postawy ciała, techniką mory projekcyjnej. Wyniki. Krzywa średnich wartości długości stóp obojga płci ma bardzo zbliżony przebieg  do wykresu właściwej płci. Krzywa rozpoczyna się wartością P: 168,2, L:168,22 mm, kończy P: 238,0, L:233,3 mm. W 14 r.ż. występuje obniżenie wartości do P: 214,68, L:209,91 mm. Szerokość posiada wartość początkową P: 62,99, L:64,92 mm, końcową P: 90,8, L:90,18 mm. W 14 r.ż. występuje załamanie do wartości P: 81,82, L:82,39 mm. Wnioski     1. Przyrost długości i szerokości stóp populacji żeńskiej i męskiej od 4 do 18 r.ż. jest równomiernie intensywny, przy czym w 14 r.ż. następuje spowolnienie przyrostu wielkości badanych cech.     2. Przebieg zmian średnich wielkości długości i szerokości stopy w wieku od 4 do 18 lat regionu warmińsko – mazurskiego nie znajduje w pełni potwierdzenia w badaniach metod

Linearly Refined Session Types

Directory of Open Access Journals (Sweden)

Pedro Baltazar

2012-11-01

Full Text Available Session types capture precise protocol structure in concurrent programming, but do not specify properties of the exchanged values beyond their basic type. Refinement types are a form of dependent types that can address this limitation, combining types with logical formulae that may refer to program values and can constrain types using arbitrary predicates. We present a pi calculus with assume and assert operations, typed using a session discipline that incorporates refinement formulae written in a fragment of Multiplicative Linear Logic. Our original combination of session and refinement types, together with the well established benefits of linearity, allows very fine-grained specifications of communication protocols in which refinement formulae are treated as logical resources rather than persistent truths.

Detection of epistatic effects with logic regression and a classical linear regression model.

Science.gov (United States)

Malina, Magdalena; Ickstadt, Katja; Schwender, Holger; Posch, Martin; Bogdan, Małgorzata

2014-02-01

To locate multiple interacting quantitative trait loci (QTL) influencing a trait of interest within experimental populations, usually methods as the Cockerham's model are applied. Within this framework, interactions are understood as the part of the joined effect of several genes which cannot be explained as the sum of their additive effects. However, if a change in the phenotype (as disease) is caused by Boolean combinations of genotypes of several QTLs, this Cockerham's approach is often not capable to identify them properly. To detect such interactions more efficiently, we propose a logic regression framework. Even though with the logic regression approach a larger number of models has to be considered (requiring more stringent multiple testing correction) the efficient representation of higher order logic interactions in logic regression models leads to a significant increase of power to detect such interactions as compared to a Cockerham's approach. The increase in power is demonstrated analytically for a simple two-way interaction model and illustrated in more complex settings with simulation study and real data analysis.

Computational intelligence synergies of fuzzy logic, neural networks and evolutionary computing

CERN Document Server

Siddique, Nazmul

2013-01-01

Computational Intelligence: Synergies of Fuzzy Logic, Neural Networks and Evolutionary Computing presents an introduction to some of the cutting edge technological paradigms under the umbrella of computational intelligence. Computational intelligence schemes are investigated with the development of a suitable framework for fuzzy logic, neural networks and evolutionary computing, neuro-fuzzy systems, evolutionary-fuzzy systems and evolutionary neural systems. Applications to linear and non-linear systems are discussed with examples. Key features: Covers all the aspect

On-line tuning of a fuzzy-logic power system stabilizer

International Nuclear Information System (INIS)

Hossein-Zadeh, N.; Kalam, A.

2002-01-01

A scheme for on-line tuning of a fuzzy-logic power system stabilizer is presented. firstly, a fuzzy-logic power system stabilizer is developed using speed deviation and accelerating power as the controller input variables. The inference mechanism of fuzzy-logic controller is represented by a decision table, constructed of linguistic IF-THEN rules. The Linguistic rules are available from experts and the design procedure is based on these rules. It assumed that an exact model of the plant is not available and it is difficult to extract the exact parameters of the power plant. Thus, the design procedure can not be based on an exact model. This is an advantage of fuzzy logic that makes the design of a controller possible without knowing the exact model of the plant. Secondly, two scaling parameters are introduced to tune the fuzzy-logic power system stabilizer. These scaling parameters are the outputs of another fuzzy-logic system, which gets the operating conditions of power system as inputs. These mechanism of tuning the fuzzy-logic power system stabilizer makes the fuzzy-logic power system stabilizer adaptive to changes in the operating conditions. Therefore, the degradation of the system response, under a wide range of operating conditions, is less compared to the system response with a fixed-parameter fuzzy-logic power system stabilizer and a conventional (linear) power system stabilizer. The tuned stabilizer has been tested by performing nonlinear simulations using a synchronous machine-infinite bus model. The responses are compared with a fixed parameters fuzzy-logic power system stabilizer and a conventional (linear) power system stabilizer. It is shown that the tuned fuzzy-logic power system stabilizer is superior to both of them

Characteristics of a Circular Logic and Its Treatment

International Nuclear Information System (INIS)

Lim, Ho-Gon; Han, Sang-Hoon; Yang, Joon Eon

2007-01-01

A circular logic or a logical loop is defined as the infinite circulation of supporting relations due to their mutual dependencies among the systems in the Fault Tree Analysis (FTA). While many methods to break the circular logic have been developed and used in the fault tree quantification codes, the general solution for a circular logic and its breaking methods are not generally known as yet. This paper presents an analytic solution for circular logics in which the systems are linearly interrelated with each other. Then, a general treatment of circular logics is discussed. To formulate the analytic solution, the relations among systems in the fault tree structure are described by the Boolean equations. The solution is, then, obtained from the successive substitutions of the Boolean equations, which is equivalent to the attaching processes of interrelated system's fault tree to a given fault tree. The solution for three interrelated systems and their independent fault tree structures are given as an example

Embedding Logics into Product Logic

Czech Academy of Sciences Publication Activity Database

Baaz, M.; Hájek, Petr; Krajíček, Jan; Švejda, David

1998-01-01

Roč. 61, č. 1 (1998), s. 35-47 ISSN 0039-3215 R&D Projects: GA AV ČR IAA1030601 Grant - others:COST(XE) Action 15 Keywords : fuzzy logic * Lukasiewicz logic * Gödel logic * product logic * computational complexity * arithmetical hierarchy Subject RIV: BA - General Mathematics

a fuzzy logic approach to non-linearity problem of load frequency

African Journals Online (AJOL)

user

2016-07-03

Jul 3, 2016 ... reduction in settling time, percent overshoot and steady state error. Keywords: fuzzy logic ... power system to regain a state of operating equilibrium given ... power system depends basically on the active (real) power balance ...

Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types

DEFF Research Database (Denmark)

Carbone, Marco; Lindley, Sam; Montesi, Fabrizio

2016-01-01

the duality of classical linear logic (relating two types) with a more general notion of coherence (relating an arbitrary number of types). This paper introduces variants of CP and MCP, plus a new intermediate calculus of Globally-governed Classical Processes (GCP). We show a tight relation between......Wadler introduced Classical Processes (CP), a calculus based on a propositions-as-types correspondence between propositions of classical linear logic and session types. Carbone et al. introduced Multiparty Classical Processes, a calculus that generalises CP to multiparty session types, by replacing...

Single-nary philosophy for non-linear study of mechanics of materials

International Nuclear Information System (INIS)

Tran, C.

2005-01-01

Non-linear study of mechanics of materials is formulated in this paper as a problem of meta-intelligent system analysis. Non-linearity will be singled out as an important concept for understanding of high-order complex systems. Through single-nary thinking, which will be represented in this work, we introduce a modification of Aristotelian philosophy using modal logic and multi-valued logic (these logics we call 'high-order' logic). Next, non-linear cause - effect relations are expressed through non-additive measures and multiple-information aggregation principles based on fuzzy integration. The study of real time behaviors, required experiences and intuition, will be realized using truth measures (non-additive measures) and a procedure for information processing in intelligence levels. (author)

Choreographies, Logically

DEFF Research Database (Denmark)

Carbone, Marco; Montesi, Fabrizio; Schürmann, Carsten

2014-01-01

In Choreographic Programming, a distributed system is programmed by giving a choreography, a global description of its interactions, instead of separately specifying the behaviour of each of its processes. Process implementations in terms of a distributed language can then be automatically...... projected from a choreography. We present Linear Compositional Choreographies (LCC), a proof theory for reasoning about programs that modularly combine choreographies with processes. Using LCC, we logically reconstruct a semantics and a projection procedure for programs. For the first time, we also obtain...... a procedure for extracting choreographies from process terms....

Linearization Method and Linear Complexity

Science.gov (United States)

Tanaka, Hidema

We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N(≅2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.

Specification and Verification of Web Applications in Rewriting Logic

Science.gov (United States)

Alpuente, María; Ballis, Demis; Romero, Daniel

This paper presents a Rewriting Logic framework that formalizes the interactions between Web servers and Web browsers through a communicating protocol abstracting HTTP. The proposed framework includes a scripting language that is powerful enough to model the dynamics of complex Web applications by encompassing the main features of the most popular Web scripting languages (e.g. PHP, ASP, Java Servlets). We also provide a detailed characterization of browser actions (e.g. forward/backward navigation, page refresh, and new window/tab openings) via rewrite rules, and show how our models can be naturally model-checked by using the Linear Temporal Logic of Rewriting (LTLR), which is a Linear Temporal Logic specifically designed for model-checking rewrite theories. Our formalization is particularly suitable for verification purposes, since it allows one to perform in-depth analyses of many subtle aspects related to Web interaction. Finally, the framework has been completely implemented in Maude, and we report on some successful experiments that we conducted by using the Maude LTLR model-checker.

Fuzzy logic of quasi-truth an algebraic treatment

CERN Document Server

Di Nola, Antonio; Turunen, Esko

2016-01-01

This book presents the first algebraic treatment of quasi-truth fuzzy logic and covers the algebraic foundations of many-valued logic. It offers a comprehensive account of basic techniques and reports on important results showing the pivotal role played by perfect many-valued algebras (MV-algebras). It is well known that the first-order predicate Łukasiewicz logic is not complete with respect to the canonical set of truth values. However, it is complete with respect to all linearly ordered MV –algebras. As there are no simple linearly ordered MV-algebras in this case, infinitesimal elements of an MV-algebra are allowed to be truth values. The book presents perfect algebras as an interesting subclass of local MV-algebras and provides readers with the necessary knowledge and tools for formalizing the fuzzy concept of quasi true and quasi false. All basic concepts are introduced in detail to promote a better understanding of the more complex ones. It is an advanced and inspiring reference-guide for graduate s...

Linear algebra

CERN Document Server

Stoll, R R

1968-01-01

Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand

Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions

DEFF Research Database (Denmark)

Bresolin, Davide; Goranko, Valentin; Montanari, Angelo

2009-01-01

In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics (PNL), we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities...... over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS....

La tradizione del nuovo nel cinema di Ugo Nespolo

OpenAIRE

Bertetto, Paolo

2018-01-01

On the background of Nespolo’s cinema there are on the one hand the new rules and the new structures assigned by art to itself during the Twentieth Century. On the other hand the “logic of dada”, based on the immediacy of the creation through a gesture of everyday objects presentation. Therefore, by exploring the experimental use of camera and of its technical possibilities, what Nespolo does is avant-gardist cinema in two senses: as an elaboration of visual image that represents surrealistic...

Instantons in Self-Organizing Logic Gates

Science.gov (United States)

Bearden, Sean R. B.; Manukian, Haik; Traversa, Fabio L.; Di Ventra, Massimiliano

2018-03-01

Self-organizing logic is a recently suggested framework that allows the solution of Boolean truth tables "in reverse"; i.e., it is able to satisfy the logical proposition of gates regardless to which terminal(s) the truth value is assigned ("terminal-agnostic logic"). It can be realized if time nonlocality (memory) is present. A practical realization of self-organizing logic gates (SOLGs) can be done by combining circuit elements with and without memory. By employing one such realization, we show, numerically, that SOLGs exploit elementary instantons to reach equilibrium points. Instantons are classical trajectories of the nonlinear equations of motion describing SOLGs and connect topologically distinct critical points in the phase space. By linear analysis at those points, we show that these instantons connect the initial critical point of the dynamics, with at least one unstable direction, directly to the final fixed point. We also show that the memory content of these gates affects only the relaxation time to reach the logically consistent solution. Finally, we demonstrate, by solving the corresponding stochastic differential equations, that, since instantons connect critical points, noise and perturbations may change the instanton trajectory in the phase space but not the initial and final critical points. Therefore, even for extremely large noise levels, the gates self-organize to the correct solution. Our work provides a physical understanding of, and can serve as an inspiration for, models of bidirectional logic gates that are emerging as important tools in physics-inspired, unconventional computing.

Fuzzy Logic Controlled Solar Module for Driving Three- Phase Induction Motor

Science.gov (United States)

Afiqah Zainal, Nurul; Sooi Tat, Chan; Ajisman

2016-02-01

Renewable energy produced by solar module gives advantages for generated three- phase induction motor in remote area. But, solar module's ou tput is uncertain and complex. Fuzzy logic controller is one of controllers that can handle non-linear system and maximum power of solar module. Fuzzy logic controller used for Maximum Power Point Tracking (MPPT) technique to control Pulse-Width Modulation (PWM) for switching power electronics circuit. DC-DC boost converter used to boost up photovoltaic voltage to desired output and supply voltage source inverter which controlled by three-phase PWM generated by microcontroller. IGBT switched Voltage source inverter (VSI) produced alternating current (AC) voltage from direct current (DC) source to control speed of three-phase induction motor from boost converter output. Results showed that, the output power of solar module is optimized and controlled by using fuzzy logic controller. Besides that, the three-phase induction motor can be drive and control using VSI switching by the PWM signal generated by the fuzzy logic controller. This concluded that the non-linear system can be controlled and used in driving three-phase induction motor.

Data Logic

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...

Extending Value Logic Thinking to Value Logic Portfolios

DEFF Research Database (Denmark)

Andersen, Poul Houman; Ritter, Thomas

2014-01-01

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...

Boolean Logic Tree of Label-Free Dual-Signal Electrochemical Aptasensor System for Biosensing, Three-State Logic Computation, and Keypad Lock Security Operation.

Science.gov (United States)

Lu, Jiao Yang; Zhang, Xin Xing; Huang, Wei Tao; Zhu, Qiu Yan; Ding, Xue Zhi; Xia, Li Qiu; Luo, Hong Qun; Li, Nian Bing

2017-09-19

The most serious and yet unsolved problems of molecular logic computing consist in how to connect molecular events in complex systems into a usable device with specific functions and how to selectively control branchy logic processes from the cascading logic systems. This report demonstrates that a Boolean logic tree is utilized to organize and connect "plug and play" chemical events DNA, nanomaterials, organic dye, biomolecule, and denaturant for developing the dual-signal electrochemical evolution aptasensor system with good resettability for amplification detection of thrombin, controllable and selectable three-state logic computation, and keypad lock security operation. The aptasensor system combines the merits of DNA-functionalized nanoamplification architecture and simple dual-signal electroactive dye brilliant cresyl blue for sensitive and selective detection of thrombin with a wide linear response range of 0.02-100 nM and a detection limit of 1.92 pM. By using these aforementioned chemical events as inputs and the differential pulse voltammetry current changes at different voltages as dual outputs, a resettable three-input biomolecular keypad lock based on sequential logic is established. Moreover, the first example of controllable and selectable three-state molecular logic computation with active-high and active-low logic functions can be implemented and allows the output ports to assume a high impediment or nothing (Z) state in addition to the 0 and 1 logic levels, effectively controlling subsequent branchy logic computation processes. Our approach is helpful in developing the advanced controllable and selectable logic computing and sensing system in large-scale integration circuits for application in biomedical engineering, intelligent sensing, and control.

A Single MEMS Resonator for Reconfigurable Multifunctional Logic Gates

KAUST Repository

Tella, Sherif Adekunle

2018-04-30

Despite recent efforts toward true electromechanical resonator-based computing, achieving complex logics functions through cascading micro resonators has been deterred by challenges involved in their interconnections and the large required array of resonators. In this work we present a single micro electromechanical resonator with two outputs that enables the realization of multifunctional logic gates as well as other complex logic operations. As examples, we demonstrate the realization of the fundamental 2-bit logic gates of OR, XOR, AND, NOR, and a half adder. The device is based on a compound resonator consisting of a clamped-guided electrostatically actuated arch beam that is attached to another resonant beam from the side, which serves as an additional actuation electrode for the arch. The structure is also provided with an additional electrothermal tuning capability. The logic operations are based on the linear frequency modulations of the arch resonator and side microbeam. The device is compatible with CMOS fabrication process and works at room temperature

A Single MEMS Resonator for Reconfigurable Multifunctional Logic Gates

KAUST Repository

Tella, Sherif Adekunle; Alcheikh, Nouha; Younis, Mohammad I.

2018-01-01

Despite recent efforts toward true electromechanical resonator-based computing, achieving complex logics functions through cascading micro resonators has been deterred by challenges involved in their interconnections and the large required array of resonators. In this work we present a single micro electromechanical resonator with two outputs that enables the realization of multifunctional logic gates as well as other complex logic operations. As examples, we demonstrate the realization of the fundamental 2-bit logic gates of OR, XOR, AND, NOR, and a half adder. The device is based on a compound resonator consisting of a clamped-guided electrostatically actuated arch beam that is attached to another resonant beam from the side, which serves as an additional actuation electrode for the arch. The structure is also provided with an additional electrothermal tuning capability. The logic operations are based on the linear frequency modulations of the arch resonator and side microbeam. The device is compatible with CMOS fabrication process and works at room temperature

A logic for specifying stochastic actions and observations

CSIR Research Space (South Africa)

Rens, G

2014-03-01

Full Text Available (2007) 30. Smallwood, R., Sondik, E.: The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21, 1071–1088 (1973) 31. Tarski, A.: A decision method for elementary algebra and geometry. Tech. rep., The RAND... POMDPs totally into the logical arena. One is then in very familiar territory and new opportunities for the advancement in reasoning about POMDPs may be opened up. Systems of linear inequalities are at the heart of Nilsson’s probabilistic logic [19...

Three-valued logics in modal logic

NARCIS (Netherlands)

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

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....

Abstract Interpretation of PIC programs through Logic Programming

DEFF Research Database (Denmark)

Henriksen, Kim Steen; Gallagher, John Patrick

2006-01-01

, are applied to the logic based model of the machine. A small PIC microcontroller is used as a case study. An emulator for this microcontroller is written in Prolog, and standard programming transformations and analysis techniques are used to specialise this emulator with respect to a given PIC program....... The specialised emulator can now be further analysed to gain insight into the given program for the PIC microcontroller. The method describes a general framework for applying abstractions, illustrated here by linear constraints and convex hull analysis, to logic programs. Using these techniques on the specialised...

Logic programming extensions of Horn clause logic

Directory of Open Access Journals (Sweden)

Ron Sigal

1988-11-01

Full Text Available Logic programming is now firmly established as an alternative programming paradigm, distinct and arguably superior to the still dominant imperative style of, for instance, the Algol family of languages. The concept of a logic programming language is not precisely defined, but it is generally understood to be characterized buy: a declarative nature; foundation in some well understood logical system, e.g., first order logic.

Full-order Luenberger observer based on fuzzy-logic control for sensorless field-oriented control of a single-sided linear induction motor.

Science.gov (United States)

Holakooie, Mohammad Hosein; Ojaghi, Mansour; Taheri, Asghar

2016-01-01

This paper investigates sensorless indirect field oriented control (IFOC) of SLIM with full-order Luenberger observer. The dynamic equations of SLIM are first elaborated to draw full-order Luenberger observer with some simplifying assumption. The observer gain matrix is derived from conventional procedure so that observer poles are proportional to SLIM poles to ensure the stability of system for wide range of linear speed. The operation of observer is significantly impressed by adaptive scheme. A fuzzy logic control (FLC) is proposed as adaptive scheme to estimate linear speed using speed tuning signal. The parameters of FLC are tuned using an off-line method through chaotic optimization algorithm (COA). The performance of the proposed observer is verified by both numerical simulation and real-time hardware-in-the-loop (HIL) implementation. Moreover, a detailed comparative study among proposed and other speed observers is obtained under different operation conditions. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Fuzzy Logic Controlled Solar Module for Driving Three- Phase Induction Motor

International Nuclear Information System (INIS)

Zainal, Nurul Afiqah; Tat, Chan Sooi; Ajisman

2016-01-01

Renewable energy produced by solar module gives advantages for generated three- phase induction motor in remote area. But, solar module's output is uncertain and complex. Fuzzy logic controller is one of controllers that can handle non-linear system and maximum power of solar module. Fuzzy logic controller used for Maximum Power Point Tracking (MPPT) technique to control Pulse-Width Modulation (PWM) for switching power electronics circuit. DC-DC boost converter used to boost up photovoltaic voltage to desired output and supply voltage source inverter which controlled by three-phase PWM generated by microcontroller. IGBT switched Voltage source inverter (VSI) produced alternating current (AC) voltage from direct current (DC) source to control speed of three-phase induction motor from boost converter output. Results showed that, the output power of solar module is optimized and controlled by using fuzzy logic controller. Besides that, the three-phase induction motor can be drive and control using VSI switching by the PWM signal generated by the fuzzy logic controller. This concluded that the non-linear system can be controlled and used in driving three-phase induction motor. (paper)

Intuitionistic hybrid logic

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....

A new quantum flux parametron logic gate with large input margin

International Nuclear Information System (INIS)

Hioe, W.; Hosoya, M.; Goto, E.

1991-01-01

This paper reports on the Quantum Flux Parametron (QFP) which is a flux transfer, flux activated Josephson logic device which realizes much lower power dissipation than other Josephson logic devices. Being a two-terminal device its correct operation may be affected by coupling to other QFPs. The problems include backcoupling from active QFPs through inactive QFPs (relay noise), coupling between QFPs activated at different times because of clock skew (homophase noise), and interaction between active QFPs (reaction hazard). Previous QFP circuits worked by wired-majority, which being a linear input logic, has low input margin. A new logic gate (D-gate) using a QFP to perform logic operations has been analyzed and tested by computer simulation. Relay noise, homophase noise and reaction hazard are substantially reduced. Moreover, the input have little interaction hence input margin is greatly improved

Admissible Rules of Lukasiewicz Logic

Czech Academy of Sciences Publication Activity Database

Jeřábek, Emil

2010-01-01

Roč. 20, č. 2 (2010), s. 425-447 ISSN 0955-792X R&D Projects: GA AV ČR IAA900090703; GA AV ČR IAA100190902; GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10190503 Keywords : linear temporal logic * unification * consecutions Subject RIV: BA - General Mathematics Impact factor: 0.586, year: 2010 http://logcom.oxfordjournals.org/content/20/2/425

Classical logic and logicism in human thought

OpenAIRE

Elqayam, Shira

2012-01-01

This chapter explores the role of classical logic as a theory of human reasoning. I distinguish between classical logic as a normative, computational and algorithmic system, and review its role is theories of human reasoning since the 1960s. The thesis I defend is that psychological theories have been moving further and further away from classical logic on all three levels. I examine some prominent example of logicist theories, which incorporate logic in their psychological account, includin...

Optical NOR logic gate design on square lattice photonic crystal platform

Energy Technology Data Exchange (ETDEWEB)

D’souza, Nirmala Maria, E-mail: nirmala@cukerala.ac.in; Mathew, Vincent, E-mail: vincent@cukerala.ac.in [Department of Physics, Central University of Kerala, Kasaragod, Kerala-671 314 (India)

2016-05-06

We numerically demonstrate a new configuration of all-optical NOR logic gate with square lattice photonic crystal (PhC) waveguide using finite difference time domain (FDTD) method. The logic operations are based on interference effect of optical waves. We have determined the operating frequency range by calculating the band structure for a perfectly periodic PhC using plane wave expansion (PWE) method. Response time of this logic gate is 1.98 ps and it can be operated with speed about 513 GB/s. The proposed device consists of four linear waveguides and a square ring resonator waveguides on PhC platform.

Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme

DEFF Research Database (Denmark)

Schürmann, Carsten; Beckert, Bernhard; Gore, Rejeev

2013-01-01

We present a method for using first-order logic to specify the semantics of preferences as used in common vote counting algorithms. We also present a corresponding system that uses Celf linear-logic programs to describe voting algorithms and which generates explicit examples when the algorithm de...

Some results from the combinatorial approach to quantum logic

International Nuclear Information System (INIS)

Greechie, R.J.

1976-01-01

The combinatorial approach to quantum logic focuses on certain interconnections between graphs, combinatorial designs, and convex sets as applied to a quantum logic. This article is concerned only with orthomodular lattices and associated structures. A class of complete atomic irreducible semimodular orthomodular lattices is derived which may not be represented as linear subspaces of a vector space over a division ring. Each of these lattices is a proposition system of dimension three. These proposition systems form orthocomplemented non-Desarguesian projective geometries. (B.R.H.)

Duality Theory and Categorical Universal Logic: With Emphasis on Quantum Structures

Directory of Open Access Journals (Sweden)

Yoshihiro Maruyama

2014-12-01

Full Text Available Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras, which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical, intuitionistic, and diverse substructural logics. Here we show there are those dual adjunctions that have inherent hyperdoctrine structures in their predicate functor parts. We systematically investigate into the categorical logics of dual adjunctions by utilising Johnstone-Dimov-Tholen's duality-theoretic framework. Our set-theoretical duality-based hyperdoctrines for quantum logic have both universal and existential quantifiers (and higher-order structures, giving rise to a universe of Takeuti-Ozawa's quantum sets via the tripos-to-topos construction by Hyland-Johnstone-Pitts. The set-theoretical hyperdoctrinal models of quantum logic, as well as all quantum hyperdoctrines with cartesian base categories, turn out to give sound and complete semantics for Faggian-Sambin's first-order quantum sequent calculus over cartesian type theory; in addition, quantum hyperdoctrines with monoidal base categories are sound and complete for the calculus over linear type theory. We finally consider how to reconcile Birkhoff-von Neumann's quantum logic and Abramsky-Coecke's categorical quantum mechanics (which is modernised quantum logic as an antithesis to the traditional one via categorical universal logic.

Axially modulated arch resonator for logic and memory applications

KAUST Repository

Hafiz, Md Abdullah Al

2018-01-17

We demonstrate reconfigurable logic and random access memory devices based on an axially modulated clamped-guided arch resonator. The device is electrostatically actuated and the motional signal is capacitively sensed, while the resonance frequency is modulated through an axial electrostatic force from the guided side of the microbeam. A multi-physics finite element model is used to verify the effectiveness of the axial modulation. We present two case studies: first, a reconfigurable two-input logic gate based on the linear resonance frequency modulation, and second, a memory element based on the hysteretic frequency response of the resonator working in the nonlinear regime. The energy consumptions of the device for both logic and memory operations are in the range of picojoules, promising for energy efficient alternative computing paradigm.

Linearity in Process Languages

DEFF Research Database (Denmark)

Nygaard, Mikkel; Winskel, Glynn

2002-01-01

The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open......-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided for the tensor fragment of the language. Different ways to make assemblies of processes lead to different choices of exponential, some of which respect bisimulation....

Logical labyrinths

CERN Document Server

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

Rough set classification based on quantum logic

Science.gov (United States)

Hassan, Yasser F.

2017-11-01

By combining the advantages of quantum computing and soft computing, the paper shows that rough sets can be used with quantum logic for classification and recognition systems. We suggest the new definition of rough set theory as quantum logic theory. Rough approximations are essential elements in rough set theory, the quantum rough set model for set-valued data directly construct set approximation based on a kind of quantum similarity relation which is presented here. Theoretical analyses demonstrate that the new model for quantum rough sets has new type of decision rule with less redundancy which can be used to give accurate classification using principles of quantum superposition and non-linear quantum relations. To our knowledge, this is the first attempt aiming to define rough sets in representation of a quantum rather than logic or sets. The experiments on data-sets have demonstrated that the proposed model is more accuracy than the traditional rough sets in terms of finding optimal classifications.

Visit at CERN of representatives of the Department of Piacenza (Italy), received by Lucio Rossi and Ugo Amaldi and hosted by the DG. The department of Piacenza is the native land of Edoardo Amaldi, one of the founding fathers of CERN, and the Department is preparing the celebration of the centennial of his birth.

CERN Multimedia

Maximilien Brice

2008-01-01

Visit at CERN of representatives of the Department of Piacenza (Italy), received by Lucio Rossi and Ugo Amaldi and hosted by the DG. The department of Piacenza is the native land of Edoardo Amaldi, one of the founding fathers of CERN, and the Department is preparing the celebration of the centennial of his birth.

Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths

DEFF Research Database (Denmark)

Bresolin, Davide; Goranko, Valentin; Montanari, Angelo

2009-01-01

Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontological entities. In this paper we introduce and study Right Propositional Neighborhood Logic over natural numbers...... with integer constraints for interval lengths, which is a propositional interval temporal logic featuring a modality for the 'right neighborhood' relation between intervals and explicit integer constraints for interval lengths. We prove that it has the bounded model property with respect to ultimately periodic...

A Comparison of Implications in Orthomodular Quantum Logic—Morphological Analysis of Quantum Logic

Directory of Open Access Journals (Sweden)

Mitsuhiko Fujio

2012-01-01

Full Text Available Morphological operators are generalized to lattices as adjunction pairs (Serra, 1984; Ronse, 1990; Heijmans and Ronse, 1990; Heijmans, 1994. In particular, morphology for set lattices is applied to analyze logics through Kripke semantics (Bloch, 2002; Fujio and Bloch, 2004; Fujio, 2006. For example, a pair of morphological operators as an adjunction gives rise to a temporalization of normal modal logic (Fujio and Bloch, 2004; Fujio, 2006. Also, constructions of models for intuitionistic logic or linear logics can be described in terms of morphological interior and/or closure operators (Fujio and Bloch, 2004. This shows that morphological analysis can be applied to various non-classical logics. On the other hand, quantum logics are algebraically formalized as orhomodular or modular ortho-complemented lattices (Birkhoff and von Neumann, 1936; Maeda, 1980; Chiara and Giuntini, 2002, and shown to allow Kripke semantics (Chiara and Giuntini, 2002. This suggests the possibility of morphological analysis for quantum logics. In this article, to show an efficiency of morphological analysis for quantum logic, we consider the implication problem in quantum logics (Chiara and Giuntini, 2002. We will give a comparison of the 5 polynomial implication connectives available in quantum logics.

HYPROLOG: A New Logic Programming Language with Assumptions and Abduction

DEFF Research Database (Denmark)

Christiansen, Henning; Dahl, Veronica

2005-01-01

We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integrity constraints. Assumptions are a mechanism inspired by linear logic and taken over from Assumption Grammars. The lan......We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integrity constraints. Assumptions are a mechanism inspired by linear logic and taken over from Assumption Grammars....... The language shows a novel flexibility in the interaction between the different paradigms, including all additional built-in predicates and constraints solvers that may be available. Assumptions and abduction are especially useful for language processing, and we can show how HYPROLOG works seamlessly together...

Complete axiomatization of the stutter-invariant fragment of the linear time µ-calculus

NARCIS (Netherlands)

Gheerbrant, A.

2010-01-01

The logic µ(U) is the fixpoint extension of the "Until"-only fragment of linear-time temporal logic. It also happens to be the stutter-invariant fragment of linear-time µ-calculus µ(◊). We provide complete axiomatizations of µ(U) on the class of finite words and on the class of ω-words. We introduce

Acoustic logic gates and Boolean operation based on self-collimating acoustic beams

International Nuclear Information System (INIS)

Zhang, Ting; Xu, Jian-yi; Cheng, Ying; Liu, Xiao-jun; Guo, Jian-zhong

2015-01-01

The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations

Surface confined assemblies and polymers for sensing and molecular logic

Science.gov (United States)

de Ruiter, Graham; Altman, Marc; Motiei, Leila; Lahav, Michal; van der Boom, Milko E.

2013-05-01

Since the development of molecule-based sensors and the introduction of molecules mimicking the behavior of the AND gate in solution by de Silva in 1993, molecular (Boolean) Logic and Computing (MBLC) has become increasingly popular. The molecular approach toward Boolean logic resulted in intriguing proofs of concepts in solution including logic gates, half-adders, multiplexers, and flip-flop logic circuits. Molecular assemblies can perform diverse logic tasks by reconfiguring their inputs. Our recent research activities focus on MBLC with electrochromic polymers and immobilized polypyridyl complexes on solid support. We have designed a series of coordination-based thin films that are formed linearly by stepwise wet-chemical deposition or by self-propagating molecular assembly. The electrochromic properties of these films can be used for (i) detecting various analytes in solution and in the air, (ii) MBLC, (iii) electron-transfer studies, and (iv) interlayers for efficient inverted bulk-heterojunction solar cells. Our concept toward MBLC with functionalized surfaces is applicable to electrochemical and chemical inputs coupled with optical readout. Using this approach, we demonstrated various logic architectures with redox-active functionalized surfaces. Electrochemically operated sequential logic systems (e.g., flip-flops), multi-valued logic, and multi-state memory have been designed, which can improve computational power without increasing spatial requirements. Applying multi-valued digits in data storage and information processing could exponentially increase memory capacity. Our approach is applicable to highly diverse electrochromic thin films that operate at practical voltages (< 1.5 V).

Towards electromechanical computation: An alternative approach to realize complex logic circuits

KAUST Repository

Hafiz, Md Abdullah Al; Kosuru, Lakshmoji; Younis, Mohammad I.

2016-01-01

Electromechanical computing based on micro/nano resonators has recently attracted significant attention. However, full implementation of this technology has been hindered by the difficulty in realizing complex logic circuits. We report here an alternative approach to realize complex logic circuits based on multiple MEMS resonators. As case studies, we report the construction of a single-bit binary comparator, a single-bit 4-to-2 encoder, and parallel XOR/XNOR and AND/NOT logic gates. Toward this, several microresonators are electrically connected and their resonance frequencies are tuned through an electrothermal modulation scheme. The microresonators operating in the linear regime do not require large excitation forces, and work at room temperature and at modest air pressure. This study demonstrates that by reconfiguring the same basic building block, tunable resonator, several essential complex logic functions can be achieved.

Towards electromechanical computation: An alternative approach to realize complex logic circuits

KAUST Repository

Hafiz, M. A. A.

2016-08-18

Electromechanical computing based on micro/nano resonators has recently attracted significant attention. However, full implementation of this technology has been hindered by the difficulty in realizing complex logic circuits. We report here an alternative approach to realize complex logic circuits based on multiple MEMS resonators. As case studies, we report the construction of a single-bit binary comparator, a single-bit 4-to-2 encoder, and parallel XOR/XNOR and AND/NOT logic gates. Toward this, several microresonators are electrically connected and their resonance frequencies are tuned through an electrothermal modulation scheme. The microresonators operating in the linear regime do not require large excitation forces, and work at room temperature and at modest air pressure. This study demonstrates that by reconfiguring the same basic building block, tunable resonator, several essential complex logic functions can be achieved.

Logical Characterisation of Ontology Construction using Fuzzy Description Logics

DEFF Research Database (Denmark)

Badie, Farshad; Götzsche, Hans

had the extension of ontologies with Fuzzy Logic capabilities which plan to make proper backgrounds for ontology driven reasoning and argumentation on vague and imprecise domains. This presentation conceptualises learning from fuzzy classes using the Inductive Logic Programming framework. Then......, employs Description Logics in characterising and analysing fuzzy statements. And finally, provides a conceptual framework describing fuzzy concept learning in ontologies using the Inductive Logic Programming....

Logic circuits based on molecular spider systems.

Science.gov (United States)

Mo, Dandan; Lakin, Matthew R; Stefanovic, Darko

2016-08-01

Spatial locality brings the advantages of computation speed-up and sequence reuse to molecular computing. In particular, molecular walkers that undergo localized reactions are of interest for implementing logic computations at the nanoscale. We use molecular spider walkers to implement logic circuits. We develop an extended multi-spider model with a dynamic environment wherein signal transmission is triggered via localized reactions, and use this model to implement three basic gates (AND, OR, NOT) and a cascading mechanism. We develop an algorithm to automatically generate the layout of the circuit. We use a kinetic Monte Carlo algorithm to simulate circuit computations, and we analyze circuit complexity: our design scales linearly with formula size and has a logarithmic time complexity. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

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.

Axially Modulated Clamped-Guided Arch Resonator for Memory and Logic Applications

KAUST Repository

Hafiz, Md Abdullah Al; Tella, Sherif Adekunle; Alcheikh, Nouha; Fariborzi, Hossein; Younis, Mohammad I.

2017-01-01

We experimentally demonstrate memory and logic devices based on an axially modulated clamped-guided arch resonator. The device are electrostatically actuated and capacitively sensed, while the resonance frequency modulation is achieved through an axial electrostatic force from the guided side of the clamped-guided arch microbeam. We present two case studies: first, a dynamic memory based on the nonlinear frequency response of the resonator, and second, a reprogrammable two-input logic gate based on the linear frequency modulation of the resonator. These devices show energy cost per memory/logic operation in pJ, are fully compatible with CMOS fabrication processes, have the potential for on-chip system integration, and operate at room temperature.

Axially Modulated Clamped-Guided Arch Resonator for Memory and Logic Applications

KAUST Repository

Hafiz, Md Abdullah Al

2017-11-03

We experimentally demonstrate memory and logic devices based on an axially modulated clamped-guided arch resonator. The device are electrostatically actuated and capacitively sensed, while the resonance frequency modulation is achieved through an axial electrostatic force from the guided side of the clamped-guided arch microbeam. We present two case studies: first, a dynamic memory based on the nonlinear frequency response of the resonator, and second, a reprogrammable two-input logic gate based on the linear frequency modulation of the resonator. These devices show energy cost per memory/logic operation in pJ, are fully compatible with CMOS fabrication processes, have the potential for on-chip system integration, and operate at room temperature.

Transforming equality logic to propositional logic

NARCIS (Netherlands)

Zantema, H.; Groote, J.F.

2003-01-01

Abstract We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We propose equality substitution as a new approach combining desirable

Logic and Ontology

Directory of Open Access Journals (Sweden)

Newton C. A. da Costa

2002-12-01

Full Text Available In view of the present state of development of non classical logic, especially of paraconsistent logic, a new stand regarding the relations between logic and ontology is defended In a parody of a dictum of Quine, my stand May be summarized as follows. To be is to be the value of a variable a specific language with a given underlying logic Yet my stand differs from Quine’s, because, among other reasons, I accept some first order heterodox logics as genuine alternatives to classical logic I also discuss some questions of non classical logic to substantiate my argument, and suggest that may position complements and extends some ideas advanced by L Apostel.

Structural Logical Relations

DEFF Research Database (Denmark)

Schürmann, Carsten; Sarnat, Jeffrey

2008-01-01

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......, 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...

Development of Fuzzy Logic Controller for Quanser Bench-Top Helicopter

Science.gov (United States)

Jafri, M. H.; Mansor, H.; Gunawan, T. S.

2017-11-01

Bench-top helicopter is a laboratory scale helicopter that usually used as a testing bench of the real helicopter behavior. This helicopter is a 3 Degree of Freedom (DOF) helicopter which works by three different axes wshich are elevation, pitch and travel. Thus, fuzzy logic controller has been proposed to be implemented into Quanser bench-top helicopter because of its ability to work with non-linear system. The objective for this project is to design and apply fuzzy logic controller for Quanser bench-top helicopter. Other than that, fuzzy logic controller performance system has been simulated to analyze and verify its behavior over existing PID controller by using Matlab & Simulink software. In this research, fuzzy logic controller has been designed to control the elevation angle. After simulation has been performed, it can be seen that simulation result shows that fuzzy logic elevation control is working for 4°, 5° and 6°. These three angles produce zero steady state error and has a fast response. Other than that, performance comparisons have been performed between fuzzy logic controller and PID controller. Fuzzy logic elevation control has a better performance compared to PID controller where lower percentage overshoot and faster settling time have been achieved in 4°, 5° and 6° step response test. Both controller are have zero steady state error but fuzzy logic controller is managed to produce a better performance in term of settling time and percentage overshoot which make the proposed controller is reliable compared to the existing PID controller.

BDI Logics

NARCIS (Netherlands)

Meyer, J.J.Ch.; Broersen, J.M.; Herzig, A.

2015-01-01

This paper presents an overview of so-called BDI logics, logics where the notion of Beliefs, Desires and Intentions play a central role. Starting out from the basic ideas about BDI by Bratman, we consider various formalizations in logic, such as the approach of Cohen and Levesque, slightly

Many-valued logics

CERN Document Server

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...

Type-2 fuzzy logic uncertain systems’ modeling and control

CERN Document Server

Antão, Rómulo

2017-01-01

This book focuses on a particular domain of Type-2 Fuzzy Logic, related to process modeling and control applications. It deepens readers’understanding of Type-2 Fuzzy Logic with regard to the following three topics: using simpler methods to train a Type-2 Takagi-Sugeno Fuzzy Model; using the principles of Type-2 Fuzzy Logic to reduce the influence of modeling uncertainties on a locally linear n-step ahead predictor; and developing model-based control algorithms according to the Generalized Predictive Control principles using Type-2 Fuzzy Sets. Throughout the book, theory is always complemented with practical applications and readers are invited to take their learning process one step farther and implement their own applications using the algorithms’ source codes (provided). As such, the book offers avaluable referenceguide for allengineers and researchers in the field ofcomputer science who are interested in intelligent systems, rule-based systems and modeling uncertainty.

Quantum Logic as a Dynamic Logic

NARCIS (Netherlands)

Baltag, A.; Smets, S.

We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear “no”.

Quantum logic as a dynamic logic

NARCIS (Netherlands)

Baltag, Alexandru; Smets, Sonja

We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear "no".

Product Lukasiewicz Logic

Czech Academy of Sciences Publication Activity Database

Horčík, Rostislav; Cintula, Petr

2004-01-01

Roč. 43, - (2004), s. 477-503 ISSN 1432-0665 R&D Projects: GA AV ČR IAA1030004; GA ČR GA201/02/1540 Grant - others:GA CTU(CZ) project 0208613; net CEEPUS(SK) SK-042 Institutional research plan: CEZ:AV0Z1030915 Keywords : fuzzy logic * many-valued logic * Lukasiewicz logic * Lpi logic * Takeuti-Titani logic * MV-algebras * product MV-algebras Subject RIV: BA - General Mathematics Impact factor: 0.295, year: 2004

Application of fuzzy logic to determine the odour intensity of model gas mixtures using electronic nose

Science.gov (United States)

Szulczyński, Bartosz; Gębicki, Jacek; Namieśnik, Jacek

2018-01-01

The paper presents the possibility of application of fuzzy logic to determine the odour intensity of model, ternary gas mixtures (α-pinene, toluene and triethylamine) using electronic nose prototype. The results obtained using fuzzy logic algorithms were compared with the values obtained using multiple linear regression (MLR) model and sensory analysis. As the results of the studies, it was found the electronic nose prototype along with the fuzzy logic pattern recognition system can be successfully used to estimate the odour intensity of tested gas mixtures. The correctness of the results obtained using fuzzy logic was equal to 68%.

Interferometric architectures based All-Optical logic design methods and their implementations

Science.gov (United States)

Singh, Karamdeep; Kaur, Gurmeet

2015-06-01

All-Optical Signal Processing is an emerging technology which can avoid costly Optical-electronic-optical (O-E-O) conversions which are usually compulsory in traditional Electronic Signal Processing systems, thus greatly enhancing operating bit rate with some added advantages such as electro-magnetic interference immunity and low power consumption etc. In order to implement complex signal processing tasks All-Optical logic gates are required as backbone elements. This review describes the advances in the field of All-Optical logic design methods based on interferometric architectures such as Mach-Zehnder Interferometer (MZI), Sagnac Interferometers and Ultrafast Non-Linear Interferometer (UNI). All-Optical logic implementations for realization of arithmetic and signal processing applications based on each interferometric arrangement are also presented in a categorized manner.

Against Logical Form

Directory of Open Access Journals (Sweden)

P N Johnson-Laird

2010-10-01

Full Text Available An old view in logic going back to Aristotle is that an inference is valid in virtue of its logical form. Many psychologists have adopted the same point of view about human reasoning: the first step is to recover the logical form of an inference, and the second step is to apply rules of inference that match these forms in order to prove that the conclusion follows from the premises. The present paper argues against this idea. The logical form of an inference transcends the grammatical forms of the sentences used to express it, because logical form also depends on context. Context is not readily expressed in additional premises. And the recovery of logical form leads ineluctably to the need for infinitely many axioms to capture the logical properties of relations. An alternative theory is that reasoning depends on mental models, and this theory obviates the need to recover logical form.

Superconductor fluxoid logic

International Nuclear Information System (INIS)

Andronov, A.A.; Kurin, V.V.; Levichev, M.Yu.; Ryndyk, D.A.; Vostokov, V.I.

1993-01-01

In recent years there has been much interest in superconductor logical devices. Our paper is devoted to the analysis of some new possibilities in this field. The main problems here are: minimization of time of logical operations and reducing of device scale. Josephson systems are quite appropriate for this purpose because of small size, short characteristic time and also small energy losses. Two different types of Josephson logic have been investigated during last years. The first type is based on hysteretic V-A characteristic of a single Josephson junction. Superconducting and resistive (with nonzero voltage) states are considered as logical zero and logical unit. The second one - rapid single flux quantum logic, has been developed recently and is based on SQUID-like bistability. Different logical states are the states with different number of magnetic flux quanta inside closed superconducting contour. Information is represented by voltage pulses with fixed ''area'' (∫ V(t)/dt). This pulses are generated when logical state of SQUID-like elementary cell changes. The fundamental role of magnetic flux quantization in this type of logic leads to the necessity of large enough self-inductance of superconductor contour and thus to limitations on minimal device dimensions. (orig.)

Advances in Modal Logic

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....

Mathematical logic

CERN Document Server

Kleene, Stephen Cole

1967-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.

Indeterministic Temporal Logic

Directory of Open Access Journals (Sweden)

Trzęsicki Kazimierz

2015-09-01

Full Text Available The questions od determinism, causality, and freedom have been the main philosophical problems debated since the beginning of temporal logic. The issue of the logical value of sentences about the future was stated by Aristotle in the famous tomorrow sea-battle passage. The question has inspired Łukasiewicz’s idea of many-valued logics and was a motive of A. N. Prior’s considerations about the logic of tenses. In the scheme of temporal logic there are different solutions to the problem. In the paper we consider indeterministic temporal logic based on the idea of temporal worlds and the relation of accessibility between them.

Classical Logic and Quantum Logic with Multiple and Common Lattice Models

Directory of Open Access Journals (Sweden)

Mladen Pavičić

2016-01-01

Full Text Available We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra underlying Hilbert (quantum space. We give an equivalent proof for the classical logic which turns out to have disjoint distributive and nondistributive ortholattices. In particular, we prove that both classical logic and quantum logic are sound and complete with respect to each of these lattices. We also show that there is one common nonorthomodular lattice that is a model of both quantum and classical logic. In technical terms, that enables us to run the same classical logic on both a digital (standard, two-subset, 0-1-bit computer and a nondigital (say, a six-subset computer (with appropriate chips and circuits. With quantum logic, the same six-element common lattice can serve us as a benchmark for an efficient evaluation of equations of bigger lattice models or theorems of the logic.

Perancangan Kendali Robot pada Smartphone Menggunakan Sensor Accelerometer Berbasis Metode Fuzzy Logic

Directory of Open Access Journals (Sweden)

Mohamad Agung Prawira Negara

2017-08-01

Full Text Available Telecommunications and robotics technology is being developed to assist and facilitate the work of a human. In the field of telecommunications particularly smartphone has reached the planting of operating systems like android until planting sensors such as an accelerometer, gyro, proximity, etc. We would like to take advantage of the accelerometer sensor on a smartphone as robot control. We will compare the use of Sugeno Fuzzy Logic and Mamdani Fuzzy Logic to determine the best control method. The basic components of the robot are the Bluetooth module HC-05 as a medium of communication with the android, arduino as the control system and actuators such as DC motors drive the rear wheels to adjust the speed of the robot, and servo motor drives the front wheels to adjust the degree of turn robot. In robot’s movement test, 4 of 8 trials or approximately 50% stated better Sugeno Fuzzy Logic than Mamdani Fuzzy Logic in terms of linearity. In robot's controller response test, for Sugeno Fuzzy Logic method the average delay is 0.41 seconds, and for Mamdani Fuzzy Logic method the average delay is 10.80 seconds.

Propositional Logics of Dependence

NARCIS (Netherlands)

Yang, F.; Väänänen, J.

2016-01-01

In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well as propositional inquisitive logic, are expressively complete

Fuzzy logic control of vehicle suspensions with dry friction nonlinearity

Indian Academy of Sciences (India)

We design and investigate the performance of fuzzy logic-controlled (FLC) active suspensions on a nonlinear vehicle model with four degrees of freedom, without causing any degeneration in suspension working limits. Force actuators were mounted parallel to the suspensions. In this new approach, linear combinations of ...

Abductive Logic Grammars

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...

Applications of Logic Coverage Criteria and Logic Mutation to Software Testing

Science.gov (United States)

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…

A fuzzy logic pitch angle controller for power system stabilization

Energy Technology Data Exchange (ETDEWEB)

Jauch, Clemens; Cronin, Tom; Sorensen, Poul [Wind Energy Department, Riso National Laboratory, PO Box 49, DK-4000 Roskilde, (Denmark); Jensen, Birgitte Bak [Institute of Energy Technology, Aalborg University, Pontoppidanstraede 101, DK-9220 Aalborg East, (Denmark)

2006-07-12

In this article the design of a fuzzy logic pitch angle controller for a fixed speed, active-stall wind turbine, which is used for power system stabilization, is presented. The system to be controlled, which is the wind turbine and the power system to which the turbine is connected, is described. The advantages of fuzzy logic control when applied to large-signal control of active-stall wind turbines are outlined. The general steps of the design process for a fuzzy logic controller, including definition of the controller inputs, set-up of the fuzzy rules and the method of defuzzification, are described. The performance of the controller is assessed by simulation, where the wind turbine's task is to dampen power system oscillations. In the scenario simulated for this work, the wind turbine has to ride through a transient short-circuit fault and subsequently contribute to the damping of the grid frequency oscillations that are caused by the transient fault. It is concluded that the fuzzy logic controller enables the wind turbine to dampen power system oscillations. It is also concluded that, owing to the inherent non-linearities in a wind turbine and the unpredictability of the whole system, the fuzzy logic controller is very suitable for this application. (Author).

Design of stability-guaranteed fuzzy logic controller for nuclear steam generators

International Nuclear Information System (INIS)

Cho, B.H.; No, H.C.

1996-01-01

A fuzzy logic controller (FLC) and a fuzzy logic filter (FLF), which have a special type of fuzzifier, inference engine, and defuzzifier, are applied to the water level control of a nuclear steam generator (S/G). It is shown that arbitrary two-input, single-output linear controllers can be adequately expressed by this FLC. A procedure to construct stability-guaranteed FLC rules is proposed. It contains the following steps: (1) the stable sector of linear feedback gains is obtained from the suboptimal concept based on LQR theory and the Lyapunov's stability criteria; (2) the stable sector of linear gains is mapped into two linear rule tables that are used as limits for the FLC rules; and (3) the construction of an FLC rule table is done by choosing certain rules that lie between these limits. This type of FLC guarantees asymptotic stability of the control system. The FLF generates a feedforward signal of S/G feedwater from the steam flow measurement using a fuzzy concept. Through computer simulation, it is found that the FLC with the FLF works better than a well-tuned PID controller with variable gains to reduce swell/shrink phenomena, especially for the water level deviation and abrupt steam flow disturbances that are typical in the existing power plants

Stochastic coalgebraic logic

CERN Document Server

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.

Towards an arithmetical logic the arithmetical foundations of logic

CERN Document Server

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...

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...

Adaptive phase measurements in linear optical quantum computation

International Nuclear Information System (INIS)

Ralph, T C; Lund, A P; Wiseman, H M

2005-01-01

Photon counting induces an effective non-linear optical phase shift in certain states derived by linear optics from single photons. Although this non-linearity is non-deterministic, it is sufficient in principle to allow scalable linear optics quantum computation (LOQC). The most obvious way to encode a qubit optically is as a superposition of the vacuum and a single photon in one mode-so-called 'single-rail' logic. Until now this approach was thought to be prohibitively expensive (in resources) compared to 'dual-rail' logic where a qubit is stored by a photon across two modes. Here we attack this problem with real-time feedback control, which can realize a quantum-limited phase measurement on a single mode, as has been recently demonstrated experimentally. We show that with this added measurement resource, the resource requirements for single-rail LOQC are not substantially different from those of dual-rail LOQC. In particular, with adaptive phase measurements an arbitrary qubit state α vertical bar 0>+β vertical bar 1> can be prepared deterministically

Connections among quantum logics

International Nuclear Information System (INIS)

Lock, P.F.; Hardegree, G.M.

1985-01-01

In this paper, a theory of quantum logics is proposed which is general enough to enable us to reexamine a previous work on quantum logics in the context of this theory. It is then easy to assess the differences between the different systems studied. The quantum logical systems which are incorporated are divided into two groups which we call ''quantum propositional logics'' and ''quantum event logics''. The work of Kochen and Specker (partial Boolean algebras) is included and so is that of Greechie and Gudder (orthomodular partially ordered sets), Domotar (quantum mechanical systems), and Foulis and Randall (operational logics) in quantum propositional logics; and Abbott (semi-Boolean algebras) and Foulis and Randall (manuals) in quantum event logics, In this part of the paper, an axiom system for quantum propositional logics is developed and the above structures in the context of this system examined. (author)

A Comparison of Linear and Systems Thinking Approaches for Program Evaluation Illustrated Using the Indiana Interdisciplinary GK-12

Science.gov (United States)

Dyehouse, Melissa; Bennett, Deborah; Harbor, Jon; Childress, Amy; Dark, Melissa

2009-01-01

Logic models are based on linear relationships between program resources, activities, and outcomes, and have been used widely to support both program development and evaluation. While useful in describing some programs, the linear nature of the logic model makes it difficult to capture the complex relationships within larger, multifaceted…

Process optimization of citric acid production from aspergillus niger using fuzzy logic design

International Nuclear Information System (INIS)

Ali, S.; Haq, I.U.

2014-01-01

The inherent non-linearity of citric acid fermentation from Aspergillus niger renders its control difficult, so there is a need to fine-tune the bioreactor performance for maximum production of citric acid in batch culture. For this, fuzzy logic is becoming a popular tool to handle non-linearity of a batch process. The present manuscript deals with fuzzy logic control of citric acid accretion by A. niger in a stirred tank reactor using blackstrap sugarcane molasses as a basal fermentation medium. The customary batches were termed as 'control' while those under fuzzy logic were 'experimental'. The performance of fuzzy logic control of stirred tank reactor was found to be very encouraging for enhanced production of citric acid. The comparison of kinetic parameters showed improved citrate synthase ability of experimental culture (Yp/x = 7.042 g/g). When the culture grown on 150 g/l carbohydrates was monitored for Qp, Qs and Yp/s, there was significant enhancement in these variables over the control. Specific productivity of culture (qp = 0.070 g/g cells/h) was several fold increased. The enthalpy (HD = 70.5 kJ/mol) and entropy of activation (S = -144 J/mol/K) of enzyme for citric acid biosynthesis, free energies for transition state formation and substrate binding for sucrose hydrolysis of experimental were substantially improved. (author)

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....

Conjunction analysis and propositional logic in fMRI data analysis using Bayesian statistics.

Science.gov (United States)

Rudert, Thomas; Lohmann, Gabriele

2008-12-01

To evaluate logical expressions over different effects in data analyses using the general linear model (GLM) and to evaluate logical expressions over different posterior probability maps (PPMs). In functional magnetic resonance imaging (fMRI) data analysis, the GLM was applied to estimate unknown regression parameters. Based on the GLM, Bayesian statistics can be used to determine the probability of conjunction, disjunction, implication, or any other arbitrary logical expression over different effects or contrast. For second-level inferences, PPMs from individual sessions or subjects are utilized. These PPMs can be combined to a logical expression and its probability can be computed. The methods proposed in this article are applied to data from a STROOP experiment and the methods are compared to conjunction analysis approaches for test-statistics. The combination of Bayesian statistics with propositional logic provides a new approach for data analyses in fMRI. Two different methods are introduced for propositional logic: the first for analyses using the GLM and the second for common inferences about different probability maps. The methods introduced extend the idea of conjunction analysis to a full propositional logic and adapt it from test-statistics to Bayesian statistics. The new approaches allow inferences that are not possible with known standard methods in fMRI. (c) 2008 Wiley-Liss, Inc.

What are Institutional Logics

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...... as change and agency generated by friction between logics. We use these topics as basis for an analysis of selected empirical papers, with the aim of understanding how institutional logics contribute to institutional theory at large, and which social matters institutional logics can and cannot explore...

Dispositional logic

Science.gov (United States)

Le Balleur, J. C.

1988-01-01

The applicability of conventional mathematical analysis (based on the combination of two-valued logic and probability theory) to problems in which human judgment, perception, or emotions play significant roles is considered theoretically. It is shown that dispositional logic, a branch of fuzzy logic, has particular relevance to the common-sense reasoning typical of human decision-making. The concepts of dispositionality and usuality are defined analytically, and a dispositional conjunctive rule and dispositional modus ponens are derived.

Logic and structure

CERN Document Server

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...

CONTROL SYSTEM DESIGN WITH FUZZY LOGIC PID-СONTROLLER TYPE 2

Directory of Open Access Journals (Sweden)

A. Tунік

2011-04-01

Full Text Available This paper presents a fuzzy logic PID-controller synthesis method for solid body guidance. Formany nonlinear systems with nonlinearities and uncertainties, the performance of fuzzy controllertype 1 may not be satisfactory. Therefore, in this work, fuzzy logic type 2 controller design isintroduced. These controllers capture the advantage of a linear controller in terms of simplicity andalso can handle nonlinearity because of their inference mechanism.The main feature of the proposedmethod constitutes in a membership functions type 2 applications. The membership function type 2is represented by upper and lower membership functions of type 1. The interval between these twofunctions represent the footprint of uncertainty, which give an opportunity to synthesize commonregulator for set of a models. The structure of fuzzy logic controller for solid body control isgrounded. Simulation results confirm the effectiveness of the proposed approach.

First-Order Hybrid Logic

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...

Metamathematics of fuzzy logic

CERN Document Server

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.

Equational type logic

NARCIS (Netherlands)

Manca, V.; Salibra, A.; Scollo, Giuseppe

1990-01-01

Equational type logic is an extension of (conditional) equational logic, that enables one to deal in a single, unified framework with diverse phenomena such as partiality, type polymorphism and dependent types. In this logic, terms may denote types as well as elements, and atomic formulae are either

Henkin and Hybrid Logic

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....

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...... institutional logics in the course of their organizational practice. We introduce an exciting line of new works on the meta-theoretical foundations of logics, institutional logic processes, and institutional complexity and organizational responses. Collectively, the papers in this volume advance the very...... 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....

Greek, Indian and Arabic logic

CERN Document Server

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...

Error of quantum-logic simulation via vector-soliton collisions

International Nuclear Information System (INIS)

Janutka, Andrzej

2007-01-01

In a concept of simulating the quantum logic with vector solitons by the author (Janutka 2006 J. Phys. A: Math. Gen. 39 12505), the soliton polarization is thought of as a state vector of a system of cebits (classical counterparts of qubits) switched via collisions with other solitons. The advantage of this method of information processing compared to schemes using linear optics is the possibility of the determination of the information-register state in a single measurement. Minimization of the information-processing error for different optical realizations of the logical systems is studied in the framework of a quantum analysis of soliton fluctuations. The problem is considered with relevance to general difficulties of the quantum error-correction schemes for the classical analogies of the quantum-information processing

The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing

OpenAIRE

Dunn, J. Michael; Moss, Lawrence S.; Wang, Zhenghan

2013-01-01

We begin by discussing the history of quantum logic, dividing it into three eras or lives. The first life has to do with Birkhoff and von Neumann's algebraic approach in the 1930's. The second life has to do with attempt to understand quantum logic as logic that began in the late 1950's and blossomed in the 1970's. And the third life has to do with recent developments in quantum logic coming from its connections to quantum computation. We discuss our own work connecting quantum logic to quant...

Real Islamic Logic

NARCIS (Netherlands)

Bergstra, J.A.

2011-01-01

Four options for assigning a meaning to Islamic Logic are surveyed including a new proposal for an option named "Real Islamic Logic" (RIL). That approach to Islamic Logic should serve modern Islamic objectives in a way comparable to the functionality of Islamic Finance. The prospective role of RIL

What are Institutional Logics

OpenAIRE

Berg Johansen, Christina; Bock Waldorff, Susanne

2015-01-01

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 guided by institutional logics, as well as change and agency generated by friction between logics. We use these topics as basis for an analysis of selected empirical papers, with the aim of understanding how institutional logics contribute to...

Quantum logic using correlated one-dimensional quantum walks

Science.gov (United States)

Lahini, Yoav; Steinbrecher, Gregory R.; Bookatz, Adam D.; Englund, Dirk

2018-01-01

Quantum Walks are unitary processes describing the evolution of an initially localized wavefunction on a lattice potential. The complexity of the dynamics increases significantly when several indistinguishable quantum walkers propagate on the same lattice simultaneously, as these develop non-trivial spatial correlations that depend on the particle's quantum statistics, mutual interactions, initial positions, and the lattice potential. We show that even in the simplest case of a quantum walk on a one dimensional graph, these correlations can be shaped to yield a complete set of compact quantum logic operations. We provide detailed recipes for implementing quantum logic on one-dimensional quantum walks in two general cases. For non-interacting bosons—such as photons in waveguide lattices—we find high-fidelity probabilistic quantum gates that could be integrated into linear optics quantum computation schemes. For interacting quantum-walkers on a one-dimensional lattice—a situation that has recently been demonstrated using ultra-cold atoms—we find deterministic logic operations that are universal for quantum information processing. The suggested implementation requires minimal resources and a level of control that is within reach using recently demonstrated techniques. Further work is required to address error-correction.

Some relationships between logic programming and multiple-valued logic

International Nuclear Information System (INIS)

Rine, D.C.

1986-01-01

There have been suggestions in the artificial intelligence literature that investigations into relationships between logic programming and multiple-valued logic may be helpful. This paper presents some of these relationships through equivalent algebraic evaluations

People Like Logical Truth: Testing the Intuitive Detection of Logical Value in Basic Propositions.

Directory of Open Access Journals (Sweden)

Hiroko Nakamura

Full Text Available Recent studies on logical reasoning have suggested that people are intuitively aware of the logical validity of syllogisms or that they intuitively detect conflict between heuristic responses and logical norms via slight changes in their feelings. According to logical intuition studies, logically valid or heuristic logic no-conflict reasoning is fluently processed and induces positive feelings without conscious awareness. One criticism states that such effects of logicality disappear when confounding factors such as the content of syllogisms are controlled. The present study used abstract propositions and tested whether people intuitively detect logical value. Experiment 1 presented four logical propositions (conjunctive, biconditional, conditional, and material implications regarding a target case and asked the participants to rate the extent to which they liked the statement. Experiment 2 tested the effects of matching bias, as well as intuitive logic, on the reasoners' feelings by manipulating whether the antecedent or consequent (or both of the conditional was affirmed or negated. The results showed that both logicality and matching bias affected the reasoners' feelings, and people preferred logically true targets over logically false ones for all forms of propositions. These results suggest that people intuitively detect what is true from what is false during abstract reasoning. Additionally, a Bayesian mixed model meta-analysis of conditionals indicated that people's intuitive interpretation of the conditional "if p then q" fits better with the conditional probability, q given p.

Fuzzy logic prediction of dew point pressure of selected Iranian gas condensate reservoirs

Energy Technology Data Exchange (ETDEWEB)

Nowroozi, Saeed [Shahid Bahonar Univ. of Kerman (Iran); Iranian Offshore Oil Company (I.O.O.C.) (Iran); Ranjbar, Mohammad; Hashemipour, Hassan; Schaffie, Mahin [Shahid Bahonar Univ. of Kerman (Iran)

2009-12-15

The experimental determination of dew point pressure in a window PVT cell is often difficult especially in the case of lean retrograde gas condensate. Besides all statistical, graphical and experimental methods, the fuzzy logic method can be useful and more reliable for estimation of reservoir properties. Fuzzy logic can overcome uncertainty existent in many reservoir properties. Complexity, non-linearity and vagueness are some reservoir parameter characteristics, which can be propagated simply by fuzzy logic. The fuzzy logic dew point pressure modeling system used in this study is a multi input single output (MISO) Mamdani system. The model was developed using experimentally constant volume depletion (CVD) measured samples of some Iranian fields. The performance of the model is compared against the performance of some of the most accurate and general correlations for dew point pressure calculation. Results show that this novel method is more accurate and reliable with an average absolute deviation of 1.33% and 2.68% for developing and checking, respectively. (orig.)

Concurrent weighted logic

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....

Error-Transparent Quantum Gates for Small Logical Qubit Architectures

Science.gov (United States)

Kapit, Eliot

2018-02-01

One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems from a combination of control errors and random single qubit errors from interaction with the environment. While great strides have been made in mitigating control errors, intrinsic qubit error remains a serious problem that limits gate fidelity in modern qubit architectures. Simultaneously, recent developments of small error-corrected logical qubit devices promise significant increases in logical state lifetime, but translating those improvements into increases in gate fidelity is a complex challenge. In this Letter, we construct protocols for gates on and between small logical qubit devices which inherit the parent device's tolerance to single qubit errors which occur at any time before or during the gate. We consider two such devices, a passive implementation of the three-qubit bit flip code, and the author's own [E. Kapit, Phys. Rev. Lett. 116, 150501 (2016), 10.1103/PhysRevLett.116.150501] very small logical qubit (VSLQ) design, and propose error-tolerant gate sets for both. The effective logical gate error rate in these models displays superlinear error reduction with linear increases in single qubit lifetime, proving that passive error correction is capable of increasing gate fidelity. Using a standard phenomenological noise model for superconducting qubits, we demonstrate a realistic, universal one- and two-qubit gate set for the VSLQ, with error rates an order of magnitude lower than those for same-duration operations on single qubits or pairs of qubits. These developments further suggest that incorporating small logical qubits into a measurement based code could substantially improve code performance.

Action Type Deontic Logic

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...... are evaluated with respect to the benchmark cases. After that follows an informal introduction to the ideas behind the formal semantics, focussing on the distinction between action types and action tokens. Then the syntax and semantics of Action Type Deontic Logic is presented and it is shown to meet...

Evaluating linear-nonlinear thinking style for knowledge management education

OpenAIRE

Constantin Bratianu; Simona Vasilache

2009-01-01

The purpose of this paper is to present a new perspective of the linear-nonlinear thinking style and its critical role in knowledge management education. Previous works in this field identified linear thinking as being rational, logic and analytic, and nonlinear thinking as being based on intuition, insight and creativity. In this perspective, linear thinking is related mostly with cognitive intelligence, while nonlinear thinking is related mostly with emotional intelligence. These interpreta...

Quantifiers for quantum logic

OpenAIRE

Heunen, Chris

2008-01-01

We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is just an incarnation of categorical logic, enabling us to establish an existential quantifier for quantum logic, and conclude that there cannot be a universal quantifier.

Fuzzy logic based control system for fresh water aquaculture: A MATLAB based simulation approach

Directory of Open Access Journals (Sweden)

Rana Dinesh Singh

2015-01-01

Full Text Available Fuzzy control is regarded as the most widely used application of fuzzy logic. Fuzzy logic is an innovative technology to design solutions for multiparameter and non-linear control problems. One of the greatest advantages of fuzzy control is that it uses human experience and process information obtained from operator rather than a mathematical model for the definition of a control strategy. As a result, it often delivers solutions faster than conventional control design techniques. The proposed system is an attempt to apply fuzzy logic techniques to predict the stress factor on the fish, based on line data and rule base generated using domain expert. The proposed work includes a use of Data acquisition system, an interfacing device for on line parameter acquisition and analysis, fuzzy logic controller (FLC for inferring the stress factor. The system takes stress parameters on the fish as inputs, fuzzified by using FLC with knowledge base rules and finally provides single output. All the parameters are controlled and calibrated by the fuzzy logic toolbox and MATLAB programming.

A Logical Process Calculus

Science.gov (United States)

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.

Logic delays of 5-μm resistor coupled Josephson logic

International Nuclear Information System (INIS)

Sone, J.; Yoshida, T.; Tahara, S.; Abe, H.

1982-01-01

Logic delays of resistor coupled Josephson logic (RCJL) have been investigated. An experimental circuit with a cascade chain of ten RCJL OR gates was fabricated using Pb-alloy Josephson IC technology with 5-μm minimum linewidth. Logic delay was measured to be as low as 10.8 ps with power dissipation of 11.7 μW. This demonstrates a switching operation faster than those reported for other Josephson gate designs. Comparison with computer-simulation results is also presented

Radiation tolerant combinational logic cell

Science.gov (United States)

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.

Erotetic epistemic logic

Czech Academy of Sciences Publication Activity Database

Peliš, Michal

2017-01-01

Roč. 26, č. 3 (2017), s. 357-381 ISSN 1425-3305 R&D Projects: GA ČR(CZ) GC16-07954J Institutional support: RVO:67985955 Keywords : epistemic logic * erotetic implication * erotetic logic * logic of questions Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology http://apcz.umk.pl/czasopisma/index.php/LLP/article/view/LLP.2017.007

Analysis of Linear Hybrid Systems in CLP

DEFF Research Database (Denmark)

Banda, Gourinath; Gallagher, John Patrick

2009-01-01

In this paper we present a procedure for representing the semantics of linear hybrid automata (LHAs) as constraint logic programs (CLP); flexible and accurate analysis and verification of LHAs can then be performed using generic CLP analysis and transformation tools. LHAs provide an expressive...

The Football of Logic

Directory of Open Access Journals (Sweden)

Schang Fabien

2017-03-01

Full Text Available An analogy is made between two rather different domains, namely: logic, and football (or soccer. Starting from a comparative table between the two activities, an alternative explanation of logic is given in terms of players, ball, goal, and the like. Our main thesis is that, just as the task of logic is preserving truth from premises to the conclusion, footballers strive to keep the ball as far as possible until the opposite goal. Assuming this analogy may help think about logic in the same way as in dialogical logic, but it should also present truth-values in an alternative sense of speech-acts occurring in a dialogue. The relativity of truth-values is focused by this way, thereby leading to an additional way of logical pluralism.

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...

A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems

Directory of Open Access Journals (Sweden)

Qingshan Chen

2017-01-01

Full Text Available Clause learning is the key component of modern SAT solvers, while conflict analysis based on the implication graph is the mainstream technology to generate the learnt clauses. Whenever a clause in the clause database is falsified by the current variable assignments, the SAT solver will try to analyze the reason by using different cuts (i.e., the Unique Implication Points on the implication graph. Those schemes reflect only the conflict on the current search subspace, does not reflect the inherent conflict directly involved in the rest space. In this paper, we propose a new advanced clause learning algorithm based on the conflict analysis and the logical deduction, which reconstructs a linear logical deduction by analyzing the relationship of different decision variables between the backjumping level and the current decision level. The logical deduction result is then added into the clause database as a newly learnt clause. The resulting implementation in Minisat improves the state-of-the-art performance in SAT solving.

A fast-slow logic system

International Nuclear Information System (INIS)

Kawashima, Hideo.

1977-01-01

A fast-slow logic system has been made for use in multi-detector experiments in nuclear physics such as particle-gamma and particle-particle coincidence experiments. The system consists of a fast logic system and a slow logic system. The fast logic system has a function of fast coincidences and provides timing signals for the slow logic system. The slow logic system has a function of slow coincidences and a routing control of input analog signals to the ADCs. (auth.)

Logic for Physicists

Science.gov (United States)

Pereyra, Nicolas A.

2018-06-01

This book gives a rigorous yet 'physics-focused' introduction to mathematical logic that is geared towards natural science majors. We present the science major with a robust introduction to logic, focusing on the specific knowledge and skills that will unavoidably be needed in calculus topics and natural science topics in general (rather than taking a philosophical-math-fundamental oriented approach that is commonly found in mathematical logic textbooks).

Logic of likelihood

International Nuclear Information System (INIS)

Wall, M.J.W.

1992-01-01

The notion of open-quotes probabilityclose quotes is generalized to that of open-quotes likelihood,close quotes and a natural logical structure is shown to exist for any physical theory which predicts likelihoods. Two physically based axioms are given for this logical structure to form an orthomodular poset, with an order-determining set of states. The results strengthen the basis of the quantum logic approach to axiomatic quantum theory. 25 refs

One reason, several logics

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.

GOAL Agents Instantiate Intention Logic

OpenAIRE

Hindriks, Koen; van der Hoek, Wiebe

2008-01-01

It is commonly believed there is a big gap between agent logics and computational agent frameworks. In this paper, we show that this gap is not as big as believed by showing that GOAL agents instantiate Intention Logic of Cohen and Levesque. That is, we show that GOAL agent programs can be formally related to Intention Logic.We do so by proving that the GOAL Verification Logic can be embedded into Intention Logic. It follows that (a fragment of) Intention Logic can be used t...

Noise-based logic: Binary, multi-valued, or fuzzy, with optional superposition of logic states

Energy Technology Data Exchange (ETDEWEB)

Kish, Laszlo B. [Texas A and M University, Department of Electrical and Computer Engineering, College Station, TX 77843-3128 (United States)], E-mail: laszlo.kish@ece.tamu.edu

2009-03-02

A new type of deterministic (non-probabilistic) computer logic system inspired by the stochasticity of brain signals is shown. The distinct values are represented by independent stochastic processes: independent voltage (or current) noises. The orthogonality of these processes provides a natural way to construct binary or multi-valued logic circuitry with arbitrary number N of logic values by using analog circuitry. Moreover, the logic values on a single wire can be made a (weighted) superposition of the N distinct logic values. Fuzzy logic is also naturally represented by a two-component superposition within the binary case (N=2). Error propagation and accumulation are suppressed. Other relevant advantages are reduced energy dissipation and leakage current problems, and robustness against circuit noise and background noises such as 1/f, Johnson, shot and crosstalk noise. Variability problems are also non-existent because the logic value is an AC signal. A similar logic system can be built with orthogonal sinusoidal signals (different frequency or orthogonal phase) however that has an extra 1/N type slowdown compared to the noise-based logic system with increasing number of N furthermore it is less robust against time delay effects than the noise-based counterpart.

Noise-based logic: Binary, multi-valued, or fuzzy, with optional superposition of logic states

International Nuclear Information System (INIS)

Kish, Laszlo B.

2009-01-01

A new type of deterministic (non-probabilistic) computer logic system inspired by the stochasticity of brain signals is shown. The distinct values are represented by independent stochastic processes: independent voltage (or current) noises. The orthogonality of these processes provides a natural way to construct binary or multi-valued logic circuitry with arbitrary number N of logic values by using analog circuitry. Moreover, the logic values on a single wire can be made a (weighted) superposition of the N distinct logic values. Fuzzy logic is also naturally represented by a two-component superposition within the binary case (N=2). Error propagation and accumulation are suppressed. Other relevant advantages are reduced energy dissipation and leakage current problems, and robustness against circuit noise and background noises such as 1/f, Johnson, shot and crosstalk noise. Variability problems are also non-existent because the logic value is an AC signal. A similar logic system can be built with orthogonal sinusoidal signals (different frequency or orthogonal phase) however that has an extra 1/N type slowdown compared to the noise-based logic system with increasing number of N furthermore it is less robust against time delay effects than the noise-based counterpart

Noise-based logic: Binary, multi-valued, or fuzzy, with optional superposition of logic states

Science.gov (United States)

Kish, Laszlo B.

2009-03-01

A new type of deterministic (non-probabilistic) computer logic system inspired by the stochasticity of brain signals is shown. The distinct values are represented by independent stochastic processes: independent voltage (or current) noises. The orthogonality of these processes provides a natural way to construct binary or multi-valued logic circuitry with arbitrary number N of logic values by using analog circuitry. Moreover, the logic values on a single wire can be made a (weighted) superposition of the N distinct logic values. Fuzzy logic is also naturally represented by a two-component superposition within the binary case ( N=2). Error propagation and accumulation are suppressed. Other relevant advantages are reduced energy dissipation and leakage current problems, and robustness against circuit noise and background noises such as 1/f, Johnson, shot and crosstalk noise. Variability problems are also non-existent because the logic value is an AC signal. A similar logic system can be built with orthogonal sinusoidal signals (different frequency or orthogonal phase) however that has an extra 1/N type slowdown compared to the noise-based logic system with increasing number of N furthermore it is less robust against time delay effects than the noise-based counterpart.

Regression Models and Fuzzy Logic Prediction of TBM Penetration Rate

Directory of Open Access Journals (Sweden)

Minh Vu Trieu

2017-03-01

Full Text Available This paper presents statistical analyses of rock engineering properties and the measured penetration rate of tunnel boring machine (TBM based on the data of an actual project. The aim of this study is to analyze the influence of rock engineering properties including uniaxial compressive strength (UCS, Brazilian tensile strength (BTS, rock brittleness index (BI, the distance between planes of weakness (DPW, and the alpha angle (Alpha between the tunnel axis and the planes of weakness on the TBM rate of penetration (ROP. Four (4 statistical regression models (two linear and two nonlinear are built to predict the ROP of TBM. Finally a fuzzy logic model is developed as an alternative method and compared to the four statistical regression models. Results show that the fuzzy logic model provides better estimations and can be applied to predict the TBM performance. The R-squared value (R2 of the fuzzy logic model scores the highest value of 0.714 over the second runner-up of 0.667 from the multiple variables nonlinear regression model.

Regression Models and Fuzzy Logic Prediction of TBM Penetration Rate

Science.gov (United States)

Minh, Vu Trieu; Katushin, Dmitri; Antonov, Maksim; Veinthal, Renno

2017-03-01

This paper presents statistical analyses of rock engineering properties and the measured penetration rate of tunnel boring machine (TBM) based on the data of an actual project. The aim of this study is to analyze the influence of rock engineering properties including uniaxial compressive strength (UCS), Brazilian tensile strength (BTS), rock brittleness index (BI), the distance between planes of weakness (DPW), and the alpha angle (Alpha) between the tunnel axis and the planes of weakness on the TBM rate of penetration (ROP). Four (4) statistical regression models (two linear and two nonlinear) are built to predict the ROP of TBM. Finally a fuzzy logic model is developed as an alternative method and compared to the four statistical regression models. Results show that the fuzzy logic model provides better estimations and can be applied to predict the TBM performance. The R-squared value (R2) of the fuzzy logic model scores the highest value of 0.714 over the second runner-up of 0.667 from the multiple variables nonlinear regression model.

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 mech­anics 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—underpin­ning its dynamics. This logic will be considered in light of what has been identified as mass me­dia logic, which has helped spread the media's powerful discourse outside its institutional boundaries. Theorizing social media logic, we identify four grounding principles—programmabil­ity, popularity, connectivity, and datafication—and argue that these principles become increas­ingly 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 ex­isting 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 relat­ively simple to identify, but it is much harder to map the complex connections between plat­forms that distribute this logic: users that employ them, technologies that

Reprogrammable Logic Gate and Logic Circuit Based on Multistimuli-Responsive Raspberry-like Micromotors.

Science.gov (United States)

Zhang, Lina; Zhang, Hui; Liu, Mei; Dong, Bin

2016-06-22

In this paper, we report a polymer-based raspberry-like micromotor. Interestingly, the resulting micromotor exhibits multistimuli-responsive motion behavior. Its on-off-on motion can be regulated by the application of stimuli such as H2O2, near-infrared light, NH3, or their combinations. Because of the versatility in motion control, the current micromotor has great potential in the application field of logic gate and logic circuit. With use of different stimuli as the inputs and the micromotor motion as the output, reprogrammable OR and INHIBIT logic gates or logic circuit consisting of OR, NOT, and AND logic gates can be achieved.

Enriching an effect calculus with linear types

DEFF Research Database (Denmark)

Egger, Jeff; Møgelberg, Rasmus Ejlers; Simpson, Alex

2009-01-01

We define an ``enriched effect calculus'' by conservatively extending  a type theory for computational effects with primitives from linear logic. By doing so, we obtain a generalisation of linear type theory, intended as a formalism for expressing linear aspects of effects. As a worked example, we...... formulate  linearly-used continuations in the enriched effect calculus. These are captured by a fundamental translation of the enriched effect calculus into itself, which extends existing call-by-value and call-by-name linearly-used CPS translations. We show that our translation is involutive. Full...... completeness results for the various linearly-used CPS translations  follow. Our main results, the conservativity of enriching the effect calculus with linear primitives, and the involution property of the fundamental translation, are proved using a category-theoretic semantics for the enriched effect calculus...

Conference Trends in Logic XI

CERN Document Server

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 ...

Logic analysis and verification of n-input genetic logic circuits

DEFF Research Database (Denmark)

Baig, Hasan; Madsen, Jan

2017-01-01

. 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......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...

Prospects of luminescence based molecular scale logic gates and logic circuits

International Nuclear Information System (INIS)

Speiser, Shammai

2016-01-01

In recent years molecular electronics has emerged as a rapidly growing research field. The aim of this review is to introduce this subject as a whole with special emphasis on molecular scale potential devices and applications. As a particular example we will discuss all optical molecular scale logic gates and logic circuits based on molecular fluorescence and electronic excitation transfer processes. Charge and electronic energy transfers (ET and EET) are well-studied examples whereby different molecules can signal their state from one (the donor, D) to the other (the acceptor, A). We show how a half-adder logic circuit can be implemented on one molecule that can communicate its logic output as input to another half-adder molecule. This is achieved as an electronic energy transfer from a donor to an acceptor, thus implementing a molecular full adder. We discuss a specific pair, the rhodamine–azulene, for which there is considerable spectroscopic data, but the scheme is general enough to allow a wide choice of D and A pairs. We present results based on this pair, in which, for the first time, an all optical half-adder and full-adder logic circuits are implemented. - Highlights: • Molecular scale logic • Photoquenching • Full adder

Prospects of luminescence based molecular scale logic gates and logic circuits

Energy Technology Data Exchange (ETDEWEB)

Speiser, Shammai, E-mail: speiser@technion.ac.il

2016-01-15

In recent years molecular electronics has emerged as a rapidly growing research field. The aim of this review is to introduce this subject as a whole with special emphasis on molecular scale potential devices and applications. As a particular example we will discuss all optical molecular scale logic gates and logic circuits based on molecular fluorescence and electronic excitation transfer processes. Charge and electronic energy transfers (ET and EET) are well-studied examples whereby different molecules can signal their state from one (the donor, D) to the other (the acceptor, A). We show how a half-adder logic circuit can be implemented on one molecule that can communicate its logic output as input to another half-adder molecule. This is achieved as an electronic energy transfer from a donor to an acceptor, thus implementing a molecular full adder. We discuss a specific pair, the rhodamine–azulene, for which there is considerable spectroscopic data, but the scheme is general enough to allow a wide choice of D and A pairs. We present results based on this pair, in which, for the first time, an all optical half-adder and full-adder logic circuits are implemented. - Highlights: • Molecular scale logic • Photoquenching • Full adder.

A uniform geometrical optics and an extended uniform geometrical theory of diffraction for evaluating high frequency EM fields near smooth caustics and composite shadow boundaries

Science.gov (United States)

Constantinides, E. D.; Marhefka, R. J.

1994-01-01

A uniform geometrical optics (UGO) and an extended uniform geometrical theory of diffraction (EUTD) are developed for evaluating high frequency electromagnetic (EM) fields within transition regions associated with a two and three dimensional smooth caustic of reflected rays and a composite shadow boundary formed by the caustic termination or the confluence of the caustic with the reflection shadow boundary (RSB). The UGO is a uniform version of the classic geometrical optics (GO). It retains the simple ray optical expressions of classic GO and employs a new set of uniform reflection coefficients. The UGO also includes a uniform version of the complex GO ray field that exists on the dark side of the smooth caustic. The EUTD is an extension of the classic uniform geometrical theory of diffraction (UTD) and accounts for the non-ray optical behavior of the UGO reflected field near caustics by using a two-variable transition function in the expressions for the edge diffraction coefficients. It also uniformly recovers the classic UTD behavior of the edge diffracted field outside the composite shadow boundary transition region. The approach employed for constructing the UGO/EUTD solution is based on a spatial domain physical optics (PO) radiation integral representation for the fields which is then reduced using uniform asymptotic procedures. The UGO/EUTD analysis is also employed to investigate the far-zone RCS problem of plane wave scattering from two and three dimensional polynomial defined surfaces, and uniform reflection, zero-curvature, and edge diffraction coefficients are derived. Numerical results for the scattering and diffraction from cubic and fourth order polynomial strips are also shown and the UGO/EUTD solution is validated by comparison to an independent moment method (MM) solution. The UGO/EUTD solution is also compared with the classic GO/UTD solution. The failure of the classic techniques near caustics and composite shadow boundaries is clearly

Quantum logics with existence property

International Nuclear Information System (INIS)

Schindler, C.

1991-01-01

A quantum logic (σ-orthocomplete orthomodular poset L with a convex, unital, and separating set Δ of states) is said to have the existence property if the expectation functionals on lin(Δ) associated with the bounded observables of L form a vector space. Classical quantum logics as well as the Hilbert space logics of traditional quantum mechanics have this property. The author shows that, if a quantum logic satisfies certain conditions in addition to having property E, then the number of its blocks (maximal classical subsystems) must either be one (classical logics) or uncountable (as in Hilbert space logics)

Flat Coalgebraic Fixed Point Logics

Science.gov (United States)

Schröder, Lutz; Venema, Yde

Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-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 μ-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 μ-calculus including, e.g., flat fragments of the graded μ-calculus and the alternating-time μ-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 μ-calculus but avoids using automata.

MEMS Logic Using Mixed-Frequency Excitation

KAUST Repository

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

Amplifying genetic logic gates.

Science.gov (United States)

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.

The Quantum Logical Challenge: Peter Mittelstaedt's Contributions to Logic and Philosophy of Science

Science.gov (United States)

Beltrametti, E.; Dalla Chiara, M. L.; Giuntini, R.

2017-12-01

Peter Mittelstaedt's contributions to quantum logic and to the foundational problems of quantum theory have significantly realized the most authentic spirit of the International Quantum Structures Association: an original research about hard technical problems, which are often "entangled" with the emergence of important changes in our general world-conceptions. During a time where both the logical and the physical community often showed a skeptical attitude towards Birkhoff and von Neumann's quantum logic, Mittelstaedt brought into light the deeply innovating features of a quantum logical thinking that allows us to overcome some strong and unrealistic assumptions of classical logical arguments. Later on his intense research on the unsharp approach to quantum theory and to the measurement problem stimulated the increasing interest for unsharp forms of quantum logic, creating a fruitful interaction between the work of quantum logicians and of many-valued logicians. Mittelstaedt's general views about quantum logic and quantum theory seem to be inspired by a conjecture that is today more and more confirmed: there is something universal in the quantum theoretic formalism that goes beyond the limits of microphysics, giving rise to interesting applications to a number of different fields.

Fuzzy logic controllers and chaotic natural convection loops

International Nuclear Information System (INIS)

Theler, German

2007-01-01

The study of natural circulation loops is a subject of special concern for the engineering design of advanced nuclear reactors, as natural convection provides an efficient and completely passive heat removal system. However, under certain circumstances thermal-fluid-dynamical instabilities may appear, threatening the reactor safety as a whole.On the other hand, fuzzy logic controllers provide an ideal framework to approach highly non-linear control problems. In the present work, we develop a software-based fuzzy logic controller and study its application to chaotic natural convection loops.We numerically analyse the linguistic control of the loop known as the Welander problem in such conditions that, if the controller were not present, the circulation flow would be non-periodic unstable.We also design a Taka gi-Sugeno fuzzy controller based on a fuzzy model of a natural convection loop with a toroidal geometry, in order to stabilize a Lorenz-chaotic behaviour.Finally, we show experimental results obtained in a rectangular natural circulation loop [es

Querying Natural Logic Knowledge Bases

DEFF Research Database (Denmark)

Andreasen, Troels; Bulskov, Henrik; Jensen, Per Anker

2017-01-01

This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes...... in ontologies and class-relationships such as are common in life-science descriptions. The paper adopts a version of natural logic with recursive restrictive clauses such as relative clauses and adnominal prepositional phrases. It includes passive as well as active voice sentences. We outline a prototype...... for partial translation of natural language into natural logic, featuring further querying and conceptual path finding in natural logic knowledge bases....

Questions and dependency in intuitionistic logic

NARCIS (Netherlands)

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

Logic Meeting

CERN Document Server

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.

What is mathematical logic?

CERN Document Server

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

Introduction to mathematical logic

CERN Document Server

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

A Logic for Choreographies

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 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...

Fuzzy Logic and Arithmetical Hierarchy III

Czech Academy of Sciences Publication Activity Database

Hájek, Petr

2001-01-01

Roč. 68, č. 1 (2001), s. 129-142 ISSN 0039-3215 R&D Projects: GA AV ČR IAA1030004 Institutional research plan: AV0Z1030915 Keywords : fuzzy logic * basic fuzzy logic * Lukasiewicz logic * Godel logic * product logic * arithmetical hierarchy Subject RIV: BA - General Mathematics

Modern logic and quantum mechanics

International Nuclear Information System (INIS)

Garden, R.W.

1984-01-01

The book applies the methods of modern logic and probabilities to ''interpreting'' quantum mechanics. The subject is described and discussed under the chapter headings: classical and quantum mechanics, modern logic, the propositional logic of mechanics, states and measurement in mechanics, the traditional analysis of probabilities, the probabilities of mechanics and the model logic of predictions. (U.K.)

Semantic theory for logic programming

Energy Technology Data Exchange (ETDEWEB)

Brown, F M

1981-01-01

The author axiomatizes a number of meta theoretic concepts which have been used in logic programming, including: meaning, logical truth, nonentailment, assertion and erasure, thus showing that these concepts are logical in nature and need not be defined as they have previously been defined in terms of the operations of any particular interpreter for logic programs. 10 references.

FUZZY LOGIC CONTROLLER AS MODELING TOOL FOR THE BURNING PROCESS OF A CEMENT PRODUCTION PLANT

Directory of Open Access Journals (Sweden)

P.B. Osofisan

2012-01-01

Full Text Available

ENGLISH ABSTRACT: A comprehensive optimisation of the cement production process presents a problem since the input variables as well as the output variables are non-linear, interdependent and contain uncertainties. To arrive at a solution, a Fuzzy Logic controller has been designed to achieve a well-defined relationship between the main and vital variables through the instrumentality of a Fuzzy Model. The Fuzzy Logic controller has been simulated on a digital computer using MATLAB 5.0 Fuzzy Logic Tool Box, using data from a local cement production plant.

AFRIKAANSE OPSOMMING: Die omvattende optimisering van 'n proses wat sement vervaardig, word beskryf deur nie-linieêre inset- en uitsetveranderlikes wat onderling afhanklik is, en ook van onsekere aard is. Om 'n optimum oplossing te verkry, word 'n Wasigheidsmodel gebruik. Die model word getoets deur gebruik te maak van die MATLAB 5.0 Fuzzy Logic Tool Box en data vanaf 'n lokale sementvervaardigingsaanleg.

Logic and Learning

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....

Magnonic logic circuits

International Nuclear Information System (INIS)

Khitun, Alexander; Bao Mingqiang; Wang, Kang L

2010-01-01

We describe and analyse possible approaches to magnonic logic circuits and basic elements required for circuit construction. A distinctive feature of the magnonic circuitry is that information is transmitted by spin waves propagating in the magnetic waveguides without the use of electric current. The latter makes it possible to exploit spin wave phenomena for more efficient data transfer and enhanced logic functionality. We describe possible schemes for general computing and special task data processing. The functional throughput of the magnonic logic gates is estimated and compared with the conventional transistor-based approach. Magnonic logic circuits allow scaling down to the deep submicrometre range and THz frequency operation. The scaling is in favour of the magnonic circuits offering a significant functional advantage over the traditional approach. The disadvantages and problems of the spin wave devices are also discussed.

Relativistic quantum logic

International Nuclear Information System (INIS)

Mittelstaedt, P.

1983-01-01

on the basis of the well-known quantum logic and quantum probability a formal language of relativistic quantum physics is developed. This language incorporates quantum logical as well as relativistic restrictions. It is shown that relativity imposes serious restrictions on the validity regions of propositions in space-time. By an additional postulate this relativistic quantum logic can be made consistent. The results of this paper are derived exclusively within the formal quantum language; they are, however, in accordance with well-known facts of relativistic quantum physics in Hilbert space. (author)

Implementing conventional logic unconventionally: photochromic molecular populations as registers and logic gates.

Science.gov (United States)

Chaplin, J C; Russell, N A; Krasnogor, N

2012-07-01

In this paper we detail experimental methods to implement registers, logic gates and logic circuits using populations of photochromic molecules exposed to sequences of light pulses. Photochromic molecules are molecules with two or more stable states that can be switched reversibly between states by illuminating with appropriate wavelengths of radiation. Registers are implemented by using the concentration of molecules in each state in a given sample to represent an integer value. The register's value can then be read using the intensity of a fluorescence signal from the sample. Logic gates have been implemented using a register with inputs in the form of light pulses to implement 1-input/1-output and 2-input/1-output logic gates. A proof of concept logic circuit is also demonstrated; coupled with the software workflow describe the transition from a circuit design to the corresponding sequence of light pulses. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

A Logic for Choreographies

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.

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...

Heterogeneous logics of competition

DEFF Research Database (Denmark)

Mossin, Christiane

2015-01-01

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...... 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...

Basic logic and quantum entanglement

International Nuclear Information System (INIS)

Zizzi, P A

2007-01-01

As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective 'entanglement' in a logical sequent calculus for the machine language? And also, is it possible to 'teach' the quantum computer to 'mimic' the EPR 'paradox'? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective 'entanglement'). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing

Using Abductive Research Logic: "The Logic of Discovery", to Construct a Rigorous Explanation of Amorphous Evaluation Findings

Science.gov (United States)

Levin-Rozalis, Miri

2010-01-01

Background: Two kinds of research logic prevail in scientific research: deductive research logic and inductive research logic. However, both fail in the field of evaluation, especially evaluation conducted in unfamiliar environments. Purpose: In this article I wish to suggest the application of a research logic--"abduction"--"the logic of…

Circuit Simulation of All-Spin Logic

KAUST Repository

Alawein, Meshal

2016-05-01

With the aggressive scaling of complementary metal-oxide semiconductor (CMOS) nearing an inevitable physical limit and its well-known power crisis, the quest for an alternative/augmenting technology that surpasses the current semiconductor electronics is needed for further technological progress. Spintronic devices emerge as prime candidates for Beyond CMOS era by utilizing the electron spin as an extra degree of freedom to decrease the power consumption and overcome the velocity limit connected with the charge. By using the nonvolatility nature of magnetization along with its direction to represent a bit of information and then manipulating it by spin-polarized currents, routes are opened for combined memory and logic. This would not have been possible without the recent discoveries in the physics of nanomagnetism such as spin-transfer torque (STT) whereby a spin-polarized current can excite magnetization dynamics through the transfer of spin angular momentum. STT have expanded the available means of switching the magnetization of magnetic layers beyond old classical techniques, promising to fulfill the need for a new generation of dense, fast, and nonvolatile logic and storage devices. All-spin logic (ASL) is among the most promising spintronic logic switches due to its low power consumption, logic-in-memory structure, and operation on pure spin currents. The device is based on a lateral nonlocal spin valve and STT switching. It utilizes two nanomagnets (whereby information is stored) that communicate with pure spin currents through a spin-coherent nonmagnetic channel. By using the well-known spin physics and the recently proposed four-component spin circuit formalism, ASL can be thoroughly studied and simulated. Previous attempts to model ASL in the linear and diffusive regime either neglect the dynamic characteristics of transport or do not provide a scalable and robust platform for full micromagnetic simulations and inclusion of other effects like spin Hall

Connections among quantum logics

International Nuclear Information System (INIS)

Lock, P.F.; Hardegree, G.M.

1985-01-01

This paper gives a brief introduction to the major areas of work in quantum event logics: manuals (Foulis and Randall) and semi-Boolean algebras (Abbott). The two theories are compared, and the connection between quantum event logics and quantum propositional logics is made explicit. In addition, the work on manuals provides us with many examples of results stated in Part I. (author)

Safety logic systems of PFBR

International Nuclear Information System (INIS)

Sambasivan, S. Ilango

2004-01-01

Full text : PFBR is provided with two independent, fast acting and diverse shutdown systems to detect any abnormalities and to initiate safety action. Each system consists of sensors, signal processing systems, logics, drive mechanisms and absorber rods. The absorber rods of the first system are Control and Safety Rods (CSR) and that of the second are called as Diverse Safety Rods (DSR). There are nine CSR and three DSR. While CSR are used for startup, control of reactor power, controlled shutdown and SCRAM, the DSR are used only for SCRAM. The respective drive mechanisms are called as CSRDM and DSRDM. Each of these two systems is capable of executing the shutdown satisfactorily with single failure criteria. Two independent safety logic systems based on diverse principles have been designed for the two shut down systems. The analog outputs of the sensors of Core Monitoring Systems comprising of reactor flux monitoring, core temperature monitoring, failed fuel detection and core flow monitoring systems are processed and converted into binary signals depending on their instantaneous values. Safety logic systems receive the binary signals from these core-monitoring systems and process them logically to protect the reactor against postulated initiating events. Neutronic and power to flow (P/Q) signals form the inputs to safety logic system-I and temperature signals are inputs to the safety logic system II. Failed fuel detection signals are processed by both the shut down systems. The two logic systems to actuate the safety rods are also based on two diverse designs and implemented with solid-state devices to meet all the requirements of safety systems. Safety logic system I that caters to neutronic and P/Q signals is designed around combinational logic and has an on-line test facility to detect struck at faults. The second logic system is based on dynamic logic and hence is inherently safe. This paper gives an overview of the two logic systems that have been

Logic from A to Z the Routledge encyclopedia of philosophy glossary of logical and mathematical terms

CERN Document Server

Bacon, John B; McCarty, David Charles; Bacon, John B

1999-01-01

First published in the most ambitious international philosophy project for a generation; the Routledge Encyclopedia of Philosophy. Logic from A to Z is a unique glossary of terms used in formal logic and the philosophy of mathematics. Over 500 entries include key terms found in the study of: * Logic: Argument, Turing Machine, Variable * Set and model theory: Isomorphism, Function * Computability theory: Algorithm, Turing Machine * Plus a table of logical symbols. Extensively cross-referenced to help comprehension and add detail, Logic from A to Z provides an indispensable reference source for students of all branches of logic.

A Paraconsistent Higher Order Logic

DEFF Research Database (Denmark)

Villadsen, Jørgen

2004-01-01

of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order...... 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...

Breaking the fault tree circular logic

International Nuclear Information System (INIS)

Lankin, M.

2000-01-01

Event tree - fault tree approach to model failures of nuclear plants as well as of other complex facilities is noticeably dominant now. This approach implies modeling an object in form of unidirectional logical graph - tree, i.e. graph without circular logic. However, genuine nuclear plants intrinsically demonstrate quite a few logical loops (circular logic), especially where electrical systems are involved. This paper shows the incorrectness of existing practice of circular logic breaking by elimination of part of logical dependencies and puts forward a formal algorithm, which enables the analyst to correctly model the failure of complex object, which involves logical dependencies between system and components, in form of fault tree. (author)

Neutral network and fuzzy logic based grate control; Roststyrning med neutrala naetverk och fuzzy logic

Energy Technology Data Exchange (ETDEWEB)

Ramstroem, Erik [TPS Termiska Processer AB, Nykoeping (Sweden)

2002-04-01

Grate-control is a complex task in many ways. The relations between controlled variables and the values they depend on are mostly unknown. Research projects are going on to create grate models based on physical laws. Those models are too complex for control implementation. The evaluation time is to long for control use. Another fundamental difficulty is that the relationships are none linear. That is, for a specific change in control value, the change in controlled value depends on the original size of control value, process disturbances and controlled values. There are extensive theories for linear process control. Non-linear control theory is used in robotic applications, but not in process and combustion control. The aim of grate control is to use as much of the grate area as possible, without having unburned material in ash. The outlined strategy is: To keep the position of the final bum out zone constant and its extension controlled. The control variables should be primary airflow, distribution of primary air, and fuel flow. Disturbances that should be measured are the fuel moisture content, the temperature of primary air and the grate temperature under the fuel bed. Technologies used are, fuzzy-logic and neural networks. A combination of booth could be used as well as any of them separately. A Fuzzy-logic controller acts as a computerised operator. Rules are specified with 'if - then' thesis. An example of that is: - if temperature is low, then close the valve The boundaries between the rules are made fuzzy. That makes it possible for the temperature to be just a bit low, which makes the valve open a bit. A lot of rules are created so that the controller knows what to do in every situation. Neural networks are sort of multi dimensional curves, with arbitrary degrees of freedom. The nets are used to predict future process values from measured ones. The model is evaluated from collected data. Parameters are adjusted for best correspondence between

Indexical Hybrid Tense Logic

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...... operator N) and prove completeness results for both logical and contextual validity. We then add propositional constants to handle yesterday, today and tomorrow; our system correctly treats sentences like “Niels will die yesterday” as contextually unsatisfiable. Building on our completeness results for now......, we prove completeness for the richer language, again for both logical and contextual validity....

Reversible logic gates on Physarum Polycephalum

International Nuclear Information System (INIS)

Schumann, Andrew

2015-01-01

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

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.

A beginner's guide to mathematical logic

CERN Document Server

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.

From Logical to Distributional Models

Directory of Open Access Journals (Sweden)

Anne Preller

2014-12-01

Full Text Available The paper relates two variants of semantic models for natural language, logical functional models and compositional distributional vector space models, by transferring the logic and reasoning from the logical to the distributional models. The geometrical operations of quantum logic are reformulated as algebraic operations on vectors. A map from functional models to vector space models makes it possible to compare the meaning of sentences word by word.

Logic reversibility and thermodynamic irreversibility demonstrated by DNAzyme-based Toffoli and Fredkin logic gates.

Science.gov (United States)

Orbach, Ron; Remacle, Françoise; Levine, R D; Willner, Itamar

2012-12-26

The Toffoli and Fredkin gates were suggested as a means to exhibit logic reversibility and thereby reduce energy dissipation associated with logic operations in dense computing circuits. We present a construction of the logically reversible Toffoli and Fredkin gates by implementing a library of predesigned Mg(2+)-dependent DNAzymes and their respective substrates. Although the logical reversibility, for which each set of inputs uniquely correlates to a set of outputs, is demonstrated, the systems manifest thermodynamic irreversibility originating from two quite distinct and nonrelated phenomena. (i) The physical readout of the gates is by fluorescence that depletes the population of the final state of the machine. This irreversible, heat-releasing process is needed for the generation of the output. (ii) The DNAzyme-powered logic gates are made to operate at a finite rate by invoking downhill energy-releasing processes. Even though the three bits of Toffoli's and Fredkin's logically reversible gates manifest thermodynamic irreversibility, we suggest that these gates could have important practical implication in future nanomedicine.

Functions and generality of logic reflections on Dedekind's and Frege's logicisms

CERN Document Server

Benis-Sinaceur, Hourya; Sandu, Gabriel

2015-01-01

This book examines three connected aspects of Frege's logicism: the differences between Dedekind's and Frege's interpretation of the term 'logic' and related terms and reflects on Frege's notion of function, comparing its understanding and the role it played in Frege's and Lagrange's foundational programs. It concludes with an examination of the notion of arbitrary function, taking into account Frege's, Ramsey's and Russell's view on the subject. Composed of three chapters, this book sheds light on important aspects of Dedekind's and Frege's logicisms. The first chapter explains how, although he shares Frege's aim at substituting logical standards of rigor to intuitive imports from spatio-temporal experience into the deductive presentation of arithmetic, Dedekind had a different goal and used or invented different tools. The chapter highlights basic dissimilarities between Dedekind's and Frege's actual ways of doing and thinking. The second chapter reflects on Frege's notion of a function, in comparison with ...

An Algebraic View of Super-Belnap Logics

Czech Academy of Sciences Publication Activity Database

Albuquerque, H.; Přenosil, Adam; Rivieccio, U.

2017-01-01

Roč. 105, č. 6 (2017), s. 1051-1086 ISSN 0039-3215 R&D Projects: GA ČR GBP202/12/G061 Grant - others:EU(XE) PIRSES- GA-2012-31898 Institutional support: RVO:67985807 Keywords : Super-Belnap logics * Four-valued logic * Paraconsistent logic * Belnap–Dunn logic * FDE * Logic of Paradox * Kleene logic * Exactly True logic * De Morgan algebras * Abstract Algebraic Logic * Leibniz filters * Strong versions of logics Subject RIV: BA - General Mathematics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.589, year: 2016

Logic Programming: PROLOG.

Science.gov (United States)

Lopez, Antonio M., Jr.

1989-01-01

Provides background material on logic programing and presents PROLOG as a high-level artificial intelligence programing language that borrows its basic constructs from logic. Suggests the language is one which will help the educator to achieve various goals, particularly the promotion of problem solving ability. (MVL)

Introduction to fuzzy logic using Matlab

CERN Document Server

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.

Basic logic and quantum entanglement

Energy Technology Data Exchange (ETDEWEB)

Zizzi, P A [Dipartimento di Matematica Pura ed Applicata, Via Trieste 63, 35121 Padova (Italy)

2007-05-15

As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective 'entanglement' in a logical sequent calculus for the machine language? And also, is it possible to 'teach' the quantum computer to 'mimic' the EPR 'paradox'? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective 'entanglement'). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.

Implicational (semilinear) logics III: completeness properties

Czech Academy of Sciences Publication Activity Database

Cintula, Petr; Noguera, Carles

2018-01-01

Roč. 57, 3-4 (2018), s. 391-420 ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * protoalgebraic logics * implicational logics * disjunctional logics * semilinear logics * non-classical logics * completeness theorems * rational completeness Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) OBOR OECD: Computer science s, information science , bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.394, year: 2016

Implicational (semilinear) logics III: completeness properties

Czech Academy of Sciences Publication Activity Database

Cintula, Petr; Noguera, Carles

2018-01-01

Roč. 57, 3-4 (2018), s. 391-420 ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * protoalgebraic logics * implicational logics * disjunctional logics * semilinear logics * non-classical logics * completeness theorems * rational completeness Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.394, year: 2016

Complexity of Monadic inf-datalog. Application to temporal logic.

OpenAIRE

Foustoucos , Eugénie; Guessarian , Irene

2003-01-01

In [11] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. $CTL$, alternation-free Modal $\\mu$-calculus and Modal $\\mu$-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model checking has 1. linear data and program complexities (both in time and space) for $CTL$ and alternation-free Modal $\\mu$-calculus, a...

Fuzzy Multi-objective Linear Programming Approach

Directory of Open Access Journals (Sweden)

Amna Rehmat

2007-07-01

Full Text Available Traveling salesman problem (TSP is one of the challenging real-life problems, attracting researchers of many fields including Artificial Intelligence, Operations Research, and Algorithm Design and Analysis. The problem has been well studied till now under different headings and has been solved with different approaches including genetic algorithms and linear programming. Conventional linear programming is designed to deal with crisp parameters, but information about real life systems is often available in the form of vague descriptions. Fuzzy methods are designed to handle vague terms, and are most suited to finding optimal solutions to problems with vague parameters. Fuzzy multi-objective linear programming, an amalgamation of fuzzy logic and multi-objective linear programming, deals with flexible aspiration levels or goals and fuzzy constraints with acceptable deviations. In this paper, a methodology, for solving a TSP with imprecise parameters, is deployed using fuzzy multi-objective linear programming. An example of TSP with multiple objectives and vague parameters is discussed.

Logic and memory concepts for all-magnetic computing based on transverse domain walls

International Nuclear Information System (INIS)

Vandermeulen, J; Van de Wiele, B; Dupré, L; Van Waeyenberge, B

2015-01-01

We introduce a non-volatile digital logic and memory concept in which the binary data is stored in the transverse magnetic domain walls present in in-plane magnetized nanowires with sufficiently small cross sectional dimensions. We assign the digital bit to the two possible orientations of the transverse domain wall. Numerical proofs-of-concept are presented for a NOT-, AND- and OR-gate, a FAN-out as well as a reading and writing device. Contrary to the chirality based vortex domain wall logic gates introduced in Omari and Hayward (2014 Phys. Rev. Appl. 2 044001), the presented concepts remain applicable when miniaturized and are driven by electrical currents, making the technology compatible with the in-plane racetrack memory concept. The individual devices can be easily combined to logic networks working with clock speeds that scale linearly with decreasing design dimensions. This opens opportunities to an all-magnetic computing technology where the digital data is stored and processed under the same magnetic representation. (paper)

Nanoscale on-chip all-optical logic parity checker in integrated plasmonic circuits in optical communication range

Science.gov (United States)

Wang, Feifan; Gong, Zibo; Hu, Xiaoyong; Yang, Xiaoyu; Yang, Hong; Gong, Qihuang

2016-01-01

The nanoscale chip-integrated all-optical logic parity checker is an essential core component for optical computing systems and ultrahigh-speed ultrawide-band information processing chips. Unfortunately, little experimental progress has been made in development of these devices to date because of material bottleneck limitations and a lack of effective realization mechanisms. Here, we report a simple and efficient strategy for direct realization of nanoscale chip-integrated all-optical logic parity checkers in integrated plasmonic circuits in the optical communication range. The proposed parity checker consists of two-level cascaded exclusive-OR (XOR) logic gates that are realized based on the linear interference of surface plasmon polaritons propagating in the plasmonic waveguides. The parity of the number of logic 1s in the incident four-bit logic signals is determined, and the output signal is given the logic state 0 for even parity (and 1 for odd parity). Compared with previous reports, the overall device feature size is reduced by more than two orders of magnitude, while ultralow energy consumption is maintained. This work raises the possibility of realization of large-scale integrated information processing chips based on integrated plasmonic circuits, and also provides a way to overcome the intrinsic limitations of serious surface plasmon polariton losses for on-chip integration applications. PMID:27073154

Nanoscale on-chip all-optical logic parity checker in integrated plasmonic circuits in optical communication range.

Science.gov (United States)

Wang, Feifan; Gong, Zibo; Hu, Xiaoyong; Yang, Xiaoyu; Yang, Hong; Gong, Qihuang

2016-04-13

The nanoscale chip-integrated all-optical logic parity checker is an essential core component for optical computing systems and ultrahigh-speed ultrawide-band information processing chips. Unfortunately, little experimental progress has been made in development of these devices to date because of material bottleneck limitations and a lack of effective realization mechanisms. Here, we report a simple and efficient strategy for direct realization of nanoscale chip-integrated all-optical logic parity checkers in integrated plasmonic circuits in the optical communication range. The proposed parity checker consists of two-level cascaded exclusive-OR (XOR) logic gates that are realized based on the linear interference of surface plasmon polaritons propagating in the plasmonic waveguides. The parity of the number of logic 1s in the incident four-bit logic signals is determined, and the output signal is given the logic state 0 for even parity (and 1 for odd parity). Compared with previous reports, the overall device feature size is reduced by more than two orders of magnitude, while ultralow energy consumption is maintained. This work raises the possibility of realization of large-scale integrated information processing chips based on integrated plasmonic circuits, and also provides a way to overcome the intrinsic limitations of serious surface plasmon polariton losses for on-chip integration applications.

Logical database design principles

CERN Document Server

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

Topics in linear optical quantum computation

Science.gov (United States)

Glancy, Scott Charles

This thesis covers several topics in optical quantum computation. A quantum computer is a computational device which is able to manipulate information by performing unitary operations on some physical system whose state can be described as a vector (or mixture of vectors) in a Hilbert space. The basic unit of information, called the qubit, is considered to be a system with two orthogonal states, which are assigned logical values of 0 and 1. Photons make excellent candidates to serve as qubits. They have little interactions with the environment. Many operations can be performed using very simple linear optical devices such as beam splitters and phase shifters. Photons can easily be processed through circuit-like networks. Operations can be performed in very short times. Photons are ideally suited for the long-distance communication of quantum information. The great difficulty in constructing an optical quantum computer is that photons naturally interact weakly with one another. This thesis first gives a brief review of two early approaches to optical quantum computation. It will describe how any discrete unitary operation can be performed using a single photon and a network of beam splitters, and how the Kerr effect can be used to construct a two photon logic gate. Second, this work provides a thorough introduction to the linear optical quantum computer developed by Knill, Laflamme, and Milburn. It then presents this author's results on the reliability of this scheme when implemented using imperfect photon detectors. This author finds that quantum computers of this sort cannot be built using current technology. Third, this dissertation describes a method for constructing a linear optical quantum computer using nearly orthogonal coherent states of light as the qubits. It shows how a universal set of logic operations can be performed, including calculations of the fidelity with which these operations may be accomplished. It discusses methods for reducing and

Model-Checking of Linear-Time Properties in Multi-Valued Systems

OpenAIRE

Li, Yongming; Droste, Manfred; Lei, Lihui

2012-01-01

In this paper, we study model-checking of linear-time properties in multi-valued systems. Safety property, invariant property, liveness property, persistence and dual-persistence properties in multi-valued logic systems are introduced. Some algorithms related to the above multi-valued linear-time properties are discussed. The verification of multi-valued regular safety properties and multi-valued $\\omega$-regular properties using lattice-valued automata are thoroughly studied. Since the law o...

Proposal for the Formalization of Dialectical Logic

Directory of Open Access Journals (Sweden)

José Luis Usó-Doménech

2016-12-01

Full Text Available Classical logic is typically concerned with abstract analysis. The problem for a synthetic logic is to transcend and unify available data to reconstruct the object as a totality. Three rules are proposed to pass from classic logic to synthetic logic. We present the category logic of qualitative opposition using examples from various sciences. This logic has been defined to include the neuter as part of qualitative opposition. The application of these rules to qualitative opposition, and, in particular, its neuter, demonstrated that a synthetic logic allows the truth of some contradictions. This synthetic logic is dialectical with a multi-valued logic, which gives every proposition a truth value in the interval [0,1] that is the square of the modulus of a complex number. In this dialectical logic, contradictions of the neuter of an opposition may be true.

Modern logic 1850-1950, East and West

CERN Document Server

Fuller, Mark

2016-01-01

This book presents diverse topics in mathematical logic such as proof theory, meta-mathematics, and applications of logic to mathematical structures. The collection spans the first 100 years of modern logic and is dedicated to the memory of Irving Anellis, founder of the journal 'Modern Logic', whose academic work was essential in promoting the algebraic tradition of logic, as represented by Charles Sanders Peirce. Anellis’s association with the Russian logic community introduced their school of logic to a wider audience in the USA, Canada and Western Europe. In addition, the collection takes a historical perspective on proof theory and the development of logic and mathematics in Eastern Logic, the Soviet Union and Russia. The book will be of interest to historians and philosophers in logic and mathematics, and the more specialized papers will also appeal to mathematicians and logicians.

Lectures on Logic and Computation

DEFF Research Database (Denmark)

The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers fo...

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 log...

The logic of actual obligation. An alternative approach to deontic logic

NARCIS (Netherlands)

Voorbraak, F.

In this paper we develop a system of deontic logic (LAO, the logic of actual obligation) with a rather limited scope: we are, only interested in obligations as far as they: are relevant for deciding what actions actually ought to be done in a particular situation, given some normative system N.

From the history of logic. Semantics of homonymy in Porphyry’s logic

Directory of Open Access Journals (Sweden)

Garin Sergey Vyacheslavovich

2016-10-01

Full Text Available The article deals with the logical and semantic aspects of the theory of homonyms in Aristotle’s “Categories” within the context of Porphyry’s commentaries. We consider the logical formation of the doctrine of homonymy of nouns, verbs, and conjunctions in Ancient Greek. We reveal the difficulty in interpreting the terms “κατηγορίαι”, “ὄνομα” and “ῥῆμα”. The paper has shed some light on different aspects of Porphyry’s logic.

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 ...

Popular lectures on mathematical logic

CERN Document Server

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

Optimization methods for logical inference

CERN Document Server

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

Logic and Philosophy of Time

DEFF Research Database (Denmark)

By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s).......By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s)....

Logical independence and quantum randomness

International Nuclear Information System (INIS)

Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C; Prevedel, R; Klimek, P

2010-01-01

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.

Logic an introductory course

CERN Document Server

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.

A Resolution Prover for Coalition Logic

OpenAIRE

Nalon, Cláudia; Zhang, Lan; Dixon, Clare; Hustadt, Ullrich

2014-01-01

We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolution-based calculus for Coalition Logic. We then give details of the implementation of CLProver and prese...

Linear algebra as an alternative approach to the synthesis of digital devices of automation and control systems

Directory of Open Access Journals (Sweden)

Nikolay Chernov

2018-01-01

Full Text Available The article considers linear algebra as an alternative mathematical tool of logic synthesis of digital structures to Boolean algebra and synthesis methods of digital electronic component base (ECB on its ground. The methods of solving the applied problems of logic synthesis are shown, including the expansion of an arbitrary logic function by means of monotonic functions. The proposed mathematical apparatus actually provides the creation of digital structures on the principles of analog circuitry. It can find application in the design of multivalued digital ECB, specialized system-on-chip and analog-digital sensors with current output. The examples of synthesis of the combinational and sequential two-valued and multivalued digital devices are given. In conclusion, the advantages of linear algebra in comparison with Boolean algebra are formulated.

On Witnessed Models in Fuzzy Logic III - Witnessed Gödel Logics

Czech Academy of Sciences Publication Activity Database

Hájek, Petr

2010-01-01

Roč. 56, č. 2 (2010), s. 171-174 ISSN 0942-5616 R&D Projects: GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : mathematical fuzzy logic * Gödel logic * witnessed models * arithmetical complexity Subject RIV: BA - General Mathematics Impact factor: 0.361, year: 2010

Design and experimentation of BSFQ logic devices

International Nuclear Information System (INIS)

Hosoki, T.; Kodaka, H.; Kitagawa, M.; Okabe, Y.

1999-01-01

Rapid single flux quantum (RSFQ) logic needs synchronous pulses for each gate, so the clock-wiring problem is more serious when designing larger scale circuits with this logic. So we have proposed a new SFQ logic which follows Boolean algebra perfectly by using set and reset pulses. With this logic, the level information of current input is transmitted with these pulses generated by level-to-pulse converters, and each gate calculates logic using its phase level made by these pulses. Therefore, our logic needs no clock in each gate. We called this logic 'Boolean SFQ (BSFQ) logic'. In this paper, we report design and experimentation for an AND gate with inverting input based on BSFQ logic. The experimental results for OR and XOR gates are also reported. (author)

Combining Paraconsistent Logic with Argumentation

NARCIS (Netherlands)

Grooters, Diana; Prakken, Hendrik

2014-01-01

One tradition in the logical study of argumentation is to allow for arguments that combine strict and defeasible inference rules, and to derive the strict inference rules from a logic at least as strong as classical logic. An unsolved problem in this tradition is how the trivialising effect of the

Anticoincidence logic using PALs

International Nuclear Information System (INIS)

Bolanos, L.; Arista Romeu, E.

1997-01-01

This paper describes the functioning principle of an anticoincidence logic and a design of this based on programing logic. The circuit was included in a discriminator of an equipment for single-photon absorptiometry

Verification of BGA type FPGA logic applied to a control equipment with Safety Class using the special socket

International Nuclear Information System (INIS)

Chung, YounHu; Yoo, Kwanwoo; Lee, Myeongkyun; Yun, Donghwa

2015-01-01

This article aims to provide the verification method for BGA-type FPGA of Programmable Logic Controller (PLC) developed as Safety Class. The logic of FPGA in the control device with Safety Class is the circuit to control overall logic of PLC. This device converts to the different module from the input signals for both digital and analogue of the equipment in the field and outputs their data. In addition, it should perform the logical controls such as backplane communication control and data communication. We suggest acquiring method of the data signal with efficient logic using the socket in this article. Proposed test socket is made by simpler process than former one, and the process is done in batches by which cost can be reduces, and the test socket can be quickly produced in response to any request. Also, it is possible to reduce the wear by reducing the contact force of the ball phenomenon. The structure on the basis of silicon can be reduced the modification, and it has excellent linearity. At the logic verification, the operation that state data block is designed in the FPGA could be easily confirmed by using a socket

Contextual logic for quantum systems

International Nuclear Information System (INIS)

Domenech, Graciela; Freytes, Hector

2005-01-01

In this work we build a quantum logic that allows us to refer to physical magnitudes pertaining to different contexts from a fixed one without the contradictions with quantum mechanics expressed in no-go theorems. This logic arises from considering a sheaf over a topological space associated with the Boolean sublattices of the ortholattice of closed subspaces of the Hilbert space of the physical system. Different from standard quantum logics, the contextual logic maintains a distributive lattice structure and a good definition of implication as a residue of the conjunction

Tensor product of quantum logics

Science.gov (United States)

Pulmannová, Sylvia

1985-01-01

A quantum logic is the couple (L,M) where L is an orthomodular σ-lattice and M is a strong set of states on L. The Jauch-Piron property in the σ-form is also supposed for any state of M. A ``tensor product'' of quantum logics is defined. This definition is compared with the definition of a free orthodistributive product of orthomodular σ-lattices. The existence and uniqueness of the tensor product in special cases of Hilbert space quantum logics and one quantum and one classical logic are studied.

Microelectromechanical resonator based digital logic elements

KAUST Repository

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.

Microelectromechanical resonator based digital logic elements

KAUST Repository

Hafiz, Md Abdullah Al; Kosuru, Lakshmoji; Younis, Mohammad I.; Fariborzi, Hossein

2016-01-01

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.

Students’ logical-mathematical intelligence profile

Science.gov (United States)

Arum, D. P.; Kusmayadi, T. A.; Pramudya, I.

2018-04-01

One of students’ characteristics which play an important role in learning mathematics is logical-mathematical intelligence. This present study aims to identify profile of students’ logical-mathematical intelligence in general and specifically in each indicator. It is also analyzed and described based on students’ sex. This research used qualitative method with case study strategy. The subjects involve 29 students of 9th grade that were selected by purposive sampling. Data in this research involve students’ logical-mathematical intelligence result and interview. The results show that students’ logical-mathematical intelligence was identified in the moderate level with the average score is 11.17 and 51.7% students in the range of the level. In addition, the level of both male and female students are also mostly in the moderate level. On the other hand, both male and female students’ logical-mathematical intelligence is strongly influenced by the indicator of ability to classify and understand patterns and relationships. Furthermore, the ability of comparison is the weakest indicator. It seems that students’ logical-mathematical intelligence is still not optimal because more than 50% students are identified in moderate and low level. Therefore, teachers need to design a lesson that can improve students’ logical-mathematical intelligence level, both in general and on each indicator.

Fuzzy Versions of Epistemic and Deontic Logic

Science.gov (United States)

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.

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.

Marketing Logics, Ambidexterity and Influence

DEFF Research Database (Denmark)

Tollin, Karin; Schmidt, Marcus

2012-01-01

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......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...

Optical programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2011-11-10

Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.

Pulse coded safety logic for PFBR

International Nuclear Information System (INIS)

Anwer, Md. Najam; Satheesh, N.; Nagaraj, C.P.; Krishnakumar, B.

2002-01-01

Full text: Reactor safety logic is designed to initiate safety action against design basis events. The reactor is shutdown by de-energizing electromagnets and dropping the absorber rods under gravity. In prototype fast breeder reactor (PFBR), shutdown is affected by two independent shutdown systems, viz., control and safety rod drive mechanism (CSRDM) and diverse safety rod drive mechanism (DSRDM). Two separate safety logics are proposed for CSRDM and DSRDM, i.e. solid state logic with on-line fine impulse test (FIT) for CSRDM and pulse coded safety logic (PCSL) for DSRDM. The PCSL primarily utilizes the fact that the vast majority of faults in the logic circuitry result in static conditions at the output. It is arranged such that the presence of pulses are required to hold the shutdown actuators and any DC logic state, either logic 0 or logic 1 releases them. It is a dynamic, self-testing logic and used in a number of reactors. This paper describes the principle of operation of PCSL, its advantages, the concept of guard line logic (GLL), detection of stuck at 0 and stuck at 1 faults, fail safe and diversity features. The implementation of PCSL using Altera Max+Plus II software for PFBR trip signals and the results of simulation are discussed. This paper also describes a test jig using 80186 based system for testing PCSL for various input parameter's combinations and monitoring the outputs

Towards rational closure for fuzzy logic: The case of propositional Godel logic

CSIR Research Space (South Africa)

Casini, G

2013-12-01

Full Text Available In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark and we are going to see whether such a construction can be adopted in the context of mathematical fuzzy logic, a so far (apparently) unexplored...

A Resolution Prover for Coalition Logic

Directory of Open Access Journals (Sweden)

Cláudia Nalon

2014-04-01

Full Text Available We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolution-based calculus for Coalition Logic. We then give details of the implementation of CLProver and present the results for a comparison with an existing tableau-based solver.

Logical design for computers and control

CERN Document Server

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

Real Time Implementation of a DC Motor Speed Control by Fuzzy Logic Controller and PI Controller Using FPGA

Directory of Open Access Journals (Sweden)

G. Sakthivel

2010-10-01

Full Text Available Fuzzy logic control has met with growing interest in many motor control applications due to its non-linearity, handling features and independence of plant modelling. The hardware implementation of fuzzy logic controller (FLC on FPGA is very important because of the increasing number of fuzzy applications requiring highly parallel and high speed fuzzy processing. Implementation of a fuzzy logic controller and conventional PI controller on an FPGA using VHDL for DC motor speed control is presented in this paper. The proposed scheme is to improve tracking performance of D.C. motor as compared to the conventional (PI control strategy .This paper describes the hardware implementation of two inputs (error and change in error, one output fuzzy logic controller based on PI controller and conventional PI controller using VHDL. Real time implementation FLC and conventional PI controller is made on Spartan-3A DSP FPGA (XC3SD1800A FPGA for the speed control of DC motor. It is observed that fuzzy logic based controllers give better responses than the conventional PI controller for the speed control of dc motor.

Separation Logic

DEFF Research Database (Denmark)

Reynolds, John C.

2002-01-01

In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure. The simple imperative programming language is extended with commands (not...... with the inductive definition of predicates on abstract data structures, this extension permits the concise and flexible description of structures with controlled sharing. In this paper, we will survey the current development of this program logic, including extensions that permit unrestricted address arithmetic...

How Objects Shape Logics in Construction

DEFF Research Database (Denmark)

Tryggestad, Kjell; Georg, Susse

2011-01-01

The notion of institutional logics is a key tenet in institutional theory but few studies have attended to the micro‐foundations of logics. The sociology of associations is used to explore the micro‐foundations of logics, their emergence and temporal–spatial importance. A case study of the constr......The notion of institutional logics is a key tenet in institutional theory but few studies have attended to the micro‐foundations of logics. The sociology of associations is used to explore the micro‐foundations of logics, their emergence and temporal–spatial importance. A case study...... and identities as emergent and contingent outcomes of the material practices of building construction. The argument is concluded by considering the building construction as a materially mediated meaning structure....

Modern linear control design a time-domain approach

CERN Document Server

Caravani, Paolo

2013-01-01

This book offers a compact introduction to modern linear control design.  The simplified overview presented of linear time-domain methodology paves the road for the study of more advanced non-linear techniques. Only rudimentary knowledge of linear systems theory is assumed - no use of Laplace transforms or frequency design tools is required. Emphasis is placed on assumptions and logical implications, rather than abstract completeness; on interpretation and physical meaning, rather than theoretical formalism; on results and solutions, rather than derivation or solvability.  The topics covered include transient performance and stabilization via state or output feedback; disturbance attenuation and robust control; regional eigenvalue assignment and constraints on input or output variables; asymptotic regulation and disturbance rejection. Lyapunov theory and Linear Matrix Inequalities (LMI) are discussed as key design methods. All methods are demonstrated with MATLAB to promote practical use and comprehension. ...

Logic and Philosophy of Time

DEFF Research Database (Denmark)

A.N. Prior (1914-69) in the course of the 1950s and 1960s founded a new and revolutionary paradigm in philosophy and logic. Its most central feature is the preoccupation with time and the development of the logic of time. However, this was inseparably interwoven with fundamental questions about h...... human freedom, ethics, and existence. This remarkable integration of themes also embodies an original and in fact revolutionary conception of logic. The book series, Logic and Philosophy of Time, is dedicated to a deep investigation and also the further development of Prior’s paradigm. ...

Reliability evaluation programmable logic devices

International Nuclear Information System (INIS)

Srivani, L.; Murali, N.; Thirugnana Murthy, D.; Satya Murty, S.A.V.

2014-01-01

Programmable Logic Devices (PLD) are widely used as basic building modules in high integrity systems, considering their robust features such as gate density, performance, speed etc. PLDs are used to implement digital design such as bus interface logic, control logic, sequencing logic, glue logic etc. Due to semiconductor evolution, new PLDs with state-of-the-art features are arriving to the market. Since these devices are reliable as per the manufacturer's specification, they were used in the design of safety systems. But due to their reduced market life, the availability of performance data is limited. So evaluating the PLD before deploying in a safety system is very important. This paper presents a survey on the use of PLDs in the nuclear domain and the steps involved in the evaluation of PLD using Quantitative Accelerated Life Testing. (author)

Generator of combined logical signals

International Nuclear Information System (INIS)

Laviron, Andre; Berard, Claude.

1982-01-01

The invention concerns a generator of combined logical signals to form combinations of two outputs at logical level 1 and N-2 outputs at logical level 0, among N generator outputs. This generator is characterized in that it includes a set of N means for storing combinations. Means enable the N storage means to be loaded with the logical levels corresponding to a pre-set starting combination, to control the operations for shifting the contents of the storage means and to control, by transfer facilities, the transfers of contents between these storage means. Controls enable the storage means to be actuated in order to obtain combinations of logical levels 1 and 0. The generation of combinations can be stopped after another pre-set combination. Application is for testing of safety circuits for nuclear power stations [fr

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 finally, we extend it to a relational analysis. A Flow Logic is a program logic---in the same sense that a Hoare’s logic is. We conclude with an executive summary presenting the highlights of the approach from this perspective including a discussion of theoretical properties as well as implementation...

Logical inference and evaluation

International Nuclear Information System (INIS)

Perey, F.G.

1981-01-01

Most methodologies of evaluation currently used are based upon the theory of statistical inference. It is generally perceived that this theory is not capable of dealing satisfactorily with what are called systematic errors. Theories of logical inference should be capable of treating all of the information available, including that not involving frequency data. A theory of logical inference is presented as an extension of deductive logic via the concept of plausibility and the application of group theory. Some conclusions, based upon the application of this theory to evaluation of data, are also given

Layered Fixed Point Logic

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...

Description logics of context

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...

Hybrid Logic and its Proof-Theory

CERN Document Server

Brauner, Torben

2011-01-01

This is the first book-length treatment of hybrid logic and its proof-theory. Hybrid logic is an extension of ordinary modal logic which allows explicit reference to individual points in a model (where the points represent times, possible worlds, states in a computer, or something else). This is useful for many applications, for example when reasoning about time one often wants to formulate a series of statements about what happens at specific times. There is little consensus about proof-theory for ordinary modal logic. Many modal-logical proof systems lack important properties and the relatio

The logic of ACP

NARCIS (Netherlands)

A. Ponse (Alban); M.B. van der Zwaag

2002-01-01

textabstractWe 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

All optical programmable logic array (PLA)

Science.gov (United States)

Hiluf, Dawit

2018-03-01

A programmable logic array (PLA) is an integrated circuit (IC) logic device that can be reconfigured to implement various kinds of combinational logic circuits. The device has a number of AND and OR gates which are linked together to give output or further combined with more gates or logic circuits. This work presents the realization of PLAs via the physics of a three level system interacting with light. A programmable logic array is designed such that a number of different logical functions can be combined as a sum-of-product or product-of-sum form. We present an all optical PLAs with the aid of laser light and observables of quantum systems, where encoded information can be considered as memory chip. The dynamics of the physical system is investigated using Lie algebra approach.

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....

Logic feels so good-I like it! Evidence for intuitive detection of logicality in syllogistic reasoning.

Science.gov (United States)

Morsanyi, Kinga; Handley, Simon J

2012-05-01

When people evaluate syllogisms, their judgments of validity are often biased by the believability of the conclusions of the problems. Thus, it has been suggested that syllogistic reasoning performance is based on an interplay between a conscious and effortful evaluation of logicality and an intuitive appreciation of the believability of the conclusions (e.g., Evans, Newstead, Allen, & Pollard, 1994). However, logic effects in syllogistic reasoning emerge even when participants are unlikely to carry out a full logical analysis of the problems (e.g., Shynkaruk & Thompson, 2006). There is also evidence that people can implicitly detect the conflict between their beliefs and the validity of the problems, even if they are unable to consciously produce a logical response (e.g., De Neys, Moyens, & Vansteenwegen, 2010). In 4 experiments we demonstrate that people intuitively detect the logicality of syllogisms, and this effect emerges independently of participants' conscious mindset and their cognitive capacity. This logic effect is also unrelated to the superficial structure of the problems. Additionally, we provide evidence that the logicality of the syllogisms is detected through slight changes in participants' affective states. In fact, subliminal affective priming had an effect on participants' subjective evaluations of the problems. Finally, when participants misattributed their emotional reactions to background music, this significantly reduced the logic effect. (c) 2012 APA, all rights reserved.

Co-constructive Logics for Proofs and Refutations

Directory of Open Access Journals (Sweden)

Trafford James

2015-01-01

Full Text Available This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and its relation to falsity. It is well known both that intuitionism can not deal constructively with negative information, and that defining falsity by means of intuitionistic negation leads, under widely-held assumptions, to a justification of bivalence. For example, we do not want to equate falsity with the non-existence of a proof since this would render a statement such as “pi is transcendental” false prior to 1882. In addition, the intuitionist account of negation as shorthand for the derivation of absurdity is inadequate, particularly outside of purely mathematical contexts. To deal with these issues, I investigate the dual of intuitionistic logic, co-intuitionistic logic, as a logic of refutation, alongside intuitionistic logic of proofs. Direct proof and refutation are dual to each other, and are constructive, whilst there also exist syntactic, weak, negations within both logics. In this respect, the logic of refutation is weakly paraconsistent in the sense that it allows for statements for which, neither they, nor their negation, are refuted. I provide a proof theory for the co-constructive logic, a formal dualizing map between the logics, and a Kripke-style semantics. This is given an intuitive philosophical rendering in a re-interpretation of Kolmogorov's logic of problems.

Specifying real-time systems with interval logic

Science.gov (United States)

Rushby, John

1988-01-01

Pure temporal logic makes no reference to time. An interval temporal logic and an extension to that logic which includes real time constraints are described. The application of this logic by giving a specification for the well-known lift (elevator) example is demonstrated. It is shown how interval logic can be extended to include a notion of process. How the specification language and verification environment of EHDM could be enhanced to support this logic is described. A specification of the alternating bit protocol in this extended version of the specification language of EHDM is given.

Continuous Markovian Logics

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 exponentially distributed random variables that characterize the duration of the labeled transitions of a CMP. In this paper we present weak and strong complete axiomatizations for CML and prove a series of metaproperties, including the finite model property and the construction of canonical models. CML...... 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...

Cybernetic systems based on inductive logic

International Nuclear Information System (INIS)

Fry, Robert L.

2001-01-01

Recent work in the area of inductive logic suggests that cybernetics might be quantified and reduced to engineering practice. If so, then there are considerable implications for engineering, science, and other fields. This paper attempts to capture the essential ideas of cybernetics cast in the light of inductive logic. The described inductive logic extends conventional logic by adding a conjugate logical domain of questions to the logical domain of assertions intrinsic to Boolean Algebra with which most are familiar. This was first posited and developed by Richard Cox. Interestingly enough, these two logical domains, one of questions and the other of assertions, only exist relative to one another with each possessing natural measures of entropy and probability, respectively. Examples are given that highlight the utility of cybernetic approaches to neuroscience, algorithm design, system engineering, and the design and understanding of defensive and offensive systems. For example, the application of cybernetic approaches to defense systems suggests that these systems possess a wavefunction which like quantum mechanics, collapses when we 'look' through the eyes of the system sensors such as radars and optical sensors

A Denotational Semantics for Logic Programming

DEFF Research Database (Denmark)

Frandsen, Gudmund Skovbjerg

A fully abstract denotational semantics for logic programming has not been constructed yet. In this paper we present a denotational semantics that is almost fully abstract. We take the meaning of a logic program to be an element in a Plotkin power domain of substitutions. In this way our result...... shows that standard domain constructions suffice, when giving a semantics for logic programming. Using the well-known fixpoint semantics of logic programming we have to consider two different fixpoints in order to obtain information about both successful and failed computations. In contrast, our...... semantics is uniform in that the (single) meaning of a logic program contains information about both successful, failed and infinite computations. Finally, based on the full abstractness result, we argue that the detail level of substitutions is needed in any denotational semantics for logic programming....

All-optical symmetric ternary logic gate

Science.gov (United States)

Chattopadhyay, Tanay

2010-09-01

Symmetric ternary number (radix=3) has three logical states (1¯, 0, 1). It is very much useful in carry free arithmetical operation. Beside this, the logical operation using this type of number system is also effective in high speed computation and communication in multi-valued logic. In this literature all-optical circuits for three basic symmetrical ternary logical operations (inversion, MIN and MAX) are proposed and described. Numerical simulation verifies the theoretical model. In this present scheme the different ternary logical states are represented by different polarized state of light. Terahertz optical asymmetric demultiplexer (TOAD) based interferometric switch has been used categorically in this manuscript.

On Structural Completeness of Tabular Superintuitionistic Logics

NARCIS (Netherlands)

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

Systematic methods for the design of a class of fuzzy logic controllers

Science.gov (United States)

Yasin, Saad Yaser

2002-09-01

Fuzzy logic control, a relatively new branch of control, can be used effectively whenever conventional control techniques become inapplicable or impractical. Various attempts have been made to create a generalized fuzzy control system and to formulate an analytically based fuzzy control law. In this study, two methods, the left and right parameterization method and the normalized spline-base membership function method, were utilized for formulating analytical fuzzy control laws in important practical control applications. The first model was used to design an idle speed controller, while the second was used to control an inverted control problem. The results of both showed that a fuzzy logic control system based on the developed models could be used effectively to control highly nonlinear and complex systems. This study also investigated the application of fuzzy control in areas not fully utilizing fuzzy logic control. Three important practical applications pertaining to the automotive industries were studied. The first automotive-related application was the idle speed of spark ignition engines, using two fuzzy control methods: (1) left and right parameterization, and (2) fuzzy clustering techniques and experimental data. The simulation and experimental results showed that a conventional controller-like performance fuzzy controller could be designed based only on experimental data and intuitive knowledge of the system. In the second application, the automotive cruise control problem, a fuzzy control model was developed using parameters adaptive Proportional plus Integral plus Derivative (PID)-type fuzzy logic controller. Results were comparable to those using linearized conventional PID and linear quadratic regulator (LQR) controllers and, in certain cases and conditions, the developed controller outperformed the conventional PID and LQR controllers. The third application involved the air/fuel ratio control problem, using fuzzy clustering techniques, experimental

A Logical Characterisation of Static Equivalence

DEFF Research Database (Denmark)

Hüttel, Hans; Pedersen, Michael D.

2007-01-01

-order logic for frames with quantification over environment knowledge which, under certain general conditions, characterizes static equivalence and is amenable to construction of characteristic formulae. The logic can be used to reason about environment knowledge and can be adapted to a particular application...... by defining a suitable signature and associated equational theory. The logic can furthermore be extended with modalities to yield a modal logic for e.g. the Applied Pi calculus....

Modal logics are coalgebraic

NARCIS (Netherlands)

Cirstea, C.; Kurz, A.; Pattinson, D.; Schröder, L.; Venema, Y.

2011-01-01

Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large

Criteria for logical formalization

Czech Academy of Sciences Publication Activity Database

Peregrin, Jaroslav; Svoboda, Vladimír

2013-01-01

Roč. 190, č. 14 (2013), s. 2897-2924 ISSN 0039-7857 R&D Projects: GA ČR(CZ) GAP401/10/1279 Institutional support: RVO:67985955 Keywords : logic * logical form * formalization * reflective equilibrium Subject RIV: AA - Philosophy ; Religion Impact factor: 0.637, year: 2013

Honesty in partial logic

NARCIS (Netherlands)

W. van der Hoek (Wiebe); J.O.M. Jaspars; E. Thijsse

1995-01-01

textabstractWe propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the

Bipolar spintronics: from spin injection to spin-controlled logic

International Nuclear Information System (INIS)

Zutic, Igor; Fabian, Jaroslav; Erwin, Steven C

2007-01-01

An impressive success of spintronic applications has been typically realized in metal-based structures which utilize magnetoresistive effects for substantial improvements in the performance of computer hard drives and magnetic random access memories. Correspondingly, the theoretical understanding of spin-polarized transport is usually limited to a metallic regime in a linear response, which, while providing a good description for data storage and magnetic memory devices, is not sufficient for signal processing and digital logic. In contrast, much less is known about possible applications of semiconductor-based spintronics and spin-polarized transport in related structures which could utilize strong intrinsic nonlinearities in current-voltage characteristics to implement spin-based logic. Here we discuss the challenges for realizing a particular class of structures in semiconductor spintronics: our proposal for bipolar spintronic devices in which carriers of both polarities (electrons and holes) contribute to spin-charge coupling. We formulate the theoretical framework for bipolar spin-polarized transport, and describe several novel effects in two- and three-terminal structures which arise from the interplay between nonequilibrium spin and equilibrium magnetization

PDL as a multi-agent strategy logic

NARCIS (Netherlands)

D.J.N. van Eijck (Jan); B.C. Schipper

2013-01-01

textabstractPropositional Dynamic Logic or PDL was invented as a logic for reasoning about regular programming constructs. We propose a new perspective on PDL as a multi-agent strategic logic (MASL). This logic for strategic reasoning has group strategies as first class citizens, and

Temporal logics and real time expert systems

NARCIS (Netherlands)

Blom, J.A.

1996-01-01

This paper introduces temporal logics. Due to the eternal compromise between expressive adequacy and reasoning efficiency that must decided upon in any application, full (first order logic or modal logic based) temporal logics are frequently not suitable. This is especially true in real time expert

Belief Bisimulation for Hidden Markov Models Logical Characterisation and Decision Algorithm

DEFF Research Database (Denmark)

Jansen, David N.; Nielson, Flemming; Zhang, Lijun

2012-01-01

This paper establishes connections between logical equivalences and bisimulation relations for hidden Markov models (HMM). Both standard and belief state bisimulations are considered. We also present decision algorithms for the bisimilarities. For standard bisimilarity, an extension of the usual...... partition refinement algorithm is enough. Belief bisimilarity, being a relation on the continuous space of belief states, cannot be described directly. Instead, we show how to generate a linear equation system in time cubic in the number of states....

PM 3655 PHILIPS Logic analyzer

CERN Multimedia

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.

Weakly Intuitionistic Quantum Logic

NARCIS (Netherlands)

Hermens, Ronnie

2013-01-01

In this article von Neumann's proposal that in quantum mechanics projections can be seen as propositions is followed. However, the quantum logic derived by Birkhoff and von Neumann is rejected due to the failure of the law of distributivity. The options for constructing a distributive logic while

Synthesizing biomolecule-based Boolean logic gates.

Science.gov (United States)

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2013-02-15

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.

Non-commutative multiple-valued logic algebras

CERN Document Server

Ciungu, Lavinia Corina

2014-01-01

This monograph provides a self-contained and easy-to-read introduction to non-commutative multiple-valued logic algebras; a subject which has attracted much interest in the past few years because of its impact on information science, artificial intelligence and other subjects.   A study of the newest results in the field, the monograph includes treatment of pseudo-BCK algebras, pseudo-hoops, residuated lattices, bounded divisible residuated lattices, pseudo-MTL algebras, pseudo-BL algebras and pseudo-MV algebras. It provides a fresh perspective on new trends in logic and algebras in that algebraic structures can be developed into fuzzy logics which connect quantum mechanics, mathematical logic, probability theory, algebra and soft computing.   Written in a clear, concise and direct manner, Non-Commutative Multiple-Valued Logic Algebras will be of interest to masters and PhD students, as well as researchers in mathematical logic and theoretical computer science.

Synthesizing Biomolecule-based Boolean Logic Gates

Science.gov (United States)

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2012-01-01

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588

Advances in temporal logic

CERN Document Server

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 ...

Quantum supports and modal logic

International Nuclear Information System (INIS)

Svetlichny, G.

1986-01-01

Recently Foulis, Piron, and Randall introduced a new interpretation of empirical and quantum logics which substitute for the notion of a probabilistic weight a combinatorial notion called a support. The informal use of the notion of ''possible outcomes of experiments'' suggests that this interpretation can be related to corresponding formal notions as treated by modal logic. The purpose of this paper is to prove that in fact supports are in one-to-one correspondence with the sets of possibly true elementary propositions in Kripke models of a set of modal formulas associated to the empirical or quantum logic. This hopefully provides a sufficiently detailed link between the two rather distinct logical systems to shed useful light on both

Processing device with self-scrubbing logic

Science.gov (United States)

Wojahn, Christopher K.

2016-03-01

An apparatus includes a processing unit including a configuration memory and self-scrubber logic coupled to read the configuration memory to detect compromised data stored in the configuration memory. The apparatus also includes a watchdog unit external to the processing unit and coupled to the self-scrubber logic to detect a failure in the self-scrubber logic. The watchdog unit is coupled to the processing unit to selectively reset the processing unit in response to detecting the failure in the self-scrubber logic. The apparatus also includes an external memory external to the processing unit and coupled to send configuration data to the configuration memory in response to a data feed signal outputted by the self-scrubber logic.

¿Qué es lo lógico? La logicidad dentro y fuera de la lógica (What is Logical? Logicality Inside and Outside Logic

Directory of Open Access Journals (Sweden)

Fernando Soler Toscano

2012-12-01

Full Text Available Resumen: La pregunta por la logicidad busca los criterios que hacen que cierto objeto se pueda considerar un objeto lógico. Los diferentes criterios de logicidad posibles marcarán no solo las distintas formas de concebir la lógica como disciplina académica, sino también distintos modos de entender, en el lenguaje ordinario o en otras disciplinas, qué quiere decir que algo es o no lógico. Mostramos que las aportaciones de las lógicas no clásicas y la pragmática, así como del estudio de otras formas de inferencia distintas de la deducción, enriquecen la caracterización intuitiva de la lógica, lo cual resulta de un interés especial cuando se trata de aplicar la lógica al entrenamiento y evaluación del razonamiento humano.Abstract: The question of logicality searches for criteria that make that a given object can be considered a logical object. Different criteria of logicality establish not only the different possible ways of conceiving logic as an academic discipline, but also the different ways of understanding, in natural language or in other disciplines, what means that something is logical or not. We show that the contribution of non-classical logics and pragmatics, and the study of other kinds of inference different to deduction, enrich the intuitive characterization of logic, which is of particular interest when trying to apply the logic for training and evaluating human reasoning.

Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving

Directory of Open Access Journals (Sweden)

Salvador Lucas

2015-12-01

Full Text Available Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis of declarative programs. We use convex domains to give domains to the different sorts of an order-sorted signature; we interpret the ranked symbols of sorted signatures by means of appropriately adapted convex matrix interpretations. Such numerical interpretations permit the use of existing algorithms and tools from linear algebra and arithmetic constraint solving to synthesize the models.

Automata, Logic, and XML

OpenAIRE

NEVEN, Frank

2002-01-01

We survey some recent developments in the broad area of automata and logic which are motivated by the advent of XML. In particular, we consider unranked tree automata, tree-walking automata, and automata over infinite alphabets. We focus on their connection with logic and on questions imposed by XML.

Temporalized Epistemic Default Logic

NARCIS (Netherlands)

van der Hoek, W.; Meyer, J.J.; Treur, J.; Gabbay, D.

2001-01-01

The nonmonotonic logic Epistemic Default Logic (EDL) [Meyer and van der Hoek, 1993] is based on the metaphore of a meta-level architecture. It has already been established [Meyer and van der Hoek, 1993] how upward reflection can be formalized by a nonmonotonic entailment based on epistemic states,

A vindication of logical necessity against scepticism

OpenAIRE

Philie, Patrice

2002-01-01

Some philosophers dispute the claim that there is a notion of logical necessity involved in the concept of logical consequence. They are sceptical about logical necessity. They argue that a proper characterisation of logical consequence - of what follows from what - need not and should not appeal to the notion of necessity at all. Quine is the most prominent philosopher holding such a view. In this doctoral dissertation, I argue that scepticism about logical necessity is not successful. Quine...

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....

Formalization of Many-Valued Logics

DEFF Research Database (Denmark)

Villadsen, Jørgen; Schlichtkrull, Anders

2017-01-01

Partiality is a key challenge for computational approaches to artificial intelligence in general and natural language in particular. Various extensions of classical two-valued logic to many-valued logics have been investigated in order to meet this challenge. We use the proof assistant Isabelle...... to formalize the syntax and semantics of many-valued logics with determinate as well as indeterminate truth values. The formalization allows for a concise presentation and makes automated verification possible....

Quantum logics and convex geometry

International Nuclear Information System (INIS)

Bunce, L.J.; Wright, J.D.M.

1985-01-01

The main result is a representation theorem which shows that, for a large class of quantum logics, a quantum logic, Q, is isomorphic to the lattice of projective faces in a suitable convex set K. As an application we extend our earlier results, which, subject to countability conditions, gave a geometric characterization of those quantum logics which are isomorphic to the projection lattice of a von Neumann algebra or a JBW-algebra. (orig.)

Towards new social media logic in healthcare and its interplay with clinical logic

NARCIS (Netherlands)

Smailhodzic, E.; Boonsta, A.; Langley, D.J.

2016-01-01

Social media enable patients to communicate with a large number of their peers, share experiences, and provide each other with emotional and informational support. In this way, social media using patients develop a new logic in healthcare, which we propose as social media logic. This raises the

A crash course in arrow logic

NARCIS (Netherlands)

Venema, Y.

This contribution gives a short introduction to arrow logic. We start by explaining the basic idea underlying arrow logic and the motivation for studying it (sections 1 and 2) We discuss some elementary duality theory between arrow logic and the algebraic theory of binary relations (section 3).

Enabling Concise and Modular Specifications in Separation Logic

DEFF Research Database (Denmark)

Jensen, Jonas Buhrkal

2014-01-01

logics and examples of using these logics to verify challenging programs. The article Modular Verification of Linked Lists with Views via Separation Logic reports on verification of a practical data structure with separation logic. The challenges identified in this work has served as motivation for later...... unstructured control flow and the lack of basic facilities in the language such as memory allocation and procedure calls. Finally, the chapter Techniques for Model Construction in Separation Logic surveys the mathematical techniques used to develop the previous separation logics and many other logics...

Fuzzy logic

CERN Document Server

Smets, P

1995-01-01

We start by describing the nature of imperfect data, and giving an overview of the various models that have been proposed. Fuzzy sets theory is shown to be an extension of classical set theory, and as such has a proeminent role or modelling imperfect data. The mathematic of fuzzy sets theory is detailled, in particular the role of the triangular norms. The use of fuzzy sets theory in fuzzy logic and possibility theory,the nature of the generalized modus ponens and of the implication operator for approximate reasoning are analysed. The use of fuzzy logic is detailled for application oriented towards process control and database problems.

Observations on the Monoidal t-norm Logic

Czech Academy of Sciences Publication Activity Database

Hájek, Petr

2002-01-01

Roč. 132, č. 1 (2002), s. 107-112 ISSN 0165-0114 R&D Projects: GA AV ČR IAA1030004 Institutional research plan: AV0Z1030915 Keywords : non-classical logics * basic fuzzy logic * monoidal t-norm logic * product logic Subject RIV: BA - General Mathematics Impact factor: 0.550, year: 2002

Anselm's logic of agency

NARCIS (Netherlands)

Uckelman, S.L.

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

Logics of Business Education for Sustainability

Science.gov (United States)

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.…

The Dynamic Turn in Quantum Logic

NARCIS (Netherlands)

Baltag, A.; Smets, S.

2012-01-01

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

Quantum team logic and Bell's inequalities

NARCIS (Netherlands)

Hyttinen, T.; Paolini, G.; Väänänen, J.

2015-01-01

A logical approach to Bell’s Inequalities of quantum mechanics has been introduced by Abramsky and Hardy (Abramsky & Hardy, 2012). We point out that the logical Bell’s Inequalities of Abramsky & Hardy (2012) are provable in the probability logic of Fagin, Halpern and Megiddo (Fagin et al., 1990).

The dynamic turn in quantum logic

NARCIS (Netherlands)

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

Logic and Automata History and Perspectives

CERN Document Server

Gradel, Erich; Wilk, Thomas

2007-01-01

Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field. Title: Logic and Automata : History and Perspectives Print ISBN: 9789053565766 Author(s): Flum, Jörg; Gr; del, Erich; Wilke, Thomas eISBN: 9789048501281 Publisher: Amsterdam University Press Dewey: 511.3 Publication Date: 01 Jan, 2007 Pages: 737 Category: Mathematics LCCN: Language: English Edition: N/A LCSH:

5th World Congress of Paraconsistent Logic

CERN Document Server

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.

Proof systems for Moss’ coalgebraic logic

NARCIS (Netherlands)

Bílková, M.; Palmigiano, A.; Venema, Y.

2014-01-01

We study Gentzen-style proof theory of the finitary version of the coalgebraic logic introduced by L. Moss. The logic captures the behaviour of coalgebras for a large class of set functors. The syntax of the logic, defined uniformly with respect to a finitary coalgebraic type functor T , uses a

Strategies and logics of internationalization

Directory of Open Access Journals (Sweden)

Mahjouba Ben Salem

2013-07-01

Full Text Available The race between firms to acquire capacities worldwide has evolved in a chronological order which centered at first around products, then around position to move later on to skills and to focus currently on networks. Similarly, when observing the evolution of the different international development strategies, it was found out that they have started by the exportation and the setting up of production subsidiaries to move more recently to such strategies as mergers & acquisitions and international alliances. The present paper investigates the relationship between the internationalization strategies and logics and comes to the conclusion that, a particular logic is behind every choice made. Indeed, the present work was conducted within the Tunisian food enterprises and helped confirm this hypothesis as it was found out that the position logic is behind the choice of exportation and the creation of production subsidiaries while the choice of partnership is based on the logic of skills. The option for merger, on the other hand, is motivated by the networks logic.

A new hierarchy of infinitary logics in abstract algebraic logic

Czech Academy of Sciences Publication Activity Database

Lávička, Tomáš; Noguera, Carles

2017-01-01

Roč. 105, č. 3 (2017), s. 521-551 ISSN 0039-3215 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985556 ; RVO:67985807 Keywords : Abstract algebraic logic * consequence relations * infinitary logics * completeness properties Subject RIV: BA - General Mathematics; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics; Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) (UIVT-O) Impact factor: 0.589, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/noguera-0469118.pdf

Probabilistic logics and probabilistic networks

CERN Document Server

Haenni, Rolf; Wheeler, Gregory; Williamson, Jon; Andrews, Jill

2014-01-01

Probabilistic Logic and Probabilistic Networks presents a groundbreaking framework within which various approaches to probabilistic logic naturally fit. Additionally, the text shows how to develop computationally feasible methods to mesh with this framework.

Logic and discrete mathematics a concise introduction

CERN Document Server

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

Asynchronous Operators of Sequential Logic Venjunction & Sequention

CERN Document Server

Vasyukevich, Vadim

2011-01-01

This book is dedicated to new mathematical instruments assigned for logical modeling of the memory of digital devices. The case in point is logic-dynamical operation named venjunction and venjunctive function as well as sequention and sequentional function. Venjunction and sequention operate within the framework of sequential logic. In a form of the corresponding equations, they organically fit analytical expressions of Boolean algebra. Thus, a sort of symbiosis is formed using elements of asynchronous sequential logic on the one hand and combinational logic on the other hand. So, asynchronous

Experimental quantum computing to solve systems of linear equations.

Science.gov (United States)

Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

2013-06-07

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

Modal Logics with Counting

Science.gov (United States)

Areces, Carlos; Hoffmann, Guillaume; Denis, Alexandre

We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how this logic has been previously investigated under different guises. We show that the language is related to graded modalities and to hybrid logics. We illustrate a possible application of the language to the treatment of plural objects and queries in natural language. We investigate the expressive power of this logic via bisimulations, discuss the complexity of its satisfiability problem, define a new reasoning task that retrieves the cardinality bound of the extension of a given input formula, and provide an algorithm to solve it.

Paraconsistency properties in degree-preserving fuzzy logics

Czech Academy of Sciences Publication Activity Database

Ertola, R.; Esteva, F.; Flaminio, T.; Godo, L.; Noguera, Carles

2015-01-01

Roč. 19, č. 3 (2015), s. 531-546 ISSN 1432-7643 R&D Projects: GA ČR GAP202/10/1826 Institutional support: RVO:67985556 Keywords : Mathematical fuzzy logic * degree-preserving fuzzy logics * paraconsistent logics * logics of formal inconsistency Subject RIV: BA - General Mathematics Impact factor: 1.630, year: 2015 http://library.utia.cas.cz/separaty/2016/MTR/noguera-0469166.pdf

Quantum Logic and Quantum Reconstruction

OpenAIRE

Stairs, Allen

2015-01-01

Quantum logic understood as a reconstruction program had real successes and genuine limitations. This paper offers a synopsis of both and suggests a way of seeing quantum logic in a larger, still thriving context.

General Logic-Systems and Consequence Operators

OpenAIRE

Herrmann, Robert A.

2005-01-01

In this paper, general logic-systems are investigated. It is shown that there are infinitely many finite consequence operators defined on a fixed language L that cannot be generated from a finite logic-system. It is shown that a set map is a finite consequence operator iff it is defined by a general logic-system.

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...

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...

Optically controllable molecular logic circuits

International Nuclear Information System (INIS)

Nishimura, Takahiro; Fujii, Ryo; Ogura, Yusuke; Tanida, Jun

2015-01-01

Molecular logic circuits represent a promising technology for observation and manipulation of biological systems at the molecular level. However, the implementation of molecular logic circuits for temporal and programmable operation remains challenging. In this paper, we demonstrate an optically controllable logic circuit that uses fluorescence resonance energy transfer (FRET) for signaling. The FRET-based signaling process is modulated by both molecular and optical inputs. Based on the distance dependence of FRET, the FRET pathways required to execute molecular logic operations are formed on a DNA nanostructure as a circuit based on its molecular inputs. In addition, the FRET pathways on the DNA nanostructure are controlled optically, using photoswitching fluorescent molecules to instruct the execution of the desired operation and the related timings. The behavior of the circuit can thus be controlled using external optical signals. As an example, a molecular logic circuit capable of executing two different logic operations was studied. The circuit contains functional DNAs and a DNA scaffold to construct two FRET routes for executing Input 1 AND Input 2 and Input 1 AND NOT Input 3 operations on molecular inputs. The circuit produced the correct outputs with all possible combinations of the inputs by following the light signals. Moreover, the operation execution timings were controlled based on light irradiation and the circuit responded to time-dependent inputs. The experimental results demonstrate that the circuit changes the output for the required operations following the input of temporal light signals

Configurable unitary transformations and linear logic gates using quantum memories.

Science.gov (United States)

Campbell, G T; Pinel, O; Hosseini, M; Ralph, T C; Buchler, B C; Lam, P K

2014-08-08

We show that a set of optical memories can act as a configurable linear optical network operating on frequency-multiplexed optical states. Our protocol is applicable to any quantum memories that employ off-resonant Raman transitions to store optical information in atomic spins. In addition to the configurability, the protocol also offers favorable scaling with an increasing number of modes where N memories can be configured to implement arbitrary N-mode unitary operations during storage and readout. We demonstrate the versatility of this protocol by showing an example where cascaded memories are used to implement a conditional cz gate.

Fuzzy Logic and Education: Teaching the Basics of Fuzzy Logic through an Example (By Way of Cycling)

Science.gov (United States)

Sobrino, Alejandro

2013-01-01

Fuzzy logic dates back to 1965 and it is related not only to current areas of knowledge, such as Control Theory and Computer Science, but also to traditional ones, such as Philosophy and Linguistics. Like any logic, fuzzy logic is concerned with argumentation, but unlike other modalities, which focus on the crisp reasoning of Mathematics, it deals…

A Look at Informal Logic

Directory of Open Access Journals (Sweden)

Iryna Khomenko

2018-04-01

Full Text Available The challenges of the global time require new solutions and up-to-date ways of thinking and communication. These challenges call for the ability to use critical thinking to face the ever-changing world and the ability to maintain a dialog based on the effective skills of communication. Studies in the fields of logic and argumentation theory are of particular importance in this regard. Nowadays they can be presented as a mix of theoretical and practical approaches. In this paper, I will present my reflections on informal logic, which was formed in the late 1970s. Unfortunately, in spite of numerous papers, books, and text-books published over the last forty years, consensus on many issues in this field has not been achieved so far. Therefore, it is difficult to treat informal logic as one of the well-defined approaches to argumentation. The goal of this paper is to take a look at the place of informal logic in state-of-the art study of argumentation by clarifying its subject matter and figuring out the realm to which informal logic belongs.

Modal Logics and Definability

OpenAIRE

Kuusisto, Antti

2013-01-01

In recent years, research into the mathematical foundations of modal logic has become increasingly popular. One of the main reasons for this is the fact that modal logic seems to adapt well to the requirements of a wide range of different fields of application. This paper is a summary of some of the author’s contributions to the understanding of modal definability theory.

A Hybrid Model through the Fusion of Type-2 Fuzzy Logic Systems and Sensitivity-Based Linear Learning Method for Modeling PVT Properties of Crude Oil Systems

Directory of Open Access Journals (Sweden)

Ali Selamat

2012-01-01

Full Text Available Sensitivity-based linear learning method (SBLLM has recently been used as a predictive tool due to its unique characteristics and performance, particularly its high stability and consistency during predictions. However, the generalisation capability of SBLLM is sometimes limited depending on the nature of the dataset, particularly on whether uncertainty is present in the dataset or not. Since it made use of sensitivity analysis in relation to the data sets used, it is surely very prone to being affected by the nature of the dataset. In order to reduce the effects of uncertainties in SBLLM prediction and improve its generalisation ability, this paper proposes a hybrid system through the unique combination of type-2 fuzzy logic systems (type-2 FLSs and SBLLM; thereafter the hybrid system was used to model PVT properties of crude oil systems. Type-2 FLS has been choosen in order to better handle uncertainties existing in datasets beyond the capability of type-1 fuzzy logic systems. In the proposed hybrid, the type-2 FLS is used to handle uncertainties in reservoir data so that the cleaned data from type-2 FLS is then passed to the SBLLM for training and then final prediction using testing dataset follows. Comparative studies have been carried out to compare the performance of the newly proposed T2-SBLLM hybrid system with each of the constituent type-2 FLS and SBLLM. Empirical results from simulation show that the proposed T2-SBLLM hybrid system has greatly improved upon the performance of SBLLM, while also maintaining a better performance above that of the type-2 FLS.

Miniaturization of Josephson logic circuits

International Nuclear Information System (INIS)

Ko, H.; Van Duzer, T.

1985-01-01

The performances of Current Injection Logic (CIL) and Resistor Coupled Josephson Logic (RCJL) have been evaluated for minimum features sizes ranging from 5 μm to 0.2 μm. The logic delay is limited to about 10 ps for both the CIL AND gate and the RCJL OR gate biased at 70% of maximum bias current. The maximum circuit count on an 6.35 x 6.35 chip is 13,000 for CIL gates and 20,000 for RCJL gates. Some suggestions are given for further improvements

Nanoelectromechanical resonator for logic operations

KAUST Repository

Kazmi, Syed N. R.

2017-08-29

We report an electro-thermally tunable in-plane doubly-clamped nanoelectromechanical resonator capable of dynamically performing NOR, NOT, XNOR, XOR, and AND logic operations. Toward this, a silicon based resonator is fabricated using standard e-beam lithography and surface nanomachining of a highly conductive device layer of a silicon-on-insulator (SOI) wafer. The performance of this logic device is examined at elevated temperatures, ranging from 25 °C to 85 °C, demonstrating its resilience for most of the logic operations; thereby paving the way towards nano-elements-based mechanical computing.

DEMONSTRATION BULLETIN: THE ECO LOGIC THERMAL DESORPTION UNIT - MIDDLEGROUND LANDFILL - BAY CITY, MI - ELI ECO LOGIC INTERNATIONAL, INC.

Science.gov (United States)

ECO Logic has developed a thermal desorption unit 0"DU) for the treatment of soils contaminated with hazardous organic contaminants. This TDU has been designed to be used in conjunction with Eco Logic's patented gas-phase chemical reduction reactor. The Eco Logic reactor is the s...

Reprogammable universal logic device based on mems technology

KAUST Repository

Hafiz, Md Adbdullah Al

2017-06-15

Various examples of reprogrammable universal logic devices are provided. In one example, the device can include a tunable AC input (206) to an oscillator/resonator; a first logic input and a second logic input to the oscillator/resonator, the first and second logic inputs provided by separate DC voltage sources (VA, VB), each of the first and second logic inputs including an on/off switch (A, B); and the oscillator/resonator including an output terminal (215). The tunable oscillator/resonator can be a MEMS/NEMS resonator. Switching of one or both of the first or second logic inputs on or off in association with the tuning of the AC input (206) can provide logic gate operation. The device can easily be extended to a 3-bit or n-bit device by providing additional logic inputs. Binary comparators and encoders can be implemented using a plurality of oscillators/resonators.

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...

A logical treatment of secondary storage

International Nuclear Information System (INIS)

Foster, I.T.; Kusalik, A.J.

1986-01-01

Existing logic programming environments usually rely on highly imperative primitives and side-effects to achieve I/O with peripheral devices such as disks. This paper describes an alternate approach where the concepts of information input and output are described declarativley. Using a model of a logic-based open system, independent logic systems communicate their beliefs by means of ground logic clauses. The interface to a physical disk is defined as a node in such a system. The contents of the disk are treated as a knowledge base. The model provides the disk with a simple inference mechanism that allows it to assimilate (or reject) assertions made to it by other nodes of the logic system. This disk can also process queries about its contents. An executable specification for such a storage model is given in the parallel logic programming language PARLOG, as well as an actual implementation that uses very low-level term I/O primitives. It is also shown how this model can be extended so that the disk records entity histories, rather than simple clauses. This enables file systems to be constructed very naturally, and allows garbage collection of ''old'' knowledge

Silicon photonic crystal all-optical logic gates

Energy Technology Data Exchange (ETDEWEB)

Fu, Yulan [State Key Laboratory for Mesoscopic Physics and Department of Physics, Peking University, Beijing 100871 (China); Hu, Xiaoyong, E-mail: xiaoyonghu@pku.edu.cn [State Key Laboratory for Mesoscopic Physics and Department of Physics, Peking University, Beijing 100871 (China); Gong, Qihuang, E-mail: qhgong@pku.edu.cn [State Key Laboratory for Mesoscopic Physics and Department of Physics, Peking University, Beijing 100871 (China)

2013-01-03

All-optical logic gates, including OR, XOR, NOT, XNOR, and NAND gates, are realized theoretically in a two-dimensional silicon photonic crystal using the light beam interference effect. The ingenious photonic crystal waveguide component design, the precisely controlled optical path difference, and the elaborate device configuration ensure the simultaneous realization of five types of logic gate with low-power and a contrast ratio between the logic states of “1” and “0” as high as 20 dB. High power is not necessary for operation of these logic gate devices. This offers a simple and effective approach for the realization of integrated all-optical logic devices.

Electronic logic circuits

CERN Document Server

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

A Verification Logic for GOAL Agents

Science.gov (United States)

Hindriks, K. V.

Although there has been a growing body of literature on verification of agents programs, it has been difficult to design a verification logic for agent programs that fully characterizes such programs and to connect agent programs to agent theory. The challenge is to define an agent programming language that defines a computational framework but also allows for a logical characterization useful for verification. The agent programming language GOAL has been originally designed to connect agent programming to agent theory and we present additional results here that GOAL agents can be fully represented by a logical theory. GOAL agents can thus be said to execute the corresponding logical theory.

Translating Dominant Institutional Logics in Practice

DEFF Research Database (Denmark)

Agger Nielsen, Jeppe; Jensen, Tina Blegind

In this paper we examine the proliferation of a new mobile technology in a structured setting of home care in Denmark, focusing on how actions at multiple levels interact to enable technology diffusion and institutionalization. The case study shows how a dominating field level logic...... that combining an institutional logic perspective with a translation perspective furthers our understanding of the malleability of institutional logics....

Energy-Efficient Wide Datapath Integer Arithmetic Logic Units Using Superconductor Logic

Science.gov (United States)

Ayala, Christopher Lawrence

Complementary Metal-Oxide-Semiconductor (CMOS) technology is currently the most widely used integrated circuit technology today. As CMOS approaches the physical limitations of scaling, it is unclear whether or not it can provide long-term support for niche areas such as high-performance computing and telecommunication infrastructure, particularly with the emergence of cloud computing. Alternatively, superconductor technologies based on Josephson junction (JJ) switching elements such as Rapid Single Flux Quantum (RSFQ) logic and especially its new variant, Energy-Efficient Rapid Single Flux Quantum (ERSFQ) logic have the capability to provide an ultra-high-speed, low power platform for digital systems. The objective of this research is to design and evaluate energy-efficient, high-speed 32-bit integer Arithmetic Logic Units (ALUs) implemented using RSFQ and ERSFQ logic as the first steps towards achieving practical Very-Large-Scale-Integration (VLSI) complexity in digital superconductor electronics. First, a tunable VHDL superconductor cell library is created to provide a mechanism to conduct design exploration and evaluation of superconductor digital circuits from the perspectives of functionality, complexity, performance, and energy-efficiency. Second, hybrid wave-pipelining techniques developed earlier for wide datapath RSFQ designs have been used for efficient arithmetic and logic circuit implementations. To develop the core foundation of the ALU, the ripple-carry adder and the Kogge-Stone parallel prefix carry look-ahead adder are studied as representative candidates on opposite ends of the design spectrum. By combining the high-performance features of the Kogge-Stone structure and the low complexity of the ripple-carry adder, a 32-bit asynchronous wave-pipelined hybrid sparse-tree ALU has been designed and evaluated using the VHDL cell library tuned to HYPRES' gate-level characteristics. The designs and techniques from this research have been implemented using

Evidence logics with relational evidence

DEFF Research Database (Denmark)

Baltag, Alexandru; Occhipinti, Andrés

2017-01-01

We introduce a family of logics for reasoning about relational evidence: evidence that involves an ordering of states in terms of their relative plausibility. We provide sound and complete axiomatizations for the logics. We also present several evidential actions and prove soundness...

Binary logic is rich enough

International Nuclear Information System (INIS)

Zapatrin, R.R.

1992-01-01

Given a finite ortholattice L, the *-semigroup is explicitly built whose annihilator ortholattice is isomorphic to L. Thus, it is shown that any finite quantum logic is the additive part of a binary logic. Some areas of possible applications are outlined. 7 refs

Characterization of quantum logics

International Nuclear Information System (INIS)

Lahti, P.J.

1980-01-01

The quantum logic approach to axiomatic quantum mechanics is used to analyze the conceptual foundations of the traditional quantum theory. The universal quantum of action h>0 is incorporated into the theory by introducing the uncertainty principle, the complementarity principle, and the superposition principle into the framework. A characterization of those quantum logics (L,S) which may provide quantum descriptions is then given. (author)

A Conceptual Space Logic

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....

Classical Limit and Quantum Logic

Science.gov (United States)

Losada, Marcelo; Fortin, Sebastian; Holik, Federico

2018-02-01

The analysis of the classical limit of quantum mechanics usually focuses on the state of the system. The general idea is to explain the disappearance of the interference terms of quantum states appealing to the decoherence process induced by the environment. However, in these approaches it is not explained how the structure of quantum properties becomes classical. In this paper, we consider the classical limit from a different perspective. We consider the set of properties of a quantum system and we study the quantum-to-classical transition of its logical structure. The aim is to open the door to a new study based on dynamical logics, that is, logics that change over time. In particular, we appeal to the notion of hybrid logics to describe semiclassical systems. Moreover, we consider systems with many characteristic decoherence times, whose sublattices of properties become distributive at different times.

Molecular processors: from qubits to fuzzy logic.

Science.gov (United States)

Gentili, Pier Luigi

2011-03-14

Single molecules or their assemblies are information processing devices. Herein it is demonstrated how it is possible to process different types of logic through molecules. As long as decoherent effects are maintained far away from a pure quantum mechanical system, quantum logic can be processed. If the collapse of superimposed or entangled wavefunctions is unavoidable, molecules can still be used to process either crisp (binary or multi-valued) or fuzzy logic. The way for implementing fuzzy inference engines is declared and it is supported by the examples of molecular fuzzy logic systems devised so far. Fuzzy logic is drawing attention in the field of artificial intelligence, because it models human reasoning quite well. This ability may be due to some structural analogies between a fuzzy logic system and the human nervous system. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Design, Specification, and Synthesis of Aircraft Electric Power Systems Control Logic

Science.gov (United States)

Xu, Huan

Cyber-physical systems integrate computation, networking, and physical processes. Substantial research challenges exist in the design and verification of such large-scale, distributed sensing, actuation, and control systems. Rapidly improving technology and recent advances in control theory, networked systems, and computer science give us the opportunity to drastically improve our approach to integrated flow of information and cooperative behavior. Current systems rely on text-based specifications and manual design. Using new technology advances, we can create easier, more efficient, and cheaper ways of developing these control systems. This thesis will focus on design considerations for system topologies, ways to formally and automatically specify requirements, and methods to synthesize reactive control protocols, all within the context of an aircraft electric power system as a representative application area. This thesis consists of three complementary parts: synthesis, specification, and design. The first section focuses on the synthesis of central and distributed reactive controllers for an aircraft elec- tric power system. This approach incorporates methodologies from computer science and control. The resulting controllers are correct by construction with respect to system requirements, which are formulated using the specification language of linear temporal logic (LTL). The second section addresses how to formally specify requirements and introduces a domain-specific language for electric power systems. A software tool automatically converts high-level requirements into LTL and synthesizes a controller. The final sections focus on design space exploration. A design methodology is proposed that uses mixed-integer linear programming to obtain candidate topologies, which are then used to synthesize controllers. The discrete-time control logic is then verified in real-time by two methods: hardware and simulation. Finally, the problem of partial observability and

Cylindric-like algebras and algebraic logic

CERN Document Server

Ferenczi, Miklós; Németi, István

2013-01-01

Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski’s quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways:  as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form (“cylindric” in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin.

r-Universal reversible logic gates

International Nuclear Information System (INIS)

Vos, A de; Storme, L

2004-01-01

Reversible logic plays a fundamental role both in ultra-low power electronics and in quantum computing. It is therefore important to know which reversible logic gates can be used as building block for the reversible implementation of an arbitrary boolean function and which cannot

Quantum design rules for single molecule logic gates.

Science.gov (United States)

Renaud, N; Hliwa, M; Joachim, C

2011-08-28

Recent publications have demonstrated how to implement a NOR logic gate with a single molecule using its interaction with two surface atoms as logical inputs [W. Soe et al., ACS Nano, 2011, 5, 1436]. We demonstrate here how this NOR logic gate belongs to the general family of quantum logic gates where the Boolean truth table results from a full control of the quantum trajectory of the electron transfer process through the molecule by very local and classical inputs practiced on the molecule. A new molecule OR gate is proposed for the logical inputs to be also single metal atoms, one per logical input.

The conditional in quantum logic

International Nuclear Information System (INIS)

Hardegree, G.M.

1976-01-01

In this article it is argued that orthodox quantum logic, which is represented by the lattice of projections on Hilbert space, does in fact admit an operation which possesses the essential properties of a material conditional. It is proposed that this connective can be interpreted as a Stalnaker (counter factual) conditional, where the nearness ordering among 'worlds' (in this case, QM pure states) derives in a natural way from the Hilbert space inner-product metric. It is a characteristic of the quantum logic conditional that the law of modus ponens is equivalent to the orthomodular law of conventional quantum logic. (B.R.H.)

A Hedge for Gödel Fuzzy Logic

Czech Academy of Sciences Publication Activity Database

Hájek, Petr; Harmancová, Dagmar

2000-01-01

Roč. 8, č. 4 (2000), s. 495-498 ISSN 0218-4885 Grant - others:COST(XE) Action 15 Institutional research plan: AV0Z1030915 Keywords : fuzzy logic * Gödel logic * intuitionistic logic * hedges Subject RIV: BA - General Mathematics Impact factor: 0.145, year: 2000

Logic, reasoning, and verbal behavior

OpenAIRE

Terrell, Dudley J.; Johnston, J. M.

1989-01-01

This paper analyzes the traditional concepts of logic and reasoning from the perspective of radical behaviorism and in the terms of Skinner's treatment of verbal behavior. The topics covered in this analysis include the proposition, premises and conclusions, logicality and rules, and deductive and inductive reasoning.

Epistemic logics for sceptical agents

Czech Academy of Sciences Publication Activity Database

Bílková, M.; Majer, Ondrej; Peliš, Michal

2016-01-01

Roč. 26, č. 6 (2016), s. 1815-1841 ISSN 0955-792X R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : epistemic logic * substructural logic * frame semantics Subject RIV: AA - Philosophy ; Religion Impact factor: 0.909, year: 2016

Jauch-Piron logics with finiteness conditions

International Nuclear Information System (INIS)

Rogalewicz, V.

1991-01-01

An event structure (so-called quantum logic) of a quantum mechanical system is commonly assumed to be an orthomodular poset L. A state of such a system is then interpreted as a probability measure on L. It turns out that the orthomodular posets which may potentially serve as logics must have reasonably rich spaces of states. Moreover, the following condition on the state space appears among the axioms of a quantum system: if Φ is a state on a logic L, and Φ(a) = Φ(b) = 1 for some a, b element-of L, then there is a c element-of L such that c ≤ a, c ≤ b, and Φ(c) = 1. Such a state is said to be a Jauch-Piron state. If all states on L fulfill this condition, then L is called a Jauch-Piron logic. The condition was originally introduced by Jauch (1968) and Piron (1976). The author investigates unital Jauch-Piron logics with finitely many blocks (maximal Boolean subalgebras). He shows that such a logic is always Boolean, i.e., it represents a purely classical system. In other words, and orthomodular poset must have infinitely many blocks in order to describe a (nonclassical) quantum system

Dependence logic theory and applications

CERN Document Server

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 ...

Simultaneous G-Quadruplex DNA Logic.

Science.gov (United States)

Bader, Antoine; Cockroft, Scott L

2018-04-03

A fundamental principle of digital computer operation is Boolean logic, where inputs and outputs are described by binary integer voltages. Similarly, inputs and outputs may be processed on the molecular level as exemplified by synthetic circuits that exploit the programmability of DNA base-pairing. Unlike modern computers, which execute large numbers of logic gates in parallel, most implementations of molecular logic have been limited to single computing tasks, or sensing applications. This work reports three G-quadruplex-based logic gates that operate simultaneously in a single reaction vessel. The gates respond to unique Boolean DNA inputs by undergoing topological conversion from duplex to G-quadruplex states that were resolved using a thioflavin T dye and gel electrophoresis. The modular, addressable, and label-free approach could be incorporated into DNA-based sensors, or used for resolving and debugging parallel processes in DNA computing applications. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Evidence that logical reasoning depends on conscious processing.

Science.gov (United States)

DeWall, C Nathan; Baumeister, Roy F; Masicampo, E J

2008-09-01

Humans, unlike other animals, are equipped with a powerful brain that permits conscious awareness and reflection. A growing trend in psychological science has questioned the benefits of consciousness, however. Testing a hypothesis advanced by [Lieberman, M. D., Gaunt, R., Gilbert, D. T., & Trope, Y. (2002). Reflection and reflexion: A social cognitive neuroscience approach to attributional inference. Advances in Experimental Social Psychology, 34, 199-249], four studies suggested that the conscious, reflective processing system is vital for logical reasoning. Substantial decrements in logical reasoning were found when a cognitive load manipulation preoccupied conscious processing, while hampering the nonconscious system with consciously suppressed thoughts failed to impair reasoning (Experiment 1). Nonconscious activation (priming) of the idea of logical reasoning increased the activation of logic-relevant concepts, but failed to improve logical reasoning performance (Experiments 2a-2c) unless the logical conclusions were largely intuitive and thus not reliant on logical reasoning (Experiment 3). Meanwhile, stimulating the conscious goal of reasoning well led to improvements in reasoning performance (Experiment 4). These findings offer evidence that logical reasoning is aided by the conscious, reflective processing system.

Logic verification system for power plant sequence diagrams

International Nuclear Information System (INIS)

Fukuda, Mitsuko; Yamada, Naoyuki; Teshima, Toshiaki; Kan, Ken-ichi; Utsunomiya, Mitsugu.

1994-01-01

A logic verification system for sequence diagrams of power plants has been developed. The system's main function is to verify correctness of the logic realized by sequence diagrams for power plant control systems. The verification is based on a symbolic comparison of the logic of the sequence diagrams with the logic of the corresponding IBDs (interlock Block Diagrams) in combination with reference to design knowledge. The developed system points out the sub-circuit which is responsible for any existing mismatches between the IBD logic and the logic realized by the sequence diagrams. Applications to the verification of actual sequence diagrams of power plants confirmed that the developed system is practical and effective. (author)

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...

Dialogues as a dynamic framework for logic

NARCIS (Netherlands)

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

Structural Completeness in Fuzzy Logics

Czech Academy of Sciences Publication Activity Database

Cintula, Petr; Metcalfe, G.

2009-01-01

Roč. 50, č. 2 (2009), s. 153-183 ISSN 0029-4527 R&D Projects: GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : structral logics * fuzzy logics * structural completeness * admissible rules * primitive variety * residuated lattices Subject RIV: BA - General Mathematics

First-order modal logic theorem proving and standard PROLOG

OpenAIRE

Nonnengart, A.

1992-01-01

Many attempts have been started to combine logic programming and modal logics. Most of them however, do not use classical PROLOG, but extend the PROLOG idea in order to cope with modal logic formulae directly. These approaches have the disadvantage that for each logic new logic programming systems are to be developed and the knowledge and experience gathered from PROLOG can hardly be utilized. Modal logics based on Kripke-style relational semantics, however, allow a direct translation from mo...

Diagnosable structured logic array

Science.gov (United States)

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.

Demonstration of feed-forward control for linear optics quantum computation

International Nuclear Information System (INIS)

Pittman, T.B.; Jacobs, B.C.; Franson, J.D.

2002-01-01

One of the main requirements in linear optics quantum computing is the ability to perform single-qubit operations that are controlled by classical information fed forward from the output of single-photon detectors. These operations correspond to predetermined combinations of phase corrections and bit flips that are applied to the postselected output modes of nondeterministic quantum logic devices. Corrections of this kind are required in order to obtain the correct logical output for certain detection events, and their use can increase the overall success probability of the devices. In this paper, we report on the experimental demonstration of the use of this type of feed-forward system to increase the probability of success of a simple nondeterministic quantum logic operation from approximately (1/4) to (1/2). This logic operation involves the use of one target qubit and one ancilla qubit which, in this experiment, are derived from a parametric down-conversion photon pair. Classical information describing the detection of the ancilla photon is fed forward in real time and used to alter the quantum state of the output photon. A fiber-optic delay line is used to store the output photon until a polarization-dependent phase shift can be applied using a high-speed Pockels cell

Solving Unconstrained Global Optimization Problems via Hybrid Swarm Intelligence Approaches

Directory of Open Access Journals (Sweden)

Jui-Yu Wu

2013-01-01

Full Text Available Stochastic global optimization (SGO algorithms such as the particle swarm optimization (PSO approach have become popular for solving unconstrained global optimization (UGO problems. The PSO approach, which belongs to the swarm intelligence domain, does not require gradient information, enabling it to overcome this limitation of traditional nonlinear programming methods. Unfortunately, PSO algorithm implementation and performance depend on several parameters, such as cognitive parameter, social parameter, and constriction coefficient. These parameters are tuned by using trial and error. To reduce the parametrization of a PSO method, this work presents two efficient hybrid SGO approaches, namely, a real-coded genetic algorithm-based PSO (RGA-PSO method and an artificial immune algorithm-based PSO (AIA-PSO method. The specific parameters of the internal PSO algorithm are optimized using the external RGA and AIA approaches, and then the internal PSO algorithm is applied to solve UGO problems. The performances of the proposed RGA-PSO and AIA-PSO algorithms are then evaluated using a set of benchmark UGO problems. Numerical results indicate that, besides their ability to converge to a global minimum for each test UGO problem, the proposed RGA-PSO and AIA-PSO algorithms outperform many hybrid SGO algorithms. Thus, the RGA-PSO and AIA-PSO approaches can be considered alternative SGO approaches for solving standard-dimensional UGO problems.

Against All Odds: When Logic Meets Probability

NARCIS (Netherlands)

van Benthem, J.; Katoen, J.-P.; Langerak, R.; Rensink, A.

2017-01-01

This paper is a light walk along interfaces between logic and probability, triggered by a chance encounter with Ed Brinksma. It is not a research paper, or a literature survey, but a pointer to issues. I discuss both direct combinations of logic and probability and structured ways in which logic can

Computational logic: its origins and applications.

Science.gov (United States)

Paulson, Lawrence C

2018-02-01

Computational logic is the use of computers to establish facts in a logical formalism. Originating in nineteenth century attempts to understand the nature of mathematical reasoning, the subject now comprises a wide variety of formalisms, techniques and technologies. One strand of work follows the 'logic for computable functions (LCF) approach' pioneered by Robin Milner, where proofs can be constructed interactively or with the help of users' code (which does not compromise correctness). A refinement of LCF, called Isabelle, retains these advantages while providing flexibility in the choice of logical formalism and much stronger automation. The main application of these techniques has been to prove the correctness of hardware and software systems, but increasingly researchers have been applying them to mathematics itself.

Wave Pipelining Using Self Reset Logic

Directory of Open Access Journals (Sweden)

Miguel E. Litvin

2008-01-01

Full Text Available This study presents a novel design approach combining wave pipelining and self reset logic, which provides an elegant solution at high-speed data throughput with significant savings in power and area as compared with other dynamic CMOS logic implementations. To overcome some limitations in SRL art, we employ a new SRL family, namely, dual-rail self reset logic with input disable (DRSRL-ID. These gates depict fairly constant timing parameters, specially the width of the output pulse, for varying fan-out and logic depth, helping accommodate process, supply voltage, and temperature variations (PVT. These properties simplify the implementation of wave pipelined circuits. General timing analysis is provided and compared with previous implementations. Results of circuit implementation are presented together with conclusions and future work.

Optical reversible programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2012-07-20

Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.

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...... with an experimental vignette study of the effects of clan and kinship ties on recruitment and selection decisions in Kazakhstan, followed by qualitative interviews....

Graded Alternating-Time Temporal Logic

Science.gov (United States)

Faella, Marco; Napoli, Margherita; Parente, Mimmo

Graded modalities enrich the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a non-negative integer k. Recently, temporal logics such as μ-calculus and Computational Tree Logic, Ctl, augmented with graded modalities have received attention from the scientific community, both from a theoretical side and from an applicative perspective. Both μ-calculus and Ctl naturally apply as specification languages for closed systems: in this paper, we add graded modalities to the Alternating-time Temporal Logic (Atl) introduced by Alur et al., to study how these modalities may affect specification languages for open systems.

Formalized Epistemology, Logic, and Grammar

Science.gov (United States)

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.

Fuzzy logic and neural networks basic concepts & application

CERN Document Server

Alavala, Chennakesava R

2008-01-01

About the Book: The primary purpose of this book is to provide the student with a comprehensive knowledge of basic concepts of fuzzy logic and neural networks. The hybridization of fuzzy logic and neural networks is also included. No previous knowledge of fuzzy logic and neural networks is required. Fuzzy logic and neural networks have been discussed in detail through illustrative examples, methods and generic applications. Extensive and carefully selected references is an invaluable resource for further study of fuzzy logic and neural networks. Each chapter is followed by a question bank

A peak value searching method of the MCA based on digital logic devices

International Nuclear Information System (INIS)

Sang Ziru; Huang Shanshan; Chen Lian; Jin Ge

2010-01-01

Digital multi-channel analyzers play a more important role in multi-channel pulse height analysis technique. The direction of digitalization are characterized by powerful pulse processing ability, high throughput, improved stability and flexibility. This paper introduces a method of searching peak value of waveform based on digital logic with FPGA. This method reduce the dead time. Then data correction offline can improvement the non-linearity of MCA. It gives the α energy spectrum of 241 Am. (authors)

Fuzzy logic control of nuclear power plant

International Nuclear Information System (INIS)

Yao Liangzhong; Guo Renjun; Ma Changwen

1996-01-01

The main advantage of the fuzzy logic control is that the method does not require a detailed mathematical model of the object to be controlled. In this paper, the shortcomings and limitations of the model-based method in nuclear power plant control were presented, the theory of the fuzzy logic control was briefly introduced, and the applications of the fuzzy logic control technology in nuclear power plant controls were surveyed. Finally, the problems to be solved by using the fuzzy logic control in nuclear power plants were discussed

Towards a formal logic of design rationalization

DEFF Research Database (Denmark)

Galle, Per

1997-01-01

Certain extensions to standard predicate logic are proposed and used as a framework for critical logical study of patterns of inference in design reasoning. It is shown that within this framework a modal logic of design rationalization (suggested by an empirical study reported earlier) can...... be formally defined in terms of quantification over a universe of discourse of ‘relevant points of view’. Five basic principles of the extended predicate logic are listed, on the basis of which the validity of ten modal patterns of inference encountered in design rationalization is tested. The basic idea...

From Interpreter to Logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2003-01-01

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lam......Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied...

From Interpreter to Logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2004-01-01

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lam......Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied...

From Interpreter to logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2003-01-01

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lam......Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied...

A Dynamic Logic for Learning Theory

DEFF Research Database (Denmark)

Baltag, Alexandru; Gierasimczuk, Nina; Özgün, Aybüke

2017-01-01

Building on previous work that bridged Formal Learning Theory and Dynamic Epistemic Logic in a topological setting, we introduce a Dynamic Logic for Learning Theory (DLLT), extending Subset Space Logics with dynamic observation modalities, as well as with a learning operator, which encodes the le...... the learner’s conjecture after observing a finite sequence of data. We completely axiomatise DLLT, study its expressivity and use it to characterise various notions of knowledge, belief, and learning. ...

15 CFR 970.601 - Logical mining unit.

Science.gov (United States)

2010-01-01

... 15 Commerce and Foreign Trade 3 2010-01-01 2010-01-01 false Logical mining unit. 970.601 Section... ENVIRONMENTAL DATA SERVICE DEEP SEABED MINING REGULATIONS FOR EXPLORATION LICENSES Resource Development Concepts § 970.601 Logical mining unit. (a) In the case of an exploration license, a logical mining unit is an...

Fibred Coalgebraic Logic and Quantum Protocols

Directory of Open Access Journals (Sweden)

Daniel Marsden

2014-12-01

Full Text Available Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions on different fibres. As this fibred setting will typically involve multiple signature functors, the logic incorporates a calculus of modalities enabling the construction of new modalities using various composition operations. We extend the semantics of coalgebraic logic to this setting, and prove that this extension respects behavioural equivalence. We show how properties of the semantics of modalities are preserved under composition operations, and then apply the calculational aspect of our logic to produce an expressive set of modalities for reasoning about quantum systems, building these modalities up from simpler components. We then demonstrate how these modalities can describe some standard quantum protocols. The novel features of our logic are shown to allow for a uniform description of unitary evolution, and support local reasoning such as "Alice's qubit satisfies condition" as is common when discussing quantum protocols.

Towards the future of fuzzy logic

CERN Document Server

Trillas, Enric; Kacprzyk, Janusz

2015-01-01

This book provides readers with a snapshot of the state-of-the art in fuzzy logic. Throughout the chapters, key theories developed in the last fifty years as well as important applications to practical problems are presented and discussed from different perspectives, as the authors hail from different disciplines and therefore use fuzzy logic for different purposes.  The book aims at showing how fuzzy logic has evolved since the first theory formulation by Lotfi A. Zadeh in his seminal paper on Fuzzy Sets in 1965. Fuzzy theories and implementation grew at an impressive speed and achieved significant results, especially on the applicative side. The study of fuzzy logic and its practice spread all over the world, from Europe to Asia, America and Oceania. The editors believe that, thanks to the drive of young researchers, fuzzy logic will be able to face the challenging goals posed by computing with words. New frontiers of knowledge are waiting to be explored. In order to motivate young people to engage in the ...

Semantic foundation for preferential description logics

CSIR Research Space (South Africa)

Britz, K

2011-12-01

Full Text Available Description logics are a well-established family of knowledge representation formalisms in Artificial Intelligence. Enriching description logics with non-monotonic reasoning capabilities, especially preferential reasoning as developed by Lehmann...

Technologies for faults diagnosis of FPGA logic blocks

Directory of Open Access Journals (Sweden)

C. U. Ngene

2012-08-01

Full Text Available The critical issues of testing field programmable gate arrays (FPGA with a view to diagnosing faults are an important step that ensures the reliability of FPGA designs. Correct diagnosis of faulty logic blocks of FPGAs guarantees restoration of functionality through replacement of faulty block with replacement units. This process can be done autonomously or without the intervention of an engineer depending on application area. This paper considers two methods for analysing test results of FPGA logic blocks with the purpose of localising and distinguishing faults. The algebraic logic and vector-logical methods are proposed for diagnosing faulty logic blocks in FPGA fabric. It is found that the algebraic logic method is more useful for processing of sparse faults tables when the number of coordinates with 1s values with respect to zero values ​​is not more than 20%, whereas the vector-logical method facilitates the analysis of faults table with predominance of 1s values.

Interpreting Quantum Logic as a Pragmatic Structure

Science.gov (United States)

Garola, Claudio

2017-12-01

Many scholars maintain that the language of quantum mechanics introduces a quantum notion of truth which is formalized by (standard, sharp) quantum logic and is incompatible with the classical (Tarskian) notion of truth. We show that quantum logic can be identified (up to an equivalence relation) with a fragment of a pragmatic language LGP of assertive formulas, that are justified or unjustified rather than trueor false. Quantum logic can then be interpreted as an algebraic structure that formalizes properties of the notion of empirical justification according to quantum mechanics rather than properties of a quantum notion of truth. This conclusion agrees with a general integrationist perspective that interprets nonstandard logics as theories of metalinguistic notions different from truth, thus avoiding incompatibility with classical notions and preserving the globality of logic.

Optical pulse dynamics for quantum-dot logic operations in a photonic-crystal waveguide

Energy Technology Data Exchange (ETDEWEB)

Ma, Xun; John, Sajeev [Department of Physics, University of Toronto, Toronto, Ontario, M5S 1A7 Canada (Canada)

2011-11-15

We numerically demonstrate all-optical logic operations with quantum dots (QDs) embedded in a bimodal photonic-crystal waveguide using Maxwell-Bloch equations in a slowly varying envelope approximation (SVEA). The two-level QD excitation level is controlled by one or more femtojoule optical driving pulses passing through the waveguide. Specific logic operations depend on the relative pulse strengths and their detunings from an inhomogeneouslly broadened (about 1% for QD transitions centered at 1.5 {mu}m) QD transition. This excitation controlled two-level medium then determines passage of subsequent probe optical pulses. Envelope equations for electromagnetic waves in the linear dispersion and cutoff waveguide modes are derived to simplify solution of the coupled Maxwell-Bloch equations in the waveguide. These determine the quantum mechanical evolution of the QD excitation and its polarization, driven by classical electromagnetic (EM) pulses near a sharp discontinuity in the EM density of states of the bimodal waveguide. Different configurations of the driving pulses lead to distinctive relations between driving pulse strength and probe pulse passage, representing all-optical logic and, or, and not operations. Simulation results demonstrate that such operations can be done on picosecond time scales and within a waveguide length of about 10 {mu}m in a photonic-band-gap (PBG) optical microchip.

Contribution of Warsaw Logicians to Computational Logic

Directory of Open Access Journals (Sweden)

Damian Niwiński

2016-06-01

Full Text Available The newly emerging branch of research of Computer Science received encouragement from the successors of the Warsaw mathematical school: Kuratowski, Mazur, Mostowski, Grzegorczyk, and Rasiowa. Rasiowa realized very early that the spectrum of computer programs should be incorporated into the realm of mathematical logic in order to make a rigorous treatment of program correctness. This gave rise to the concept of algorithmic logic developed since the 1970s by Rasiowa, Salwicki, Mirkowska, and their followers. Together with Pratt’s dynamic logic, algorithmic logic evolved into a mainstream branch of research: logic of programs. In the late 1980s, Warsaw logicians Tiuryn and Urzyczyn categorized various logics of programs, depending on the class of programs involved. Quite unexpectedly, they discovered that some persistent open questions about the expressive power of logics are equivalent to famous open problems in complexity theory. This, along with parallel discoveries by Harel, Immerman and Vardi, contributed to the creation of an important area of theoretical computer science: descriptive complexity. By that time, the modal μ-calculus was recognized as a sort of a universal logic of programs. The mid 1990s saw a landmark result by Walukiewicz, who showed completeness of a natural axiomatization for the μ-calculus proposed by Kozen. The difficult proof of this result, based on automata theory, opened a path to further investigations. Later, Bojanczyk opened a new chapter by introducing an unboundedness quantifier, which allowed for expressing some quantitative properties of programs. Yet another topic, linking the past with the future, is the subject of automata founded in the Fraenkel-Mostowski set theory. The studies on intuitionism found their continuation in the studies of Curry-Howard isomorphism. ukasiewicz’s landmark idea of many-valued logic found its continuation in various approaches to incompleteness and uncertainty.

Mathematical Fuzzy Logic - State of Art 2001

Czech Academy of Sciences Publication Activity Database

Hájek, Petr

2003-01-01

Roč. 24, - (2003), s. 71-89 ISSN 0103-9059. [WOLLIC'2001. Brasília, 31.07.2001-03.08.2001] R&D Projects: GA MŠk LN00A056 Keywords : fuzzy logic * many valued logic * basic fuzzy logic BL Subject RIV: BA - General Mathematics http://www.mat.unb.br/~matcont/24_4.pdf

Logical Normativity and Common Sense Reasoning

Directory of Open Access Journals (Sweden)

Evandro Agazzi

2011-04-01

Full Text Available Logic, considered as a technical discipline inaugurated by Aristotle and typically represented by the variety of the modern logical calculi, constitutes a clarification and refinement of a conviction and practice present in common sense, that is, the fact that humans believe that truth can be acquired not only by immediate evidence, but also by means of arguments. As a first step logic can be seen as a “descriptive” record of the main forms of the arguments present in common sense, but the fact that some of these patterns can actually allow for the derivation of false consequences from true premises imposes the task of making explicit what patterns correspond to a “correct reasoning” and what not. At this point logic (that contains the presentation of such patterns appears endowed with a “normative” characteristic. This amounts to saying that logical calculi are intended to adequately mirror the intuitive notion of “logical consequence” and in this sense they cannot be totally arbitrary or conventional, but must satisfy certain basic requirements such as the conditions of soundness and (as far as possible of semantic completeness. In such a way they are “judged” according to the fundamental requirements present at the level of common sense and appear as “idealizations” of the kinds of reasoning practiced in common sense. For this reason also several kinds of logical calculi are fully justified since they make explicit in an idealized form the concrete ways of reasoning that are imposed by the particular domain of reference of the discipline in which they are used and which are basically recognized in common sense.

A Case for Embedded Natural Logic for Ontological Knowledge Bases

DEFF Research Database (Denmark)

Andreasen, Troels; Nilsson, Jørgen Fischer

2014-01-01

We argue in favour of adopting a form of natural logic for ontology-structured knowledge bases as an alternative to description logic and rule based languages. Natural logic is a form of logic resembling natural language assertions, unlike description logic. This is essential e.g. in life sciences...... negation in description logic. We embed the natural logic in DATALOG clauses which is to take care of the computational inference in connection with querying...

Introduction to mathematical logic

CERN Document Server

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

Orthogonal Algorithm of Logic Probability and Syndrome-Testable Analysis

Institute of Scientific and Technical Information of China (English)

无

1990-01-01

A new method,orthogonal algoritm,is presented to compute the logic probabilities(i.e.signal probabilities)accurately,The transfer properties of logic probabilities are studied first,which are useful for the calculation of logic probability of the circuit with random independent inputs.Then the orthogonal algoritm is described to compute the logic probability of Boolean function realized by a combinational circuit.This algorithm can make Boolean function “ORTHOGONAL”so that the logic probabilities can be easily calculated by summing up the logic probabilities of all orthogonal terms of the Booleam function.

Fuzzy logic in management

CERN Document Server

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...

Piaget's Logic of Meanings: Still Relevant Today

Science.gov (United States)

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,…

Fuzzy logic applications in engineering science

CERN Document Server

Harris, J

2006-01-01

Fuzzy logic is a relatively new concept in science applications. Hitherto, fuzzy logic has been a conceptual process applied in the field of risk management. Its potential applicability is much wider than that, however, and its particular suitability for expanding our understanding of processes and information in science and engineering in our post-modern world is only just beginning to be appreciated. Written as a companion text to the author's earlier volume "An Introduction to Fuzzy Logic Applications", the book is aimed at professional engineers and students and those with an interest in exploring the potential of fuzzy logic as an information processing kit with a wide variety of practical applications in the field of engineering science and develops themes and topics introduced in the author's earlier text.

The Immateriality of Material Practices in Institutional Logics

DEFF Research Database (Denmark)

Jones, Candace; Boxenbaum, Eva; Anthony, Callen

2013-01-01

as practices and structures, and rarely as physical objects. We explore some consequences of omitting physical materials as an object of study in institutional logics research and point to avenues for future research that may enhance theory development of institutional logics by explicitly attending......According to most theoretical formulations, institutional logics contain both an ideational and a material dimension. Whereas the ideational aspect, such as cognitive frames and symbols, has received significant attention in the growing literature on institutional logics, the material aspect has...... remained largely invisible and often implicit. We analyze the 16 most central theoretical and empirical works on institutional logics with the aim of exploring how the material dimension of logics has been conceptualized and researched. Our findings suggest that materiality has been interpreted primarily...

Generic physical protection logic trees

International Nuclear Information System (INIS)

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

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.

A superposition principle in quantum logics

International Nuclear Information System (INIS)

Pulmannova, S.

1976-01-01

A new definition of the superposition principle in quantum logics is given which enables us to define the sectors. It is shown that the superposition principle holds only in the irreducible quantum logics. (orig.) [de

Mathematical logic foundations for information science

CERN Document Server

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.

Temporal logics and real time expert systems.

Science.gov (United States)

Blom, J A

1996-10-01

This paper introduces temporal logics. Due to the eternal compromise between expressive adequacy and reasoning efficiency that must decided upon in any application, full (first order logic or modal logic based) temporal logics are frequently not suitable. This is especially true in real time expert systems, where a fixed (and usually small) response time must be guaranteed. One such expert system, Fagan's VM, is reviewed, and a delineation is given of how to formally describe and reason with time in medical protocols. It is shown that Petri net theory is a useful tool to check the correctness of formalised protocols.

Application of fuzzy logic control in industry

International Nuclear Information System (INIS)

Van der Wal, A.J.

1994-01-01

An overview is given of the various ways fuzzy logic can be used to improve industrial control. The application of fuzzy logic in control is illustrated by two case studies. The first example shows how fuzzy logic, incorporated in the hardware of an industrial controller, helps to finetune a PID controller, without the operator having any a priori knowledge of the system to be controlled. The second example is from process industry. Here, fuzzy logic supervisory control is implemented in software and enhances the operation of a sintering oven through a subtle combination of priority management and deviation-controlled timing

Coinductive Logic Programming with Negation

Science.gov (United States)

Min, Richard; Gupta, Gopal

We introduce negation into coinductive logic programming (co-LP) via what we term Coinductive SLDNF (co-SLDNF) resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting's Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF resolution are also discussed and illustrated where Co-SLDNF resolution allows one to develop elegant implementations of modal logics. Moreover it provides the capability of non-monotonic inference (e.g., predicate Answer Set Programming) that can be used to develop novel and effective first-order modal non-monotonic inference engines.

Quantum probabilistic logic programming

Science.gov (United States)

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.

Conference Cultures of Mathematics and Logic

CERN Document Server

Löwe, Benedikt; Müller, Thomas; Xie, Yun

2016-01-01

This book gathers the proceedings of the conference "Cultures of Mathematics and Logic," held in Guangzhou, China. The event was the third in a series of interdisciplinary, international conferences emphasizing the cultural components of philosophy of mathematics and logic. It brought together researchers from many disciplines whose work sheds new light on the diversity of mathematical and logical cultures and practices. In this context, the cultural diversity can be diachronical (different cultures in different historical periods), geographical (different cultures in different regions), or sociological in nature.

Digital logic circuit test

Energy Technology Data Exchange (ETDEWEB)

Yun, Gil Jung; Yang, Hong Young

2011-03-15

This book is about digital logic circuit test, which lists the digital basic theory, basic gate like and, or And Not gate, NAND/NOR gate such as NAND gate, NOR gate, AND and OR, logic function, EX-OR gate, adder and subtractor, decoder and encoder, multiplexer, demultiplexer, flip-flop, counter such as up/down counter modulus N counter and Reset type counter, shift register, D/A and A/D converter and two supplements list of using components and TTL manual and CMOS manual.

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 can...... support formal specification and verification of liveness and fairness, and also of various notions of real analysis....

Integration of biomolecular logic gates with field-effect transducers

Energy Technology Data Exchange (ETDEWEB)

Poghossian, A., E-mail: a.poghossian@fz-juelich.de [Institute of Nano- and Biotechnologies, Aachen University of Applied Sciences, Campus Juelich, Heinrich-Mussmann-Str. 1, D-52428 Juelich (Germany); Institute of Bio- and Nanosystems, Research Centre Juelich GmbH, D-52425 Juelich (Germany); Malzahn, K. [Institute of Nano- and Biotechnologies, Aachen University of Applied Sciences, Campus Juelich, Heinrich-Mussmann-Str. 1, D-52428 Juelich (Germany); Abouzar, M.H. [Institute of Nano- and Biotechnologies, Aachen University of Applied Sciences, Campus Juelich, Heinrich-Mussmann-Str. 1, D-52428 Juelich (Germany); Institute of Bio- and Nanosystems, Research Centre Juelich GmbH, D-52425 Juelich (Germany); Mehndiratta, P. [Institute of Nano- and Biotechnologies, Aachen University of Applied Sciences, Campus Juelich, Heinrich-Mussmann-Str. 1, D-52428 Juelich (Germany); Katz, E. [Department of Chemistry and Biomolecular Science, NanoBio Laboratory (NABLAB), Clarkson University, Potsdam, NY 13699-5810 (United States); Schoening, M.J. [Institute of Nano- and Biotechnologies, Aachen University of Applied Sciences, Campus Juelich, Heinrich-Mussmann-Str. 1, D-52428 Juelich (Germany); Institute of Bio- and Nanosystems, Research Centre Juelich GmbH, D-52425 Juelich (Germany)

2011-11-01

Highlights: > Enzyme-based AND/OR logic gates are integrated with a capacitive field-effect sensor. > The AND/OR logic gates compose of multi-enzyme system immobilised on sensor surface. > Logic gates were activated by different combinations of chemical inputs (analytes). > The logic output (pH change) produced by the enzymes was read out by the sensor. - Abstract: The integration of biomolecular logic gates with field-effect devices - the basic element of conventional electronic logic gates and computing - is one of the most attractive and promising approaches for the transformation of biomolecular logic principles into macroscopically useable electrical output signals. In this work, capacitive field-effect EIS (electrolyte-insulator-semiconductor) sensors based on a p-Si-SiO{sub 2}-Ta{sub 2}O{sub 5} structure modified with a multi-enzyme membrane have been used for electronic transduction of biochemical signals processed by enzyme-based OR and AND logic gates. The realised OR logic gate composes of two enzymes (glucose oxidase and esterase) and was activated by ethyl butyrate or/and glucose. The AND logic gate composes of three enzymes (invertase, mutarotase and glucose oxidase) and was activated by two chemical input signals: sucrose and dissolved oxygen. The developed integrated enzyme logic gates produce local pH changes at the EIS sensor surface as a result of biochemical reactions activated by different combinations of chemical input signals, while the pH value of the bulk solution remains unchanged. The pH-induced charge changes at the gate-insulator (Ta{sub 2}O{sub 5}) surface of the EIS transducer result in an electronic signal corresponding to the logic output produced by the immobilised enzymes. The logic output signals have been read out by means of a constant-capacitance method.

Integration of biomolecular logic gates with field-effect transducers

International Nuclear Information System (INIS)

Poghossian, A.; Malzahn, K.; Abouzar, M.H.; Mehndiratta, P.; Katz, E.; Schoening, M.J.

2011-01-01

Highlights: → Enzyme-based AND/OR logic gates are integrated with a capacitive field-effect sensor. → The AND/OR logic gates compose of multi-enzyme system immobilised on sensor surface. → Logic gates were activated by different combinations of chemical inputs (analytes). → The logic output (pH change) produced by the enzymes was read out by the sensor. - Abstract: The integration of biomolecular logic gates with field-effect devices - the basic element of conventional electronic logic gates and computing - is one of the most attractive and promising approaches for the transformation of biomolecular logic principles into macroscopically useable electrical output signals. In this work, capacitive field-effect EIS (electrolyte-insulator-semiconductor) sensors based on a p-Si-SiO 2 -Ta 2 O 5 structure modified with a multi-enzyme membrane have been used for electronic transduction of biochemical signals processed by enzyme-based OR and AND logic gates. The realised OR logic gate composes of two enzymes (glucose oxidase and esterase) and was activated by ethyl butyrate or/and glucose. The AND logic gate composes of three enzymes (invertase, mutarotase and glucose oxidase) and was activated by two chemical input signals: sucrose and dissolved oxygen. The developed integrated enzyme logic gates produce local pH changes at the EIS sensor surface as a result of biochemical reactions activated by different combinations of chemical input signals, while the pH value of the bulk solution remains unchanged. The pH-induced charge changes at the gate-insulator (Ta 2 O 5 ) surface of the EIS transducer result in an electronic signal corresponding to the logic output produced by the immobilised enzymes. The logic output signals have been read out by means of a constant-capacitance method.

Molecular sensors and molecular logic gates

International Nuclear Information System (INIS)

Georgiev, N.; Bojinov, V.

2013-01-01

Full text: The rapid grow of nanotechnology field extended the concept of a macroscopic device to the molecular level. Because of this reason the design and synthesis of (supra)-molecular species capable of mimicking the functions of macroscopic devices are currently of great interest. Molecular devices operate via electronic and/or nuclear rearrangements and, like macroscopic devices, need energy to operate and communicate between their elements. The energy needed to make a device work can be supplied as chemical energy, electrical energy, or light. Luminescence is one of the most useful techniques to monitor the operation of molecular-level devices. This fact determinates the synthesis of novel fluorescence compounds as a considerable and inseparable part of nanoscience development. Further miniaturization of semiconductors in electronic field reaches their limit. Therefore the design and construction of molecular systems capable of performing complex logic functions is of great scientific interest now. In semiconductor devices the logic gates work using binary logic, where the signals are encoded as 0 and 1 (low and high current). This process is executable on molecular level by several ways, but the most common are based on the optical properties of the molecule switches encoding the low and high concentrations of the input guest molecules and the output fluorescent intensities with binary 0 and 1 respectively. The first proposal to execute logic operations at the molecular level was made in 1988, but the field developed only five years later when the analogy between molecular switches and logic gates was experimentally demonstrated by de Silva. There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR and XNOR and all of them were achieved by molecules, the fluorescence switching as well. key words: fluorescence, molecular sensors, molecular logic gates

Electrodynamic linear motor

Energy Technology Data Exchange (ETDEWEB)

Munehiro, H

1980-05-29

When driving the carriage of a printer through a rotating motor, there are problems regarding the limited accuracy of the carriage position due to rotation or contraction and ageing of the cable. In order to solve the problem, a direct drive system was proposed, in which the printer carriage is driven by a linear motor. If one wants to keep the motor circuit of such a motor compact, then the magnetic flux density in the air gap must be reduced or the motor travel must be reduced. It is the purpose of this invention to create an electrodynamic linear motor, which on the one hand is compact and light and on the other hand has a relatively high constant force over a large travel. The invention is characterised by the fact that magnetic fields of alternating polarity are generated at equal intervals in the magnetic field, and that the coil arrangement has 2 adjacent coils, whose size corresponds to half the length of each magnetic pole. A logic circuit is provided to select one of the two coils and to determine the direction of the current depending on the signals of a magnetic field sensor on the coil arrangement.

Access control, security, and trust a logical approach

CERN Document Server

Chin, Shiu-Kai

2010-01-01

Access Control, Security, Trust, and Logic Deconstructing Access Control Decisions A Logical Approach to Access Control PRELIMINARIES A Language for Access ControlSets and Relations Syntax SemanticsReasoning about Access Control Logical RulesFormal Proofs and Theorems Soundness of Logical RulesBasic Concepts Reference Monitors Access Control Mechanisms: Tickets and Lists Authentication Security PoliciesConfidentiality, Integrity, and Availability Discretionary Security Policies Mandatory Security Policies Military Security Policies Commercial PoliciesDISTRIBUTED ACCESS CONTROL Digital Authenti

A Decidable Recursive Logic for Weighted Transition Systems

DEFF Research Database (Denmark)

Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

2014-01-01

In this paper we develop and study the Recursive Weighted Logic (RWL), a multi-modal logic that expresses qualitative and quantitative properties of labelled weighted transition systems (LWSs). LWSs are transition systems labelled with actions and real-valued quantities representing the costs of ...... extends previous results that we have demonstrated for a similar but much more restrictive logic that can only use one variable for each type of resource to encode logical properties....

A functorial semantics for quantum logic

International Nuclear Information System (INIS)

Holdsworth, D.G.

1979-09-01

The author uses category theory to examine a quantum logical interpretation of quantum theory. The central thesis is that logical structure is an objective feature of reality, not merely a feature of representation of reality inherent in particular theories. A non-classical foundation for mathematics is adopted, one that uses morphisms as its primitives. The author argues that all propositions in a physical theory are theoretical and that observation statements constitute a subclass of theoretical statements. Inferences to micro- and macro-objects are on the same pragmatic and logical level, and defending realism for quantum theory involves providing a new criterion of objectivity that coheres with the general constraints of the theory. The criterion proposed has the consequence that certain structural features of reality are to be considered theoretically determined or objective. These features are closely related to logical structure

Reconfigurable chaotic logic gates based on novel chaotic circuit

International Nuclear Information System (INIS)

Behnia, S.; Pazhotan, Z.; Ezzati, N.; Akhshani, A.

2014-01-01

Highlights: • A novel method for implementing logic gates based on chaotic maps is introduced. • The logic gates can be implemented without any changes in the threshold voltage. • The chaos-based logic gates may serve as basic components of future computing devices. - Abstract: The logical operations are one of the key issues in today’s computer architecture. Nowadays, there is a great interest in developing alternative ways to get the logic operations by chaos computing. In this paper, a novel implementation method of reconfigurable logic gates based on one-parameter families of chaotic maps is introduced. The special behavior of these chaotic maps can be utilized to provide same threshold voltage for all logic gates. However, there is a wide interval for choosing a control parameter for all reconfigurable logic gates. Furthermore, an experimental implementation of this nonlinear system is presented to demonstrate the robustness of computing capability of chaotic circuits

Reversible logic synthesis methodologies with application to quantum computing

CERN Document Server

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...

VHDL for logic synthesis

CERN Document Server

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...

Fuzzy forecasting based on two-factors second-order fuzzy-trend logical relationship groups and the probabilities of trends of fuzzy logical relationships.

Science.gov (United States)

Chen, Shyi-Ming; Chen, Shen-Wen

2015-03-01

In this paper, we present a new method for fuzzy forecasting based on two-factors second-order fuzzy-trend logical relationship groups and the probabilities of trends of fuzzy-trend logical relationships. Firstly, the proposed method fuzzifies the historical training data of the main factor and the secondary factor into fuzzy sets, respectively, to form two-factors second-order fuzzy logical relationships. Then, it groups the obtained two-factors second-order fuzzy logical relationships into two-factors second-order fuzzy-trend logical relationship groups. Then, it calculates the probability of the "down-trend," the probability of the "equal-trend" and the probability of the "up-trend" of the two-factors second-order fuzzy-trend logical relationships in each two-factors second-order fuzzy-trend logical relationship group, respectively. Finally, it performs the forecasting based on the probabilities of the down-trend, the equal-trend, and the up-trend of the two-factors second-order fuzzy-trend logical relationships in each two-factors second-order fuzzy-trend logical relationship group. We also apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) and the NTD/USD exchange rates. The experimental results show that the proposed method outperforms the existing methods.

Recent Trends in Spintronics-Based Nanomagnetic Logic

Science.gov (United States)

Das, Jayita; Alam, Syed M.; Bhanja, Sanjukta

2014-09-01

With the growing concerns of standby power in sub-100-nm CMOS technologies, alternative computing techniques and memory technologies are explored. Spin transfer torque magnetoresistive RAM (STT-MRAM) is one such nonvolatile memory relying on magnetic tunnel junctions (MTJs) to store information. It uses spin transfer torque to write information and magnetoresistance to read information. In 2012, Everspin Technologies, Inc. commercialized the first 64Mbit Spin Torque MRAM. On the computing end, nanomagnetic logic (NML) is a promising technique with zero leakage and high data retention. In 2000, Cowburn and Welland first demonstrated its potential in logic and information propagation through magnetostatic interaction in a chain of single domain circular nanomagnetic dots of Supermalloy (Ni80Fe14Mo5X1, X is other metals). In 2006, Imre et al. demonstrated wires and majority gates followed by coplanar cross wire systems demonstration in 2010 by Pulecio et al. Since 2004 researchers have also investigated the potential of MTJs in logic. More recently with dipolar coupling between MTJs demonstrated in 2012, logic-in-memory architecture with STT-MRAM have been investigated. The architecture borrows the computing concept from NML and read and write style from MRAM. The architecture can switch its operation between logic and memory modes with clock as classifier. Further through logic partitioning between MTJ and CMOS plane, a significant performance boost has been observed in basic computing blocks within the architecture. In this work, we have explored the developments in NML, in MTJs and more recent developments in hybrid MTJ/CMOS logic-in-memory architecture and its unique logic partitioning capability.

Reprogammable universal logic device based on mems technology

KAUST Repository

Hafiz, Md Adbdullah Al; Kosuru, Lakshmoji; Younis, Mohammad I.

2017-01-01

Various examples of reprogrammable universal logic devices are provided. In one example, the device can include a tunable AC input (206) to an oscillator/resonator; a first logic input and a second logic input to the oscillator/resonator, the first

Project W-058 monitor and control system logic

International Nuclear Information System (INIS)

ROBERTS, J.B.

1999-01-01

This supporting document contains the printout of the control logic for the Project W-058 Monitor and Control System, as developed by Programmable Control Services, Inc. The logic is arranged in five appendices, one for each programmable logic controller console

Mapping Modular SOS to Rewriting Logic

DEFF Research Database (Denmark)

Braga, Christiano de Oliveira; Haeusler, Edward Hermann; Meseguer, José

2003-01-01

and verification of MSOS specifications, we have defined a mapping, named , from MSOS to rewriting logic (RWL), a logic which has been proposed as a logical and semantic framework. We have proven the correctness of and implemented it as a prototype, the MSOS-SL Interpreter, in the Maude system, a high......Modular SOS (MSOS) is a framework created to improve the modularity of structural operational semantics specifications, a formalism frequently used in the fields of programming languages semantics and process algebras. With the objective of defining formal tools to support the execution...

Abductive Inference using Array-Based Logic

DEFF Research Database (Denmark)

Frisvad, Jeppe Revall; Falster, Peter; Møller, Gert L.

The notion of abduction has found its usage within a wide variety of AI fields. Computing abductive solutions has, however, shown to be highly intractable in logic programming. To avoid this intractability we present a new approach to logicbased abduction; through the geometrical view of data...... employed in array-based logic we embrace abduction in a simple structural operation. We argue that a theory of abduction on this form allows for an implementation which, at runtime, can perform abductive inference quite efficiently on arbitrary rules of logic representing knowledge of finite domains....

Molecular implementation of simple logic programs.

Science.gov (United States)

Ran, Tom; Kaplan, Shai; Shapiro, Ehud

2009-10-01

Autonomous programmable computing devices made of biomolecules could interact with a biological environment and be used in future biological and medical applications. Biomolecular implementations of finite automata and logic gates have already been developed. Here, we report an autonomous programmable molecular system based on the manipulation of DNA strands that is capable of performing simple logical deductions. Using molecular representations of facts such as Man(Socrates) and rules such as Mortal(X) logical deductions and delivers the result. This prototype is the first simple programming language with a molecular-scale implementation.

Three-valued logic gates in reaction-diffusion excitable media

International Nuclear Information System (INIS)

Motoike, Ikuko N.; Adamatzky, Andrew

2005-01-01

It is well established now that excitable media are capable of implementing of a wide range of computational operations, from image processing to logical computation to navigation of robots. The findings published so far in the field of logical computation were concerned solely with realization of boolean logic. This imposed somewhat artificial limitations on a suitability of excitable media for logical reasoning and restricted a range of possible applications of these non-classical computational devices in the field of artificial intelligence. In the paper we go beyond binary logic and show how to implement three-valued logical operations in toy models of geometrically constrained excitable media. We realize several types of logical gates, including Lukasiewicz conjunction and disjunction, and Sobocinski conjunction in cellular automata and FitzHugh-Nagumo models of T-shaped excitable media

A Case for Embedded Natural Logic for Ontological Knowledge Bases

DEFF Research Database (Denmark)

Andreasen, Troels; Nilsson, Jørgen Fischer

2014-01-01

We argue in favour of adopting a form of natural logic for ontology-structured knowledge bases as an alternative to description logic and rule based languages. Natural logic is a form of logic resembling natural language assertions, unlike description logic. This is essential e.g. in life sciences......, where the large and evolving knowledge specifications should be directly accessible to domain experts. Moreover, natural logic comes with intuitive inference rules. The considered version of natural logic leans toward the closed world assumption (CWA) unlike the open world assumption with classical...

A History of Probabilistic Inductive Logic Programming

Directory of Open Access Journals (Sweden)

Fabrizio eRiguzzi

2014-09-01

Full Text Available The field of Probabilistic Logic Programming (PLP has seen significant advances in the last 20 years, with many proposals for languages that combine probability with logic programming. Since the start, the problem of learning probabilistic logic programs has been the focus of much attention. Learning these programs represents a whole subfield of Inductive Logic Programming (ILP. In Probabilistic ILP (PILP two problems are considered: learning the parameters of a program given the structure (the rules and learning both the structure and the parameters. Usually structure learning systems use parameter learning as a subroutine. In this article we present an overview of PILP and discuss the main results.

Logic, probability, and human reasoning.

Science.gov (United States)

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. Copyright © 2015 Elsevier Ltd. All rights reserved.

Fredkin gates for finite-valued reversible and conservative logics

International Nuclear Information System (INIS)

Cattaneo, G; Leporati, A; Leporini, R

2002-01-01

The basic principles and results of conservative logic introduced by Fredkin and Toffoli in 1982, on the basis of a seminal paper of Landauer, are extended to d-valued logics, with a special attention to three-valued logics. Different approaches to d-valued logics are examined in order to determine some possible universal sets of logic primitives. In particular, we consider the typical connectives of Lukasiewicz and Goedel logics, as well as Chang's MV-algebras. As a result, some possible three-valued and d-valued universal gates are described which realize a functionally complete set of fundamental connectives. Two no-go theorems are also proved

Toward spin-based Magneto Logic Gate in Graphene

Science.gov (United States)

Wen, Hua; Dery, Hanan; Amamou, Walid; Zhu, Tiancong; Lin, Zhisheng; Shi, Jing; Zutic, Igor; Krivorotov, Ilya; Sham, Lu; Kawakami, Roland

Graphene has emerged as a leading candidate for spintronic applications due to its long spin diffusion length at room temperature. A universal magnetologic gate (MLG) based on spin transport in graphene has been recently proposed as the building block of a logic circuit which could replace the current CMOS technology. This MLG has five ferromagnetic electrodes contacting a graphene channel and can be considered as two three-terminal XOR logic gates. Here we demonstrate this XOR logic gate operation in such a device. This was achieved by systematically tuning the injection current bias to balance the spin polarization efficiency of the two inputs, and offset voltage in the detection circuit to obtain binary outputs. The output is a current which corresponds to different logic states: zero current is logic `0', and nonzero current is logic `1'. We find improved performance could be achieved by reducing device size and optimizing the contacts.

Reliability concerns with logical constants in Xilinx FPGA designs

Energy Technology Data Exchange (ETDEWEB)

Quinn, Heather M [Los Alamos National Laboratory; Graham, Paul [Los Alamos National Laboratory; Morgan, Keith [Los Alamos National Laboratory; Ostler, Patrick [Los Alamos National Laboratory; Allen, Greg [JPL; Swift, Gary [XILINX; Tseng, Chen W [XILINX

2009-01-01

In Xilinx Field Programmable Gate Arrays logical constants, which ground unused inputs and provide constants for designs, are implemented in SEU-susceptible logic. In the past, these logical constants have been shown to cause the user circuit to output bad data and were not resetable through off-line rcconfiguration. In the more recent devices, logical constants are less problematic, though mitigation should still be considered for high reliability applications. In conclusion, we have presented a number of reliability concerns with logical constants in the Xilinx Virtex family. There are two main categories of logical constants: implicit and explicit logical constants. In all of the Virtex devices, the implicit logical constants are implemented using half latches, which in the most recent devices are several orders of magnitudes smaller than configuration bit cells. Explicit logical constants are implemented exclusively using constant LUTs in the Virtex-I and Virtex-II, and use a combination of constant LUTs and architectural posts to the ground plane in the Virtex-4. We have also presented mitigation methods and options for these devices. While SEUs in implicit and some types of explicit logical constants can cause data corrupt, the chance of failure from these components is now much smaller than it was in the Virtex-I device. Therefore, for many cases, mitigation might not be necessary, except under extremely high reliability situations.

A reconfigurable NAND/NOR genetic logic gate.

Science.gov (United States)

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.

Rethinking logic logic in relation to mathematics, evolution, and method

CERN Document Server

Cellucci, Carlo

2014-01-01

This book examines the limitations of mathematical logic and proposes a new approach intended to overcome them. Formulates new rules of discovery, such as induction, analogy, generalization, specialization, metaphor, metonymy, definition and diagrams.

Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic

DEFF Research Database (Denmark)

Møgelberg, Rasmus Ejlers; Birkedal, Lars; Rosolini, Guiseppe

2008-01-01

Plotkin suggested using a polymorphic dual intuitionistic/linear type theory (PILLY) as a metalanguage for parametric polymorphism and recursion. In recent work the first two authors and R.L. Petersen have defined a notion of parametric LAPL-structure, which are models of PILLY, in which one can...... reason using parametricity and, for example, solve a large class of domain equations, as suggested by Plotkin.In this paper, we show how an interpretation of a strict version of Bierman, Pitts and Russo's language Lily into synthetic domain theory presented by Simpson and Rosolini gives rise...... to a parametric LAPL-structure. This adds to the evidence that the notion of LAPL-structure is a general notion, suitable for treating many different parametric models, and it provides formal proofs of consequences of parametricity expected to hold for the interpretation. Finally, we show how these results...

Conceptual and Metaphysical Origins and Relevance of Temporal Logic

DEFF Research Database (Denmark)

Jakobsen, David; Øhrstrøm, Peter

2016-01-01

Logic has sometimes been seen as an alternative to metaphysics and to speculation. In this paper it is argued that a different story should be told when it comes to temporal logic and tense-logic in particular. A.N. Prior’s first formulation of tense logic was mainly established in order to quali...

Permission-Based Separation Logic for Multithreaded Java Programs

NARCIS (Netherlands)

Haack, Christian; Huisman, Marieke; Hurlin, C.

2011-01-01

This paper motivates and presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of

Three views of logic mathematics, philosophy, and computer science

CERN Document Server

Loveland, Donald W; Sterrett, S G

2014-01-01

Demonstrating the different roles that logic plays in the disciplines of computer science, mathematics, and philosophy, this concise undergraduate textbook covers select topics from three different areas of logic: proof theory, computability theory, and nonclassical logic. The book balances accessibility, breadth, and rigor, and is designed so that its materials will fit into a single semester. Its distinctive presentation of traditional logic material will enhance readers' capabilities and mathematical maturity. The proof theory portion presents classical propositional logic and first-orde

Quantum logic in dagger kernel categories

NARCIS (Netherlands)

Heunen, C.; Jacobs, B.P.F.

2009-01-01

This paper investigates quantum logic from the perspective of categorical logic, and starts from minimal assumptions, namely the existence of involutions/daggers and kernels. The resulting structures turn out to (1) encompass many examples of interest, such as categories of relations, partial

Quantum logic in dagger kernel categories

NARCIS (Netherlands)

Heunen, C.; Jacobs, B.P.F.; Coecke, B.; Panangaden, P.; Selinger, P.

2011-01-01

This paper investigates quantum logic from the perspective of categorical logic, and starts from minimal assumptions, namely the existence of involutions/daggers and kernels. The resulting structures turn out to (1) encompass many examples of interest, such as categories of relations, partial

New developments in segment ancillary logic for FASTBUS

International Nuclear Information System (INIS)

Walz, H.V.; Bertolucci, B.

1983-01-01

Segment Ancillary Logic hardware for FASTBUS systems provides logical functions required in common by all devices attached to a segment. It controls the execution of arbitration cycles, and geographical address cycles, and generates the system handshake responses for broadcast operations. The mandatory requirements for Segment Ancillary Logic in the FASTBUS specifications are reviewed. A detailed implementation based on ECL logic is described, and the hardware to be used on an ECL cable segment for an experimental FASTBUS system at SLAC is shown

Application of temporal LNC logic in artificial intelligence

Science.gov (United States)

Adamek, Marek; Mulawka, Jan

2016-09-01

This paper presents the temporal logic inference engine developed in our university. It is an attempt to demonstrate implementation and practical application of temporal logic LNC developed in Cardinal Stefan Wyszynski University in Warsaw.1 The paper describes the fundamentals of LNC logic, architecture and implementation of inference engine. The practical application is shown by providing the solution for popular in Artificial Intelligence problem of Missionaries and Cannibals in terms of LNC logic. Both problem formulation and inference engine are described in details.

A Formal Semantics for Concept Understanding relying on Description Logics

DEFF Research Database (Denmark)

Badie, Farshad

2017-01-01

In this research, Description Logics (DLs) will be employed for logical description, logical characterisation, logical modelling and ontological description of concept understanding in terminological systems. It’s strongly believed that using a formal descriptive logic could support us in reveali...... logical assumptions whose discovery may lead us to a better understanding of ‘concept understanding’. The Structure of Observed Learning Outcomes (SOLO) model as an appropriate model of increasing complexity of humans’ understanding has supported the formal analysis....

A Formal Semantics for Concept Understanding relying on Description Logics

DEFF Research Database (Denmark)

Badie, Farshad

2017-01-01

logical assumptions whose discovery may lead us to a better understanding of ‘concept understanding’. The Structure of Observed Learning Outcomes (SOLO) model as an appropriate model of increasing complexity of humans’ understanding has supported the formal analysis.......In this research, Description Logics (DLs) will be employed for logical description, logical characterisation, logical modelling and ontological description of concept understanding in terminological systems. It’s strongly believed that using a formal descriptive logic could support us in revealing...

"Glitch Logic" and Applications to Computing and Information Security

Science.gov (United States)

Stoica, Adrian; Katkoori, Srinivas

2009-01-01

This paper introduces a new method of information processing in digital systems, and discusses its potential benefits to computing and information security. The new method exploits glitches caused by delays in logic circuits for carrying and processing information. Glitch processing is hidden to conventional logic analyses and undetectable by traditional reverse engineering techniques. It enables the creation of new logic design methods that allow for an additional controllable "glitch logic" processing layer embedded into a conventional synchronous digital circuits as a hidden/covert information flow channel. The combination of synchronous logic with specific glitch logic design acting as an additional computing channel reduces the number of equivalent logic designs resulting from synthesis, thus implicitly reducing the possibility of modification and/or tampering with the design. The hidden information channel produced by the glitch logic can be used: 1) for covert computing/communication, 2) to prevent reverse engineering, tampering, and alteration of design, and 3) to act as a channel for information infiltration/exfiltration and propagation of viruses/spyware/Trojan horses.

A parity checker circuit based on microelectromechanical resonator logic elements