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

Automated termination proofs for logic programs by term rewriting

NARCIS (Netherlands)

Schneider-Kamp, P.; Giesl, J.; Serebrenik, A.; Thiemann, R.

2009-01-01

There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into a Term Rewrite System (TRS) and then analyze

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

Towards automatic verification of ladder logic programs

OpenAIRE

Zoubek , Bohumir; Roussel , Jean-Marc; Kwiatkowska , Martha

2003-01-01

International audience; Control system programs are usually validated by testing prior to their deployment. Unfortunately, testing is not exhaustive and therefore it is possible that a program which passed all the required tests still contains errors. In this paper we apply techniques of automatic verification to a control program written in ladder logic. A model is constructed mechanically from the ladder logic program and subjected to automatic verification against requirements that include...

Permission-based separation logic for multi-threaded Java programs

NARCIS (Netherlands)

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

This paper 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 concurrent

Proving termination of logic programs with delay declarations

NARCIS (Netherlands)

E. Marchiori; F. Teusink (Frank)

1996-01-01

textabstractIn this paper we propose a method for proving termination of logic programs with delay declarations. The method is based on the notion of recurrent logic program, which is used to prove programs terminating wrt an arbitrary selection rule. Most importantly, we use the notion of bound

Procedural and Logic Programming: A Comparison.

Science.gov (United States)

Watkins, Will; And Others

1988-01-01

Examines the similarities and fundamental differences between procedural programing and logic programing by comparing LogoWriter and PROLOG. Suggests that PROLOG may be a good first programing language for students to learn. (MVL)

Fast logic modules with programmed functions

International Nuclear Information System (INIS)

Zinov, V.G.; Selikov, A.V.

1987-01-01

Modern nuclear-physical experiment procedure requires automated control and adjustment of event selection and recording systems. Nanosecond programmed-control units realizing optional set of combinational logic functions are described. Programmed permanent storage device is the basis of one unit, and on-line storage device, preliminary provided with truth tables, is in the basis of the other units. The resolution time is 40 ns. By means of auxiliary unit the programmed logic devices with sequent storage elements (digital timer and pulse generator; multiple-phase generator; sequential digital controller) are realized. The units are performed in CAMAC standard, the modules size being 1M

Testing Automation of Context-Oriented Programs Using Separation Logic

Directory of Open Access Journals (Sweden)

Mohamed A. El-Zawawy

2014-01-01

Full Text Available A new approach for programming that enables switching among contexts of commands during program execution is context-oriented programming (COP. This technique is more structured and modular than object-oriented and aspect-oriented programming and hence more flexible. For context-oriented programming, as implemented in COP languages such as ContextJ* and ContextL, this paper introduces accurate operational semantics. The language model of this paper uses Java concepts and is equipped with layer techniques for activation/deactivation of layer contexts. This paper also presents a logical system for COP programs. This logic is necessary for the automation of testing, developing, and validating of partial correctness specifications for COP programs and is an extension of separation logic. A mathematical soundness proof for the logical system against the proposed operational semantics is presented in the paper.

Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs

Directory of Open Access Journals (Sweden)

Angelos Charalambidis

2015-09-01

Full Text Available Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of the source program. The relationships between these two approaches had not been investigated until now. In this paper we demonstrate that for a very broad class of programs, namely the class of definitional programs introduced by W. W. Wadge, the two approaches coincide (with respect to ground atoms that involve symbols of the program. On the other hand, we argue that if existential higher-order variables are allowed to appear in the bodies of program rules, the two approaches are in general different. The results of the paper contribute to a better understanding of the semantics of higher-order logic programming.

Logic programming and metadata specifications

Science.gov (United States)

Lopez, Antonio M., Jr.; Saacks, Marguerite E.

1992-01-01

Artificial intelligence (AI) ideas and techniques are critical to the development of intelligent information systems that will be used to collect, manipulate, and retrieve the vast amounts of space data produced by 'Missions to Planet Earth.' Natural language processing, inference, and expert systems are at the core of this space application of AI. This paper presents logic programming as an AI tool that can support inference (the ability to draw conclusions from a set of complicated and interrelated facts). It reports on the use of logic programming in the study of metadata specifications for a small problem domain of airborne sensors, and the dataset characteristics and pointers that are needed for data access.

LOGICAL REASONING ABILITY AND STUDENT PERFORMANCE IN GENERAL CHEMISTRY.

Science.gov (United States)

Bird, Lillian

2010-03-01

Logical reasoning skills of students enrolled in General Chemistry at the University of Puerto Rico in Río Piedras were measured using the Group Assessment of Logical Thinking (GALT) test. The results were used to determine the students' cognitive level (concrete, transitional, formal) as well as their level of performance by logical reasoning mode (mass/volume conservation, proportional reasoning, correlational reasoning, experimental variable control, probabilistic reasoning and combinatorial reasoning). This information was used to identify particular deficiencies and gender effects, and to determine which logical reasoning modes were the best predictors of student performance in the general chemistry course. Statistical tests to analyze the relation between (a) operational level and final grade in both semesters of the course; (b) GALT test results and performance in the ACS General Chemistry Examination; and (c) operational level and student approach (algorithmic or conceptual) towards a test question that may be answered correctly using either strategy, were also performed.

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.

Realization of logical functions by vector programs

Energy Technology Data Exchange (ETDEWEB)

Lapkin, L Ya

1983-03-01

Recent computing and control applications often require program realization of finite automata in general and of an important particular class of memoryless automata specified by systems of Boolean functions. Logical control and computing machines which receive sequences of discrete signals on the input and convert them into sequences of discrete output signals using finite memory may be described by a finite automation model. However, in distinction from the circuit interpretation of finite automata, the automaton algorithm represents the structure of the automaton program and not the structure of the machine itself. Therefore, the complexity of the computer realization of an automaton is the complexity of the computer program, and not the complexity of the hardware. Two classes of programs currently used to evalute boolean functions are operator programs and binary programs. However, computing machines, including microcomputers, are equipped with additional possibilities for evaluation of Boolean functions, which are not utilized in programs of these two basic classes. In this article, we consider the design of vector programs for program realization of systems of Boolean functions. 3 references.

Logic Programming with Requests

NARCIS (Netherlands)

De Schreye, Danny; Etalle, Sandro; van Raamsdonk, Femke

1999-01-01

We propose an extension of logic programming where the user can specify, together with the initial query, the information he is interested in by means of a request. This allows one to extract a result from an incomplete computation, such as the prefix of an infinite derivation. The classical

Modular Logic Programming for Web Data, Inheritance and Agents

Science.gov (United States)

Karali, Isambo

The Semantic Web provides a framework and a set of technologies enabling an effective machine processable information. However, most of the problems that are addressed in the Semantic Web were tackled by the artificial intelligence community, in the past. Within this period, Logic Programming emerged as a complete framework ranging from a sound formal theory, based on Horn clauses, to a declarative description language and an operational behavior that can be executed. Logic programming and its extensions have been already used in various approaches in the Semantic Web or the traditional Web context. In this work, we investigate the use of Modular Logic Programming, i.e. Logic Programming extended with modules, to address issues of the Semantic Web ranging from the ontology layer to reasoning and agents. These techniques provide a uniform framework ranging from the data layer to the higher layers of logic, avoiding the problem of incompatibilities of technologies related with different Semantic Web layers. What is more is that it can operate directly on top of existent World Wide Web sources.

Logic models as a tool for sexual violence prevention program development.

Science.gov (United States)

Hawkins, Stephanie R; Clinton-Sherrod, A Monique; Irvin, Neil; Hart, Laurie; Russell, Sarah Jane

2009-01-01

Sexual violence is a growing public health problem, and there is an urgent need to develop sexual violence prevention programs. Logic models have emerged as a vital tool in program development. The Centers for Disease Control and Prevention funded an empowerment evaluation designed to work with programs focused on the prevention of first-time male perpetration of sexual violence, and it included as one of its goals, the development of program logic models. Two case studies are presented that describe how significant positive changes can be made to programs as a result of their developing logic models that accurately describe desired outcomes. The first case study describes how the logic model development process made an organization aware of the importance of a program's environmental context for program success; the second case study demonstrates how developing a program logic model can elucidate gaps in organizational programming and suggest ways to close those gaps.

Constraint Logic Programming approach to protein structure prediction

Directory of Open Access Journals (Sweden)

Fogolari Federico

2004-11-01

Full Text Available Abstract Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Results Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. Conclusions The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Constraint Logic Programming approach to protein structure prediction.

Science.gov (United States)

Dal Palù, Alessandro; Dovier, Agostino; Fogolari, Federico

2004-11-30

The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known) secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Logic Programming for Linguistics

DEFF Research Database (Denmark)

Christiansen, Henning

2010-01-01

This article gives a short introduction on how to get started with logic pro- gramming in Prolog that does not require any previous programming expe- rience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what...

Truth and falsehood an inquiry into generalized logical values

CERN Document Server

Shramko, Yaroslav

2012-01-01

Here is a thoroughly elaborated logical theory of generalized truth-values, presenting the idea of a trilattice of truth values - a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity.

Logic-programming language enriches design processes

Energy Technology Data Exchange (ETDEWEB)

Kitson, B.; Ow-Wing, K.

1984-03-22

With the emergence of a set of high-level CAD tools for programmable logic devices, designers can translate logic into functional custom devices simply and efficiently. The core of the package is a blockstructured hardware description language called PLPL, for ''programmable-logic programming language.'' The cheif advantage of PLPL lies in its multiple input formats, which permit different design approaches for a variety of design problems. The higher the level of the approach, the closer PLPL will come to directly specifying the desired function. Intermediate steps in the design process can be eliminated, along with the errors that might have been generated during those steps.

Logic integer programming models for signaling networks.

Science.gov (United States)

Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert

2009-05-01

We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.

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.

Devil is in the details: Using logic models to investigate program process.

Science.gov (United States)

Peyton, David J; Scicchitano, Michael

2017-12-01

Theory-based logic models are commonly developed as part of requirements for grant funding. As a tool to communicate complex social programs, theory based logic models are an effective visual communication. However, after initial development, theory based logic models are often abandoned and remain in their initial form despite changes in the program process. This paper examines the potential benefits of committing time and resources to revising the initial theory driven logic model and developing detailed logic models that describe key activities to accurately reflect the program and assist in effective program management. The authors use a funded special education teacher preparation program to exemplify the utility of drill down logic models. The paper concludes with lessons learned from the iterative revision process and suggests how the process can lead to more flexible and calibrated program management. Copyright © 2017 Elsevier Ltd. All rights reserved.

A Logic Programming Testbed for Inductive Thought and Specification.

Science.gov (United States)

Neff, Norman D.

This paper describes applications of logic programming technology to the teaching of the inductive method in computer science and mathematics. It discusses the nature of inductive thought and its place in those fields of inquiry, arguing that a complete logic programming system for supporting inductive inference is not only feasible but necessary.…

Phonotactics in inductive logic programming

NARCIS (Netherlands)

Nerbonne, J.; Konstantopoulos, S.; Klopotek, M.A.; Wierzchon, S.T.; Trojanowski, K.

2004-01-01

We examine the results of applying inductive logic programming (ILP) to a relatively simple linguistic task, that of recognizing monosyllables in one language. ILP is suited to linguistic problems given linguists' preference for formulating their theories in discrete rules, and because of ILP's

Core TuLiP - Logic Programming for Trust Management

NARCIS (Netherlands)

Czenko, M.R.; Etalle, Sandro; Dahl, V.; Niemelä, I.

2007-01-01

We propose CoreTuLiP - the core of a trust management language based on Logic Programming. CoreTuLiP is based on a subset of moded logic programming, but enjoys the features of TM languages such as RT; in particular clauses are issued by different authorities and stored in a distributed manner. We

Interacting institutional logics in general dental practice.

Science.gov (United States)

Harris, Rebecca; Holt, Robin

2013-10-01

We investigate the organisational field of general dental practice and how agents change or maintain the institution of values associated with the everyday work of health care provision. Our dataset comprise archival literature and policy documents, interview data from field level actors, as well as service delivery level interview data and secondary data gathered (2011-12) from 16 English dental practices. Our analysis provides a typology of institutional logics (prevailing systems of value) experienced in the field of dental practice. Confirming current literature, we find two logics dominate how care is assessed: business-like health care and medical professionalism. We advance the literature by finding the business-like health care logic further distinguished by values of commercialism on the one hand and those of accountability and procedural diligence on the other. The logic of professionalism we also find is further distinguished into a commitment to clinical expertise and independence in delivering patient care on the one hand, and concerns for the autonomy and sustainability of a business enterprise on the other. Copyright © 2013 The Authors. Published by Elsevier Ltd.. All rights reserved.

Computing single step operators of logic programming in radial basis function neural networks

Science.gov (United States)

Hamadneh, Nawaf; Sathasivam, Saratha; Choon, Ong Hong

2014-07-01

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (Tp:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.

Computing single step operators of logic programming in radial basis function neural networks

Energy Technology Data Exchange (ETDEWEB)

Hamadneh, Nawaf; Sathasivam, Saratha; Choon, Ong Hong [School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)

2014-07-10

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.

Computing single step operators of logic programming in radial basis function neural networks

International Nuclear Information System (INIS)

Hamadneh, Nawaf; Sathasivam, Saratha; Choon, Ong Hong

2014-01-01

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T p :I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks

The lazy functional side of logic programming

NARCIS (Netherlands)

Etalle, Sandro; Lau, K.K.; Mountjoy, Jon

In this paper we show, among other things, that logical structures such as di erence lists have a natural counterpart in lazy functional programs; i.e. that most programs using di erence-lists are functional in nature. This shows immediately that many common non-well-moded programs are functional in

The Application of Logic Programming to Communication Education.

Science.gov (United States)

Sanford, David L.

Recommending that communication students be required to learn to use computers not merely as number crunchers, word processors, data bases, and graphics generators, but also as logical inference makers, this paper examines the recently developed technology of logical programing in computer languages. It presents two syllogisms and shows how they…

The Haskell Road to Logic, Maths and Programming, Second Edition

NARCIS (Netherlands)

H.C. Doets; D.J.N. van Eijck (Jan)

2012-01-01

textabstractThe purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. The programming language that will be our tool for this is Haskell, a member of the Lisp family. Haskell emerged in the last decade as a

Generalized Majority Logic Criterion to Analyze the Statistical Strength of S-Boxes

Science.gov (United States)

Hussain, Iqtadar; Shah, Tariq; Gondal, Muhammad Asif; Mahmood, Hasan

2012-05-01

The majority logic criterion is applicable in the evaluation process of substitution boxes used in the advanced encryption standard (AES). The performance of modified or advanced substitution boxes is predicted by processing the results of statistical analysis by the majority logic criteria. In this paper, we use the majority logic criteria to analyze some popular and prevailing substitution boxes used in encryption processes. In particular, the majority logic criterion is applied to AES, affine power affine (APA), Gray, Lui J, residue prime, S8 AES, Skipjack, and Xyi substitution boxes. The majority logic criterion is further extended into a generalized majority logic criterion which has a broader spectrum of analyzing the effectiveness of substitution boxes in image encryption applications. The integral components of the statistical analyses used for the generalized majority logic criterion are derived from results of entropy analysis, contrast analysis, correlation analysis, homogeneity analysis, energy analysis, and mean of absolute deviation (MAD) analysis.

Analysis of Logic Programs Using Regular Tree Languages

DEFF Research Database (Denmark)

Gallagher, John Patrick

2012-01-01

The eld of nite tree automata provides fundamental notations and tools for reasoning about set of terms called regular or recognizable tree languages. We consider two kinds of analysis using regular tree languages, applied to logic programs. The rst approach is to try to discover automatically...... a tree automaton from a logic program, approximating its minimal Herbrand model. In this case the input for the analysis is a program, and the output is a tree automaton. The second approach is to expose or check properties of the program that can be expressed by a given tree automaton. The input...... to the analysis is a program and a tree automaton, and the output is an abstract model of the program. These two contrasting abstract interpretations can be used in a wide range of analysis and verication problems....

Verification of Imperative Programs by Constraint Logic Program Transformation

Directory of Open Access Journals (Sweden)

Emanuele De Angelis

2013-09-01

Full Text Available We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs (CLP. We use CLP as a metalanguage for representing imperative programs, their executions, and their properties. First, we encode the correctness of an imperative program, say prog, as the negation of a predicate 'incorrect' defined by a CLP program T. By construction, 'incorrect' holds in the least model of T if and only if the execution of prog from an initial configuration eventually halts in an error configuration. Then, we apply to program T a sequence of transformations that preserve its least model semantics. These transformations are based on well-known transformation rules, such as unfolding and folding, guided by suitable transformation strategies, such as specialization and generalization. The objective of the transformations is to derive a new CLP program TransfT where the predicate 'incorrect' is defined either by (i the fact 'incorrect.' (and in this case prog is not correct, or by (ii the empty set of clauses (and in this case prog is correct. In the case where we derive a CLP program such that neither (i nor (ii holds, we iterate the transformation. Since the problem is undecidable, this process may not terminate. We show through examples that our method can be applied in a rather systematic way, and is amenable to automation by transferring to the field of program verification many techniques developed in the field of program transformation.

Functional and Logic Programming - 14th International Symposium (FLOPS 2018)

DEFF Research Database (Denmark)

This volume contains the proceedings of the 14th International Symposium on Functional and Logic Programming - FLOPS 2018 - held in Nagoya, Japan, May 9 - 11, 2018......This volume contains the proceedings of the 14th International Symposium on Functional and Logic Programming - FLOPS 2018 - held in Nagoya, Japan, May 9 - 11, 2018...

Mixed wasted integrated program: Logic diagram

International Nuclear Information System (INIS)

Mayberry, J.; Stelle, S.; O'Brien, M.; Rudin, M.; Ferguson, J.; McFee, J.

1994-01-01

The Mixed Waste Integrated Program Logic Diagram was developed to provide technical alternative for mixed wastes projects for the Office of Technology Development's Mixed Waste Integrated Program (MWIP). Technical solutions in the areas of characterization, treatment, and disposal were matched to a select number of US Department of Energy (DOE) treatability groups represented by waste streams found in the Mixed Waste Inventory Report (MWIR)

Mixed wasted integrated program: Logic diagram

Energy Technology Data Exchange (ETDEWEB)

Mayberry, J.; Stelle, S. [Science Applications International Corp., Idaho Falls, ID (United States); O`Brien, M. [Univ. of Arizona, Tucson, AZ (United States); Rudin, M. [Univ. of Nevada, Las Vegas, NV (United States); Ferguson, J. [Lockheed Idaho Technologies Co., Idaho Falls, ID (United States); McFee, J. [I.T. Corp., Albuquerque, NM (United States)

1994-11-30

The Mixed Waste Integrated Program Logic Diagram was developed to provide technical alternative for mixed wastes projects for the Office of Technology Development`s Mixed Waste Integrated Program (MWIP). Technical solutions in the areas of characterization, treatment, and disposal were matched to a select number of US Department of Energy (DOE) treatability groups represented by waste streams found in the Mixed Waste Inventory Report (MWIR).

A hybrid nanomemristor/transistor logic circuit capable of self-programming.

Science.gov (United States)

Borghetti, Julien; Li, Zhiyong; Straznicky, Joseph; Li, Xuema; Ohlberg, Douglas A A; Wu, Wei; Stewart, Duncan R; Williams, R Stanley

2009-02-10

Memristor crossbars were fabricated at 40 nm half-pitch, using nanoimprint lithography on the same substrate with Si metal-oxide-semiconductor field effect transistor (MOS FET) arrays to form fully integrated hybrid memory resistor (memristor)/transistor circuits. The digitally configured memristor crossbars were used to perform logic functions, to serve as a routing fabric for interconnecting the FETs and as the target for storing information. As an illustrative demonstration, the compound Boolean logic operation (A AND B) OR (C AND D) was performed with kilohertz frequency inputs, using resistor-based logic in a memristor crossbar with FET inverter/amplifier outputs. By routing the output signal of a logic operation back onto a target memristor inside the array, the crossbar was conditionally configured by setting the state of a nonvolatile switch. Such conditional programming illuminates the way for a variety of self-programmed logic arrays, and for electronic synaptic computing.

Post optimization paradigm in maximum 3-satisfiability logic programming

Science.gov (United States)

Mansor, Mohd. Asyraf; Sathasivam, Saratha; Kasihmuddin, Mohd Shareduwan Mohd

2017-08-01

Maximum 3-Satisfiability (MAX-3SAT) is a counterpart of the Boolean satisfiability problem that can be treated as a constraint optimization problem. It deals with a conundrum of searching the maximum number of satisfied clauses in a particular 3-SAT formula. This paper presents the implementation of enhanced Hopfield network in hastening the Maximum 3-Satisfiability (MAX-3SAT) logic programming. Four post optimization techniques are investigated, including the Elliot symmetric activation function, Gaussian activation function, Wavelet activation function and Hyperbolic tangent activation function. The performances of these post optimization techniques in accelerating MAX-3SAT logic programming will be discussed in terms of the ratio of maximum satisfied clauses, Hamming distance and the computation time. Dev-C++ was used as the platform for training, testing and validating our proposed techniques. The results depict the Hyperbolic tangent activation function and Elliot symmetric activation function can be used in doing MAX-3SAT logic programming.

A logic road from special relativity to general relativity

OpenAIRE

Andréka, Hajnal; Madarász, Judit X.; Németi, István; Székely, Gergely

2010-01-01

We present a streamlined axiom system of special relativity in first-order logic. From this axiom system we "derive" an axiom system of general relativity in two natural steps. We will also see how the axioms of special relativity transform into those of general relativity. This way we hope to make general relativity more accessible for the non-specialist.

Efficient dynamic optimization of logic programs

Science.gov (United States)

Laird, Phil

1992-01-01

A summary is given of the dynamic optimization approach to speed up learning for logic programs. The problem is to restructure a recursive program into an equivalent program whose expected performance is optimal for an unknown but fixed population of problem instances. We define the term 'optimal' relative to the source of input instances and sketch an algorithm that can come within a logarithmic factor of optimal with high probability. Finally, we show that finding high-utility unfolding operations (such as EBG) can be reduced to clause reordering.

Programming Games for Logical Thinking

Directory of Open Access Journals (Sweden)

H. Tsalapatas

2013-03-01

Full Text Available Analytical thinking is a transversal skill that helps learners synthesize knowledge across subject areas; from mathematics, science, and technology to critical reading, critical examination, and evaluation of lessons. While most would not doubt the importance of analytical capacity in academic settings and its growing demand for the skill in professional environments, school curricula do not comprehensively address its development. As a result, the responsibility for structuring related learning activities falls to teachers. This work examines learning paradigms that can be integrated into mathematics and science school education for developing logical thinking through game-based exercises based on programming. The proposed learning design promotes structured algorithmic mindsets, is based on inclusive universal logic present in all cultures, and promotes constructivism educational approaches encouraging learners to drive knowledge building by composing past and emerging experiences.

Logic Models for Program Design, Implementation, and Evaluation: Workshop Toolkit. REL 2015-057

Science.gov (United States)

Shakman, Karen; Rodriguez, Sheila M.

2015-01-01

The Logic Model Workshop Toolkit is designed to help practitioners learn the purpose of logic models, the different elements of a logic model, and the appropriate steps for developing and using a logic model for program evaluation. Topics covered in the sessions include an overview of logic models, the elements of a logic model, an introduction to…

Fuzzy Logic Decoupled Lateral Control for General Aviation Airplanes

Science.gov (United States)

Duerksen, Noel

1997-01-01

It has been hypothesized that a human pilot uses the same set of generic skills to control a wide variety of aircraft. If this is true, then it should be possible to construct an electronic controller which embodies this generic skill set such that it can successfully control different airplanes without being matched to a specific airplane. In an attempt to create such a system, a fuzzy logic controller was devised to control aileron or roll spoiler position. This controller was used to control bank angle for both a piston powered single engine aileron equipped airplane simulation and a business jet simulation which used spoilers for primary roll control. Overspeed, stall and overbank protection were incorporated in the form of expert systems supervisors and weighted fuzzy rules. It was found that by using the artificial intelligence techniques of fuzzy logic and expert systems, a generic lateral controller could be successfully used on two general aviation aircraft types that have very different characteristics. These controllers worked for both airplanes over their entire flight envelopes. The controllers for both airplanes were identical except for airplane specific limits (maximum allowable airspeed, throttle ]ever travel, etc.). This research validated the fact that the same fuzzy logic based controller can control two very different general aviation airplanes. It also developed the basic controller architecture and specific control parameters required for such a general controller.

Programming Programmable Logic Controller. High-Technology Training Module.

Science.gov (United States)

Lipsky, Kevin

This training module on programming programmable logic controllers (PLC) is part of the memory structure and programming unit used in a packaging systems equipment control course. In the course, students assemble, install, maintain, and repair industrial machinery used in industry. The module contains description, objectives, content outline,…

Verification and Planning Based on Coinductive Logic Programming

Science.gov (United States)

Bansal, Ajay; Min, Richard; Simon, Luke; Mallya, Ajay; Gupta, Gopal

2008-01-01

Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution

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

Using program logic model analysis to evaluate and better deliver what works

International Nuclear Information System (INIS)

Megdal, Lori; Engle, Victoria; Pakenas, Larry; Albert, Scott; Peters, Jane; Jordan, Gretchen

2005-01-01

There is a rich history in using program theories and logic models (PT/LM) for evaluation, monitoring, and program refinement in a variety of fields, such as health care, social and education programs. The use of these tools to evaluate and improve energy efficiency programs has been growing over the last 5-7 years. This paper provides an overview of the state-of-the-art methods of logic model development, with analysis that significantly contributed to: Assessing the logic behind how the program expects to be able to meets its ultimate goals, including the 'who', the 'how', and through what mechanism. In doing so, gaps and questions that still need to be addressed can be identified. Identifying and prioritize the indicators that should be measured to evaluate the program and program theory. Determining key researchable questions that need to be answered by evaluation/research, to assess whether the mechanism assumed to cause the changes in actions, attitudes, behaviours, and business practices is workable and efficient. Also will assess the validity in the program logic and the likelihood that the program can accomplish its ultimate goals. Incorporating analysis of prior like programs and social science theories in a framework to identify opportunities for potential program refinements. The paper provides an overview of the tools, techniques and references, and uses as example the energy efficiency program analysis conducted for the New York State Energy Research and Development Authority's (NYSERDA) New York ENERGY $MART SM programs

Neighborhood semantics for modal many-valued logics

Czech Academy of Sciences Publication Activity Database

Cintula, Petr; Noguera, Carles

online 18 October 2017 (2018) ISSN 0165-0114 R&D Projects: GA ČR(CZ) GF15-34650L EU Projects: European Commission(XE) 689176 - SYSMICS Grant - others:AV ČR(CZ) JSPS-16-08; Austrian Science Fund(AT) I1897-N25 Program:Bilaterální spolupráce Institutional support: RVO:67985807 ; RVO:67985556 Keywords : mathematical fuzzy logic * modal fuzzy logics * neighborhood frames * Kripke semantics * many-valued logics Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) Impact factor: 2.718, year: 2016

Verifying object-oriented programs with higher-order separation logic in Coq

DEFF Research Database (Denmark)

Bengtson, Jesper; Jensen, Jonas Braband; Sieczkowski, Filip

2011-01-01

We present a shallow Coq embedding of a higher-order separation logic with nested triples for an object-oriented programming language. Moreover, we develop novel specification and proof patterns for reasoning in higher-order separation logic with nested triples about programs that use interfaces...... and interface inheritance. In particular, we show how to use the higher-order features of the Coq formalisation to specify and reason modularly about programs that (1) depend on some unknown code satisfying a specification or that (2) return objects conforming to a certain specification. All of our results have...

Generalized look-ahead number conversion from signed digit to complement representation with optical logic operations

Science.gov (United States)

Qian, Feng; Li, Guoqiang

2001-12-01

In this paper a generalized look-ahead logic algorithm for number conversion from signed-digit to its complement representation is developed. By properly encoding the signed digits, all the operations are performed by binary logic, and unified logical expressions can be obtained for conversion from modified-signed-digit (MSD) to 2's complement, trinary signed-digit (TSD) to 3's complement, and quaternary signed-digit (QSD) to 4's complement. For optical implementation, a parallel logical array module using electron-trapping device is employed, which is suitable for realizing complex logic functions in the form of sum-of-product. The proposed algorithm and architecture are compatible with a general-purpose optoelectronic computing system.

A Fuzzy-Logic Generalization of a Data Mining Approach

Czech Academy of Sciences Publication Activity Database

Holeňa, Martin

2001-01-01

Roč. 11, č. 6 (2001), s. 595-610 ISSN 1210-0552. [SOFSEM 2001 Workshop on Soft Computing. Piešťany, 29.11.2001-30.11.2001] R&D Projects: GA AV ČR IAA1030004 Institutional research plan: AV0Z1030915 Keywords : data analysis * vague hypotheses * vague significante level * fuzzy prediacate calculus * basic fuzzy logic * generalized quantifiers * method GUHA Subject RIV: BA - General Mathematics

Proving deadlock freedom of logic programs with dynamic scheduling

NARCIS (Netherlands)

E. Marchiori; F. Teusink (Frank)

1996-01-01

textabstractIn increasingly many logic programming systems, the Prolog left to right selection rule has been replaced with dynamic selection rules, that select an atom of a query among those satisfying suitable conditions. These conditions describe the form of the arguments of every program

Answer Sets in a Fuzzy Equilibrium Logic

Science.gov (United States)

Schockaert, Steven; Janssen, Jeroen; Vermeir, Dirk; de Cock, Martine

Since its introduction, answer set programming has been generalized in many directions, to cater to the needs of real-world applications. As one of the most general “classical” approaches, answer sets of arbitrary propositional theories can be defined as models in the equilibrium logic of Pearce. Fuzzy answer set programming, on the other hand, extends answer set programming with the capability of modeling continuous systems. In this paper, we combine the expressiveness of both approaches, and define answer sets of arbitrary fuzzy propositional theories as models in a fuzzification of equilibrium logic. We show that the resulting notion of answer set is compatible with existing definitions, when the syntactic restrictions of the corresponding approaches are met. We furthermore locate the complexity of the main reasoning tasks at the second level of the polynomial hierarchy. Finally, as an illustration of its modeling power, we show how fuzzy equilibrium logic can be used to find strong Nash equilibria.

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

A Semantics for Modular General Logic Programs

NARCIS (Netherlands)

Etalle, Sandro

1998-01-01

Modular programs are built as a combination of separate modules, which may be developed and verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of

A semantics for modular general logic programs

NARCIS (Netherlands)

Etalle, S.

1998-01-01

Modular programs are built as a combination of separate modules, which may be developed and verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of

Probabilistic Abductive Logic Programming in Constraint Handling Rules

DEFF Research Database (Denmark)

Christiansen, Henning

A class of Probabilistic Abductive Logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-explanations and most-probable-explanations versions are given. % Compared with other...

Support vector inductive logic programming outperforms the naive Bayes classifier and inductive logic programming for the classification of bioactive chemical compounds.

Science.gov (United States)

Cannon, Edward O; Amini, Ata; Bender, Andreas; Sternberg, Michael J E; Muggleton, Stephen H; Glen, Robert C; Mitchell, John B O

2007-05-01

We investigate the classification performance of circular fingerprints in combination with the Naive Bayes Classifier (MP2D), Inductive Logic Programming (ILP) and Support Vector Inductive Logic Programming (SVILP) on a standard molecular benchmark dataset comprising 11 activity classes and about 102,000 structures. The Naive Bayes Classifier treats features independently while ILP combines structural fragments, and then creates new features with higher predictive power. SVILP is a very recently presented method which adds a support vector machine after common ILP procedures. The performance of the methods is evaluated via a number of statistical measures, namely recall, specificity, precision, F-measure, Matthews Correlation Coefficient, area under the Receiver Operating Characteristic (ROC) curve and enrichment factor (EF). According to the F-measure, which takes both recall and precision into account, SVILP is for seven out of the 11 classes the superior method. The results show that the Bayes Classifier gives the best recall performance for eight of the 11 targets, but has a much lower precision, specificity and F-measure. The SVILP model on the other hand has the highest recall for only three of the 11 classes, but generally far superior specificity and precision. To evaluate the statistical significance of the SVILP superiority, we employ McNemar's test which shows that SVILP performs significantly (p < 5%) better than both other methods for six out of 11 activity classes, while being superior with less significance for three of the remaining classes. While previously the Bayes Classifier was shown to perform very well in molecular classification studies, these results suggest that SVILP is able to extract additional knowledge from the data, thus improving classification results further.

The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments

NARCIS (Netherlands)

Mancarella, P.; Terreni, G.; Sadri, F.; Toni, F.; Endriss, U.

2009-01-01

We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and

An approach to profiling for run-time checking of computational properties and performance debugging in logic programs.

OpenAIRE

Mera, E.; Trigo, Teresa; López García, Pedro; Hermenegildo, Manuel V.

2010-01-01

Although several profiling techniques for identifying performance bottlenecks in logic programs have been developed, they are generally not automatic and in most cases they do not provide enough information for identifying the root causes of such bottlenecks. This complicates using their results for guiding performance improvement. We present a profiling method and tool that provides such explanations. Our profiler associates cost centers to certain program elements and can measure different ...

Evaluating bacterial gene-finding HMM structures as probabilistic logic programs.

Science.gov (United States)

Mørk, Søren; Holmes, Ian

2012-03-01

Probabilistic logic programming offers a powerful way to describe and evaluate structured statistical models. To investigate the practicality of probabilistic logic programming for structure learning in bioinformatics, we undertook a simplified bacterial gene-finding benchmark in PRISM, a probabilistic dialect of Prolog. We evaluate Hidden Markov Model structures for bacterial protein-coding gene potential, including a simple null model structure, three structures based on existing bacterial gene finders and two novel model structures. We test standard versions as well as ADPH length modeling and three-state versions of the five model structures. The models are all represented as probabilistic logic programs and evaluated using the PRISM machine learning system in terms of statistical information criteria and gene-finding prediction accuracy, in two bacterial genomes. Neither of our implementations of the two currently most used model structures are best performing in terms of statistical information criteria or prediction performances, suggesting that better-fitting models might be achievable. The source code of all PRISM models, data and additional scripts are freely available for download at: http://github.com/somork/codonhmm. Supplementary data are available at Bioinformatics online.

Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

Science.gov (United States)

Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

2016-11-01

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules

DEFF Research Database (Denmark)

Christiansen, Henning

2008-01-01

A class of Probabilistic Abductive Logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-explanations and most-probable-explanations versions are given. Compared with other...

Competing and coexisting logics in the changing field of English general medical practice.

Science.gov (United States)

McDonald, Ruth; Cheraghi-Sohi, Sudeh; Bayes, Sara; Morriss, Richard; Kai, Joe

2013-09-01

Recent reforms, which change incentive and accountability structures in the English National Health Service, can be conceptualised as trying to shift the dominant institutional logic in the field of primary medical care (general medical practice) away from medical professionalism towards a logic of "population based medicine". This paper draws on interviews with primary care doctors, conducted during 2007-2009 and 2011-2012. It contrasts the approach of active management of populations, in line with recent reforms with responses to patients with medically unexplained symptoms. Our data suggest that rather than one logic becoming dominant, different dimensions of organisational activity reflect different logics. Although some aspects of organisational life are relatively untouched by the reforms, this is not due to 'resistance' on the part of staff within these organisations to attempts to 'control' them. We suggest that a more helpful way of understanding the data is to see these different aspects of work as governed by different institutional logics. Copyright © 2012 Elsevier Ltd. All rights reserved.

Development of a program logic model and evaluation plan for a participatory ergonomics intervention in construction.

Science.gov (United States)

Jaegers, Lisa; Dale, Ann Marie; Weaver, Nancy; Buchholz, Bryan; Welch, Laura; Evanoff, Bradley

2014-03-01

Intervention studies in participatory ergonomics (PE) are often difficult to interpret due to limited descriptions of program planning and evaluation. In an ongoing PE program with floor layers, we developed a logic model to describe our program plan, and process and summative evaluations designed to describe the efficacy of the program. The logic model was a useful tool for describing the program elements and subsequent modifications. The process evaluation measured how well the program was delivered as intended, and revealed the need for program modifications. The summative evaluation provided early measures of the efficacy of the program as delivered. Inadequate information on program delivery may lead to erroneous conclusions about intervention efficacy due to Type III error. A logic model guided the delivery and evaluation of our intervention and provides useful information to aid interpretation of results. © 2013 Wiley Periodicals, Inc.

Development of a Program Logic Model and Evaluation Plan for a Participatory Ergonomics Intervention in Construction

Science.gov (United States)

Jaegers, Lisa; Dale, Ann Marie; Weaver, Nancy; Buchholz, Bryan; Welch, Laura; Evanoff, Bradley

2013-01-01

Background Intervention studies in participatory ergonomics (PE) are often difficult to interpret due to limited descriptions of program planning and evaluation. Methods In an ongoing PE program with floor layers, we developed a logic model to describe our program plan, and process and summative evaluations designed to describe the efficacy of the program. Results The logic model was a useful tool for describing the program elements and subsequent modifications. The process evaluation measured how well the program was delivered as intended, and revealed the need for program modifications. The summative evaluation provided early measures of the efficacy of the program as delivered. Conclusions Inadequate information on program delivery may lead to erroneous conclusions about intervention efficacy due to Type III error. A logic model guided the delivery and evaluation of our intervention and provides useful information to aid interpretation of results. PMID:24006097

Agent Programming Languages and Logics in Agent-Based Simulation

DEFF Research Database (Denmark)

Larsen, John

2018-01-01

and social behavior, and work on verification. Agent-based simulation is an approach for simulation that also uses the notion of agents. Although agent programming languages and logics are much less used in agent-based simulation, there are successful examples with agents designed according to the BDI...

Improvements to the adaptive maneuvering logic program

Science.gov (United States)

Burgin, George H.

1986-01-01

The Adaptive Maneuvering Logic (AML) computer program simulates close-in, one-on-one air-to-air combat between two fighter aircraft. Three important improvements are described. First, the previously available versions of AML were examined for their suitability as a baseline program. The selected program was then revised to eliminate some programming bugs which were uncovered over the years. A listing of this baseline program is included. Second, the equations governing the motion of the aircraft were completely revised. This resulted in a model with substantially higher fidelity than the original equations of motion provided. It also completely eliminated the over-the-top problem, which occurred in the older versions when the AML-driven aircraft attempted a vertical or near vertical loop. Third, the requirements for a versatile generic, yet realistic, aircraft model were studied and implemented in the program. The report contains detailed tables which make the generic aircraft to be either a modern, high performance aircraft, an older high performance aircraft, or a previous generation jet fighter.

Learning Probabilistic Logic Models from Probabilistic Examples.

Science.gov (United States)

Chen, Jianzhong; Muggleton, Stephen; Santos, José

2008-10-01

We revisit an application developed originally using abductive Inductive Logic Programming (ILP) for modeling inhibition in metabolic networks. The example data was derived from studies of the effects of toxins on rats using Nuclear Magnetic Resonance (NMR) time-trace analysis of their biofluids together with background knowledge representing a subset of the Kyoto Encyclopedia of Genes and Genomes (KEGG). We now apply two Probabilistic ILP (PILP) approaches - abductive Stochastic Logic Programs (SLPs) and PRogramming In Statistical modeling (PRISM) to the application. Both approaches support abductive learning and probability predictions. Abductive SLPs are a PILP framework that provides possible worlds semantics to SLPs through abduction. Instead of learning logic models from non-probabilistic examples as done in ILP, the PILP approach applied in this paper is based on a general technique for introducing probability labels within a standard scientific experimental setting involving control and treated data. Our results demonstrate that the PILP approach provides a way of learning probabilistic logic models from probabilistic examples, and the PILP models learned from probabilistic examples lead to a significant decrease in error accompanied by improved insight from the learned results compared with the PILP models learned from non-probabilistic examples.

Contour tracking and corner detection in a logic programming environment

DEFF Research Database (Denmark)

Bell, Benjamin; Pau, L. F.

1990-01-01

The added functionality such as contour tracking and corner detection which logic programming lends to standard image operators is described. An environment for implementing low-level imaging operations with Prolog predicates is considered. Within this environment, higher-level image predicates (...

Research on uranium resource models. Part IV. Logic: a computer graphics program to construct integrated logic circuits for genetic-geologic models. Progress report

International Nuclear Information System (INIS)

Scott, W.A.; Turner, R.M.; McCammon, R.B.

1981-01-01

Integrated logic circuits were described as a means of formally representing genetic-geologic models for estimating undiscovered uranium resources. The logic circuits are logical combinations of selected geologic characteristics judged to be associated with particular types of uranium deposits. Each combination takes on a value which corresponds to the combined presence, absence, or don't know states of the selected characteristic within a specified geographic cell. Within each cell, the output of the logic circuit is taken as a measure of the favorability of occurrence of an undiscovered deposit of the type being considered. In this way, geological, geochemical, and geophysical data are incorporated explicitly into potential uranium resource estimates. The present report describes how integrated logic circuits are constructed by use of a computer graphics program. A user's guide is also included

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

The effectiveness of web-programming module based on scientific approach to train logical thinking ability for students in vocational high school

Science.gov (United States)

Nashiroh, Putri Khoirin; Kamdi, Waras; Elmunsyah, Hakkun

2017-09-01

Web programming is a basic subject in Computer and Informatics Engineering, a program study in a vocational high school. It requires logical thinking ability in its learning activities. The purposes of this research were (1) to develop a web programming module that implement scientific approach that can improve logical thinking ability for students in vocational high school; and (2) to test the effectiveness of web programming module based on scientific approach to train students' logical thinking ability. The results of this research was a web-programming module that apply scientific approach for learning activities to improve logical thinking ability of students in the vocational high school. The results of the effectiveness test of web-programming module give conclusion that it was very effective to train logical thinking ability and to improve learning result, this conclusion was supported by: (1) the average of posttest result of students exceeds the minimum criterion value, it was 79.91; (2) the average percentage of students' logical thinking score is 82,98; and (3) the average percentage of students' responses to the web programming module was 81.86%.

Development of a Logic Model to Guide Evaluations of the ASCA National Model for School Counseling Programs

Science.gov (United States)

Martin, Ian; Carey, John

2014-01-01

A logic model was developed based on an analysis of the 2012 American School Counselor Association (ASCA) National Model in order to provide direction for program evaluation initiatives. The logic model identified three outcomes (increased student achievement/gap reduction, increased school counseling program resources, and systemic change and…

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.

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.

Logic programming to infer complex RNA expression patterns from RNA-seq data.

Science.gov (United States)

Weirick, Tyler; Militello, Giuseppe; Ponomareva, Yuliya; John, David; Döring, Claudia; Dimmeler, Stefanie; Uchida, Shizuka

2018-03-01

To meet the increasing demand in the field, numerous long noncoding RNA (lncRNA) databases are available. Given many lncRNAs are specifically expressed in certain cell types and/or time-dependent manners, most lncRNA databases fall short of providing such profiles. We developed a strategy using logic programming to handle the complex organization of organs, their tissues and cell types as well as gender and developmental time points. To showcase this strategy, we introduce 'RenalDB' (http://renaldb.uni-frankfurt.de), a database providing expression profiles of RNAs in major organs focusing on kidney tissues and cells. RenalDB uses logic programming to describe complex anatomy, sample metadata and logical relationships defining expression, enrichment or specificity. We validated the content of RenalDB with biological experiments and functionally characterized two long intergenic noncoding RNAs: LOC440173 is important for cell growth or cell survival, whereas PAXIP1-AS1 is a regulator of cell death. We anticipate RenalDB will be used as a first step toward functional studies of lncRNAs in the kidney.

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 Young Children Learn to Program with Sensor, Action, and Logic Blocks

Science.gov (United States)

Wyeth, Peta

2008-01-01

Electronic Blocks are a new programming environment designed specifically for children aged between 3 and 8 years. These physical, stackable blocks include sensor blocks, action blocks, and logic blocks. By connecting these blocks, children can program a wide variety of structures that interact with one another and the environment. Electronic…

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

Horn逻辑程序和形式文法之间的对应关系%The Correspondence between Horn Logic Programs and Formal Grammars

Institute of Scientific and Technical Information of China (English)

陈文彬; 王驹

2003-01-01

The paper researches Horn logic programs with grammatical view. The correspondence between Horn logic programs and grammars is found. The method by which type-0 grammars generate the least Herbrand models of logic programs is found. The method by which Horn logic programs generate the languages of type-0 grammars is found.The characterization of Horn Logic programs that are semantically equavanent to type-2 grammars and type-3 grammars is found.

A retrospective review of the Honduras AIN-C program guided by a community health worker performance logic model.

Science.gov (United States)

Rodríguez, Daniela C; Peterson, Lauren A

2016-05-06

Factors that influence performance of community health workers (CHWs) delivering health services are not well understood. A recent logic model proposed categories of support from both health sector and communities that influence CHW performance and program outcomes. This logic model has been used to review a growth monitoring program delivered by CHWs in Honduras, known as Atención Integral a la Niñez en la Comunidad (AIN-C). A retrospective review of AIN-C was conducted through a document desk review and supplemented with in-depth interviews. Documents were systematically coded using the categories from the logic model, and gaps were addressed through interviews. Authors reviewed coded data for each category to analyze program details and outcomes as well as identify potential issues and gaps in the logic model. Categories from the logic model were inconsistently represented, with more information available for health sector than community. Context and input activities were not well documented. Information on health sector systems-level activities was available for governance but limited for other categories, while not much was found for community systems-level activities. Most available information focused on program-level activities with substantial data on technical support. Output, outcome, and impact data were drawn from various resources and suggest mixed results of AIN-C on indicators of interest. Assessing CHW performance through a desk review left gaps that could not be addressed about the relationship of activities and performance. There were critical characteristics of program design that made it contextually appropriate; however, it was difficult to identify clear links between AIN-C and malnutrition indicators. Regarding the logic model, several categories were too broad (e.g., technical support, context) and some aspects of AIN-C did not fit neatly in logic model categories (e.g., political commitment, equity, flexibility in implementation). The

Reasoning about Java programs in higher order logic using PVS and Isabelle

NARCIS (Netherlands)

Huisman, Marieke

2001-01-01

This thesis describes the first steps of a project aimed at formal verification of Java programs. The work presented here is part of a larger project called LOOP, for Logic of Object Oriented Programming. A semantics for Java is described in type theory and it is shown how this semantics forms the

Teaching and Learning Logic Programming in Virtual Worlds Using Interactive Microworld Representations

Science.gov (United States)

Vosinakis, Spyros; Anastassakis, George; Koutsabasis, Panayiotis

2018-01-01

Logic Programming (LP) follows the declarative programming paradigm, which novice students often find hard to grasp. The limited availability of visual teaching aids for LP can lead to low motivation for learning. In this paper, we present a platform for teaching and learning Prolog in Virtual Worlds, which enables the visual interpretation and…

Constraints and Logic Programming in Grammars and Language Analysis

DEFF Research Database (Denmark)

Christiansen, Henning

2014-01-01

Constraints are an important notion in grammars and language analysis, and constraint programming techniques have been developed concurrently for solving a variety of complex problems. In this chapter we consider the synthesis of these branches into practical and effective methods for language...... methods that combine constraints with logic grammars such as Definite Clause Grammars and CHR Grammars, and show also a direct relationship to abductive reasoning....

From Logic Programming Semantics to the Consistency of Syntactical Treatments of Knowledge and Belief

DEFF Research Database (Denmark)

Bolander, Thomas

2003-01-01

that we can keep the predicate approach if we make suitable restrictions to our set of epistemic axioms. Their results are proved by careful translations from corresponding modal formalisms. In the present paper we show that their results fit nicely into the framework of logic programming semantics......, in that we show their results to be corollaries of well-known results in this field. This does not only allow us to demonstrate a close connection between consistency problems in the syntactic treatment of propositional attitudes and problems in semantics for logic programs, but it also allows us......This paper concerns formal theories for reasoning about the knowledge and belief of agents. It has seemed attractive to researchers in artificial intelligence to formalise these propositional attitudes as predicates of first-order predicate logic. This allows the agents to express stronger...

Application of Logic Models in a Large Scientific Research Program

Science.gov (United States)

O'Keefe, Christine M.; Head, Richard J.

2011-01-01

It is the purpose of this article to discuss the development and application of a logic model in the context of a large scientific research program within the Commonwealth Scientific and Industrial Research Organisation (CSIRO). CSIRO is Australia's national science agency and is a publicly funded part of Australia's innovation system. It conducts…

Standardising the Lay: Logics of Change in Programs of Disease Self-management

Directory of Open Access Journals (Sweden)

Annegrete Juul Nielsen

2012-11-01

Full Text Available The health political discourse on self-care is dominated by the view that the selfmanaging patient represents a more democratic and patient-centric perspective, as he or she is believed to renegotiate the terms on which patient participation in health care has hitherto taken place. The self-managing patient is intended as a challenge to traditional medical authority by introducing lay methods of knowing disease. Rather than a meeting between authoritative professionals and vulnerable patients, the self-managing patient seeks to open up new spaces for a meeting between experts. The present paper questions these assumptions through an ethnographic exploration of a patient-led self-management program called the Chronic Disease Self-Management Program. The program is concerned with what its developers call the social and mental aspects of living with a chronic disease and uses trained patients as role models and program leaders. Drawing inspiration from Annemarie Mol’s term ‘logic’, we explore the rationale of ‘situations of selfmanagement’ and identify what we call a ‘logic of change’, which involves very specific ideas on how life with a chronic condition should be dealt with and directs attention towards particular manageable aspects of life with a chronic condition. This logic of change entails, we argue, a clash not between ‘medical’ and ‘lay’ forms of knowledge but between different logics or perceptions of how transformation can be achieved: through open-ended and ongoing reflection and experimentation in social settings or through standardised trajectories of change. Returning to the literature on lay forms of knowledge and illness perspectives, we question whether programs such as the Chronic Disease Self-Management Program – despite its apparent patient-centric perspective – reproduces classical hierarchical relations between lay and expert knowledge, albeit in new forms.

NWTS waste package program plan. Volume II. Program logic networks

International Nuclear Information System (INIS)

1981-10-01

This document describes the work planned for developing the technology to design, test and produce packages used for the long-term isolation of nuclear waste in deep geologic repositories. Waste forms considered include spent fuel and high-level waste. The testing and selection effort for barrier materials for radionuclide containment is described. The NWTS waste package program is a design-driven effort; waste package conceptual designs are used as input for preliminary designs, which are upgraded to a final design as materials and testing data become available. Performance assessment models are developed and validated. Milestones and a detailed schedule are given for the waste package development effort. Program logic networks defining work flow, interfaces among the NWTS Projects, and interrelationships of specific activities are presented. Detailed work elements are provided for the Waste Package Program Plan subtasks - design and development, waste form, barrier materials, and performance evaluation - for salt and basalt, host rocks for which the state of waste package knowledge and the corresponding data base are advanced

Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions.

Science.gov (United States)

Qu, Xiangmeng; Wang, Shaopeng; Ge, Zhilei; Wang, Jianbang; Yao, Guangbao; Li, Jiang; Zuo, Xiaolei; Shi, Jiye; Song, Shiping; Wang, Lihua; Li, Li; Pei, Hao; Fan, Chunhai

2017-08-02

Programmable remodelling of cell surfaces enables high-precision regulation of cell behavior. In this work, we developed in vitro constructed DNA-based chemical reaction networks (CRNs) to program on-chip cell adhesion. We found that the RGD-functionalized DNA CRNs are entirely noninvasive when interfaced with the fluidic mosaic membrane of living cells. DNA toehold with different lengths could tunably alter the release kinetics of cells, which shows rapid release in minutes with the use of a 6-base toehold. We further demonstrated the realization of Boolean logic functions by using DNA strand displacement reactions, which include multi-input and sequential cell logic gates (AND, OR, XOR, and AND-OR). This study provides a highly generic tool for self-organization of biological systems.

The Generality of Adult Development Stages and Transformations: Comparing Meaning-making and Logical Reasoning

Directory of Open Access Journals (Sweden)

Tom Hagström

2015-09-01

Full Text Available Human development theories differ in “context sensitivity,” covering those stressing development stages and those stressing continuously progressing changes. The former theories differ in whether, how and why the stages are regarded as being generalized across domains, i.e. their generality claims. Piaget’s developmental stage theory of logical complexity of children and adolescents fulfill “strong” such claims, including fixed stage sequentiality of increasing complexity levels and higher stage structures integrating earlier ones. His theory has inspired a number of adult development stage theories with varying generality claims. These provide suggestions of stages and stage transitions reaching beyond “pure” cognition, integrating more of e.g. emotional, value and moral dimensions. From a neo-Piagetian perspective, core generality aspects seem to concern on the one hand logical reasoning and on the other hand meaning-making. This raises questions of how these aspects are related to each other in terms of stage structures and transformations. The aim of the article is to discern general features in adult development stage structures and transitions, in terms of logical reasoning and meaning making. This is carried out by a “thought experiment” interrelating two theories that differ in these respects but that are both based on Piaget’s theory, namely Robert Kegan’s constructive developmental Subject-Object Theory (SOT and Michael Common´s behaviouristic Model of Hierarchical Complexity (MHC. This comparing approach concerns the 3rd, 4th and 5th order of consciousness as well as transitions between these according to SOT, and order 9 to 12 and corresponding transitions according to MHC. The thought experiment indicates that the generality claims of both models can be argued for without one of them necessarily being subordinated to the other one. Both theories are interpreted as differing but partly overlapping structures of

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

A system at the cross-roads of functional and logic programming

NARCIS (Netherlands)

Kamareddine, F.

1992-01-01

The type-free ¿-calculus is powerful enough to contain all the polymorphic and higher-order nature of functional programming and furthermore types could be constructed inside it. However, mixing the type-free ¿-calculus with logic is not very straightforward (see Aczel [1] and Scott [15]). In this

Edge detection methods based on generalized type-2 fuzzy logic

CERN Document Server

Gonzalez, Claudia I; Castro, Juan R; Castillo, Oscar

2017-01-01

In this book four new methods are proposed. In the first method the generalized type-2 fuzzy logic is combined with the morphological gra-dient technique. The second method combines the general type-2 fuzzy systems (GT2 FSs) and the Sobel operator; in the third approach the me-thodology based on Sobel operator and GT2 FSs is improved to be applied on color images. In the fourth approach, we proposed a novel edge detec-tion method where, a digital image is converted a generalized type-2 fuzzy image. In this book it is also included a comparative study of type-1, inter-val type-2 and generalized type-2 fuzzy systems as tools to enhance edge detection in digital images when used in conjunction with the morphologi-cal gradient and the Sobel operator. The proposed generalized type-2 fuzzy edge detection methods were tested with benchmark images and synthetic images, in a grayscale and color format. Another contribution in this book is that the generalized type-2 fuzzy edge detector method is applied in the preproc...

A general approach for developing system-specific functions to score protein-ligand docked complexes using support vector inductive logic programming.

Science.gov (United States)

Amini, Ata; Shrimpton, Paul J; Muggleton, Stephen H; Sternberg, Michael J E

2007-12-01

Despite the increased recent use of protein-ligand and protein-protein docking in the drug discovery process due to the increases in computational power, the difficulty of accurately ranking the binding affinities of a series of ligands or a series of proteins docked to a protein receptor remains largely unsolved. This problem is of major concern in lead optimization procedures and has lead to the development of scoring functions tailored to rank the binding affinities of a series of ligands to a specific system. However, such methods can take a long time to develop and their transferability to other systems remains open to question. Here we demonstrate that given a suitable amount of background information a new approach using support vector inductive logic programming (SVILP) can be used to produce system-specific scoring functions. Inductive logic programming (ILP) learns logic-based rules for a given dataset that can be used to describe properties of each member of the set in a qualitative manner. By combining ILP with support vector machine regression, a quantitative set of rules can be obtained. SVILP has previously been used in a biological context to examine datasets containing a series of singular molecular structures and properties. Here we describe the use of SVILP to produce binding affinity predictions of a series of ligands to a particular protein. We also for the first time examine the applicability of SVILP techniques to datasets consisting of protein-ligand complexes. Our results show that SVILP performs comparably with other state-of-the-art methods on five protein-ligand systems as judged by similar cross-validated squares of their correlation coefficients. A McNemar test comparing SVILP to CoMFA and CoMSIA across the five systems indicates our method to be significantly better on one occasion. The ability to graphically display and understand the SVILP-produced rules is demonstrated and this feature of ILP can be used to derive hypothesis for

General purpose programmable accelerator board

Science.gov (United States)

Robertson, Perry J.; Witzke, Edward L.

2001-01-01

A general purpose accelerator board and acceleration method comprising use of: one or more programmable logic devices; a plurality of memory blocks; bus interface for communicating data between the memory blocks and devices external to the board; and dynamic programming capabilities for providing logic to the programmable logic device to be executed on data in the memory blocks.

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

An Embedded Reconfigurable Logic Module

Science.gov (United States)

Tucker, Jerry H.; Klenke, Robert H.; Shams, Qamar A. (Technical Monitor)

2002-01-01

A Miniature Embedded Reconfigurable Computer and Logic (MERCAL) module has been developed and verified. MERCAL was designed to be a general-purpose, universal module that that can provide significant hardware and software resources to meet the requirements of many of today's complex embedded applications. This is accomplished in the MERCAL module by combining a sub credit card size PC in a DIMM form factor with a XILINX Spartan I1 FPGA. The PC has the ability to download program files to the FPGA to configure it for different hardware functions and to transfer data to and from the FPGA via the PC's ISA bus during run time. The MERCAL module combines, in a compact package, the computational power of a 133 MHz PC with up to 150,000 gate equivalents of digital logic that can be reconfigured by software. The general architecture and functionality of the MERCAL hardware and system software are described.

Automated identification of protein-ligand interaction features using Inductive Logic Programming: a hexose binding case study.

Science.gov (United States)

A Santos, Jose C; Nassif, Houssam; Page, David; Muggleton, Stephen H; E Sternberg, Michael J

2012-07-11

There is a need for automated methods to learn general features of the interactions of a ligand class with its diverse set of protein receptors. An appropriate machine learning approach is Inductive Logic Programming (ILP), which automatically generates comprehensible rules in addition to prediction. The development of ILP systems which can learn rules of the complexity required for studies on protein structure remains a challenge. In this work we use a new ILP system, ProGolem, and demonstrate its performance on learning features of hexose-protein interactions. The rules induced by ProGolem detect interactions mediated by aromatics and by planar-polar residues, in addition to less common features such as the aromatic sandwich. The rules also reveal a previously unreported dependency for residues cys and leu. They also specify interactions involving aromatic and hydrogen bonding residues. This paper shows that Inductive Logic Programming implemented in ProGolem can derive rules giving structural features of protein/ligand interactions. Several of these rules are consistent with descriptions in the literature. In addition to confirming literature results, ProGolem's model has a 10-fold cross-validated predictive accuracy that is superior, at the 95% confidence level, to another ILP system previously used to study protein/hexose interactions and is comparable with state-of-the-art statistical learners.

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.

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.

Program Verification with Monadic Second-Order Logic & Languages for Web Service Development

DEFF Research Database (Denmark)

Møller, Anders

applications, this implementation forms the basis of a verification technique for imperative programs that perform data-type operations using pointers. To achieve this, the basic logic is extended with layers of language abstractions. Also, a language for expressing data structures and operations along...

SITE PROGRAM DEMONSTRATION ECO LOGIC INTERNATIONAL GAS-PHASE CHEMICAL REDUCTION PROCESS, BAY CITY, MICHIGAN TECHNOLOGY EVALUATION REPORT

Science.gov (United States)

The SITE Program funded a field demonstration to evaluate the Eco Logic Gas-Phase Chemical Reduction Process developed by ELI Eco Logic International Inc. (ELI), Ontario, Canada. The Demonstration took place at the Middleground Landfill in Bay City, Michigan using landfill wa...

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

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

Using RUFDATA to guide a logic model for a quality assurance process in an undergraduate university program.

Science.gov (United States)

Sherman, Paul David

2016-04-01

This article presents a framework to identify key mechanisms for developing a logic model blueprint that can be used for an impending comprehensive evaluation of an undergraduate degree program in a Canadian university. The evaluation is a requirement of a comprehensive quality assurance process mandated by the university. A modified RUFDATA (Saunders, 2000) evaluation model is applied as an initiating framework to assist in decision making to provide a guide for conceptualizing a logic model for the quality assurance process. This article will show how an educational evaluation is strengthened by employing a RUFDATA reflective process in exploring key elements of the evaluation process, and then translating this information into a logic model format that could serve to offer a more focussed pathway for the quality assurance activities. Using preliminary program evaluation data from two key stakeholders of the undergraduate program as well as an audit of the curriculum's course syllabi, a case is made for, (1) the importance of inclusivity of key stakeholders participation in the design of the evaluation process to enrich the authenticity and accuracy of program participants' feedback, and (2) the diversification of data collection methods to ensure that stakeholders' narrative feedback is given ample exposure. It is suggested that the modified RUFDATA/logic model framework be applied to all academic programs at the university undergoing the quality assurance process at the same time so that economies of scale may be realized. Copyright © 2015 Elsevier Ltd. All rights reserved.

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

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.

Designing of all optical generalized circuit for two-input binary and multi-valued logical operations

Science.gov (United States)

Bhowmik, Panchatapa; Roy, Jitendra Nath; Chattopadhyay, Tanay

2014-11-01

This paper presents a generalized all optical circuit of two-input logical operation (both binary and multi-valued), using an optical nonlinear material (OPNLM) based switch. The inputs of the logic gates are represented by different polarization states of light. This model is simple, practical and very much useful for future all optical information processing. Proposed scheme can work for different wavelengths and for different materials. The simulation result with the nonlinear material gold nanoparticle embedded in optically transparent matrices alumina (Al2O3) is also presented in the paper.

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

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

The Father Friendly Initiative within Families: Using a logic model to develop program theory for a father support program.

Science.gov (United States)

Gervais, Christine; de Montigny, Francine; Lacharité, Carl; Dubeau, Diane

2015-10-01

The transition to fatherhood, with its numerous challenges, has been well documented. Likewise, fathers' relationships with health and social services have also begun to be explored. Yet despite the problems fathers experience in interactions with healthcare services, few programs have been developed for them. To explain this, some authors point to the difficulty practitioners encounter in developing and structuring the theory of programs they are trying to create to promote and support father involvement (Savaya, R., & Waysman, M. (2005). Administration in Social Work, 29(2), 85), even when such theory is key to a program's effectiveness (Chen, H.-T. (2005). Practical program evaluation. Thousand Oaks, CA: Sage Publications). The objective of the present paper is to present a tool, the logic model, to bridge this gap and to equip practitioners for structuring program theory. This paper addresses two questions: (1) What would be a useful instrument for structuring the development of program theory in interventions for fathers? (2) How would the concepts of a father involvement program best be organized? The case of the Father Friendly Initiative within Families (FFIF) program is used to present and illustrate six simple steps for developing a logic model that are based on program theory and demonstrate its relevance. Crown Copyright © 2015. Published by Elsevier Ltd. All rights reserved.

The explanatory logic and ontological commitments of generalized Darwinism

NARCIS (Netherlands)

Stoelhorst, J.W.

2008-01-01

The recent debate about the value of Darwinism as a source of ontological foundations for evolutionary economics reduces to a disagreement about whether or not the causal logic of Darwinism applies to economic evolution. However, this logic has not yet been fully specified. While the explanantia of

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.

Automated identification of protein-ligand interaction features using Inductive Logic Programming: a hexose binding case study

Directory of Open Access Journals (Sweden)

A Santos Jose C

2012-07-01

Full Text Available Abstract Background There is a need for automated methods to learn general features of the interactions of a ligand class with its diverse set of protein receptors. An appropriate machine learning approach is Inductive Logic Programming (ILP, which automatically generates comprehensible rules in addition to prediction. The development of ILP systems which can learn rules of the complexity required for studies on protein structure remains a challenge. In this work we use a new ILP system, ProGolem, and demonstrate its performance on learning features of hexose-protein interactions. Results The rules induced by ProGolem detect interactions mediated by aromatics and by planar-polar residues, in addition to less common features such as the aromatic sandwich. The rules also reveal a previously unreported dependency for residues cys and leu. They also specify interactions involving aromatic and hydrogen bonding residues. This paper shows that Inductive Logic Programming implemented in ProGolem can derive rules giving structural features of protein/ligand interactions. Several of these rules are consistent with descriptions in the literature. Conclusions In addition to confirming literature results, ProGolem’s model has a 10-fold cross-validated predictive accuracy that is superior, at the 95% confidence level, to another ILP system previously used to study protein/hexose interactions and is comparable with state-of-the-art statistical learners.

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.

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

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)

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.

Logic Models: A Tool for Effective Program Planning, Collaboration, and Monitoring. REL 2014-025

Science.gov (United States)

Kekahio, Wendy; Lawton, Brian; Cicchinelli, Louis; Brandon, Paul R.

2014-01-01

A logic model is a visual representation of the assumptions and theory of action that underlie the structure of an education program. A program can be a strategy for instruction in a classroom, a training session for a group of teachers, a grade-level curriculum, a building-level intervention, or a district-or statewide initiative. This guide, an…

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

A Logic Programming Based Approach to Applying Abstract Interpretation to Embedded Software

DEFF Research Database (Denmark)

Henriksen, Kim Steen

anvendt til at analysere programmer udviklet til indlejrede systemer. Et givet indlejret system modelleres som en emulator skrevet i en variant af logikprogrammering kaldet constraint logic programming (CLP). Emulatoren specialiseres med hensyn til et givet program, hvilket resulterer i et nyt program i...... programmeringsparadigme der har et solidt matematisk fundament. Et af dets karakteristika er adskillelsen af logik (betydningen af et program) og kontrol (hvordan programmet udføres), hvilket gør logikprogrammering til et meget anvendeligt sprog hvad angår programanalyse. I denne afhandling bliver logikprogrammering...... skrevet i sproget CLP der samtidig er isomorft med programmet skrevet til det indlejrede system. Anvendes abstract interpretation baserede analysatorer på det specialiserede program, kan resultater fra denne analyse direkte overføres til den indlejrede program, da dette program og den specialiserede...

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

Satisfiability of logic programming based on radial basis function neural networks

International Nuclear Information System (INIS)

Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged; Choon, Ong Hong

2014-01-01

In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems

Satisfiability of logic programming based on radial basis function neural networks

Energy Technology Data Exchange (ETDEWEB)

Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged; Choon, Ong Hong [School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)

2014-07-10

In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.

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

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

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.

Constraint Logic Programming for Resolution of Relative Time Expressions

DEFF Research Database (Denmark)

Christiansen, Henning

2014-01-01

Translating time expression into absolute time points or durations is a challenge for natural languages processing such as text mining and text understanding in general. We present a constraint logic language CLP(Time) tailored to text usages concerned with time and calendar. It provides a simple...... and flexible formalism to express relationships between different time expressions in a text, thereby giving a recipe for resolving them into absolute time. A constraint solver is developed which, as opposed to some earlier approaches, is independent of the order in which temporal information is introduced...

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

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

IT0: Discrete Math and Programming Logic Topics as a Hybrid Alternative to CS0

Science.gov (United States)

Martin, Nancy L.

2015-01-01

This paper describes the development of a hybrid introductory course for students in their first or second year of an information systems technologies degree program at a large Midwestern university. The course combines topics from discrete mathematics and programming logic and design, a unique twist on most introductory courses. The objective of…

Comparison of Anti-Virus Programs using Fuzzy Logic

Directory of Open Access Journals (Sweden)

Vaclav Bezdek

2013-07-01

Full Text Available This work follows the previous author´s paper: Possible use of Fuzzy Logic in Database. It tries to show application of Fuzzy Logic in selecting the best anti-virus software based on testing made by AV-Comparatives.

Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming.

Science.gov (United States)

Guziolowski, Carito; Videla, Santiago; Eduati, Federica; Thiele, Sven; Cokelaer, Thomas; Siegel, Anne; Saez-Rodriguez, Julio

2013-09-15

Logic modeling is a useful tool to study signal transduction across multiple pathways. Logic models can be generated by training a network containing the prior knowledge to phospho-proteomics data. The training can be performed using stochastic optimization procedures, but these are unable to guarantee a global optima or to report the complete family of feasible models. This, however, is essential to provide precise insight in the mechanisms underlaying signal transduction and generate reliable predictions. We propose the use of Answer Set Programming to explore exhaustively the space of feasible logic models. Toward this end, we have developed caspo, an open-source Python package that provides a powerful platform to learn and characterize logic models by leveraging the rich modeling language and solving technologies of Answer Set Programming. We illustrate the usefulness of caspo by revisiting a model of pro-growth and inflammatory pathways in liver cells. We show that, if experimental error is taken into account, there are thousands (11 700) of models compatible with the data. Despite the large number, we can extract structural features from the models, such as links that are always (or never) present or modules that appear in a mutual exclusive fashion. To further characterize this family of models, we investigate the input-output behavior of the models. We find 91 behaviors across the 11 700 models and we suggest new experiments to discriminate among them. Our results underscore the importance of characterizing in a global and exhaustive manner the family of feasible models, with important implications for experimental design. caspo is freely available for download (license GPLv3) and as a web service at http://caspo.genouest.org/. Supplementary materials are available at Bioinformatics online. santiago.videla@irisa.fr.

Knowledge discovery from structured mammography reports using inductive logic programming.

Science.gov (United States)

Burnside, Elizabeth S; Davis, Jesse; Costa, Victor Santos; Dutra, Inês de Castro; Kahn, Charles E; Fine, Jason; Page, David

2005-01-01

The development of large mammography databases provides an opportunity for knowledge discovery and data mining techniques to recognize patterns not previously appreciated. Using a database from a breast imaging practice containing patient risk factors, imaging findings, and biopsy results, we tested whether inductive logic programming (ILP) could discover interesting hypotheses that could subsequently be tested and validated. The ILP algorithm discovered two hypotheses from the data that were 1) judged as interesting by a subspecialty trained mammographer and 2) validated by analysis of the data itself.

Student Perceptions of Instructional Tools in Programming Logic: A Comparison of Traditional versus Alice Teaching Environments

Science.gov (United States)

Schultz, Leah

2011-01-01

This research investigates the implementation of the programming language Alice to teach computer programming logic to computer information systems students. Alice has been implemented in other university settings and has been reported to have many benefits including object-oriented concepts and an engaging and fun learning environment. In this…

A Logic Model for Evaluating the Academic Health Department.

Science.gov (United States)

Erwin, Paul Campbell; McNeely, Clea S; Grubaugh, Julie H; Valentine, Jennifer; Miller, Mark D; Buchanan, Martha

2016-01-01

Academic Health Departments (AHDs) are collaborative partnerships between academic programs and practice settings. While case studies have informed our understanding of the development and activities of AHDs, there has been no formal published evaluation of AHDs, either singularly or collectively. Developing a framework for evaluating AHDs has potential to further aid our understanding of how these relationships may matter. In this article, we present a general theory of change, in the form of a logic model, for how AHDs impact public health at the community level. We then present a specific example of how the logic model has been customized for a specific AHD. Finally, we end with potential research questions on the AHD based on these concepts. We conclude that logic models are valuable tools, which can be used to assess the value and ultimate impact of the AHD.

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.

MANUAL LOGIC CONTROLLER (MLC)

OpenAIRE

Claude Ziad Bayeh

2015-01-01

The “Manual Logic Controller” also called MLC, is an electronic circuit invented and designed by the author in 2008, in order to replace the well known PLC (Programmable Logic Controller) in many applications for its advantages and its low cost of fabrication. The function of the MLC is somewhat similar to the well known PLC, but instead of doing it by inserting a written program into the PLC using a computer or specific software inside the PLC, it will be manually programmed in a manner to h...

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.

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

A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking

DEFF Research Database (Denmark)

Brunel, Julien Pierre Manuel; Doligez, Damien; Hansen, Rene Rydhof

2008-01-01

an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found......, using a transformation rule that fixes several reference count bugs in Linux code....

General edition program

International Nuclear Information System (INIS)

Vaturi, Sylvain

1969-01-01

Computerized edition is essential for data processing exploitation. When a more or less complex edition program is required for each task, then the need for a general edition program become obvious. The aim of this study is to create a general edition program. Universal programs are capable to execute numerous and varied tasks. For a more precise processing, the execution of which is frequently required, the use of a specialized program is preferable because, contradictory to the universal program, it goes straight to the point [fr

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

Temporal abstraction and inductive logic programming for arrhythmia recognition from electrocardiograms.

Science.gov (United States)

Carrault, G; Cordier, M-O; Quiniou, R; Wang, F

2003-07-01

This paper proposes a novel approach to cardiac arrhythmia recognition from electrocardiograms (ECGs). ECGs record the electrical activity of the heart and are used to diagnose many heart disorders. The numerical ECG is first temporally abstracted into series of time-stamped events. Temporal abstraction makes use of artificial neural networks to extract interesting waves and their features from the input signals. A temporal reasoner called a chronicle recogniser processes such series in order to discover temporal patterns called chronicles which can be related to cardiac arrhythmias. Generally, it is difficult to elicit an accurate set of chronicles from a doctor. Thus, we propose to learn automatically from symbolic ECG examples the chronicles discriminating the arrhythmias belonging to some specific subset. Since temporal relationships are of major importance, inductive logic programming (ILP) is the tool of choice as it enables first-order relational learning. The approach has been evaluated on real ECGs taken from the MIT-BIH database. The performance of the different modules as well as the efficiency of the whole system is presented. The results are rather good and demonstrate that integrating numerical techniques for low level perception and symbolic techniques for high level classification is very valuable.

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.

A Framework for Incorporating General Domain Knowledge into Latent Dirichlet Allocation using First-Order Logic

Energy Technology Data Exchange (ETDEWEB)

Andrzejewski, D; Zhu, X; Craven, M; Recht, B

2011-01-18

Topic models have been used successfully for a variety of problems, often in the form of application-specific extensions of the basic Latent Dirichlet Allocation (LDA) model. Because deriving these new models in order to encode domain knowledge can be difficult and time-consuming, we propose the Fold-all model, which allows the user to specify general domain knowledge in First-Order Logic (FOL). However, combining topic modeling with FOL can result in inference problems beyond the capabilities of existing techniques. We have therefore developed a scalable inference technique using stochastic gradient descent which may also be useful to the Markov Logic Network (MLN) research community. Experiments demonstrate the expressive power of Fold-all, as well as the scalability of our proposed inference method.

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

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

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

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.

Automatic Function Annotations for Hoare Logic

Directory of Open Access Journals (Sweden)

Daniel Matichuk

2012-11-01

Full Text Available In systems verification we are often concerned with multiple, inter-dependent properties that a program must satisfy. To prove that a program satisfies a given property, the correctness of intermediate states of the program must be characterized. However, this intermediate reasoning is not always phrased such that it can be easily re-used in the proofs of subsequent properties. We introduce a function annotation logic that extends Hoare logic in two important ways: (1 when proving that a function satisfies a Hoare triple, intermediate reasoning is automatically stored as function annotations, and (2 these function annotations can be exploited in future Hoare logic proofs. This reduces duplication of reasoning between the proofs of different properties, whilst serving as a drop-in replacement for traditional Hoare logic to avoid the costly process of proof refactoring. We explain how this was implemented in Isabelle/HOL and applied to an experimental branch of the seL4 microkernel to significantly reduce the size and complexity of existing proofs.

A Logical Analysis of Quantum Voting Protocols

Science.gov (United States)

Rad, Soroush Rafiee; Shirinkalam, Elahe; Smets, Sonja

2017-12-01

In this paper we provide a logical analysis of the Quantum Voting Protocol for Anonymous Surveying as developed by Horoshko and Kilin in (Phys. Lett. A 375, 1172-1175 2011). In particular we make use of the probabilistic logic of quantum programs as developed in (Int. J. Theor. Phys. 53, 3628-3647 2014) to provide a formal specification of the protocol and to derive its correctness. Our analysis is part of a wider program on the application of quantum logics to the formal verification of protocols in quantum communication and quantum computation.

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

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

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

Model Checking Is Static Analysis of Modal Logic

DEFF Research Database (Denmark)

Nielson, Flemming; Nielson, Hanne Riis

2010-01-01

Flow Logic is an approach to the static analysis of programs that has been developed for functional, imperative and object-oriented programming languages and for concurrent, distributed, mobile and cryptographic process calculi. In this paper we extend it; to deal with modal logics and prove...

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

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

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

Purwarupa Sistem Kontrol Elevator Berbasis Programable Logic Control

Directory of Open Access Journals (Sweden)

Fathahillah Fathahillah

2017-12-01

Full Text Available Various methods / types of controls developed in accordance with industry needs one of them in the field of building automation system. One of the controls in the field of building automation system is the elevator control system (elevator. Early elevator control systems that transport humans or goods as vertical transportation vehicles are still conventional using human power, then evolved using steam engines, until now the elevators use AC motors equipped with control systems. The purpose of this research is to design the prototype of elevator control system using programmable logic control (PLC. The type of PLC controller used in the study using Omron PLC. The results show the design of prototype of elevator control system using PLC successfully and can control eleveator in accordance with its function, besides its programming form can be more simple.

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.

Symbolic logic and mechanical theorem proving

CERN Document Server

Chang, Chin-Liang

1969-01-01

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.

Logics and falsifications a new perspective on constructivist semantics

CERN Document Server

Kapsner, Andreas

2014-01-01

This volume examines the concept of falsification as a central notion of semantic theories and its effects on logical laws. The point of departure is the general constructivist line of argument that Michael Dummett has offered over the last decades. From there, the author examines the ways in which falsifications can enter into a constructivist semantics, displays the full spectrum of options, and discusses the logical systems most suitable to each one of them. While the idea of introducing falsifications into the semantic account is Dummett's own, the many ways in which falsificationism departs quite radically from verificationism are here spelled out in detail for the first time. The volume is divided into three large parts. The first part provides important background information about Dummett’s program, intuitionism and logics with gaps and gluts. The second part is devoted to the introduction of falsifications into the constructive account, and shows that there is more than one way in which one can do ...

Logic in the curricula of Computer Science

Directory of Open Access Journals (Sweden)

Margareth Quindeless

2014-12-01

Full Text Available The aim of the programs in Computer Science is to educate and train students to understand the problems and build systems that solve them. This process involves applying a special reasoning to model interactions, capabilities, and limitations of the components involved. A good curriculum must involve the use of tools to assist in these tasks, and one that could be considered as a fundamental is the logic, because with it students develop the necessary reasoning. Besides, software developers analyze the behavior of the program during the designed, the depuration, and testing; hardware designers perform minimization and equivalence verification of circuits; designers of operating systems validate routing protocols, programing, and synchronization; and formal logic underlying all these activities. Therefore, a strong background in applied logic would help students to develop or potentiate their ability to reason about complex systems. Unfortunately, few curricula formed and properly trained in logic. Most includes only one or two courses of Discrete Mathematics, which in a few weeks covered truth tables and the propositional calculus, and nothing more. This is not enough, and higher level courses in which they are applied and many other logical concepts are needed. In addition, students will not see the importance of logic in their careers and need to modify the curriculum committees or adapt the curriculum to reverse this situation.

Discovering rules for protein-ligand specificity using support vector inductive logic programming.

Science.gov (United States)

Kelley, Lawrence A; Shrimpton, Paul J; Muggleton, Stephen H; Sternberg, Michael J E

2009-09-01

Structural genomics initiatives are rapidly generating vast numbers of protein structures. Comparative modelling is also capable of producing accurate structural models for many protein sequences. However, for many of the known structures, functions are not yet determined, and in many modelling tasks, an accurate structural model does not necessarily tell us about function. Thus, there is a pressing need for high-throughput methods for determining function from structure. The spatial arrangement of key amino acids in a folded protein, on the surface or buried in clefts, is often the determinants of its biological function. A central aim of molecular biology is to understand the relationship between such substructures or surfaces and biological function, leading both to function prediction and to function design. We present a new general method for discovering the features of binding pockets that confer specificity for particular ligands. Using a recently developed machine-learning technique which couples the rule-discovery approach of inductive logic programming with the statistical learning power of support vector machines, we are able to discriminate, with high precision (90%) and recall (86%) between pockets that bind FAD and those that bind NAD on a large benchmark set given only the geometry and composition of the backbone of the binding pocket without the use of docking. In addition, we learn rules governing this specificity which can feed into protein functional design protocols. An analysis of the rules found suggests that key features of the binding pocket may be tied to conformational freedom in the ligand. The representation is sufficiently general to be applicable to any discriminatory binding problem. All programs and data sets are freely available to non-commercial users at http://www.sbg.bio.ic.ac.uk/svilp_ligand/.

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

Conditioning of high voltage radio frequency cavities by using fuzzy logic in connection with rule based programming

CERN Document Server

Perréard, S

1993-01-01

Many processes are controlled by experts using some kind of mental model to decide actions and make conclusions. This model, based on heuristic knowledge, can often be conveniently represented in rules and has not to be particularly accurate. This is the case for the problem of conditioning high voltage radio-frequency cavities: the expert has to decide, by observing some criteria, if he can increase or if he has to decrease the voltage and by how much. A program has been implemented which can be applied to a class of similar problems. The kernel of the program is a small rule base, which is independent of the kind of cavity. To model a specific cavity, we use fuzzy logic which is implemented as a separate routine called by the rule base. We use fuzzy logic to translate from numeric to symbolic information. The example we chose for applying this kind of technique can be implemented by sequential programming. The two versions exist for comparison. However, we believe that this kind of programming can be powerf...

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.

Drawing Analogies between Logic Programming and Natural Language Argumentation Texts to Scaffold Learners' Understanding

Science.gov (United States)

Ragonis, Noa; Shilo, Gila

2014-01-01

The paper presents a theoretical investigational study of the potential advantages that secondary school learners may gain from learning two different subjects, namely, logic programming within computer science studies and argumentation texts within linguistics studies. The study suggests drawing an analogy between the two subjects since they both…

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.

Developing and Using a Logic Model for Evaluation and Assessment of University Student Affairs Programming: A Case Study

Science.gov (United States)

Cooper, Jeff

2009-01-01

This dissertation addresses theory and practice of evaluation and assessment in university student affairs, by applying logic modeling/program theory to a case study. I intend to add knowledge to ongoing dialogue among evaluation scholars and practitioners on student affairs program planning and improvement as integral considerations that serve…

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

Logic Programs as a Specification and Description Tool in the Design Process of an Intelligent Tutoring System

OpenAIRE

Möbus, Claus

1987-01-01

We propose the use of logic programs when designing intelligent tutoring systems. With their help we specified the small-step semantics of the learning curriculum, designed the graphical user interface, derived instructions and modelled students' knowledge.

Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing

KAUST Repository

Luo, Zhaochu

2016-11-16

In the magnetic logic, four basic Boolean logic operations can be programmed by a magnetic bit at room temperature with a high output ratio (>103%). In the same clock cycle, benefiting from the built-in spin Hall effect, logic results can be directly written into magnetic bits using an all-electric method.

Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing

KAUST Repository

Luo, Zhaochu; Lu, Ziyao; Xiong, Chengyue; Zhu, Tao; Wu, Wei; Zhang, Qiang; Wu, Huaqiang; Zhang, Xixiang; Zhang, Xiaozhong

2016-01-01

In the magnetic logic, four basic Boolean logic operations can be programmed by a magnetic bit at room temperature with a high output ratio (>103%). In the same clock cycle, benefiting from the built-in spin Hall effect, logic results can be directly written into magnetic bits using an all-electric method.

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.

Fundamentals of the fuzzy logic-based generalized theory of decisions

CERN Document Server

Aliev, Rafik Aziz

2013-01-01

Every day decision making and decision making in complex human-centric systems are characterized by imperfect decision-relevant information. Main drawback of the existing decision theories is namely incapability to deal with imperfect information and modeling vague preferences. Actually, a paradigm of non-numerical probabilities in decision making has a long history and arose also in Keynes’s analysis of uncertainty. There is a need for further generalization – a move to decision theories with perception-based imperfect information described in NL. The languages of new decision models for human-centric systems should be not languages based on binary logic but human-centric computational schemes able to operate on NL-described information. Development of new theories is now possible due to an increased computational power of information processing systems which allows for computations with imperfect information, particularly, imprecise and partially true information, which are much more complex than comput...

Permissive Subsorted Partial Logic in CASL

DEFF Research Database (Denmark)

Cerioli, Maura; Haxthausen, Anne Elisabeth; Krieg-Brückner, Bernd

1997-01-01

This paper presents a permissive subsorted partial logic used in the CoFI Algebraic Specification Language. In contrast to other order-sorted logics, subsorting is not modeled by set inclusions, but by injective embeddings allowing for more general models in which subtypes can have different data...

The LPi and LPi/2 Propositional and Predicate Logics

Czech Academy of Sciences Publication Activity Database

Cintula, Petr

2001-01-01

Roč. 124, č. 3 (2001), s. 289-302 ISSN 0165-0114 Institutional research plan: AV0Z1030915 Keywords : fuzzy logic * product logic * Lukasiewicz logic Subject RIV: BA - General Mathematics Impact factor: 0.470, year: 2001

Improving the human readability of Arden Syntax medical logic modules using a concept-oriented terminology and object-oriented programming expressions.

Science.gov (United States)

Choi, Jeeyae; Bakken, Suzanne; Lussier, Yves A; Mendonça, Eneida A

2006-01-01

Medical logic modules are a procedural representation for sharing task-specific knowledge for decision support systems. Based on the premise that clinicians may perceive object-oriented expressions as easier to read than procedural rules in Arden Syntax-based medical logic modules, we developed a method for improving the readability of medical logic modules. Two approaches were applied: exploiting the concept-oriented features of the Medical Entities Dictionary and building an executable Java program to replace Arden Syntax procedural expressions. The usability evaluation showed that 66% of participants successfully mapped all Arden Syntax rules to Java methods. These findings suggest that these approaches can play an essential role in the creation of human readable medical logic modules and can potentially increase the number of clinical experts who are able to participate in the creation of medical logic modules. Although our approaches are broadly applicable, we specifically discuss the relevance to concept-oriented nursing terminologies and automated processing of task-specific nursing knowledge.

Logical provenance in data-oriented workflows?

KAUST Repository

Ikeda, R.

2013-04-01

We consider the problem of defining, generating, and tracing provenance in data-oriented workflows, in which input data sets are processed by a graph of transformations to produce output results. We first give a new general definition of provenance for general transformations, introducing the notions of correctness, precision, and minimality. We then determine when properties such as correctness and minimality carry over from the individual transformations\\' provenance to the workflow provenance. We describe a simple logical-provenance specification language consisting of attribute mappings and filters. We provide an algorithm for provenance tracing in workflows where logical provenance for each transformation is specified using our language. We consider logical provenance in the relational setting, observing that for a class of Select-Project-Join (SPJ) transformations, logical provenance specifications encode minimal provenance. We have built a prototype system supporting the features and algorithms presented in the paper, and we report a few preliminary experimental results. © 2013 IEEE.

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

Modular Logic Metaprogramming

DEFF Research Database (Denmark)

Klose, Karl; Ostermann, Klaus

2010-01-01

In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze the probl...

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

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

Logical and mathematical structures of quantum mechanics

International Nuclear Information System (INIS)

Beltrametti, E.G.; Cassinelli, G.

1976-01-01

The logic associated with a physical system is first analysed, and the general properties of observable and states are discussed. The logic of the Hilbert-space formulation of quantum mechanics and of pure, ideal measurements is described

A Non-Arithmetical Gödel Logic

Czech Academy of Sciences Publication Activity Database

Hájek, Petr

2005-01-01

Roč. 13, č. 4 (2005), s. 435-441 ISSN 1367-0751 R&D Projects: GA AV ČR IAA100300503 Institutional research plan: CEZ:AV0Z10300504 Keywords : fuzzy logic * Gödel logic * arithmetical hierarchy Subject RIV: BA - General Mathematics Impact factor: 0.382, year: 2005

Knowledge-Driven Versus Data-Driven Logics

Czech Academy of Sciences Publication Activity Database

Dubois, D.; Hájek, Petr; Prade, H.

2000-01-01

Roč. 9, č. 1 (2000), s. 65-89 ISSN 0925-8531 R&D Projects: GA AV ČR IAA1030601 Grant - others:CNRS(FR) 4008 Institutional research plan: AV0Z1030915 Keywords : epistemic logic * possibility theory * data-driven reasoning * deontic logic Subject RIV: BA - General Mathematics

Program summary for the Civilian Reactor Development Program

International Nuclear Information System (INIS)

1982-07-01

This Civilian Reactor Development Program document has the prime purpose of summarizing the technical programs supported by the FY 1983 budget request. This section provides a statement of the overall program objectives and a general program overview. Section II presents the technical programs in a format intended to show logical technical interrelationships, and does not necessarily follow the structure of the formal budget presentation. Section III presents the technical organization and management structure of the program

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

Multi-valued and Fuzzy Logic Realization using TaOx Memristive Devices.

Science.gov (United States)

Bhattacharjee, Debjyoti; Kim, Wonjoo; Chattopadhyay, Anupam; Waser, Rainer; Rana, Vikas

2018-01-08

Among emerging non-volatile storage technologies, redox-based resistive switching Random Access Memory (ReRAM) is a prominent one. The realization of Boolean logic functionalities using ReRAM adds an extra edge to this technology. Recently, 7-state ReRAM devices were used to realize ternary arithmetic circuits, which opens up the computing space beyond traditional binary values. In this manuscript, we report realization of multi-valued and fuzzy logic operators with a representative application using ReRAM devices. Multi-valued logic (MVL), such as Łukasiewicz logic generalizes Boolean logic by allowing more than two truth values. MVL also permits operations on fuzzy sets, where, in contrast to standard crisp logic, an element is permitted to have a degree of membership to a given set. Fuzzy operations generally model human reasoning better than Boolean logic operations, which is predominant in current computing technologies. When the available information for the modelling of a system is imprecise and incomplete, fuzzy logic provides an excellent framework for the system design. Practical applications of fuzzy logic include, industrial control systems, robotics, and in general, design of expert systems through knowledge-based reasoning. Our experimental results show, for the first time, that it is possible to model fuzzy logic natively using multi-state memristive devices.

UTP and Temporal Logic Model Checking

Science.gov (United States)

Anderson, Hugh; Ciobanu, Gabriel; Freitas, Leo

In this paper we give an additional perspective to the formal verification of programs through temporal logic model checking, which uses Hoare and He Unifying Theories of Programming (UTP). Our perspective emphasizes the use of UTP designs, an alphabetised relational calculus expressed as a pre/post condition pair of relations, to verify state or temporal assertions about programs. The temporal model checking relation is derived from a satisfaction relation between the model and its properties. The contribution of this paper is that it shows a UTP perspective to temporal logic model checking. The approach includes the notion of efficiency found in traditional model checkers, which reduced a state explosion problem through the use of efficient data structures

Ontology learning from interpretations in lightweight description logics

CSIR Research Space (South Africa)

Klarman, S

2015-08-01

Full Text Available International Conference on Inductive Logic programming (ILP), Kyoto, Japan, 20-22 August 2015 Ontology Learning from Interpretations in Lightweight Description Logics Szymon Klarman1 and Katarina Britz2 1 Department of Computer Science, Brunel...

A backtracking algorithm for the stream AND-parallel execution of logic programs

Energy Technology Data Exchange (ETDEWEB)

Somogyi, Z.; Ramamohanarao, K.; Vaghani, J. (Univ. of Melbourne, Parkville (Australia))

1988-06-01

The authors present the first backtracking algorithm for stream AND-parallel logic programs. It relies on compile-time knowledge of the data flow graph of each clause to let it figure out efficiently which goals to kill or restart when a goal fails. This crucial information, which they derive from mode declarations, was not available at compile-time in any previous stream AND-parallel system. They show that modes can increase the precision of the backtracking algorithm, though their algorithm allows this precision to be traded off against overhead on a procedure-by-procedure and call-by-call basis. The modes also allow their algorithm to handle efficiently programs that manipulate partially instantiated data structures and an important class of programs with circular dependency graphs. On code that does not need backtracking, the efficiency of their algorithm approaches that of the committed-choice languages; on code that does need backtracking its overhead is comparable to that of the independent AND-parallel backtracking algorithms.

Extension Properties and Subdirect Representation in Abstract Algebraic Logic

Czech Academy of Sciences Publication Activity Database

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

(2018) ISSN 0039-3215 R&D Projects: GA ČR GA17-04630S Institutional support: RVO:67985556 Keywords : Abstract algebraic logic * Infinitary logics * Natural extensions * Natural expansions * Semilinear logics * Subdirect representation Subject RIV: BA - General Mathematics Impact factor: 0.589, year: 2016

Parametric Analysis of Flexible Logic Control Model

Directory of Open Access Journals (Sweden)

Lihua Fu

2013-01-01

Full Text Available Based on deep analysis about the essential relation between two input variables of normal two-dimensional fuzzy controller, we used universal combinatorial operation model to describe the logic relationship and gave a flexible logic control method to realize the effective control for complex system. In practical control application, how to determine the general correlation coefficient of flexible logic control model is a problem for further studies. First, the conventional universal combinatorial operation model has been limited in the interval [0,1]. Consequently, this paper studies a kind of universal combinatorial operation model based on the interval [a,b]. And some important theorems are given and proved, which provide a foundation for the flexible logic control method. For dealing reasonably with the complex relations of every factor in complex system, a kind of universal combinatorial operation model with unequal weights is put forward. Then, this paper has carried out the parametric analysis of flexible logic control model. And some research results have been given, which have important directive to determine the values of the general correlation coefficients in practical control application.

Implicational (Semilinear) Logics II: Additional Connectives and Characterizations of Semilinearity

Czech Academy of Sciences Publication Activity Database

Cintula, Petr; Noguera, Carles

2016-01-01

Roč. 55, č. 3 (2016), s. 353-372 ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 247584 - MATOMUVI Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * implicational logics * disjunctional logics * semilinear logics * non-classical logics * transfer theorems Subject RIV: BA - General Mathematics Impact factor: 0.394, year: 2016

The Logic of the Method of Agent-Based Simulation in the Social Sciences: Empirical and Intentional Adequacy of Computer Programs

OpenAIRE

Nuno David; Jaime Simão Sichman; Helder Coelho

2005-01-01

WOS:000235217900009 (Nº de Acesso Web of Science) The classical theory of computation does not represent an adequate model of reality for simulation in the social sciences. The aim of this paper is to construct a methodological perspective that is able to conciliate the formal and empirical logic of program verification in computer science, with the interpretative and multiparadigmatic logic of the social sciences. We attempt to evaluate whether social simulation implies an additional pers...

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.

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

Short-circuit logic

NARCIS (Netherlands)

Bergstra, J.A.; Ponse, A.

2010-01-01

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. A short-circuit logic is a variant of

On the Automatic Evolution of an OS Kernel Using Temporal Logic and AOP

DEFF Research Database (Denmark)

Åberg, Rickard; Lawall, Julia Laetitia; Sudholt, Mario

2003-01-01

aspect-oriented programing, temporal logic, process scheduling, Linux, domain-specific languages......aspect-oriented programing, temporal logic, process scheduling, Linux, domain-specific languages...

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.

Advances in the LPi and LPi1/2 Logics

Czech Academy of Sciences Publication Activity Database

Cintula, Petr

2003-01-01

Roč. 42, č. 5 (2003), s. 449-468 ISSN 0933-5846 R&D Projects: GA AV ČR IAA1030004 Institutional research plan: AV0Z1030915 Keywords : fuzzy logic * Lukasiewicz logic * product logic Subject RIV: BA - General Mathematics Impact factor: 0.523, year: 2003

Using Weighted Constraints to Diagnose Errors in Logic Programming--The Case of an Ill-Defined Domain

Science.gov (United States)

Le, Nguyen-Thinh; Menzel, Wolfgang

2009-01-01

In this paper, we introduce logic programming as a domain that exhibits some characteristics of being ill-defined. In order to diagnose student errors in such a domain, we need a means to hypothesise the student's intention, that is the strategy underlying her solution. This is achieved by weighting constraints, so that hypotheses about solution…

[New horizons in medicine. The application of "fuzzy logic" in clinical and experimental medicine].

Science.gov (United States)

Guarini, G

1994-06-01

In medicine, the study of physiological and physiopathological problems is generally programmed by elaborating models which respond to the principals of formal logic. This gives the advantage of favouring the transformation of the formal model into a mathematical model of reference which responds to the principles of the set theories. All this is in the utopian wish to obtain as a result of each research, a net answer whether positive or negative, according to the Aristotelian principal of tertium non datur. Taking this into consideration, the A. briefly traces the principles of modal logic and, in particular, those of fuzzy logic, proposing that the latter substitute the actual definition of "logic with more truth values", with that perhaps more pertinent of "logic of conditioned possibilities". After a brief synthesis on the state of the art on the application of fuzzy logic, the A. reports an example of graphic expression of fuzzy logic by demonstrating how the basic glycemic data (expressed by the vectors magnitude) revealed in a sample of healthy individuals, constituted on the whole an unbroken continuous stream of set partials. The A. calls attention to fuzzy logic as a useful instrument to elaborate in a new way the analysis of scenario qualified to acquire the necessary information to single out the critical points which characterize the potential development of any biological phenomenon.

Quantum logic

International Nuclear Information System (INIS)

Mittelstaedt, P.

1979-01-01

The subspaces of Hilbert space constitute an orthocomplemented quasimodular lattice Lsub(q) for which neither a two-valued function nor generalized truth function exist. A generalisation of the dialogic method can be used as an interpretation of a lattice Lsub(qi), which may be considered as the intuitionistic part of Lsub(q). Some obvious modifications of the dialogic method are introduced which come from the possible incommensurability of propositions about quantum mechanical systems. With the aid of this generalized dialogic method a propositional calculus Qsub(eff) is derived which is similar to the calculus of effective (intuitionistic) logic, but contains a few restrictions which are based on the incommensurability of quantum mechanical propositions. It can be shown within the framework of the calculus Qsub(eff) that the value-definiteness of the elementary propositions which are proved by quantum mechanical propositions is inherited by all finite compund propositions. In this way one arrives at the calculus Q of full quantum logic which incorporates the principle of excluded middle for all propositions and which is a model for the lattice Lsub(q). (Auth.)

Development of a Logic Model for a Physical Activity–Based Employee Wellness Program for Mass Transit Workers

OpenAIRE

Das, Bhibha M.; Petruzzello, Steven J.; Ryan, Katherine E.

2014-01-01

Transportation workers, who constitute a large sector of the workforce, have worksite factors that harm their health. Worksite wellness programs must target this at-risk population. Although physical activity is often a component of worksite wellness logic models, we consider it the cornerstone for improving the health of mass transit employees. Program theory was based on in-person interviews and focus groups of employees. We identified 4 short-term outcome categories, which provided a chain...

Flow Logics and Operational Semantics

DEFF Research Database (Denmark)

Nielson, Flemming; Nielson, Hanne Riis

1998-01-01

Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analys...... correct. Our main conclusion is that environment based semantics is more flexible than either substitution based semantics or semantics making use of structural congruences (like alpha-renaming)....

Mitigation of adverse interactions in pairs of clinical practice guidelines using constraint logic programming.

Science.gov (United States)

Wilk, Szymon; Michalowski, Wojtek; Michalowski, Martin; Farion, Ken; Hing, Marisela Mainegra; Mohapatra, Subhra

2013-04-01

We propose a new method to mitigate (identify and address) adverse interactions (drug-drug or drug-disease) that occur when a patient with comorbid diseases is managed according to two concurrently applied clinical practice guidelines (CPGs). A lack of methods to facilitate the concurrent application of CPGs severely limits their use in clinical practice and the development of such methods is one of the grand challenges for clinical decision support. The proposed method responds to this challenge. We introduce and formally define logical models of CPGs and other related concepts, and develop the mitigation algorithm that operates on these concepts. In the algorithm we combine domain knowledge encoded as interaction and revision operators using the constraint logic programming (CLP) paradigm. The operators characterize adverse interactions and describe revisions to logical models required to address these interactions, while CLP allows us to efficiently solve the logical models - a solution represents a feasible therapy that may be safely applied to a patient. The mitigation algorithm accepts two CPGs and available (likely incomplete) patient information. It reports whether mitigation has been successful or not, and on success it gives a feasible therapy and points at identified interactions (if any) together with the revisions that address them. Thus, we consider the mitigation algorithm as an alerting tool to support a physician in the concurrent application of CPGs that can be implemented as a component of a clinical decision support system. We illustrate our method in the context of two clinical scenarios involving a patient with duodenal ulcer who experiences an episode of transient ischemic attack. Copyright © 2013 Elsevier Inc. All rights reserved.

Oak Ridge National Laboratory Technology Logic Diagram

International Nuclear Information System (INIS)

1993-09-01

The Oak Ridge National Laboratory Technology Logic Diagram (TLD) was developed to provide a decision-support tool that relates environmental restoration (ER) and waste management (WM) problems at Oak Ridge National Laboratory (ORNL) to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration, testing, and evaluation needed to develop these technologies to a state that allows technology transfer and application to decontamination and decommissioning (D ampersand D), remedial action (RA), and WM activities. The TLD consists of three fundamentally separate volumes: Vol. 1 (Technology Evaluation), Vol. 2 (Technology Logic Diagram), and Vol. 3 (Technology Evaluation Data Sheets). Part A of Vols. 1 and 2 focuses on D ampersand D. Part B of Vols. 1 and 2 focuses on RA of contaminated facilities. Part C of Vols. 1 and 2 focuses on WM. Each part of Vol. 1 contains an overview of the TLD, an explanation of the program-specific responsibilities, a review of identified technologies, and the ranking os remedial technologies. Volume 2 (Pts. A, B, and C) contains the logic linkages among EM goals, environmental problems, and the various technologies that have the potential to solve these problems. Volume 3 (Pts. A, B, and C) contains the TLD data sheets. The focus of Vol. 1, Pt. B, is RA, and it has been divided into six chapters. The first chapter is an introduction, which defines problems specific to the ER Program for ORNL. Chapter 2 provides a general overview of the TLD. Chapters 3 through 5 are organized into necessary subelement categories: RA, characterization, and robotics and automation. The final chapter contains regulatory compliance information concerning RA

Using a logic model to evaluate the Kids Together early education inclusion program for children with disabilities and additional needs.

Science.gov (United States)

Clapham, Kathleen; Manning, Claire; Williams, Kathryn; O'Brien, Ginger; Sutherland, Margaret

2017-04-01

Despite clear evidence that learning and social opportunities for children with disabilities and special needs are more effective in inclusive not segregated settings, there are few known effective inclusion programs available to children with disabilities, their families or teachers in the early years within Australia. The Kids Together program was developed to support children with disabilities/additional needs aged 0-8 years attending mainstream early learning environments. Using a key worker transdisciplinary team model, the program aligns with the individualised package approach of the National Disability Insurance Scheme (NDIS). This paper reports on the use of a logic model to underpin the process, outcomes and impact evaluation of the Kids Together program. The research team worked across 15 Early Childhood Education and Care (ECEC) centres and in home and community settings. A realist evaluation using mixed methods was undertaken to understand what works, for whom and in what contexts. The development of a logic model provided a structured way to explore how the program was implemented and achieved short, medium and long term outcomes within a complex community setting. Kids Together was shown to be a highly effective and innovative model for supporting the inclusion of children with disabilities/additional needs in a range of environments central for early childhood learning and development. The use of a logic model provided a visual representation of the Kids Together model and its component parts and enabled a theory of change to be inferred, showing how a coordinated and collaborative approached can work across multiple environments. Copyright © 2016 Elsevier Ltd. All rights reserved.

Inference of Well-Typings for Logic Programs with Application to Termination Analysis

DEFF Research Database (Denmark)

Bruynooghe, M.; Gallagher, John Patrick; Humbeeck, W. Van

2005-01-01

A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms can automatically be constructed. Previous work on type-based termination analysis used either types declared...... by the user, or automatically generated monomorphic types describing the success set of predicates. The latter types are less precise and result in weaker termination conditions than those obtained from declared types. Our type inference procedure involves solving set constraints generated from the program...... and derives a well-typing in contrast to a success-set approximation. Experiments so far show that our automatically inferred well-typings are close to the declared types and result in termination conditions that are as strong as those obtained with declared types. We describe the method, its implementation...

The Role of Institutional Logics in Shaping Architecture Governance

DEFF Research Database (Denmark)

Andersen, Peter; Svejvig, Per; Carugati, Andrea

2016-01-01

are discussed in relation to current practice and theory on both architecture and IT governance. Generally, the findings show how architecture governance is shaped through a complex, contextual and social process beyond rational, managerial decision-making. Finally, we propose that institutional logics can...... to IT governance literature in general. IT governance is often described as a management prerogative, however, using institutional logics as a theoretical lens and sensitizing device, we show how different logics emerged over time and influenced how the organization governed its architecture. These findings...

A logical correspondence between natural semantics and abstract machines

DEFF Research Database (Denmark)

Simmons, Robert J.; Zerny, Ian

2013-01-01

We present a logical correspondence between natural semantics and abstract machines. This correspondence enables the mechanical and fully-correct construction of an abstract machine from a natural semantics. Our logical correspondence mirrors the Reynolds functional correspondence, but we...... manipulate semantic specifications encoded in a logical framework instead of manipulating functional programs. Natural semantics and abstract machines are instances of substructural operational semantics. As a byproduct, using a substructural logical framework, we bring concurrent and stateful models...

A Note on Axiomatizations of Pavelka-style Complete Fuzzy Logics

Czech Academy of Sciences Publication Activity Database

Cintula, Petr

2016-01-01

Roč. 292, 1 June (2016), s. 160-174 ISSN 0165-0114 R&D Projects: GA ČR GAP202/10/1826 Institutional support: RVO:67985807 Keywords : mathematical fuzzy logic * Pavelka-style completeness * MTL logic * Lukasiewicz logics * Product Logic * truth constants * Monteiro–Baaz delta Subject RIV: BA - General Mathematics Impact factor: 2.718, year: 2016

Quantum computer with mixed states and four-valued logic

International Nuclear Information System (INIS)

Tarasov, Vasily E.

2002-01-01

In this paper we discuss a model of quantum computer in which a state is an operator of density matrix and gates are general quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum systems is considered as an element of 4 n -dimensional operator Hilbert space (Liouville space). It allows us to use a quantum computer model with four-valued logic. The gates of this model are general superoperators which act on n-ququat state. Ququat is a quantum state in a four-dimensional (operator) Hilbert space. Unitary two-valued logic gates and quantum operations for an n-qubit open system are considered as four-valued logic gates acting on n-ququats. We discuss properties of quantum four-valued logic gates. In the paper we study universality for quantum four-valued logic gates. (author)

Four logics of governance

DEFF Research Database (Denmark)

Friche, Nanna; Normann Andersen, Vibeke

unintended consequences. Theoretically, we draw on different management and governance theories, e.g. performance management. Empirically, the study is based on surveys to teachers and students at all Danish vocational colleges and interviews with school leaders, teachers and students at six colleges (cases...... and well-being of students enrolled in the VETs must be strengthened. We focus on target 1, 2 and 4. The reform is being implemented in a field of VET that can be characterized by four logics of governance. Firstly, a governance logic characterized by institutional independence of vocational colleges......For the last fifteen years completion rates in Danish vocational education and training (VET) has stayed on a rather low level. In 2014, only half of the students enrolled in a vocational program on upper secondary level, graduated from the program (Flarup et al 2016). In Denmark, like in other...

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

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.

Philosophical, logical and scientific perspectives in engineering

CERN Document Server

Sen, Zekâi

2013-01-01

This book highlights and explains the significance of philosophical, logical, and scientific principles for engineering education/training and engineering works. In so doing, it aims to help to rectify the neglect of philosophy and logic in current education and training programs, which emphasize analytical and numerical methods at the expense of the innovative practical and creative abilities so important for engineering in the past. Individual chapters examine the relation of philosophy, logic, and science to engineering, drawing attention to, for example, the significance of ethics, the rel

Empirical logic and quantum mechanics

International Nuclear Information System (INIS)

Foulis, D.J.; Randall, C.H.

1976-01-01

This article discusses some of the basic notions of quantum physics within the more general framework of operational statistics and empirical logic (as developed in Foulis and Randall, 1972, and Randall and Foulis, 1973). Empirical logic is a formal mathematical system in which the notion of an operation is primitive and undefined; all other concepts are rigorously defined in terms of such operations (which are presumed to correspond to actual physical procedures). (Auth.)

Proceedings of the sixteenth international symposium on multiple-valued logic

International Nuclear Information System (INIS)

Anon.

1986-01-01

This book presents the papers given at a conference on the mathematical logic behind artificial intelligence and expert systems. Topics considered at the conference included logic programming, probability, memory processing, electro-optical effects, fuzzy logic, set theory, a fuzzy expert system based on relations, sequential machines, computerized simulation, and algorithms

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

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.

Knowledge discovery in variant databases using inductive logic programming.

Science.gov (United States)

Nguyen, Hoan; Luu, Tien-Dao; Poch, Olivier; Thompson, Julie D

2013-01-01

Understanding the effects of genetic variation on the phenotype of an individual is a major goal of biomedical research, especially for the development of diagnostics and effective therapeutic solutions. In this work, we describe the use of a recent knowledge discovery from database (KDD) approach using inductive logic programming (ILP) to automatically extract knowledge about human monogenic diseases. We extracted background knowledge from MSV3d, a database of all human missense variants mapped to 3D protein structure. In this study, we identified 8,117 mutations in 805 proteins with known three-dimensional structures that were known to be involved in human monogenic disease. Our results help to improve our understanding of the relationships between structural, functional or evolutionary features and deleterious mutations. Our inferred rules can also be applied to predict the impact of any single amino acid replacement on the function of a protein. The interpretable rules are available at http://decrypthon.igbmc.fr/kd4v/.

Logic Learning in Hopfield Networks

OpenAIRE

Sathasivam, Saratha; Abdullah, Wan Ahmad Tajuddin Wan

2008-01-01

Synaptic weights for neurons in logic programming can be calculated either by using Hebbian learning or by Wan Abdullah's method. In other words, Hebbian learning for governing events corresponding to some respective program clauses is equivalent with learning using Wan Abdullah's method for the same respective program clauses. In this paper we will evaluate experimentally the equivalence between these two types of learning through computer simulations.

Fictional Separation Logic

DEFF Research Database (Denmark)

Jensen, Jonas Buhrkal; Birkedal, Lars

2012-01-01

, separation means physical separation. In this paper, we introduce \\emph{fictional separation logic}, which includes more general forms of fictional separating conjunctions P * Q, where "*" does not require physical separation, but may also be used in situations where the memory resources described by P and Q...

For society, state and self: juggling the logics of professionalism in general practice appraisal.

Science.gov (United States)

Entwistle, Tom; Matthews, Elaine

2015-11-01

Sociologists repeatedly appeal to notions of altruism, bureaucratisation and self interest in their efforts to explain the changing place of the professions in contemporary society. We treat these three readings as institutional logics that are key to understanding the way in which doctors respond to the appraisal system at the heart of the UK's approach to revalidation. Our analysis of a survey of 998 general practitioners (GPs) working in Wales finds an altruistic commitment to learning and improvement, bureaucratic demands for reporting information and self-regarding resentment of changes in the occupational package provided by general practice. But the data also demonstrate that the maintenance of the appraisal regime is dependent on the preparedness and capacity of individual GPs to do micro-level institutional work on all fronts. © 2015 Foundation for the Sociology of Health & Illness.

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

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.

Modifications to River Protection Project (RPP) Level -0 Logic

International Nuclear Information System (INIS)

SEEMAN, S.E.

2000-01-01

The following modifications were made to the River Protection Project Level-0 logic in going from Rev. I to Rev. 2. The first change was the change to the heading at the top of the drawing: ''TWRS Program Logic'' to ''River Protection Project Mission Logic''. Note that purely format changes (e.g., fonts, location of boxes, date format, addition of numbers to ''ghost'' boxes) are not discussed. However, the major format change was to show DOE-BNFL Inc. Interface Control Documents (ICDs) on the logic

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.

On Continuous Distributions and Parameter Estimation in Probabilistic Logic Programs (Over continue verdelingen en het schatten van parameters in probabilistische logische programma's)

OpenAIRE

Gutmann, Bernd

2011-01-01

In the last decade remarkable progress has been made on combining statistical machine learning techniques, reasoning under uncertainty, and relational representations. The branch of Artificial Intelligence working on the synthesis of these three areas is known as statistical relational learning or probabilistic logic learning.ProbLog, one of the probabilistic frameworks developed, is an extension of the logic programming language Prolog with independent random variables that are defined by an...

Fuzzy Logic in Medicine and Bioinformatics

Directory of Open Access Journals (Sweden)

Angela Torres

2006-01-01

Full Text Available The purpose of this paper is to present a general view of the current applications of fuzzy logic in medicine and bioinformatics. We particularly review the medical literature using fuzzy logic. We then recall the geometrical interpretation of fuzzy sets as points in a fuzzy hypercube and present two concrete illustrations in medicine (drug addictions and in bioinformatics (comparison of genomes.

Identification of tumor evolution patterns by means of inductive logic programming.

Science.gov (United States)

Bevilacqua, Vitoantonio; Chiarappa, Patrizia; Mastronardi, Giuseppe; Menolascina, Filippo; Paradiso, Angelo; Tommasi, Stefania

2008-06-01

In considering key events of genomic disorders in the development and progression of cancer, the correlation between genomic instability and carcinogenesis is currently under investigation. In this work, we propose an inductive logic programming approach to the problem of modeling evolution patterns for breast cancer. Using this approach, it is possible to extract fingerprints of stages of the disease that can be used in order to develop and deliver the most adequate therapies to patients. Furthermore, such a model can help physicians and biologists in the elucidation of molecular dynamics underlying the aberrations-waterfall model behind carcinogenesis. By showing results obtained on a real-world dataset, we try to give some hints about further approach to the knowledge-driven validations of such hypotheses.

A practical introduction to fuzzy logic using LISP

CERN Document Server

Argüelles Mendez, Luis

2016-01-01

This book makes use of the LISP programming language to provide readers with the necessary background to understand and use fuzzy logic to solve simple to medium-complexity real-world problems. It introduces the basics of LISP required to use a Fuzzy LISP programming toolbox, which was specifically implemented by the author to “teach” the theory behind fuzzy logic and at the same time equip readers to use their newly-acquired knowledge to build fuzzy models of increasing complexity. The book fills an important gap in the literature, providing readers with a practice-oriented reference guide to fuzzy logic that offers more complexity than popular books yet is more accessible than other mathematical treatises on the topic. As such, students in first-year university courses with a basic tertiary mathematical background and no previous experience with programming should be able to easily follow the content. The book is intended for students and professionals in the fields of computer science and engineering, ...

A logic programming approach to medical errors in imaging.

Science.gov (United States)

Rodrigues, Susana; Brandão, Paulo; Nelas, Luís; Neves, José; Alves, Victor

2011-09-01

In 2000, the Institute of Medicine reported disturbing numbers on the scope it covers and the impact of medical error in the process of health delivery. Nevertheless, a solution to this problem may lie on the adoption of adverse event reporting and learning systems that can help to identify hazards and risks. It is crucial to apply models to identify the adverse events root causes, enhance the sharing of knowledge and experience. The efficiency of the efforts to improve patient safety has been frustratingly slow. Some of this insufficiency of progress may be assigned to the lack of systems that take into account the characteristic of the information about the real world. In our daily lives, we formulate most of our decisions normally based on incomplete, uncertain and even forbidden or contradictory information. One's knowledge is less based on exact facts and more on hypothesis, perceptions or indications. From the data collected on our adverse event treatment and learning system on medical imaging, and through the use of Extended Logic Programming to knowledge representation and reasoning, and the exploitation of new methodologies for problem solving, namely those based on the perception of what is an agent and/or multi-agent systems, we intend to generate reports that identify the most relevant causes of error and define improvement strategies, concluding about the impact, place of occurrence, form or type of event recorded in the healthcare institutions. The Eindhoven Classification Model was extended and adapted to the medical imaging field and used to classify adverse events root causes. Extended Logic Programming was used for knowledge representation with defective information, allowing for the modelling of the universe of discourse in terms of data and knowledge default. A systematization of the evolution of the body of knowledge about Quality of Information embedded in the Root Cause Analysis was accomplished. An adverse event reporting and learning system

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

Two Notions of Compactness in Gödel Logics

Czech Academy of Sciences Publication Activity Database

Cintula, Petr

2005-01-01

Roč. 81, č. 1 (2005), s. 99-123 ISSN 0039-3215 R&D Projects: GA ČR GD401/03/H047 Institutional research plan: CEZ:AV0Z10300504 Keywords : logic * Gödel logic * compactness * entailment * satisfiability Subject RIV: BA - General Mathematics

Classical Syllogisms in Logic Teaching

DEFF Research Database (Denmark)

Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar

2013-01-01

This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy students...... have a tendency correctly to assess valid syllogisms as such more often than correctly assessing invalid syllogisms as such. It is also investigated to what extent the students have improved their skills in practical reasoning by attending the logic courses. Finally, some open questions regarding...

Programmable Array Logic Design

International Nuclear Information System (INIS)

Demon Handoyo; Djen Djen Djainal

2007-01-01

Good digital circuit design that part of a complex system, often becoming a separate problem. To produce finishing design according to wanted performance is often given on to considerations which each other confuse, hence thereby analyse optimization become important in this case. To realization is made design logic program, the first are determined global diagram block, then are decided contents of these block diagram, and then determined its interconnection in the form of logic expression, continued with election of component. These steps are done to be obtained the design with low price, easy in its interconnection, minimal volume, low power and certainty god work. (author)

Generalized internal multiple imaging

KAUST Repository

Zuberi, Mohammad Akbar Hosain

2014-12-04

Various examples are provided for generalized internal multiple imaging (GIMI). In one example, among others, a method includes generating a higher order internal multiple image using a background Green\\'s function and rendering the higher order internal multiple image for presentation. In another example, a system includes a computing device and a generalized internal multiple imaging (GIMI) application executable in the computing device. The GIMI application includes logic that generates a higher order internal multiple image using a background Green\\'s function and logic that renders the higher order internal multiple image for display on a display device. In another example, a non-transitory computer readable medium has a program executable by processing circuitry that generates a higher order internal multiple image using a background Green\\'s function and renders the higher order internal multiple image for display on a display device.

Generalized internal multiple imaging

KAUST Repository

Zuberi, Mohammad Akbar Hosain; Alkhalifah, Tariq

2014-01-01

Various examples are provided for generalized internal multiple imaging (GIMI). In one example, among others, a method includes generating a higher order internal multiple image using a background Green's function and rendering the higher order internal multiple image for presentation. In another example, a system includes a computing device and a generalized internal multiple imaging (GIMI) application executable in the computing device. The GIMI application includes logic that generates a higher order internal multiple image using a background Green's function and logic that renders the higher order internal multiple image for display on a display device. In another example, a non-transitory computer readable medium has a program executable by processing circuitry that generates a higher order internal multiple image using a background Green's function and renders the higher order internal multiple image for display on a display device.

What is "the patient perspective" in patient engagement programs? Implicit logics and parallels to feminist theories.

Science.gov (United States)

Rowland, Paula; McMillan, Sarah; McGillicuddy, Patti; Richards, Joy

2017-01-01

Public and patient involvement (PPI) in health care may refer to many different processes, ranging from participating in decision-making about one's own care to participating in health services research, health policy development, or organizational reforms. Across these many forms of public and patient involvement, the conceptual and theoretical underpinnings remain poorly articulated. Instead, most public and patient involvement programs rely on policy initiatives as their conceptual frameworks. This lack of conceptual clarity participates in dilemmas of program design, implementation, and evaluation. This study contributes to the development of theoretical understandings of public and patient involvement. In particular, we focus on the deployment of patient engagement programs within health service organizations. To develop a deeper understanding of the conceptual underpinnings of these programs, we examined the concept of "the patient perspective" as used by patient engagement practitioners and participants. Specifically, we focused on the way this phrase was used in the singular: "the" patient perspective or "the" patient voice. From qualitative analysis of interviews with 20 patient advisers and 6 staff members within a large urban health network in Canada, we argue that "the patient perspective" is referred to as a particular kind of situated knowledge, specifically an embodied knowledge of vulnerability. We draw parallels between this logic of patient perspective and the logic of early feminist theory, including the concepts of standpoint theory and strong objectivity. We suggest that champions of patient engagement may learn much from the way feminist theorists have constructed their arguments and addressed critique.

Denotational World-indexed Logical Relations and Friends

DEFF Research Database (Denmark)

Thamsborg, Jacob Junker

and solve the fundamental type-worlds circularity by metric-space theory. This approach scales to state-of-theart step-indexed techniques and permits unrestricted relational reasoning by the use of so-called Bohr relations. Along the way, we develop auxiliary theory; most notably a generalized version...... of separation logic with assertion variables. In particular, we give criteria for when standard, unary separation logic proofs lift to the binary setting. Phrased dierently, given a module-dependent client and a standard separation logic proof of its correctness, we ponder the default question of representation...

An Arbitrary First Order Theory Can Be Represented by a Program: A Theorem

Science.gov (United States)

Hosheleva, Olga

1997-01-01

How can we represent knowledge inside a computer? For formalized knowledge, classical logic seems to be the most adequate tool. Classical logic is behind all formalisms of classical mathematics, and behind many formalisms used in Artificial Intelligence. There is only one serious problem with classical logic: due to the famous Godel's theorem, classical logic is algorithmically undecidable; as a result, when the knowledge is represented in the form of logical statements, it is very difficult to check whether, based on this statement, a given query is true or not. To make knowledge representations more algorithmic, a special field of logic programming was invented. An important portion of logic programming is algorithmically decidable. To cover knowledge that cannot be represented in this portion, several extensions of the decidable fragments have been proposed. In the spirit of logic programming, these extensions are usually introduced in such a way that even if a general algorithm is not available, good heuristic methods exist. It is important to check whether the already proposed extensions are sufficient, or further extensions is necessary. In the present paper, we show that one particular extension, namely, logic programming with classical negation, introduced by M. Gelfond and V. Lifschitz, can represent (in some reasonable sense) an arbitrary first order logical theory.

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

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

Design of synthetic biological logic circuits based on evolutionary algorithm.

Science.gov (United States)

Chuang, Chia-Hua; Lin, Chun-Liang; Chang, Yen-Chang; Jennawasin, Tanagorn; Chen, Po-Kuei

2013-08-01

The construction of an artificial biological logic circuit using systematic strategy is recognised as one of the most important topics for the development of synthetic biology. In this study, a real-structured genetic algorithm (RSGA), which combines general advantages of the traditional real genetic algorithm with those of the structured genetic algorithm, is proposed to deal with the biological logic circuit design problem. A general model with the cis-regulatory input function and appropriate promoter activity functions is proposed to synthesise a wide variety of fundamental logic gates such as NOT, Buffer, AND, OR, NAND, NOR and XOR. The results obtained can be extended to synthesise advanced combinational and sequential logic circuits by topologically distinct connections. The resulting optimal design of these logic gates and circuits are established via the RSGA. The in silico computer-based modelling technology has been verified showing its great advantages in the purpose.

Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics

Czech Academy of Sciences Publication Activity Database

Přenosil, Adam

2017-01-01

Roč. 105, č. 6 (2017), s. 1255-1289 ISSN 0039-3215 R&D Projects: GA ČR GBP202/12/G061 EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 Keywords : Super-Belnap logic s * Dunn–Belnap logic * Logic of Paradox * Strong Kleene logic * Exactly True Logic * Gentzen calculus * Cut elimination * Identity elimination * Interpolation 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

Logical operations realized on the Ising chain of N qubits

International Nuclear Information System (INIS)

Asano, Masanari; Tateda, Norihiro; Ishii, Chikara

2004-01-01

Multiqubit logical gates are proposed as implementations of logical operations on N qubits realized physically by the local manipulation of qubits before and after the one-time evolution of an Ising chain. This construction avoids complicated tuning of the interactions between qubits. The general rules of the action of multiqubit logical gates are derived by decomposing the process into the product of two-qubit logical operations. The formalism is demonstrated by the construction of a special type of multiqubit logical gate that is simulated by a quantum circuit composed of controlled-NOT gates

Knowledge discovery for pancreatic cancer using inductive logic programming.

Science.gov (United States)

Qiu, Yushan; Shimada, Kazuaki; Hiraoka, Nobuyoshi; Maeshiro, Kensei; Ching, Wai-Ki; Aoki-Kinoshita, Kiyoko F; Furuta, Koh

2014-08-01

Pancreatic cancer is a devastating disease and predicting the status of the patients becomes an important and urgent issue. The authors explore the applicability of inductive logic programming (ILP) method in the disease and show that the accumulated clinical laboratory data can be used to predict disease characteristics, and this will contribute to the selection of therapeutic modalities of pancreatic cancer. The availability of a large amount of clinical laboratory data provides clues to aid in the knowledge discovery of diseases. In predicting the differentiation of tumour and the status of lymph node metastasis in pancreatic cancer, using the ILP model, three rules are developed that are consistent with descriptions in the literature. The rules that are identified are useful to detect the differentiation of tumour and the status of lymph node metastasis in pancreatic cancer and therefore contributed significantly to the decision of therapeutic strategies. In addition, the proposed method is compared with the other typical classification techniques and the results further confirm the superiority and merit of the proposed method.

Using logic models in a community-based agricultural injury prevention project.

Science.gov (United States)

Helitzer, Deborah; Willging, Cathleen; Hathorn, Gary; Benally, Jeannie

2009-01-01

The National Institute for Occupational Safety and Health has long promoted the logic model as a useful tool in an evaluator's portfolio. Because a logic model supports a systematic approach to designing interventions, it is equally useful for program planners. Undertaken with community stakeholders, a logic model process articulates the underlying foundations of a particular programmatic effort and enhances program design and evaluation. Most often presented as sequenced diagrams or flow charts, logic models demonstrate relationships among the following components: statement of a problem, various causal and mitigating factors related to that problem, available resources to address the problem, theoretical foundations of the selected intervention, intervention goals and planned activities, and anticipated short- and long-term outcomes. This article describes a case example of how a logic model process was used to help community stakeholders on the Navajo Nation conceive, design, implement, and evaluate agricultural injury prevention projects.

CONCEPT OF SUSTAINABILITY – A LOGICAL APPROACH

Directory of Open Access Journals (Sweden)

EMIL DINGA

2011-04-01

Full Text Available The paper aims to achieve a definition of the concept of sustainability and of sustainable system from a logical perspective. In this respect, it introduces and defines (through the sufficiency predicates the concept of logically vivid system and, on this basis, are discussed a logical concept of sustainability, respectively of a sustainable system in general are discussed and built up. Sustainability is considered in light of identity preservation of the systems, as a static anchor, on one hand, and of the concept of automatic stabilizers as a dynamic anchor on the other side. Finally, the two sufficiency conditions for a logically vivid system be sustainable are identified: the presence of hyper-cycles, respectively the absence of positive feed-back.

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

Oak Ridge National Laboratory Technology Logic Diagram. Volume 2, Technology Logic Diagram: Part B, Remedial Action

Energy Technology Data Exchange (ETDEWEB)

1993-09-01

The Oak Ridge National Laboratory Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates environmental restoration (ER) and waste management (WM) problems at Oak Ridge National Laboratory (ORNL) to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration, testing, and evaluation needed to develop these technologies to a state that allows technology transfer and application to decontamination and decommissioning (D&D), remedial action (RA), and WM activities. The TLD consists of three fundamentally separate volumes: Vol. 1 (Technology Evaluation), Vol. 2 (Technology Logic Diagram), and Vol. 3 (Technology Evaluation Data Sheets). Part A of Vols. 1. and 2 focuses on D&D. Part B of Vols. 1 and 2 focuses on the RA of contaminated facilities. Part C of Vols. 1 and 2 focuses on WM. Each part of Vol. 1 contains an overview of the TLD, an explanation of the program-specific responsibilities, a review of identified technologies, and the rankings of remedial technologies. Volume 2 (Pts. A, B, and C) contains the logic linkages among EM goals, environmental problems, and the various technologies that have the potential to solve these problems. Volume 3 (Pts. A, B, and C) contains the TLD data sheets. Remedial action is the focus of Vol. 2, Pt. B, which has been divided into the three necessary subelements of the RA: characterization, RA, and robotics and automation. Each of these sections address general ORNL problems, which are then broken down by problem area/constituents and linked to potential remedial technologies. The diagrams also contain summary information about a technology`s status, its science and technology needs, and its implementation needs.

Discovering H-bonding rules in crystals with inductive logic programming.

Science.gov (United States)

Ando, Howard Y; Dehaspe, Luc; Luyten, Walter; Van Craenenbroeck, Elke; Vandecasteele, Henk; Van Meervelt, Luc

2006-01-01

In the domain of crystal engineering, various schemes have been proposed for the classification of hydrogen bonding (H-bonding) patterns observed in 3D crystal structures. In this study, the aim is to complement these schemes with rules that predict H-bonding in crystals from 2D structural information only. Modern computational power and the advances in inductive logic programming (ILP) can now provide computational chemistry with the opportunity for extracting structure-specific rules from large databases that can be incorporated into expert systems. ILP technology is here applied to H-bonding in crystals to develop a self-extracting expert system utilizing data in the Cambridge Structural Database of small molecule crystal structures. A clear increase in performance was observed when the ILP system DMax was allowed to refer to the local structural environment of the possible H-bond donor/acceptor pairs. This ability distinguishes ILP from more traditional approaches that build rules on the basis of global molecular properties.

Concrete quantum logics with covering properties

Science.gov (United States)

Müller, Vladimir; Pták, Pavel; Tkadlec, Josef

1992-05-01

Let L be a concrete (=set-representable) quantum logic. Let n be a natural number (or, more generally, a cardinal). We say that L admits intrinsic coverings of the order n, and write L∈ C n , if for any pair A, B∈L we can find a collection { C i ∶ i∈ I}, where card IJauch-Piron states). We then consider conditions on which a class of concrete logics reduce to Boolean algebras. We conclude with some open questions.

A Verification Study on the Loop-Breaking Logic of FTREX

International Nuclear Information System (INIS)

Choi, Jong Soo

2008-01-01

The logical loop problem in fault tree analysis (FTA) has been solved by manually or automatically breaking their circular logics. The breaking of logical loops is one of uncertainty sources in fault tree analyses. A practical method which can verify fault tree analysis results was developed by Choi. The method has the capability to handle logical loop problems. It has been implemented in a FORTRAN program which is called VETA (Verification and Evaluation of fault Tree Analysis results) code. FTREX, a well-known fault tree quantifier developed by KAERI, has an automatic loop-breaking logic. In order to make certain of the correctness of the loop-breaking logic of FTREX, some typical trees with complex loops are developed and applied to this study. This paper presents some verification results of the loop-breaking logic tested by the VETA code

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

FTAP, Minimal Cut Sets of Arbitrary Fault Trees. FRTPLT, Fault Tree Structure and Logical Gates Plot for Program FTAP. FRTGEN, Fault Trees by Sub-tree Generator from Parent Tree for Program FTAP

International Nuclear Information System (INIS)

Willie, Randall R.; Rabien, U.

1997-01-01

1 - Description of problem or function: FTAP is a general-purpose program for deriving minimal reliability cut and path set families from the fault tree for a complex system. The program has a number of useful features that make it well-suited to nearly all fault tree applications. An input fault tree may specify the system state as any logical function of subsystem or component state variables or complements of these variables; thus, for instance, 'exclusive-or' type relations may be formed. When fault tree logical relations involve complements of state variables, the analyst may instruct FTAP to produce a family of prime implicants, a generalization of the minimal cut set concept. The program offers the flexibility of several distinct methods of generating cut set families. FTAP can also identify certain subsystems as system modules and provide a collection of minimal cut set families that essentially expresses the system state as a function of these module state variables. Another feature allows a useful subfamily to be obtained when the family of minimal cut sets or prime implicants is too large to be found in its entirety; this subfamily may consist of only those sets not containing more than some fixed number of elements or only those sets 'interesting' to the analyst in some special sense. Finally, the analyst can modify the input fault tree in various ways by declaring state variables identically true or false. 2 - Method of solution: Fault tree methods are based on the observation that the system state, either working or failed, can usually be expressed as a Boolean relation between states of several large, readily identifiable subsystems. The state of each subsystem in turn depends on states of simpler subsystems and components which compose it, so that the state of the system itself is determined by a hierarchy of logical relationships between states of subsystems. A fault tree is a graphical representation of these relationships. 3 - Restrictions on the

A discriminative method for family-based protein remote homology detection that combines inductive logic programming and propositional models.

Science.gov (United States)

Bernardes, Juliana S; Carbone, Alessandra; Zaverucha, Gerson

2011-03-23

Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequence alignments (MSA), including all positions. However, when we deal with proteins in the "twilight zone" we can observe that only some segments of sequences (motifs) are conserved. We introduce a novel logical representation that allows us to represent physico-chemical properties of sequences, conserved amino acid positions and conserved physico-chemical positions in the MSA. From this, Inductive Logic Programming (ILP) finds the most frequent patterns (motifs) and uses them to train propositional models, such as decision trees and support vector machines (SVM). We use the SCOP database to perform our experiments by evaluating protein recognition within the same superfamily. Our results show that our methodology when using SVM performs significantly better than some of the state of the art methods, and comparable to other. However, our method provides a comprehensible set of logical rules that can help to understand what determines a protein function. The strategy of selecting only the most frequent patterns is effective for the remote homology detection. This is possible through a suitable first-order logical representation of homologous properties, and through a set of frequent patterns, found by an ILP system, that summarizes essential features of protein functions.

Structural logical relations with case analysis and equality reasoning

DEFF Research Database (Denmark)

Rasmussen, Ulrik Terp; Filinski, Andrzej

2013-01-01

requires the assertion logic to be extended with reasoning principles not present in the original presentation of the formalization method. We address this by generalizing the assertion logic to include dependent sorts, and demonstrate that the original cut elimination proof continues to apply without...

The Semantic Isomorphism Theorem in Abstract Algebraic Logic

Czech Academy of Sciences Publication Activity Database

Moraschini, Tommaso

2016-01-01

Roč. 167, č. 12 (2016), s. 1298-1331 ISSN 0168-0072 R&D Projects: GA ČR GA13-14654S Institutional support: RVO:67985807 Keywords : algebra izable logics * abstract algebra ic logic * structural closure operators * semantic isomorphism theorem * evaluational frames * compositional lattice Subject RIV: BA - General Mathematics Impact factor: 0.647, year: 2016

A Note on the Notion of Truth in Fuzzy Logic

Czech Academy of Sciences Publication Activity Database

Hájek, Petr; Shepherdson, J.

2001-01-01

Roč. 109, 1-2 (2001), s. 65-69 ISSN 0168-0072 Institutional research plan: AV0Z1030915 Keywords : many-valued logic * fuzzy logic Subject RIV: BA - General Mathematics Impact factor: 0.519, year: 2001

National Waste Terminal Storage Program: management and technical program plan, FY 1976--FY 1978

International Nuclear Information System (INIS)

1976-01-01

The discussion on the management plan covers the program, responsibilities, general program schedule and logic, Office of Waste Isolation organization and facilities, management approach, administrative plan, and public affairs plan. The technical program plan includes geological studies, technical support studies, engineering studies, waste facility projects, environmental studies, system studies, data management, and international activities. The information contained in this report is obsolete and of historical interest only

Representation of molecular structure using quantum topology with inductive logic programming in structure-activity relationships.

Science.gov (United States)

Buttingsrud, Bård; Ryeng, Einar; King, Ross D; Alsberg, Bjørn K

2006-06-01

The requirement of aligning each individual molecule in a data set severely limits the type of molecules which can be analysed with traditional structure activity relationship (SAR) methods. A method which solves this problem by using relations between objects is inductive logic programming (ILP). Another advantage of this methodology is its ability to include background knowledge as 1st-order logic. However, previous molecular ILP representations have not been effective in describing the electronic structure of molecules. We present a more unified and comprehensive representation based on Richard Bader's quantum topological atoms in molecules (AIM) theory where critical points in the electron density are connected through a network. AIM theory provides a wealth of chemical information about individual atoms and their bond connections enabling a more flexible and chemically relevant representation. To obtain even more relevant rules with higher coverage, we apply manual postprocessing and interpretation of ILP rules. We have tested the usefulness of the new representation in SAR modelling on classifying compounds of low/high mutagenicity and on a set of factor Xa inhibitors of high and low affinity.

Epistemic logic and explicit knowledge in distributed programming

NARCIS (Netherlands)

Witzel, A.; Zvesper, J.A.; Padgham, L.; Parkes, D.; Müller, J.; Parsons, S.

2008-01-01

In this paper we propose an explicit form of knowledge-based programming. Our initial motivation is the distributed implementation of game-theoretical algorithms, but we abstract away from the game-theoretical details and describe a general scenario, where a group of agents each have some initially

Logical foundation of quantum mechanics

International Nuclear Information System (INIS)

Stachow, E.W.

1980-01-01

The subject of this article is the reconstruction of quantum mechanics on the basis of a formal language of quantum mechanical propositions. During recent years, research in the foundations of the language of science has given rise to a dialogic semantics that is adequate in the case of a formal language for quantum physics. The system of sequential logic which is comprised by the language is more general than classical logic; it includes the classical system as a special case. Although the system of sequential logic can be founded without reference to the empirical content of quantum physical propositions, it establishes an essential part of the structure of the mathematical formalism used in quantum mechanics. It is the purpose of this paper to demonstrate the connection between the formal language of quantum physics and its representation by mathematical structures in a self-contained way. (author)

Optical three-step binary-logic-gate-based MSD arithmetic

Science.gov (United States)

Fyath, R. S.; Alsaffar, A. A. W.; Alam, M. S.

2003-11-01

A three-step modified signed-digit (MSD) adder is proposed which can be optically implmented using binary logic gates. The proposed scheme depends on encoding each MSD digits into a pair of binary digits using a two-state and multi-position based encoding scheme. The design algorithm depends on constructing the addition truth table of binary-coded MSD numbers and then using Karnaugh map to achieve output minimization. The functions associated with the optical binary logic gates are achieved by simply programming the decoding masks of an optical shadow-casting logic system.

CIFOL: Case-intensional first order logic. (I) Toward a theory of sorts

NARCIS (Netherlands)

Belnap, Nuel; Müller, Thomas

2012-01-01

This is Part I of a two-part essay introducing case-intensional first-order logic (CIFOL), an easy-to-use, uniform, powerful, and useful combination of first order logic with modal logic resulting from philosophical and technical modifications of Bressan’s General interpreted modal calculus (Yale

An Inductive Logic Programming Approach to Validate Hexose Binding Biochemical Knowledge.

Science.gov (United States)

Nassif, Houssam; Al-Ali, Hassan; Khuri, Sawsan; Keirouz, Walid; Page, David

2010-01-01

Hexoses are simple sugars that play a key role in many cellular pathways, and in the regulation of development and disease mechanisms. Current protein-sugar computational models are based, at least partially, on prior biochemical findings and knowledge. They incorporate different parts of these findings in predictive black-box models. We investigate the empirical support for biochemical findings by comparing Inductive Logic Programming (ILP) induced rules to actual biochemical results. We mine the Protein Data Bank for a representative data set of hexose binding sites, non-hexose binding sites and surface grooves. We build an ILP model of hexose-binding sites and evaluate our results against several baseline machine learning classifiers. Our method achieves an accuracy similar to that of other black-box classifiers while providing insight into the discriminating process. In addition, it confirms wet-lab findings and reveals a previously unreported Trp-Glu amino acids dependency.

Brain Computation Is Organized via Power-of-Two-Based Permutation Logic

Science.gov (United States)

Xie, Kun; Fox, Grace E.; Liu, Jun; Lyu, Cheng; Lee, Jason C.; Kuang, Hui; Jacobs, Stephanie; Li, Meng; Liu, Tianming; Song, Sen; Tsien, Joe Z.

2016-01-01

There is considerable scientific interest in understanding how cell assemblies—the long-presumed computational motif—are organized so that the brain can generate intelligent cognition and flexible behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic (N = 2i–1), producing specific-to-general cell-assembly architecture capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based permutation logic is widely used in cortical and subcortical circuits across animal species and is conserved for the processing of a variety of cognitive modalities including appetitive, emotional and social information. However, modulatory neurons, such as dopaminergic (DA) neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact although NMDA receptors—the synaptic switch for learning and memory—were deleted throughout adulthood, suggesting that the logic is developmentally pre-configured. Moreover, this computational logic is implemented in the cortex via combining a random-connectivity strategy in superficial layers 2/3 with nonrandom organizations in deep layers 5/6. This randomness of layers 2/3 cliques—which preferentially encode specific and low-combinatorial features and project inter-cortically—is ideal for maximizing cross-modality novel pattern-extraction, pattern-discrimination and pattern-categorization using sparse code, consequently explaining why it requires hippocampal offline-consolidation. In contrast, the nonrandomness in layers 5/6—which consists of few specific cliques but a higher portion of more general cliques projecting mostly to subcortical systems—is ideal for feedback-control of motivation, emotion, consciousness and behaviors. These observations suggest that the brain’s basic computational

Geometrical considerations in the transient ionization testing of digital logic circuits

International Nuclear Information System (INIS)

Johnston, A.

1982-01-01

Mechanisms are identified that can cause the transient response of digital logic circuits to depend on the logic state in which they are irradiated. Several of these mechanisms depend on surface topology, and for these cases the sensitive logic states can be determined by examining the topology. General approaches for transient radiation testing are also discussed for several MSI and LSI device technologies

The Logic of Equivalence in Academic Discourse?

DEFF Research Database (Denmark)

Madsen, Dorte

2017-01-01

of discourse to distinguish between the scientific field, where interrelationships among academic disciplines are taken as an object of research, and the widespread uses of ‘interdisciplinary’ and ‘interdisciplinarity’ in academic discourse more generally, typically for legitimation purposes. The assumption......-discourses meet. It is suggested that the logics of signification, and the tension between difference and equivalence, may be important tools for theorizing this borderland. It is argued that whereas the logic of equivalence and the production of empty signifiers appears to be of marginal interest...... to the scientific field, the logic of difference as a more complex articulation of elements, seems to be more in line with the ideals of academic discourse....

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

Representations of Multiple-Valued Logic Functions

CERN Document Server

Stankovic, Radomir S

2012-01-01

Compared to binary switching functions, multiple-valued functions offer more compact representations of the information content of signals modeled by logic functions and, therefore, their use fits very well in the general settings of data compression attempts and approaches. The first task in dealing with such signals is to provide mathematical methods for their representation in a way that will make their application in practice feasible.Representation of Multiple-Valued Logic Functions is aimed at providing an accessible introduction to these mathematical techniques that are necessary for ap

PLQP & Company: Decidable Logics for Quantum Algorithms

Science.gov (United States)

Baltag, Alexandru; Bergfeld, Jort; Kishida, Kohei; Sack, Joshua; Smets, Sonja; Zhong, Shengyang

2014-10-01

We introduce a probabilistic modal (dynamic-epistemic) quantum logic PLQP for reasoning about quantum algorithms. We illustrate its expressivity by using it to encode the correctness of the well-known quantum search algorithm, as well as of a quantum protocol known to solve one of the paradigmatic tasks from classical distributed computing (the leader election problem). We also provide a general method (extending an idea employed in the decidability proof in Dunn et al. (J. Symb. Log. 70:353-359, 2005)) for proving the decidability of a range of quantum logics, interpreted on finite-dimensional Hilbert spaces. We give general conditions for the applicability of this method, and in particular we apply it to prove the decidability of PLQP.

Note on Deduction Theorems in contraction-free logics

Czech Academy of Sciences Publication Activity Database

Chvalovský, Karel; Cintula, Petr

2012-01-01

Roč. 58, č. 3 (2012), s. 236-243 ISSN 0942-5616 R&D Projects: GA ČR GAP202/10/1826 Grant - others:Austrian Science Fund (FWF)(AT) START Y544-N23 Institutional research plan: CEZ:AV0Z10300504 Keywords : Local Deduction Theorem * BCI-logic * Substructural logics * Rule of contraction Subject RIV: BA - General Mathematics Impact factor: 0.376, year: 2012

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

INTEGRATED PROGRAMMATIC ENVIRONMENT OF THE DEPARTMENTAL OF MATHEMATICAL LOGIC OF «MATLOG»

Directory of Open Access Journals (Sweden)

Yurii I. Sinko

2010-09-01

Full Text Available The article deals with the introduction of new information technologies into the process of mathematical logic learning at the Kherson State University. The basic components of program system of mathematical logic learning are considered.

Programmable logic control applied to a coal preparation plant complex

Energy Technology Data Exchange (ETDEWEB)

Krahenbil, L W

1979-02-01

The programmable Logic Controller (PLC), at its present stage of evolution, is now considered as a mature control system. The PLC combines the solid-state reliability of hard-wired logic and computer control systems with the simplicity of a relay ladder logic. Relay symbolic programming through a function-oriented keyboard provides a means which plant personnel can easily become accoustomed to work with. In a large coal facility, it is shown that the control engineer can provide improved control flexibility with the advanced capabilities of the PLC.

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

Complexity of Some Language Fragments of Fuzzy Logics

Czech Academy of Sciences Publication Activity Database

Haniková, Zuzana

2017-01-01

Roč. 21, č. 1 (2017), s. 69-77 ISSN 1432-7643 R&D Projects: GA ČR GAP202/11/1632 Institutional support: RVO:67985807 Keywords : fuzzy logic * propositional logic * language fragment * implicational fragment * commutative semigroup * equational theory * computational complexity 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: 2.472, year: 2016

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

A defeasible reasoning approach for description logic ontologies

CSIR Research Space (South Africa)

Moodley, K

2012-10-01

Full Text Available Classical reasoning for logic-based KR (Knowledge Representation) systems is in general, monotonic. That is, there is an assumption in these systems that there is complete information about a domain. This means that they generally cannot deal...

Fuzzy logic and intelligent technologies in nuclear science

International Nuclear Information System (INIS)

Ruan, D.

1998-01-01

The research project on Fuzzy Logic and Intelligent technologies (FLINS) aims to bridge the gap between novel technologies and the nuclear industry. It aims to initiate research and development programs for solving intricate problems pertaining to the nuclear environment by using modern technologies as additional tool. The major achievements for 1997 include the application of the fuzzy-logic to the BR-1 reactor, the elaboration of a Fuzzy-control model as well as contributions to several workshops and publications

DNAzyme-Based Logic Gate-Mediated DNA Self-Assembly.

Science.gov (United States)

Zhang, Cheng; Yang, Jing; Jiang, Shuoxing; Liu, Yan; Yan, Hao

2016-01-13

Controlling DNA self-assembly processes using rationally designed logic gates is a major goal of DNA-based nanotechnology and programming. Such controls could facilitate the hierarchical engineering of complex nanopatterns responding to various molecular triggers or inputs. Here, we demonstrate the use of a series of DNAzyme-based logic gates to control DNA tile self-assembly onto a prescribed DNA origami frame. Logic systems such as "YES," "OR," "AND," and "logic switch" are implemented based on DNAzyme-mediated tile recognition with the DNA origami frame. DNAzyme is designed to play two roles: (1) as an intermediate messenger to motivate downstream reactions and (2) as a final trigger to report fluorescent signals, enabling information relay between the DNA origami-framed tile assembly and fluorescent signaling. The results of this study demonstrate the plausibility of DNAzyme-mediated hierarchical self-assembly and provide new tools for generating dynamic and responsive self-assembly systems.

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

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

Brain computation is organized via power-of-two-based permutation logic

Directory of Open Access Journals (Sweden)

Kun Xie

2016-11-01

Full Text Available There is considerable scientific interest in understanding how cell assemblies - the long-presumed computational motif - are organized so that the brain can generate cognitive behavior. The Theory of Connectivity proposes that the origin of intelligence is rooted in a power-of-two-based permutation logic (N=2i–1, giving rise to the specific-to-general cell-assembly organization capable of generating specific perceptions and memories, as well as generalized knowledge and flexible actions. We show that this power-of-two-based computational logic is widely used in cortical and subcortical circuits across animal species and is conserved for the processing of a variety of cognitive modalities including appetitive, emotional and social cognitions. However, modulatory neurons, such as dopaminergic neurons, use a simpler logic despite their distinct subtypes. Interestingly, this specific-to-general permutation logic remained largely intact despite the NMDA receptors – the synaptic switch for learning and memory – were deleted throughout adulthood, suggesting that it is likely developmentally pre-configured. Moreover, this logic is implemented in the cortex vertically via combining a random-connectivity strategy in superficial layers 2/3 with nonrandom organizations in deep layers 5/6. This randomness of layers 2/3 cliques – which preferentially encode specific and low-combinatorial features and project inter-cortically – is ideal for maximizing cross-modality novel pattern-extraction, pattern-discrimination, and pattern-categorization using sparse code, consequently explaining why it requires hippocampal offline-consolidation. In contrast, the non-randomness in layers 5/6 - which consists of few specific cliques but a higher portion of more general cliques projecting mostly to subcortical systems – is ideal for robust feedback-control of motivation, emotion, consciousness, and behaviors. These observations suggest that the brain’s basic

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.

Modal extensions of Lukasiewicz logic for modelling coalitional power

Czech Academy of Sciences Publication Activity Database

Kroupa, Tomáš; Teheux, B.

2017-01-01

Roč. 27, č. 1 (2017), s. 129-154 ISSN 0955-792X R&D Projects: GA ČR GAP402/12/1309 Institutional support: RVO:67985556 Keywords : Coalition Logic * Lukasiewicz modal logic * effectivity function Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.909, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/kroupa-0471671.pdf

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.

Interval logic. Proof theory and theorem proving

DEFF Research Database (Denmark)

Rasmussen, Thomas Marthedal

2002-01-01

of a direction of an interval, and present a sound and complete Hilbert proof system for it. Because of its generality, SIL can conveniently act as a general formalism in which other interval logics can be encoded. We develop proof theory for SIL including both a sequent calculus system and a labelled natural...

Logic qualification of FPGA-based safety-related I and C systems

International Nuclear Information System (INIS)

Hayashi, Toshifumi; Oda, Naotaka; Ito, Toshiaki; Miyazaki, Tadashi; Haren, Yasuhiko

2009-01-01

We established a logic qualification method for FPGA-Based I and C safety-related use in Nuclear Power Plants Systems. The FPGA is a programmable logic device and has advantages that the programming is rigorous, simple verifiable, and the technology is stable. However, logic qualification of FPGA had been an issue to be solved when it is used in the safety-related systems, because FPGA is relatively new technology for the nuclear power industry. We employed a software-life cycle approach, because its development process is similar to that of conventional computer-based systems. There are some differences between the FPGA-Based systems and the computer-based systems in the implementation and integration of logic. We examined the FPGA logic implementation and integration process to identify any FPGA-Based system specific hazards. The identified hazards are (1) small logic errors, (2) timing errors, (3) logic synthesis errors, (4) place and route errors, and (5) logic embedding errors. We took the appropriate countermeasures to mitigate these hazards, and employed this logic qualification method in the qualification of the Power Range Monitor System for BWR Power Plants. (author)

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

Expanding Basic Fuzzy Logic with Truth Constants for Component Delimiters

Czech Academy of Sciences Publication Activity Database

Haniková, Zuzana

2012-01-01

Roč. 197, 16 June (2012), s. 95-107 ISSN 0165-0114 R&D Projects: GA ČR GEICC/08/E018 Institutional research plan: CEZ:AV0Z10300504 Keywords : mathematics * non-classical logics * algebra * basic fuzzy logic BL * propositional constants Subject RIV: BA - General Mathematics Impact factor: 1.749, year: 2012

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.

Rewriting Logic Semantics of a Plan Execution Language

Science.gov (United States)

Dowek, Gilles; Munoz, Cesar A.; Rocha, Camilo

2009-01-01

The Plan Execution Interchange Language (PLEXIL) is a synchronous language developed by NASA to support autonomous spacecraft operations. In this paper, we propose a rewriting logic semantics of PLEXIL in Maude, a high-performance logical engine. The rewriting logic semantics is by itself a formal interpreter of the language and can be used as a semantic benchmark for the implementation of PLEXIL executives. The implementation in Maude has the additional benefit of making available to PLEXIL designers and developers all the formal analysis and verification tools provided by Maude. The formalization of the PLEXIL semantics in rewriting logic poses an interesting challenge due to the synchronous nature of the language and the prioritized rules defining its semantics. To overcome this difficulty, we propose a general procedure for simulating synchronous set relations in rewriting logic that is sound and, for deterministic relations, complete. We also report on the finding of two issues at the design level of the original PLEXIL semantics that were identified with the help of the executable specification in Maude.

Pecan Research and Outreach in New Mexico: Logic Model Development and Change in Communication Paradigms

Science.gov (United States)

Sammis, Theodore W.; Shukla, Manoj K.; Mexal, John G.; Wang, Junming; Miller, David R.

2013-01-01

Universities develop strategic planning documents, and as part of that planning process, logic models are developed for specific programs within the university. This article examines the long-standing pecan program at New Mexico State University and the deficiencies and successes in the evolution of its logic model. The university's agricultural…

75 FR 34093 - Information Collection; General Program Administration

Science.gov (United States)

2010-06-16

... Administration AGENCY: Farm Service Agency, USDA. ACTION: Notice; request for comments. SUMMARY: In accordance... supports Farm Loan Programs (FLP) for the General Program Administration. DATES: We will consider comments.... SUPPLEMENTARY INFORMATION: Title: Farm Loan Programs--General Program Administration (7 CFR part 761). OMB...

Automated logic conversion method for plant controller systems

International Nuclear Information System (INIS)

Wada, Yutaka; Kobayashi, Yasuhiro; Miyo, Tsunemasa; Okano, Masato.

1990-01-01

An automated method is proposed for logic conversion from functional description diagrams to detailed logic schematics by incorporating expertise knowledge in plant controller systems design. The method uses connection data of function elements in the functional description diagram as input, and synthesizes a detailed logic structure by adding elements to the given connection data incrementally, and to generate detailed logic schematics. In logic synthesis, for building up complex synthesis procedures by combining generally-described knowledge, knowledge is applied by groups. The search order of the groups is given by upper-level knowledge. Furthermore, the knowledge is expressed in terms of two classes of rules; one for generating a hypothesis of individual synthesis operations and the other for considering several hypotheses to determine the connection ordering of elements to be added. In the generation of detailed logic schematics, knowledge is used as rules for deriving various kinds of layout conditions on schematics, and rules for generating two-dimensional coordinates of layout objects. Rules in the latter class use layout conditions to predict intersections among layout objects without their coordinates being fixed. The effectiveness of the method with 150 rules was verified by its experimental application to some logic conversions in a real power plant design. Evaluation of the results showed them to be equivalent to those obtained by well qualified designers. (author)

Magnetic Logic Circuits for Extreme Environments, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — The program aims to demonstrate a new genre of all-magnetic logic circuits which are radiation-tolerant and capable of reliable operation in extreme environmental...

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

Tensor product of no-signaling boxes in the framework of quantum logics

International Nuclear Information System (INIS)

Tylec, T I; Kuś, M

2017-01-01

In the quantum logic framework we show that the no-signaling box model is a particular type of tensor product with single box logics. Such notion of a tensor product is too strong to apply in the category of logics of quantum mechanical systems. In the light of the obtained results, the statement that no-signaling box models are generalizations of quantum models is questionable. (letter)

Modern Logical Frameworks Design

DEFF Research Database (Denmark)

Murawska, Agata Anna

2017-01-01

lack support for reasoning about, or programming with, the mechanised systems. Our main motivation is to eventually make it possible to model and reason about complex concurrent systems and protocols. No matter the application, be it the development of a logic for multiparty session types...... or a cryptographic protocol used in a voting system, we need the ability to model and reason about both the building blocks of these systems and the intricate connections between them. To this end, this dissertation is an investigation into LF-based formalisms that might help address the aforementioned issues. We...... design and provide the meta-theory of two new frameworks, HyLF and Lincx. The former aims to extend the expressiveness of LF to include proof irrelevance and some user-defined behaviours, using ideas from hybrid logics. The latter is a showcase for an easier to implement framework, while also allowing...

Inferential Role and the Ideal of Deductive Logic

Directory of Open Access Journals (Sweden)

Thomas Hofweber

2010-11-01

Full Text Available Although there is a prima facie strong case for a close connection between the meaning and inferential role of certain expressions, this connection seems seriously threatened by the semantic and logical paradoxes which rely on these inferential roles. Some philosophers have drawn radical conclusions from the paradoxes for the theory of meaning in general, and for which sentences in our language are true. I criticize these overreactions, and instead propose to distinguish two conceptions of inferential role. This distinction is closely tied to two conceptions of deductive logic, and it is the key, I argue, for understanding first the connection between meaning and inferential role, and second what the paradoxes show more generally.

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…

Stereotypical Reasoning: Logical Properties

OpenAIRE

Lehmann, Daniel

2002-01-01

Stereotypical reasoning assumes that the situation at hand is one of a kind and that it enjoys the properties generally associated with that kind of situation. It is one of the most basic forms of nonmonotonic reasoning. A formal model for stereotypical reasoning is proposed and the logical properties of this form of reasoning are studied. Stereotypical reasoning is shown to be cumulative under weak assumptions.

Code conversion from signed-digit to complement representation based on look-ahead optical logic operations

Science.gov (United States)

Li, Guoqiang; Qian, Feng

2001-11-01

We present, for the first time to our knowledge, a generalized lookahead logic algorithm for number conversion from signed-digit to complement representation. By properly encoding the signed-digits, all the operations are performed by binary logic, and unified logical expressions can be obtained for conversion from modified-signed- digit (MSD) to 2's complement, trinary signed-digit (TSD) to 3's complement, and quarternary signed-digit (QSD) to 4's complement. For optical implementation, a parallel logical array module using an electron-trapping device is employed and experimental results are shown. This optical module is suitable for implementing complex logic functions in the form of the sum of the product. The algorithm and architecture are compatible with a general-purpose optoelectronic computing system.

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.

The Effect of Scratch- and Lego Mindstorms Ev3-Based Programming Activities on Academic Achievement, Problem-Solving Skills and Logical-Mathematical Thinking Skills of Students

Science.gov (United States)

Korkmaz, Özgen

2016-01-01

The aim of this study was to investigate the effect of the Scratch and Lego Mindstorms Ev3 programming activities on academic achievement with respect to computer programming, and on the problem-solving and logical-mathematical thinking skills of students. This study was a semi-experimental, pretest-posttest study with two experimental groups and…

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

Truth-as-simulation : towards a coalgebraic perspective on logic and games

NARCIS (Netherlands)

A. Baltag

1999-01-01

textabstractBuilding on the work of L. Moss on coalgebraic logic, I study in a general setting a class of infinitary modal logics for F-coalgebras, designed to capture simulation and bisimulation. For a notion of coalgebraic simulation, I use the work of A. Thijs on modelling simulation in terms of

Engineering a General Education Program: Designing Mechanical Engineering General Education Courses

Science.gov (United States)

Fagette, Paul; Chen, Shih-Jiun; Baran, George R.; Samuel, Solomon P.; Kiani, Mohammad F.

2013-01-01

The Department of Mechanical Engineering at our institution created two engineering courses for the General Education Program that count towards second level general science credit (traditional science courses are first level). The courses were designed for the general student population based upon the requirements of our General Education Program…

Reversible arithmetic logic unit for quantum arithmetic

DEFF Research Database (Denmark)

Thomsen, Michael Kirkedal; Glück, Robert; Axelsen, Holger Bock

2010-01-01

This communication presents the complete design of a reversible arithmetic logic unit (ALU) that can be part of a programmable reversible computing device such as a quantum computer. The presented ALU is garbage free and uses reversible updates to combine the standard reversible arithmetic...... and logical operations in one unit. Combined with a suitable control unit, the ALU permits the construction of an r-Turing complete computing device. The garbage-free ALU developed in this communication requires only 6n elementary reversible gates for five basic arithmetic-logical operations on two n......-bit operands and does not use ancillae. This remarkable low resource consumption was achieved by generalizing the V-shape design first introduced for quantum ripple-carry adders and nesting multiple V-shapes in a novel integrated design. This communication shows that the realization of an efficient reversible...

General-purpose RFQ design program

International Nuclear Information System (INIS)

Wadlinger, E.A.

1984-01-01

We have written a general-purpose, radio-frequency quadrupole (RFQ) design program that allows maximum flexibility in picking design algorithms. This program optimizes the RFQ on any combination of design parameters while simultaneously satisfying mutually compatible, physically required constraint equations. It can be very useful for deriving various scaling laws for RFQs. This program has a friendly user interface in addition to checking the consistency of the user-defined requirements and is written to minimize the effort needed to incorporate additional constraint equations. We describe the program and present some examples

Locality-preserving logical operators in topological stabilizer codes

Science.gov (United States)

Webster, Paul; Bartlett, Stephen D.

2018-01-01

Locality-preserving logical operators in topological codes are naturally fault tolerant, since they preserve the correctability of local errors. Using a correspondence between such operators and gapped domain walls, we describe a procedure for finding all locality-preserving logical operators admitted by a large and important class of topological stabilizer codes. In particular, we focus on those equivalent to a stack of a finite number of surface codes of any spatial dimension, where our procedure fully specifies the group of locality-preserving logical operators. We also present examples of how our procedure applies to codes with different boundary conditions, including color codes and toric codes, as well as more general codes such as Abelian quantum double models and codes with fermionic excitations in more than two dimensions.

Designing Experiments to Discriminate Families of Logic Models.

Science.gov (United States)

Videla, Santiago; Konokotina, Irina; Alexopoulos, Leonidas G; Saez-Rodriguez, Julio; Schaub, Torsten; Siegel, Anne; Guziolowski, Carito

2015-01-01

Logic models of signaling pathways are a promising way of building effective in silico functional models of a cell, in particular of signaling pathways. The automated learning of Boolean logic models describing signaling pathways can be achieved by training to phosphoproteomics data, which is particularly useful if it is measured upon different combinations of perturbations in a high-throughput fashion. However, in practice, the number and type of allowed perturbations are not exhaustive. Moreover, experimental data are unavoidably subjected to noise. As a result, the learning process results in a family of feasible logical networks rather than in a single model. This family is composed of logic models implementing different internal wirings for the system and therefore the predictions of experiments from this family may present a significant level of variability, and hence uncertainty. In this paper, we introduce a method based on Answer Set Programming to propose an optimal experimental design that aims to narrow down the variability (in terms of input-output behaviors) within families of logical models learned from experimental data. We study how the fitness with respect to the data can be improved after an optimal selection of signaling perturbations and how we learn optimal logic models with minimal number of experiments. The methods are applied on signaling pathways in human liver cells and phosphoproteomics experimental data. Using 25% of the experiments, we obtained logical models with fitness scores (mean square error) 15% close to the ones obtained using all experiments, illustrating the impact that our approach can have on the design of experiments for efficient model calibration.

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

Reconciling pairs of concurrently used clinical practice guidelines using Constraint Logic Programming.

Science.gov (United States)

Wilk, Szymon; Michalowski, Martin; Michalowski, Wojtek; Hing, Marisela Mainegra; Farion, Ken

2011-01-01

This paper describes a new methodological approach to reconciling adverse and contradictory activities (called points of contention) occurring when a patient is managed according to two or more concurrently used clinical practice guidelines (CPGs). The need to address these inconsistencies occurs when a patient with more than one disease, each of which is a comorbid condition, has to be managed according to different treatment regimens. We propose an automatic procedure that constructs a mathematical guideline model using the Constraint Logic Programming (CLP) methodology, uses this model to identify and mitigate encountered points of contention, and revises the considered CPGs accordingly. The proposed procedure is used as an alerting mechanism and coupled with a guideline execution engine warns the physician about potential problems with the concurrent application of two or more guidelines. We illustrate the operation of our procedure in a clinical scenario describing simultaneous use of CPGs for duodenal ulcer and transient ischemic attack.

YakYak: Parsing with Logical Side Constraints

DEFF Research Database (Denmark)

Hansen, Niels Damgaard; Klarlund, Nils; Schwartzbach, Michael Ignatieff

2000-01-01

Yak, which extends Yacc with first-order logic for specifying consteaints that are regular tree languages. Concise formulas about the parse tree replace explicit programming, and they are turned into canonical attribute grammars through tree automata calculations. YakYak is implemented as a proprocessor...

The REGENT-PLR-precompiler, execution logic

International Nuclear Information System (INIS)

Enderle, G.; Steil, A.

1976-11-01

The REGENT-PLR-Precompiler is part of the integrated CAD-system REGENT. The algorithms of REGENT-subsystems are contained in modular program units, modules. Beyond the possibilities of the base language PL/1 the programmer of the moduls can be use the REGENT-facilities; dynamic program linkage, dynamic data management and error message handling. For easy and safe use of these facilities they are realized as PL/1-extensions. The PLR-Precompiler is able to translate the extensions into PL/1. This report contains a description of the internal program logic of the REGENT-PLR-Precompiler. (orig.) [de

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

Empirical logic and tensor products

International Nuclear Information System (INIS)

Foulis, D.J.; Randall, C.H.

1981-01-01

In our work we are developing a formalism called empirical logic to support a generalization of conventional statistics; the resulting generalization is called operational statistics. We are not attempting to develop or advocate any particular physical theory; rather we are formulating a precision 'language' in which such theories can be expressed, compared, evaluated, and related to laboratory experiments. We believe that only in such a language can the connections between real physical procedures (operations) and physical theories be made explicit and perspicuous. (orig./HSI)

22 CFR 62.8 - General program requirements.

Science.gov (United States)

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false General program requirements. 62.8 Section 62.8 Foreign Relations DEPARTMENT OF STATE PUBLIC DIPLOMACY AND EXCHANGES EXCHANGE VISITOR PROGRAM General... purpose of sharing the language, culture, or history of their home country with Americans, provided such...

A Concurrent Logical Relation

DEFF Research Database (Denmark)

Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker

2012-01-01

We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number....... To the best of our knowledge, this is the first such result for a concurrent higher-order language with higher-order store and dynamic memory allocation....

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

76 FR 36566 - Notice of Submission of Proposed Information Collection to OMB “Logic Model” Grant Performance...

Science.gov (United States)

2011-06-22

... Proposed Information Collection to OMB ``Logic Model'' Grant Performance Report Standard AGENCY: Office of... lists the following information: Title of Proposal: ``Logic Model'' Grant Performance Report Standard. OMB Approval Number: 2535-0114. Form Numbers: HUD 96010, each program utilizing the Logic Model will...

Nonlinear dynamics based digital logic and circuits.

Science.gov (United States)

Kia, Behnam; Lindner, John F; Ditto, William L

2015-01-01

We discuss the role and importance of dynamics in the brain and biological neural networks and argue that dynamics is one of the main missing elements in conventional Boolean logic and circuits. We summarize a simple dynamics based computing method, and categorize different techniques that we have introduced to realize logic, functionality, and programmability. We discuss the role and importance of coupled dynamics in networks of biological excitable cells, and then review our simple coupled dynamics based method for computing. In this paper, for the first time, we show how dynamics can be used and programmed to implement computation in any given base, including but not limited to base two.

A generalized perturbation program for CANDU reactor

Energy Technology Data Exchange (ETDEWEB)

Kim, Do Heon; Kim, Jong Kyung [Hanyang University, Seoul (Korea, Republic of); Choi, Hang Bok; Roh, Gyu Hong [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Yang, Won Sik [Chosun University, Kwangju (Korea, Republic of)

1999-12-31

A generalized perturbation program has been developed for the purpose of estimating zonal power variation of a CANDU reactor upon refueling operation. The forward and adjoint calculation modules of RFSP code were used to construct the generalized perturbation program. The numerical algorithm for the generalized adjoint flux calculation was verified by comparing the zone power estimates upon refueling with those of forward calculation. It was, however, noticed that the truncation error from the iteration process of the generalized adjoint flux is not negligible. 2 refs., 1 figs., 1 tab. (Author)

A generalized perturbation program for CANDU reactor

Energy Technology Data Exchange (ETDEWEB)

Kim, Do Heon; Kim, Jong Kyung [Hanyang University, Seoul (Korea, Republic of); Choi, Hang Bok; Roh, Gyu Hong [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Yang, Won Sik [Chosun University, Kwangju (Korea, Republic of)

1998-12-31

A generalized perturbation program has been developed for the purpose of estimating zonal power variation of a CANDU reactor upon refueling operation. The forward and adjoint calculation modules of RFSP code were used to construct the generalized perturbation program. The numerical algorithm for the generalized adjoint flux calculation was verified by comparing the zone power estimates upon refueling with those of forward calculation. It was, however, noticed that the truncation error from the iteration process of the generalized adjoint flux is not negligible. 2 refs., 1 figs., 1 tab. (Author)

Advanced Concepts in Fuzzy Logic and Systems with Membership Uncertainty

CERN Document Server

Starczewski, Janusz T

2013-01-01

This book generalizes fuzzy logic systems for different types of uncertainty, including - semantic ambiguity resulting from limited perception or lack of knowledge about exact membership functions - lack of attributes or granularity arising from discretization of real data - imprecise description of membership functions - vagueness perceived as fuzzification of conditional attributes. Consequently, the membership uncertainty can be modeled by combining methods of conventional and type-2 fuzzy logic, rough set theory and possibility theory.            In particular, this book provides a number of formulae for implementing the operation extended on fuzzy-valued fuzzy sets and presents some basic structures of generalized uncertain fuzzy logic systems, as well as introduces several of methods to generate fuzzy membership uncertainty. It is desirable as a reference book for under-graduates in higher education, master and doctor graduates in the courses of computer science, computational intelligence, or...

Integration of functions in logic database systems

NARCIS (Netherlands)

Lambrichts, E.; Nees, P.; Paredaens, J.; Peelman, P.; Tanca, L.

1990-01-01

We extend Datalog, a logic programming language for rule-based systems, by respectively integrating types, negation and functions. This extention of Datalog is called MilAnt. Furthermore, MilAnt consistency is defined as a stronger form of consistency for functions. It is known that consistency for

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

Abstract quantum computing machines and quantum computational logics

Science.gov (United States)

Chiara, Maria Luisa Dalla; Giuntini, Roberto; Sergioli, Giuseppe; Leporini, Roberto

2016-06-01

Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.

Experimental demonstration of programmable multi-functional spin logic cell based on spin Hall effect

Energy Technology Data Exchange (ETDEWEB)

Zhang, X.; Wan, C.H., E-mail: wancaihua@iphy.ac.cn; Yuan, Z.H.; Fang, C.; Kong, W.J.; Wu, H.; Zhang, Q.T.; Tao, B.S.; Han, X.F., E-mail: xfhan@iphy.ac.cn

2017-04-15

Confronting with the gigantic volume of data produced every day, raising integration density by reducing the size of devices becomes harder and harder to meet the ever-increasing demand for high-performance computers. One feasible path is to actualize more logic functions in one cell. In this respect, we experimentally demonstrate a prototype spin-orbit torque based spin logic cell integrated with five frequently used logic functions (AND, OR, NOT, NAND and NOR). The cell can be easily programmed and reprogrammed to perform desired function. Furthermore, the information stored in cells is symmetry-protected, making it possible to expand into logic gate array where the cell can be manipulated one by one without changing the information of other undesired cells. This work provides a prospective example of multi-functional spin logic cell with reprogrammability and nonvolatility, which will advance the application of spin logic devices. - Highlights: • Experimental demonstration of spin logic cell based on spin Hall effect. • Five logic functions are realized in a single logic cell. • The logic cell is reprogrammable. • Information in the cell is symmetry-protected. • The logic cell can be easily expanded to logic gate array.

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

Generalized Boolean logic Driven Markov Processes: A powerful modeling framework for Model-Based Safety Analysis of dynamic repairable and reconfigurable systems

International Nuclear Information System (INIS)

Piriou, Pierre-Yves; Faure, Jean-Marc; Lesage, Jean-Jacques

2017-01-01

This paper presents a modeling framework that permits to describe in an integrated manner the structure of the critical system to analyze, by using an enriched fault tree, the dysfunctional behavior of its components, by means of Markov processes, and the reconfiguration strategies that have been planned to ensure safety and availability, with Moore machines. This framework has been developed from BDMP (Boolean logic Driven Markov Processes), a previous framework for dynamic repairable systems. First, the contribution is motivated by pinpointing the limitations of BDMP to model complex reconfiguration strategies and the failures of the control of these strategies. The syntax and semantics of GBDMP (Generalized Boolean logic Driven Markov Processes) are then formally defined; in particular, an algorithm to analyze the dynamic behavior of a GBDMP model is developed. The modeling capabilities of this framework are illustrated on three representative examples. Last, qualitative and quantitative analysis of GDBMP models highlight the benefits of the approach.

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

Programmable logic controllers in Heavy Water Project, Manuguru (Paper No. 3.4)

International Nuclear Information System (INIS)

Gupta, S.C.; Bhaskar, R.; Maiti, A.; Venkatesu, G.; Satish, P.; Goel, R.K.

1992-01-01

Enhancement to plant operational flexibility has been achieved in Heavy Water Project, Manuguru by installing programmable logic controllers for its control equipment. The earlier sulfide based Heavy Water Plant, Kota is using relay logic and diode based program-matrix for binary controls. Performance improvement and advantages of PLC and experience in its operation are described. (author). 3 refs

GRAPHIC REALIZATION FOUNDATIONS OF LOGIC-SEMANTIC MODELING IN DIDACTICS

Directory of Open Access Journals (Sweden)

V. E. Steinberg

2017-01-01

Full Text Available Introduction. Nowadays, there are not a lot of works devoted to a graphic method of logic-semantic modeling of knowledge. Meanwhile, an interest towards this method increases due to the fact of essential increase of the content of visual component in information and educational sources. The present publication is the authors’ contribution into the solution of the problem of search of new forms and means convenient for visual and logic perception of a training material, its assimilation, operating by elements of knowledge and their transformations.The aim of the research is to justify graphical implementation of the method of logic-semantic modeling of knowledge, presented by a natural language (training language and to show the possibilities of application of figurative and conceptual models in student teaching.Methodology and research methods. The research methodology is based on the specified activity-regulatory, system-multi-dimensional and structural-invariant approach and the principle of multidimensionality. The methodology the graphic realization of the logic-semantic models in learning technologies is based on didactic design using computer training programs.Results and scientific novelty. Social and anthropological-cultural adaptation bases of the method of logical-semantic knowledge modeling to the problems of didactics are established and reasoned: coordinate-invariant matrix structure is presented as the basis of logical-semantic models of figurative and conceptual nature; the possibilities of using such models as multifunctional didactic regulators – support schemes, navigation in the content of the educational material, educational activities carried out by navigators, etc., are shown. The characteristics of new teaching tools as objects of semiotics and didactic of regulators are considered; their place and role in the structure of the external and internal training curricula learning activities are pointed out

Implementation of dataflow programming based Fuzzy Logic algorithm for gas concentration index in around of Sidoarjo mudflow, Indonesia

Directory of Open Access Journals (Sweden)

Widasari Edita Rosana

2018-01-01

Full Text Available Sidoarjo mudflow or known as Lapindo mudflow erupted since 2006. The Sidoarjo mudflow is located in Sidoarjo City, East Java, Indonesia. The mudflow-affected area has high air pollution level and high health risk. Therefore, in this paper was implemented a system that can categorize the level of air pollution into several categories. The air quality index can be categorized using fuzzy logic algorithm based on the concentration of air pollutant parameters in the mudflow-affected area. Furthermore, Dataflow programming is used to process the fuzzy logic algorithm. Based on the result, the measurement accuracy of the air quality index in the mudflow-affected area has an accuracy rate of 93.92% in Siring Barat, 93.34% in Mindi, and 95.96% in Jatirejo. The methane concentration is passes the standard quality even though the air quality index is safe. Hence, the area is indicated into Hazardous level. In addition, Mindi has highest and stable methane concentration. It means that Mindi has high-risk air pollution.

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.

[Resident evaluation of general surgery training programs].

Science.gov (United States)

Espinoza G, Ricardo; Danilla E, Stefan; Valdés G, Fabio; San Francisco R, Ignacio; Llanos L, Osvaldo

2009-07-01

The profile of the general surgeon has changed, aiming to incorporate new skills and to develop new specialties. To assess the quality of postgraduate General Surgery training programs given by Chilean universities, the satisfaction of students and their preferences after finishing the training period. A survey with multiple choice and Likert type questions was designed and applied to 77 surgery residents, corresponding to 59% of all residents of general surgery specialization programs of Chilean universities. Fifty five per cent of residents financed with their own resources the specialization program. Thirty nine percent disagreed partially or totally with the objectives and rotations of programs. The opportunity to perform surgical interventions and the support by teachers was well evaluated. However, 23% revealed teacher maltreatment. Fifty six percent performed research activities, 73% expected to continue training in a derived specialty and 69% was satisfied with the training program. Residents considered that the quality and dedication of professors and financing of programs are issues that must be improved. The opportunity to perform surgical interventions, obtaining a salary for their work and teacher support is considered of utmost importance.

Bicycle Frame Prediction Techniques with Fuzzy Logic Method

Directory of Open Access Journals (Sweden)

Rafiuddin Syam

2015-03-01

Full Text Available In general, an appropriate size bike frame would get comfort to the rider while biking. This study aims to predict the simulation system on the bike frame sizes with fuzzy logic. Testing method used is the simulation test. In this study, fuzzy logic will be simulated using Matlab language to test their performance. Mamdani fuzzy logic using 3 variables and 1 output variable intake. Triangle function for the input and output. The controller is designed in the type mamdani with max-min composition and the method deffuzification using center of gravity method. The results showed that height, inseam and Crank Size generating appropriate frame size for the rider associated with comfort. Has a height range between 142 cm and 201 cm. Inseam has a range between 64 cm and 97 cm. Crank has a size range between 175 mm and 180 mm. The simulation results have a range of frame sizes between 13 inches and 22 inches. By using the fuzzy logic can be predicted the size frame of bicycle suitable for the biker.

Bicycle Frame Prediction Techniques with Fuzzy Logic Method

Directory of Open Access Journals (Sweden)

Rafiuddin Syam

2017-03-01

Full Text Available In general, an appropriate size bike frame would get comfort to the rider while biking. This study aims to predict the simulation system on the bike frame sizes with fuzzy logic. Testing method used is the simulation test. In this study, fuzzy logic will be simulated using Matlab language to test their performance. Mamdani fuzzy logic using 3 variables and 1 output variable intake. Triangle function for the input and output. The controller is designed in the type mamdani with max-min composition and the method deffuzification using center of gravity method. The results showed that height, inseam and Crank Size generating appropriate frame size for the rider associated with comfort. Has a height range between 142 cm and 201 cm. Inseam has a range between 64 cm and 97 cm. Crank has a size range between 175 mm and 180 mm. The simulation results have a range of frame sizes between 13 inches and 22 inches. By using the fuzzy logic can be predicted the size frame of bicycle suitable for the biker.

LOGICAL CONDITIONS ANALYSIS METHOD FOR DIAGNOSTIC TEST RESULTS DECODING APPLIED TO COMPETENCE ELEMENTS PROFICIENCY

Directory of Open Access Journals (Sweden)

V. I. Freyman

2015-11-01

Full Text Available Subject of Research.Representation features of education results for competence-based educational programs are analyzed. Solution importance of decoding and proficiency estimation for elements and components of discipline parts of competences is shown. The purpose and objectives of research are formulated. Methods. The paper deals with methods of mathematical logic, Boolean algebra, and parametrical analysis of complex diagnostic test results, that controls proficiency of some discipline competence elements. Results. The method of logical conditions analysis is created. It will give the possibility to formulate logical conditions for proficiency determination of each discipline competence element, controlled by complex diagnostic test. Normalized test result is divided into noncrossing zones; a logical condition about controlled elements proficiency is formulated for each of them. Summarized characteristics for test result zones are imposed. An example of logical conditions forming for diagnostic test with preset features is provided. Practical Relevance. The proposed method of logical conditions analysis is applied in the decoding algorithm of proficiency test diagnosis for discipline competence elements. It will give the possibility to automate the search procedure for elements with insufficient proficiency, and is also usable for estimation of education results of a discipline or a component of competence-based educational program.

40 CFR 76.3 - General Acid Rain Program provisions.

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 16 2010-07-01 2010-07-01 false General Acid Rain Program provisions. 76.3 Section 76.3 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) ACID RAIN NITROGEN OXIDES EMISSION REDUCTION PROGRAM § 76.3 General Acid Rain Program provisions...

Reconstructing Generalized Logical Networks of Transcriptional Regulation in Mouse Brain from Temporal Gene Expression Data

Energy Technology Data Exchange (ETDEWEB)

Song, Mingzhou (Joe) [New Mexico State University, Las Cruces; Lewis, Chris K. [New Mexico State University, Las Cruces; Lance, Eric [New Mexico State University, Las Cruces; Chesler, Elissa J [ORNL; Kirova, Roumyana [Bristol-Myers Squibb Pharmaceutical Research & Development, NJ; Langston, Michael A [University of Tennessee, Knoxville (UTK); Bergeson, Susan [Texas Tech University, Lubbock

2009-01-01

The problem of reconstructing generalized logical networks to account for temporal dependencies among genes and environmental stimuli from high-throughput transcriptomic data is addressed. A network reconstruction algorithm was developed that uses the statistical significance as a criterion for network selection to avoid false-positive interactions arising from pure chance. Using temporal gene expression data collected from the brains of alcohol-treated mice in an analysis of the molecular response to alcohol, this algorithm identified genes from a major neuronal pathway as putative components of the alcohol response mechanism. Three of these genes have known associations with alcohol in the literature. Several other potentially relevant genes, highlighted and agreeing with independent results from literature mining, may play a role in the response to alcohol. Additional, previously-unknown gene interactions were discovered that, subject to biological verification, may offer new clues in the search for the elusive molecular mechanisms of alcoholism.

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

Project Management Plan for the INEL technology logic diagrams

International Nuclear Information System (INIS)

Rudin, M.J.

1992-10-01

This Project Management Plan (PjMP) describes the elements of project planning and control that apply to activities outlined in Technical Task Plan (TTP) ID-121117, ''Technology Logic Diagrams For The INEL.'' The work on this project will be conducted by personnel in EG ampersand G Idaho, Inc.'s Waste Technology Development Program. Technology logic diagrams represent a formal methodology to identify technology gaps or needs within Environmental Restoration/Waste Management Operations, which will focus on Office of Environmental Restoration and Waste Management (EM-50) research and development, demonstration, test, and evaluation efforts throughout the US Department of Energy complex. This PjMP describes the objectives, organization, roles and responsibilities, workscope and processes for implementing and managing the technology logic diagram for the Idaho National Engineering Laboratory project

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.

Leo Esakia on duality in modal and intuitionistic logics

CERN Document Server

Bezhanishvili, Guram

2014-01-01

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia's original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia's work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other re...

Logic-based aggregation methods for ranking student applicants

Directory of Open Access Journals (Sweden)

Milošević Pavle

2017-01-01

Full Text Available In this paper, we present logic-based aggregation models used for ranking student applicants and we compare them with a number of existing aggregation methods, each more complex than the previous one. The proposed models aim to include depen- dencies in the data using Logical aggregation (LA. LA is a aggregation method based on interpolative Boolean algebra (IBA, a consistent multi-valued realization of Boolean algebra. This technique is used for a Boolean consistent aggregation of attributes that are logically dependent. The comparison is performed in the case of student applicants for master programs at the University of Belgrade. We have shown that LA has some advantages over other presented aggregation methods. The software realization of all applied aggregation methods is also provided. This paper may be of interest not only for student ranking, but also for similar problems of ranking people e.g. employees, team members, etc.

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

A Fuzzy Logic Framework for Integrating Multiple Learned Models

Energy Technology Data Exchange (ETDEWEB)

Hartog, Bobi Kai Den [Univ. of Nebraska, Lincoln, NE (United States)

1999-03-01

The Artificial Intelligence field of Integrating Multiple Learned Models (IMLM) explores ways to combine results from sets of trained programs. Aroclor Interpretation is an ill-conditioned problem in which trained programs must operate in scenarios outside their training ranges because it is intractable to train them completely. Consequently, they fail in ways related to the scenarios. We developed a general-purpose IMLM solution, the Combiner, and applied it to Aroclor Interpretation. The Combiner's first step, Scenario Identification (M), learns rules from very sparse, synthetic training data consisting of results from a suite of trained programs called Methods. S1 produces fuzzy belief weights for each scenario by approximately matching the rules. The Combiner's second step, Aroclor Presence Detection (AP), classifies each of three Aroclors as present or absent in a sample. The third step, Aroclor Quantification (AQ), produces quantitative values for the concentration of each Aroclor in a sample. AP and AQ use automatically learned empirical biases for each of the Methods in each scenario. Through fuzzy logic, AP and AQ combine scenario weights, automatically learned biases for each of the Methods in each scenario, and Methods' results to determine results for a sample.

Reasoning about logical propositions and success in science

Science.gov (United States)

Piburn, Michael D.

1990-12-01

Students display a number of misconceptions when asked to reason about logical propositions. Rather than being random, these misconceptions are stereotypic, and relate to age, ability, and success in science. The grades in science achieved by tenth-grade general science students from two parochial single-sex schools in Australia correlated with their scores on the Propositional Logic Test. The students' ability level was consistently related to the pattern of errors they committed on that measure. Mean scores were lowest on a subtest of ability to use the biconditional and implication, higher on the disjunction, and highest on the conjunction. Success in science was predicted most strongly by the disjunction and biconditional subtests. Knowledge of the way in which a person reasons about logical propositions provides additional insights into the transformations information is subjected to as it is integrated into mental schemata.

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

Peptide Logic Circuits Based on Chemoenzymatic Ligation for Programmable Cell Apoptosis.

Science.gov (United States)

Li, Yong; Sun, Sujuan; Fan, Lin; Hu, Shanfang; Huang, Yan; Zhang, Ke; Nie, Zhou; Yao, Shouzhou

2017-11-20

A novel and versatile peptide-based bio-logic system capable of regulating cell function is developed using sortase A (SrtA), a peptide ligation enzyme, as a generic processor. By modular peptide design, we demonstrate that mammalian cells apoptosis can be programmed by peptide-based logic operations, including binary and combination gates (AND, INHIBIT, OR, and AND-INHIBIT), and a complex sequential logic circuit (multi-input keypad lock). Moreover, a proof-of-concept peptide regulatory circuit was developed to analyze the expression profile of cell-secreted protein biomarkers and trigger cancer-cell-specific apoptosis. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Neutrosophic Probability, Set, And Logic (first version)

OpenAIRE

Smarandache, Florentin

2000-01-01

This project is a part of a National Science Foundation interdisciplinary project proposal. Starting from a new viewpoint in philosophy, the neutrosophy, one extends the classical "probability theory", "fuzzy set" and "fuzzy logic" to , and respectively. They are useful in artificial intelligence, neural networks, evolutionary programming, neutrosophic dynamic systems, and quantum mechanics.

A logical approach to fuzzy truth hedges

Czech Academy of Sciences Publication Activity Database

Esteva, F.; Godo, L.; Noguera, Carles

2013-01-01

Roč. 232, č. 1 (2013), s. 366-385 ISSN 0020-0255 Institutional support: RVO:67985556 Keywords : Mathematical fuzzy logic * Standard completeness * Truth hedges Subject RIV: BA - General Mathematics Impact factor: 3.893, year: 2013 http://library.utia.cas.cz/separaty/2016/MTR/noguera-0469148.pdf

A Web Based Educational Programming Logic Controller Training Set Based on Vocational High School Students' Demands

Directory of Open Access Journals (Sweden)

Abdullah Alper Efe

2018-01-01

Full Text Available The purpose of this study was to design and develop aProgramming Logic Controller Training Set according to vocational high school students’ educational needs. In this regard, by using the properties of distance education the proposed system supported “hands-on” PLC programming laboratory exercises in industrial automation area. The system allowed students to access and control the PLC training set remotely. For this purpose, researcher designed a web site to facilitate students’ interactivity and support PLC programming. In the training set, Induction Motor, Frequency Converter and Encoder tripart controlled by Siemens Simatic S7-200 PLC controller by the help of SIMATIC Step 7 Programming Software were used to make the system more effective and efficient. Moreover, training set included an IP camera system allowing to monitor devices and pilot application. By working with this novel remote accessible training set, students and researchers recieved a chance to inhere self paced learning experiences. Also, The PLC training set offered an effective learning enviroenment for distance education, which is based on presenting the content on the web and opening it to the online users and provided a safe and economical solution for multiple users in a workplace to enhance the quality of education with less overall cost.

Planning using dynamic epistemic logic: Correspondence and complexity

DEFF Research Database (Denmark)

Jensen, Martin Holm

2013-01-01

A growing community investigates planning using dynamic epistemic logic. Another framework based on similar ideas is knowledge-based programs as plans. Here we show how actions correspond in the two frameworks. We finally discuss fragments of DEL planning obtained by the restriction of event models...

Introduction to type-2 fuzzy logic control theory and applications

CERN Document Server

Mendel, Jerry M; Tan, Woei-Wan; Melek, William W; Ying, Hao

2014-01-01

Written by world-class leaders in type-2 fuzzy logic control, this book offers a self-contained reference for both researchers and students. The coverage provides both background and an extensive literature survey on fuzzy logic and related type-2 fuzzy control. It also includes research questions, experiment and simulation results, and downloadable computer programs on an associated website. This key resource will prove useful to students and engineers wanting to learn type-2 fuzzy control theory and its applications.

Federal Educational Assistance Programs Available to Service Members: Program Features and Recommendations for Improved Delivery

Science.gov (United States)

2015-01-01

results suggest a need to modify the original program design or the logic model (W.K. Kellogg Foundation, 2010). Figure 3.1 outlines the proposed RAND... Kellogg Foundation, 2004). This logic model also illustrates a number of broader impacts. The expectation is that, ultimately, these programs will...Veterans Affairs. W.K. Kellogg Foundation, Using Logic Models to Bring Together Planning, Evaluation, and Action: Logic Model Development Guide

Completeness for flat modal fixpoint logics

NARCIS (Netherlands)

Santocanale, L.; Venema, Y.

2010-01-01

This paper exhibits a general and uniform method to prove axiomatic completeness for certain modal fixpoint logics. Given a set Γ of modal formulas of the form γ(x,p1,…,pn), where x occurs only positively in γ, we obtain the flat modal fixpoint language L♯(Γ) by adding to the language of polymodal

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

Universal file processing program for field programmable integrated circuits

International Nuclear Information System (INIS)

Freytag, D.R.; Nelson, D.J.

1985-01-01

A computer program is presented that translates logic equations into promburner files (or the reverse) for programmable logic devices of various kinds, namely PROMs FPLAs, FPLSs and PALs. The program achieves flexibility through the use of a database containing detailed information about the devices to be programmed. New devices can thus be accommodated through simple extensions of the database. When writing logic equations, the user can define logic combinations of signals as new logic variables for use in subsequent equations. This procedure yields compact and transparent expressions for logic operations, thus reducing the chances for error. A logic simulation program is also provided so that an independent check of the design can be performed at the software level

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.

A Practical Study of Control in Objected-Oriented–Functional–Logic Programming with Paisley

Directory of Open Access Journals (Sweden)

Baltasar Trancón y Widemann

2017-01-01

Full Text Available Paisley is an extensible lightweight embedded domain-specific language for nondeterministic pattern matching in Java. Using simple APIs and programming idioms, it brings the power of functional-logic processing of arbitrary data objects to the Java platform, without constraining the underlying object-oriented semantics. Here we present an extension to the Paisley framework that adds pattern-based control flow. It exploits recent additions to the Java language, namely functional interfaces and lambda expressions, for an explicit and transparent continuation-passing style approach to control. We evaluate the practical impact of the novel features on a real-world case study that reengineers a third-party open-source project to use Paisley in place of conventional object-oriented data query idioms. We find the approach viable for incremental refactoring of legacy code, with significant qualitative improvements regarding separation of concerns, clarity and intentionality, thus making for easier code understanding, testing and debugging.

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

Probabilistic Rule Generator: A new methodology of variable-valued logic synthesis

International Nuclear Information System (INIS)

Lee, W.D.; Ray, S.R.

1986-01-01

A new methodology to synthesize variable-valued logic formulas from training data events is presented. Probablistic Rule Generator (PRG) employs not only information-theoretic entropy as a heuristic to capture a path expression but also multiple-valued logic to expand a captured complex. PRG is efficient for capturing major clusters in the event space, and is more general than previous methodologies in providing probabilistic features

A Rewriting Logic Approach to Type Inference

Science.gov (United States)

Ellison, Chucky; Şerbănuţă, Traian Florin; Roşu, Grigore

Meseguer and Roşu proposed rewriting logic semantics (RLS) as a programing language definitional framework that unifies operational and algebraic denotational semantics. RLS has already been used to define a series of didactic and real languages, but its benefits in connection with defining and reasoning about type systems have not been fully investigated. This paper shows how the same RLS style employed for giving formal definitions of languages can be used to define type systems. The same term-rewriting mechanism used to execute RLS language definitions can now be used to execute type systems, giving type checkers or type inferencers. The proposed approach is exemplified by defining the Hindley-Milner polymorphic type inferencer mathcal{W} as a rewrite logic theory and using this definition to obtain a type inferencer by executing it in a rewriting logic engine. The inferencer obtained this way compares favorably with other definitions or implementations of mathcal{W}. The performance of the executable definition is within an order of magnitude of that of highly optimized implementations of type inferencers, such as that of OCaml.

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

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

Scaffold hopping in drug discovery using inductive logic programming.

Science.gov (United States)

Tsunoyama, Kazuhisa; Amini, Ata; Sternberg, Michael J E; Muggleton, Stephen H

2008-05-01

In chemoinformatics, searching for compounds which are structurally diverse and share a biological activity is called scaffold hopping. Scaffold hopping is important since it can be used to obtain alternative structures when the compound under development has unexpected side-effects. Pharmaceutical companies use scaffold hopping when they wish to circumvent prior patents for targets of interest. We propose a new method for scaffold hopping using inductive logic programming (ILP). ILP uses the observed spatial relationships between pharmacophore types in pretested active and inactive compounds and learns human-readable rules describing the diverse structures of active compounds. The ILP-based scaffold hopping method is compared to two previous algorithms (chemically advanced template search, CATS, and CATS3D) on 10 data sets with diverse scaffolds. The comparison shows that the ILP-based method is significantly better than random selection while the other two algorithms are not. In addition, the ILP-based method retrieves new active scaffolds which were not found by CATS and CATS3D. The results show that the ILP-based method is at least as good as the other methods in this study. ILP produces human-readable rules, which makes it possible to identify the three-dimensional features that lead to scaffold hopping. A minor variant of a rule learnt by ILP for scaffold hopping was subsequently found to cover an inhibitor identified by an independent study. This provides a successful result in a blind trial of the effectiveness of ILP to generate rules for scaffold hopping. We conclude that ILP provides a valuable new approach for scaffold hopping.

An Innovative Fuzzy-Logic-Based Methodology for Trend Identification

International Nuclear Information System (INIS)

Wang Xin; Tsoukalas, Lefteri H.; Wei, Thomas Y.C.; Reifman, Jaques

2001-01-01

A new fuzzy-logic-based methodology for on-line signal trend identification is introduced. The methodology may be used for detecting the onset of nuclear power plant (NPP) transients at the earliest possible time and could be of great benefit to diagnostic, maintenance, and performance-monitoring programs. Although signal trend identification is complicated by the presence of noise, fuzzy methods can help capture important features of on-line signals, integrate the information included in these features, and classify incoming NPP signals into increasing, decreasing, and steady-state trend categories. A computer program named PROTREN is developed and tested for the purpose of verifying this methodology using NPP and simulation data. The results indicate that the new fuzzy-logic-based methodology is capable of detecting transients accurately, it identifies trends reliably and does not misinterpret a steady-state signal as a transient one

SISTEM PENGEMBANGAN KENDALI FUZZY LOGIC BERBASIS MIKROKONTROLER KELUARGA MCS51 (PetraFuz

Directory of Open Access Journals (Sweden)

Thiang Thiang

1999-01-01

Full Text Available This paper presents a Fuzzy Logic Development Tool called PetraFuz which has been developed at Control System Laboratory, Electrical Engineering Department, Petra Christian University. The system consists of a hardware target based on MCS51 microcontroller and a software support running under PC Windows. The system is targeted for developing fuzzy logic based systems. It supports fuzzy logic design, evaluation, assembly language generator and downloading process to the target hardware to perform on-line fuzzy process. Process action and fuzzy parameters could be transferred to PC monitor via RS-232 serial communication, this on-line process parameters is used for fuzzy tuning, i.e. fuzzy if-then rules and fuzzy membership functions. The PetraFuz tool helps very much for Fuzzy system developments, it could reduce development time significantly. The tool could spur the development of fuzzy systems based on microcontroller systems such as fuzzy control systems, fuzzy information processing, etc. Abstract in Bahasa Indonesia : Makalah ini menyajikan sebuah sistem pengembangan kendali fuzzy logic (PetraFuz, Petra Fuzzy Development System yang dikembangkan oleh laboratorium Sistem Kontrol, Jurusan Teknik Elektro, Universitas Kristen Petra Surabaya. Sistem ini terdiri dari perangkat keras sistem mikrokontroler MCS51 dan perangkat lunak pendukung yang berjalan pada PC. Sistem PetraFuz digunakan untuk mengembangkan sistem berbasis fuzzy logic utamanya pada bidang kendali. Kemampuan sistem meliputi pengembangan pada fase perancangan kendali, evaluasi kendali, pembentukan program bahasa assembly MCS51 dan proses downloading program menuju target sistem mikrokontroler MCS51 untuk dieksekusi melakukan kendali pada plant yang nyata. Aksi kendali dapat diakuisi oleh program PC melalui komunikasi serial RS232 sehingga respon kendali dapat digambarkan pada layar monitor untuk dilakukan analisis lebih lanjut yang diperlukan pada proses tuning if-then fuzzy rules

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

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.

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.

Causal Mathematical Logic as a guiding framework for the prediction of "Intelligence Signals" in brain simulations

Science.gov (United States)

Lanzalaco, Felix; Pissanetzky, Sergio

2013-12-01

A recent theory of physical information based on the fundamental principles of causality and thermodynamics has proposed that a large number of observable life and intelligence signals can be described in terms of the Causal Mathematical Logic (CML), which is proposed to encode the natural principles of intelligence across any physical domain and substrate. We attempt to expound the current definition of CML, the "Action functional" as a theory in terms of its ability to possess a superior explanatory power for the current neuroscientific data we use to measure the mammalian brains "intelligence" processes at its most general biophysical level. Brain simulation projects define their success partly in terms of the emergence of "non-explicitly programmed" complex biophysical signals such as self-oscillation and spreading cortical waves. Here we propose to extend the causal theory to predict and guide the understanding of these more complex emergent "intelligence Signals". To achieve this we review whether causal logic is consistent with, can explain and predict the function of complete perceptual processes associated with intelligence. Primarily those are defined as the range of Event Related Potentials (ERP) which include their primary subcomponents; Event Related Desynchronization (ERD) and Event Related Synchronization (ERS). This approach is aiming for a universal and predictive logic for neurosimulation and AGi. The result of this investigation has produced a general "Information Engine" model from translation of the ERD and ERS. The CML algorithm run in terms of action cost predicts ERP signal contents and is consistent with the fundamental laws of thermodynamics. A working substrate independent natural information logic would be a major asset. An information theory consistent with fundamental physics can be an AGi. It can also operate within genetic information space and provides a roadmap to understand the live biophysical operation of the phenotype

Meaning and proscription in formal logic variations on the propositional logic of William T. Parry

CERN Document Server

Ferguson, Thomas Macaulay

2017-01-01

This book aids in the rehabilitation of the wrongfully deprecated work of William Parry, and is the only full-length investigation into Parry-type propositional logics. A central tenet of the monograph is that the sheer diversity of the contexts in which the mereological analogy emerges – its effervescence with respect to fields ranging from metaphysics to computer programming – provides compelling evidence that the study of logics of analytic implication can be instrumental in identifying connections between topics that would otherwise remain hidden. More concretely, the book identifies and discusses a host of cases in which analytic implication can play an important role in revealing distinct problems to be facets of a larger, cross-disciplinary problem. It introduces an element of constancy and cohesion that has previously been absent in a regrettably fractured field, shoring up those who are sympathetic to the worth of mereological analogy. Moreover, it generates new interest in the field by illustrat...

A Continuous Formulation for Logical Decisions in Differential Algebraic Systems using Mathematical Programs with Complementarity Constraints

Directory of Open Access Journals (Sweden)

Kody M. Powell

2016-03-01

Full Text Available This work presents a methodology to represent logical decisions in differential algebraic equation simulation and constrained optimization problems using a set of continuous algebraic equations. The formulations may be used when state variables trigger a change in process dynamics, and introduces a pseudo-binary decision variable, which is continuous, but should only have valid solutions at values of either zero or one within a finite time horizon. This formulation enables dynamic optimization problems with logical disjunctions to be solved by simultaneous solution methods without using methods such as mixed integer programming. Several case studies are given to illustrate the value of this methodology including nonlinear model predictive control of a chemical reactor using a surge tank with overflow to buffer disturbances in feed flow rate. Although this work contains novel methodologies for solving dynamic algebraic equation (DAE constrained problems where the system may experience an abrupt change in dynamics that may otherwise require a conditional statement, there remain substantial limitations to this methodology, including a limited domain where problems may converge and the possibility for ill-conditioning. Although the problems presented use only continuous algebraic equations, the formulation has inherent non-smoothness. Hence, these problems must be solved with care and only in select circumstances, such as in simulation or situations when the solution is expected to be near the solver’s initial point.

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.

When technological discontinuities and disruptive business models challenge dominant industry logics: insights from the drugs industry

OpenAIRE

Sabatier , Valérie; Kennard , Adrienne; Mangematin , Vincent

2012-01-01

Working paper serie RMT (WPS 12-04) - 39 p; International audience; An industry's dominant logic is the general scheme of value creation and capture shared by its actors. In high technology fields, technological discontinuities are not enough to disrupt an industry's dominant logic. Identifying the factors that might trigger change in that logic can help companies develop strategies to enable them to capture greater value from their innovations by disrupting that logic. Based on analyzing the...

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

Application of linear logic to simulation

Science.gov (United States)

Clarke, Thomas L.

1998-08-01

Linear logic, since its introduction by Girard in 1987 has proven expressive and powerful. Linear logic has provided natural encodings of Turing machines, Petri nets and other computational models. Linear logic is also capable of naturally modeling resource dependent aspects of reasoning. The distinguishing characteristic of linear logic is that it accounts for resources; two instances of the same variable are considered differently from a single instance. Linear logic thus must obey a form of the linear superposition principle. A proportion can be reasoned with only once, unless a special operator is applied. Informally, linear logic distinguishes two kinds of conjunction, two kinds of disjunction, and also introduces a modal storage operator that explicitly indicates propositions that can be reused. This paper discuses the application of linear logic to simulation. A wide variety of logics have been developed; in addition to classical logic, there are fuzzy logics, affine logics, quantum logics, etc. All of these have found application in simulations of one sort or another. The special characteristics of linear logic and its benefits for simulation will be discussed. Of particular interest is a connection that can be made between linear logic and simulated dynamics by using the concept of Lie algebras and Lie groups. Lie groups provide the connection between the exponential modal storage operators of linear logic and the eigen functions of dynamic differential operators. Particularly suggestive are possible relations between complexity result for linear logic and non-computability results for dynamical systems.

Multi-Valued Logic, Neutrosophy, and Schrödinger Equation

Science.gov (United States)

Smarandache, Florentin; Christianto, Victor

2017-04-01

Discussing some paradoxes in Quantum Mechanics from the viewpoint of Multi-Valued-logic pioneered by Lukasiewicz, and the recent concept Neutrosophic Logic. Essentially, this new concept offers new insights on the idea of `identity', which too often it has been accepted as given. Neutrosophy itself was developed in attempt to generalize Fuzzy-Logic introduced by L. Zadeh. The discussion is motivated by observation that despite almost eight decades, there is indication that some of those paradoxes known in Quantum Physics are not yet solved. In our knowledge, this is because the solution of those paradoxes requires re-examination of the foundations of logic itself, in particular on the notion of identity and multi-valuedness of entity. The discussion is also intended for young physicist fellows who think that somewhere there should be a `complete' explanation of these paradoxes in Quantum Mechanics. If this it doesn't answer all of their questions, it is our hope that at least it offers a new alternative viewpoint for these old questions.

Celf – A Logical Framework for Deductive and Concurrent Systems (System Description)

DEFF Research Database (Denmark)

Schack-Nielsen, Anders; Schürmann, Carsten

2008-01-01

CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security protocol analysis, process algebras, and logics. Celf is an implementation of the CLF type theory that extends the LF type...... ML and compiles with MLton, MLKit, and SML/NJ. The source code and a collection of examples are available from http://www.twelf.org/~celf ....

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)

Partial logics with two kinds of negation as a foundation for knowledge-based reasoning

NARCIS (Netherlands)

H. Herre; J.O.M. Jaspars; G. Wagner

1995-01-01

textabstractWe show how to use model classes of partial logic to define semantics of general knowledge-based reasoning. Its essential benefit is that partial logics allow us to distinguish two sorts of negative information: the absence of information and the explicit rejection or falsification of

A constraint logic programming approach to associate 1D and 3D structural components for large protein complexes.

Science.gov (United States)

Dal Palù, Alessandro; Pontelli, Enrico; He, Jing; Lu, Yonggang

2007-01-01

The paper describes a novel framework, constructed using Constraint Logic Programming (CLP) and parallelism, to determine the association between parts of the primary sequence of a protein and alpha-helices extracted from 3D low-resolution descriptions of large protein complexes. The association is determined by extracting constraints from the 3D information, regarding length, relative position and connectivity of helices, and solving these constraints with the guidance of a secondary structure prediction algorithm. Parallelism is employed to enhance performance on large proteins. The framework provides a fast, inexpensive alternative to determine the exact tertiary structure of unknown proteins.

Do Institutional Logics Predict Interpretation of Contract Rules at the Dental Chair-side?

DEFF Research Database (Denmark)

Harris, Rebecca; Brown, Stephen; Holt, Robin

2014-01-01

understands opportunism as fully rational, individual responses selecting maximally efficient outcomes from a set of possibilities. We take a more emotive and collective view of contracting, exploring the influence of institutional logics in relation to the opportunistic behaviour of dentists. Following...... earlier qualitative work where we identified four institutional logics in English general dental practice, and six dental contract areas where there was scope for opportunism; in 2013 we surveyed 924 dentists to investigate these logics and whether they had predictive purchase over dentists' chair...

A Reconfigurable Logic Cell Based on a Simple Dynamical System

Directory of Open Access Journals (Sweden)

Lixiang Li

2013-01-01