Logic programming extensions of Horn clause logic
Directory of Open Access Journals (Sweden)
Ron Sigal
1988-11-01
Full Text Available Logic programming is now firmly established as an alternative programming paradigm, distinct and arguably superior to the still dominant imperative style of, for instance, the Algol family of languages. The concept of a logic programming language is not precisely defined, but it is generally understood to be characterized buy: a declarative nature; foundation in some well understood logical system, e.g., first order logic.
1981-01-01
Rapport, Groupe Intelligence Pasero, R., Artificielle , Universite d’Aix-Marseille, Roussel, P. Luminy, France, 1973. [Kowalski 1974] Kowalski, R. A...THIS PAGZ(Whan Doee Es tMord) Item 20 (Cont’d) ------ work in the area of artificial intelligence and those used in general program development into a...logic programming with LISP for implementing intelligent data base query systems. Continued developments will allow for enhancements to be made to the
Quantum probabilistic logic programming
Balu, Radhakrishnan
2015-05-01
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
Abduction, ASP and Open Logic Programs
Bonatti, Piero A.
2002-01-01
Open logic programs and open entailment have been recently proposed as an abstract framework for the verification of incomplete specifications based upon normal logic programs and the stable model semantics. There are obvious analogies between open predicates and abducible predicates. However, despite superficial similarities, there are features of open programs that have no immediate counterpart in the framework of abduction and viceversa. Similarly, open programs cannot be immediately simul...
Program Theory Evaluation: Logic Analysis
Brousselle, Astrid; Champagne, Francois
2011-01-01
Program theory evaluation, which has grown in use over the past 10 years, assesses whether a program is designed in such a way that it can achieve its intended outcomes. This article describes a particular type of program theory evaluation--logic analysis--that allows us to test the plausibility of a program's theory using scientific knowledge.…
Some relationships between logic programming and multiple-valued logic
International Nuclear Information System (INIS)
Rine, D.C.
1986-01-01
There have been suggestions in the artificial intelligence literature that investigations into relationships between logic programming and multiple-valued logic may be helpful. This paper presents some of these relationships through equivalent algebraic evaluations
Phonotactics in inductive logic programming
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
Logic programming and cardinality constraints : theory and practice
Syrjänen, Tommi
2009-01-01
Answer set programming (ASP) is a method for solving hard problems using computational logic. We describe a problem as a set of formulas of a declarative logical language in such way that the solutions correspond to the models (answer sets) of the set and then use a general-purpose inference engine to find the answer sets. In this work we define an ASP language, cardinality constraint programs (CCP). The language extends normal logic programs by adding cardinality and conditional literals...
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.
High Speed Simulation Framework for Reliable Logic Programs
International Nuclear Information System (INIS)
Lee, Wan-Bok; Kim, Seog-Ju
2006-01-01
This paper shows a case study of designing a PLC logic simulator that was developed to simulate and verify PLC control programs for nuclear plant systems. The nuclear control system requires strict restrictions rather than normal process control system does, since it works with nuclear power plants requiring high reliability under severe environment. One restriction is the safeness of the control programs which can be assured by exploiting severe testing. Another restriction is the simulation speed of the control programs, that should be fast enough to control multi devices concurrently in real-time. To cope with these restrictions, we devised a logic compiler which generates C-code programs from given PLC logic programs. Once the logic program was translated into C-code, the program could be analyzed by conventional software analysis tools and could be used to construct a fast logic simulator after cross-compiling, in fact, that is a kind of compiled-code simulation
Conceptual Modeling via Logic Programming
1990-01-01
CONCEPTUAL MODELING VIA LOGIC PROGRAMaNG 12. PERSONAL AUTHOR(S) John Burge, Bill Noah, Las Smith 13a. TYPE OF REPORT 13b. TIME COVERED 14. DATE OF...interpreter and named it Prolog for middle. He found that his program got into an "Programmation en logique ." It provided the infinite loop unless he used... lA N C I WA v Cruse Mle Submartine 44 0 0 0 0 0835 I 9 33 ICC 33 High F.e cruise Misaile 640 0 8S S44 0 0 High Post cruise missile 840 2 7S 440 too
A History of Probabilistic Inductive Logic Programming
Directory of Open Access Journals (Sweden)
Fabrizio eRiguzzi
2014-09-01
Full Text Available The field of Probabilistic Logic Programming (PLP has seen significant advances in the last 20 years, with many proposals for languages that combine probability with logic programming. Since the start, the problem of learning probabilistic logic programs has been the focus of much attention. Learning these programs represents a whole subfield of Inductive Logic Programming (ILP. In Probabilistic ILP (PILP two problems are considered: learning the parameters of a program given the structure (the rules and learning both the structure and the parameters. Usually structure learning systems use parameter learning as a subroutine. In this article we present an overview of PILP and discuss the main results.
Towards automatic verification of ladder logic programs
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...
Proof theory of epistemic logic of programs
Maffezioli, Paolo; Naibo, Alberto
A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system
Normal Forms for Fuzzy Logics: A Proof-Theoretic Approach
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Metcalfe, G.
2007-01-01
Roč. 46, č. 5-6 (2007), s. 347-363 ISSN 1432-0665 R&D Projects: GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : fuzzy logic * normal form * proof theory * hypersequents Subject RIV: BA - General Mathematics Impact factor: 0.620, year: 2007
The lazy functional side of logic programming
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
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.
Abstract Interpretation of PIC programs through Logic Programming
DEFF Research Database (Denmark)
Henriksen, Kim Steen; Gallagher, John Patrick
2006-01-01
A logic based general approach to abstract interpretation of low-level machine programs is reported. It is based on modelling the behavior of the machine as a logic program. General purpose program analysis and transformation of logic programs, such as partial evaluation and convex hull analysis......, are applied to the logic based model of the machine. A small PIC microcontroller is used as a case study. An emulator for this microcontroller is written in Prolog, and standard programming transformations and analysis techniques are used to specialise this emulator with respect to a given PIC program....... The specialised emulator can now be further analysed to gain insight into the given program for the PIC microcontroller. The method describes a general framework for applying abstractions, illustrated here by linear constraints and convex hull analysis, to logic programs. Using these techniques on the specialised...
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)
Logic integer programming models for signaling networks.
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.
Beta normal control of TFTR using fuzzy logic
International Nuclear Information System (INIS)
Lawson, J.E.; Bell, M.G.; Marsala, R.J.; Mueller, D.
1995-01-01
In TFTR plasmas heated by neutral beam injection, the fusion power yield increases rapidly with the plasma pressure. However, the pressure is limited by the onset of instabilities which may result in plasma disruptions that would have had an adverse effect on the performance of subsequent discharges and increase the risk of damage to internal components. The likelihood of disruption has been found to correlate with the normalized beta, defined as βN = 2 x 10 8 μ circle left angle p perpendicular to right angle a / BTIp where left angle p perpendicular to right angle is the volume-average plasma perpendicular pressure, a the mid-plane minor radius of the plasma, BT the toroidal magnetic field and Ip the plasma current. Other variables, such as the peaking of the plasma pressure and current profiles, have been found to influence the threshold of βN at which the probability of disruption begins to increase significantly. For TFTR plasmas with high fusion performance (TFTR ''supershots'') the probability of disruption has been found to increase rapidly for βN > 1.8. Since confinement in this regime is affected by plasma-wall interaction, which can vary from shot to shot, operation at high βN with preprogrammed heating power pulses can produce an unacceptably high risk of disruption. To reduce the risk of producing beta-limit disruptions during neutral beam heating experiments, a control system, the Neutral Beam Power Feedback System (NBPFS), has been developed to modulate the total heating power by switching individual neutral beam sources on and off in response to the evolution of the normalized beta so that the limit will not be exceeded. The value of βN is calculated in real time and transmitted to the NBPFS. The value of βN and its calculated time derivative are input to a fuzzy logic controller which implements a proportional-derivative control based on the difference between βN and a programmed reference level βNREF which can be programmed as a function
A Program Transformation for Backwards Analysis of Logic Programs
DEFF Research Database (Denmark)
Gallagher, John Patrick
2003-01-01
programs presented here is based on a transformation of the input program, which makes explicit the dependencies of the given program points on the initial goals. The transformation is derived from the resultants semantics of logic programs. The transformed program is then analysed using a standard...
ALPES: an advanced logic programming environment
Directory of Open Access Journals (Sweden)
Cristina Ruggieri
1988-11-01
Full Text Available This paper introduces a software programming environment for an extended Prolog language, called ALPES. The purpose of ALPES is to enable a logic programming paradigm to become a software engineering tool to design, develop and prototype traditional software systems, as well as artificial intelligence applications. The key structuring concepts for programs, as well as for the system architecture as a whole are those of contexts, processes and communication. The software design and development methodologies induced by the use of the Alpes-Prolog language have been incrementally used to develop the environment itself. This research was conducted under the Esprit projects P973 (ALPES.
Permission-Based Separation Logic for Multithreaded Java Programs
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
2013/2014 Eco-Logical program annual report
2014-12-01
The Eco-Logical approach offers an ecosystem-based framework for integrated infrastructure and natural resource planning, project development, and delivery. The 2013/2014 Eco-Logical Program Annual Report provides updates on the Federal Highway Admin...
Smile: a computer program for partitioning of programmed logic arrays
Energy Technology Data Exchange (ETDEWEB)
De Micheli, G.; Santomauro, M.
1983-03-01
This paper presents a new approach to optimal topological design of PLAs (programmed logic arrays). In particular the authors address the array partitioning problem and the implementation of partitioned arrays as block folded or parallel connected PLAs. They present a graph theoretic interpretation of the problem and an efficient heuristic algorithm. A computer program, SMILE, is described and experimental results are reported. 24 references.
The Family of Concurrent Logic Programming Languages
1989-05-01
we show here examples of manual specializations of meta-interpreters. Using partial evaluation techniques similar to those of [149,1501, the...193]. - 85 - 19.3 Proces to proceso mapping The question of how to map processes to processors is not unique to concurrent logic programming, and any...procinors(N,ToQ) queue(ToQ), -8 7 - procemorie(N,ToQ)Qnext. processors’(0,_). procesos (N,ToQ) - N>O I N’:=N-1, procesior(ToQ), processor’(N’ ,ToQ)Onext
ALPprolog --- A New Logic Programming Method for Dynamic Domains
Drescher, Conrad; Thielscher, Michael
2011-01-01
Logic programming is a powerful paradigm for programming autonomous agents in dynamic domains, as witnessed by languages such as Golog and Flux. In this work we present ALPprolog, an expressive, yet efficient, logic programming language for the online control of agents that have to reason about incomplete information and sensing actions.
The Haskell Road to Logic, Maths and Programming, Second Edition
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
Core TuLiP - Logic Programming for Trust Management
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
Deciding Full Branching Time Logic by Program Transformation
Pettorossi, Alberto; Proietti, Maurizio; Senni, Valerio
We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a monadic ω -program, that is, a stratified program defining nullary or unary predicates on infinite lists. This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. In the second step we verify the property of interest by using a proof method for monadic ω-programs.
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.
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......Research in multi-agent systems has resulted in agent programming languages and logics that are used as a foundation for engineering multi-agent systems. Research includes reusable agent programming platforms for engineering agent systems with environments, agent behavior, communication protocols...... paradigm, and work that combines agent-based simulation platforms with agent programming platforms. This paper analyzes and evaluates benefits of using agent programming languages and logics for agent-based simulation. In particular, the paper considers the use of agent programming languages and logics...
Research on teacher education programs: logic model approach.
Newton, Xiaoxia A; Poon, Rebecca C; Nunes, Nicole L; Stone, Elisa M
2013-02-01
Teacher education programs in the United States face increasing pressure to demonstrate their effectiveness through pupils' learning gains in classrooms where program graduates teach. The link between teacher candidates' learning in teacher education programs and pupils' learning in K-12 classrooms implicit in the policy discourse suggests a one-to-one correspondence. However, the logical steps leading from what teacher candidates have learned in their programs to what they are doing in classrooms that may contribute to their pupils' learning are anything but straightforward. In this paper, we argue that the logic model approach from scholarship on evaluation can enhance research on teacher education by making explicit the logical links between program processes and intended outcomes. We demonstrate the usefulness of the logic model approach through our own work on designing a longitudinal study that focuses on examining the process and impact of an undergraduate mathematics and science teacher education program. Copyright © 2012 Elsevier Ltd. All rights reserved.
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
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
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
2012 Eco-Logical grant program annual report
2012-01-01
Since 2007 the Eco-Logical grant program has funded 15 projects nationwide; twelve grant recipients completed their projects prior to 2012, two grant recipients completed their projects in the 2012 calendar year, and one anticipates finishing its pro...
Bayesian Logic Programs for Plan Recognition and Machine Reading
2012-12-01
Probabilistic Relational Models ( PRMs ) (Friedman, Getoor, Koller, & Pfeffer, 1999), Stochastic Logic Programs (SLPs) (Muggleton, 2000), Bayesian Logic...level plan template Description set-up-shelter(Loc) Set up an emergency shelter at location Loc fix- water -main(From,To) Fix a power line running from...Loc)|set-up-shelter(Loc),shelter-leader(Leader). object-get-to(Foodx,Loc)|set-up-shelter(Loc),food(Foodx). #fix- water -main shut-off- water (From,To)|fix
Transforming Normal Programs by Replacement
Bossi, Annalisa; Pettorossi, A.; Cocco, Nicoletta; Etalle, Sandro
1992-01-01
The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt Fitting's and Kunen's semantics. We show how replacement can mimic other transformation operations such as thinning,
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
Logic programming for operational analysis of the Savannah River reactors
International Nuclear Information System (INIS)
Suich, J.E.
1985-01-01
The Savannah River Plant (SRP) has installed an on-line reactor monitoring diagnostic computer system to direct operators to appropriate procedures for multiple, concurrent alarms. Off-line programs analyze the monitoring logic for consistency. Both applications can be described as logic programs. Emerging artificial intelligence (AI) computer technology promises operationally viable expert systems for diagnosis and control of reactor systems. The core of this technology is the use of computers for logical inference, in contrast to the more traditional number crunching and data processing functions. At present, the diagnostic logic represents surface knowledge of reactor operating procedures, while the analytical logic incorporates a small amount of real-world knowledge concerning superset/subset relationships among alarms. The challenge for the future is to create a comprehensive operations advisory system, with logic as engineering rules of thumb for cause/effect models of malfunction and corrective action, data reflecting the real-time status of all critical reactor components, and control working both bottom up from alarms to malfunctions, and top down from malfunction to corrective procedure
Modular Logic Programming for Web Data, Inheritance and Agents
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.
Using Logic Programming to Detect Activities in Pervasive Healthcare
DEFF Research Database (Denmark)
Christensen, Henrik Bærbak
2002-01-01
In this experience paper we present a case study in using logic programming in a pervasive computing project in the healthcare domain. An expert system is used to detect healthcare activities in a pervasive hospital environment where positions of people and things are tracked. Based on detected...... activities an activity-driven computing infrastructure provides computational assistance to healthcare staff on mobile-and pervasive computing equipment. Assistance range from simple activities like fast log-in into the electronic patient medical record system to complex activities like signing for medicine...... given to specific patients. We describe the role of logic programming in the infrastructure and discuss the benefits and problems of using logic programming in a pervasive context....
Proving program inclusion using Hoare's logic
Bergstra, J.A.; Klop, J.W.
1984-01-01
We explore conservative refinements of specifications. These form a quite appropriate framework for a proof theory for program inclusion based on a proof theory for program correctness. We propose two formalized proof methods for program inclusion and prove these to be sound. Both methods are
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...... (contour tracking and corner detection) are constructed. The emphasis is not on building better corner detectors, but on presenting ways of using the unification and backtracking features of logic programming for these tasks. The performance of this implementation of contour tracking and corner detection...
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....
tactusLogic: programming using physical objects
CSIR Research Space (South Africa)
Smith, Andrew C
2011-05-01
Full Text Available and constructs to simplify the language for the novice programmer. No computer knowledge is required once the programming system has been configured for use. Our evaluations reveal that the concept of variables, and redirecting program execution, are considered...
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.
Application of Logic Models in a Large Scientific Research Program
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…
Optical Neural Network Models Applied To Logic Program Execution
Stormon, Charles D.
1988-05-01
Logic programming is being used extensively by Artificial Intelligence researchers to solve problems including natural language processing and expert systems. These languages, of which Prolog is the most widely used, promise to revolutionize software engineering, but much greater performance is needed. Researchers have demonstrated the applicability of neural network models to the solution of certain NP-complete problems, but these methods are not obviously applicable to the execution of logic programs. This paper outlines the use of neural networks in four aspects of the logic program execution cycle, and discusses results of a simulation of three of these. Four neural network functional units are described, called the substitution agent, the clause filter, the structure processor, and the heuristics generator, respectively. Simulation results suggest that the system described may provide several orders of magnitude improvement in execution speed for large logic programs. However, practical implementation of the proposed architecture will require the application of optical computing techniques due to the large number of neurons required, and the need for massive, adaptive connectivity.
A Comparison of Fuzzy and Annotated Logic Programming
Czech Academy of Sciences Publication Activity Database
Krajči, S.; Lencses, R.; Vojtáš, Peter
2004-01-01
Roč. 144, - (2004), s. 173-192 ISSN 0165-0114 R&D Projects: GA ČR GA201/00/1489 Grant - others:VEGA(SK) 1/7557/20; VEGA(SK) 1/7555/20; VEGA(SK) 1/0385/03 Institutional research plan: CEZ:AV0Z1030915 Keywords : fuzzy logic programming * generalized annotated programs * declarative and procedural semantics * continuous semantics and computable fixpoint * soundness and completeness Subject RIV: BA - General Mathematics Impact factor: 0.734, year: 2004
Permission-based separation logic for multi-threaded Java programs
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
He, Ye; Rohr, Jean; Miller, Samuel D.; Levin, Barbara B.; Mercier, Susan
2010-01-01
The purpose of this study was to develop a model for evaluating a professional development school program to enact an evidence-based model for a continuous cycle of program improvement. Guided by the logic model for program evaluation, we developed three survey instruments based on the professional development school standards of the National…
Modelling and Analysis of Real Time Systems with Logic Programming and Constraints
DEFF Research Database (Denmark)
Banda, Gourinath
to verify the reactive behaviour of concur- rent systems. Computation Tree Logic (CTL) is a temporal property specification language. Logic programming is a general purpose programming language based on predicate logic. In this dissertation, the LHA models are verified by encoding them as con- straint logic...... programs. The constraint logic program (CLP) encoding an LHA model is first specialised and then a concrete minimal model (or possibly an ab- stract minimal model) for the residual program is computed. The abstract minimal model is computed by applying the theory of abstract interpretation. The com- puted...... by a compiler. To facilitate forward and backward reasoning, two different ways to model an LHA are defined. A framework consist- ing of general purpose constraint logic program tools is presented to accomplish the reachability analysis to verify a class of safety and liveness properties. A tool to compute...
Devil is in the details: Using logic models to investigate program process.
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.
The KRAKEN normal mode program
Porter, M. B.
1992-05-01
In the late 1970's, several normal-mode models existed which were widely used for predicting acoustic transmission-loss in the ocean; however, each had its own problems. Typical difficulties included numerical instabilities for certain types of sound-speed profiles and failures to compute a complete set of ocean modes. In short, there was a need for a model that was robust, accurate, and efficient. In order to resolve these problems, a new algorithm was developed forming the basis for the KRAKEN normal mode model. Over subsequent years, KRAKEN was greatly extended, with options for modeling ocean environments that are range-independent, range-dependent, or fully 3-dimensional. The current version offers the specialist a vast number of options for treating ocean-acoustics problems (or more generally acousto-elastic waveguides). On the other hand, it is easy for a less sophisticated user to learn the small subset of tools needed for the common problem of transmission-loss modeling in range-independent ocean environments. This report addresses the need for a more complete user's guide to supplement the on-line help files. The first chapters give a fairly technical description of the mathematical and numerical basis of the model. Additional chapters give a simpler description of its use and installation in a manner that is accessible to less scientifically-oriented readers.
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.
The Body Logic Program for Adolescents: A Treatment Manual for the Prevention of Eating Disorders
Varnado-Sullivan, Paula J.; Zucker, Nancy
2004-01-01
The Body Logic Program for Adolescents was developed as a two-stage intervention to prevent the development of eating disorder symptoms. Preliminary results indicate that this program shows promise as an effective prevention effort. The current article provides a detailed description of the protocol for implementing Body Logic Part I, a…
Evaluation for Community-Based Programs: The Integration of Logic Models and Factor Analysis
Helitzer, Deborah; Hollis, Christine; de Hernandez, Brisa Urquieta; Sanders, Margaret; Roybal, Suzanne; Van Deusen, Ian
2010-01-01
Purpose: To discuss the utility of and value of the use of logic models for program evaluation of community-based programs and more specifically, the integration of logic models and factor analysis to develop and revise a survey as part of an effective evaluation plan. Principal results: Diverse stakeholders with varying outlooks used a logic…
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.
Program Verification with Monadic Second-Order Logic & Languages for Web Service Development
DEFF Research Database (Denmark)
Møller, Anders
and verification techniques. This dissertation describes two projects, each exploring one particular instance of such languages: monadic second-order logic and its application to program verification, and programming languages for construction of interactive Web services. Both program verification and Web service...... 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...... development are areas of programming language research that have received increased attention during the last years. We first show how the logic Weak monadic Second-order Logic on Strings and Trees can be implemented efficiently despite an intractable theoretical worst-case complexity. Among several other...
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
Dependently Typed Programming with Domain-Specific Logics
2011-02-28
problems considered in this dissertation. The moment I decided to come to CMU was at the Saturday night dinner of the visit weekend, when, over beer at the...Church Brew Works, Tom Murphy VII and others explained the Curry-Howard interpretation of classical logic as continuations. This was not false
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
Reasoning about program control-flow paths is an important functionality of a number of recent program matching languages and associated searching and transformation tools. Temporal logic provides a well-defined means of expressing properties of control-flow paths in programs, and indeed an exten......Reasoning about program control-flow paths is an important functionality of a number of recent program matching languages and associated searching and transformation tools. Temporal logic provides a well-defined means of expressing properties of control-flow paths in programs, and indeed...... 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...
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......, and it can give meaningful output also when no exact reference time is available....
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...
IT0: Discrete Math and Programming Logic Topics as a Hybrid Alternative to CS0
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…
Reasoning about Java programs in higher order logic using PVS and Isabelle
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
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…
Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs
DEFF Research Database (Denmark)
Giesl, J.; Ströder, T.; Schneider-Kamp, P.
2013-01-01
There exist many powerful techniques to analyze termination and complexity of term rewrite systems (TRSs). Our goal is to use these techniques for the analysis of other programming languages as well. For instance, approaches to prove termination of definite logic programs by a transformation to T...
Users' manual of the LOGIC1 program library for modeling of instrument and control system
International Nuclear Information System (INIS)
Watanabe, Norio; Oikawa, Tetsukuni; Abe, Kiyoharu; Chiba, Takemi.
1984-09-01
Accident analysis codes of nuclear power plants usually need models for instrument and control systems to simulate the actuation of active components such as Engineered Safety Features. As a standardized tool for the modeling of those instrument and control systems, a computer program library LOGIC1 has been developed. This library has two functions. One is to memorize the information of the modeled instrument and control systems, and the other is to execute logical operation and determine success/failure of the active components at each step of the transient analyzed. Using LOGIC1 program library, not only automatic control logics but also operator intervention and component degradation can be modeled. LOGIC1 is separate from the thermal-hydraulic analysis codes, which can provide the information on the instrument and control system function. The causal relation among component failures and accident sequences obtained from fault tree and event tree analysis respectively can be directly reflected on the transient analysis. Such a modeling is especially important in the analysis of the core meltdown accident sequence where a lot of operations of safety related systems should be considered. LOGIC1 is being applied to the THALES code system which is under development at JAERI for the analysis of core meltdown accidents. (author)
Ratcliffe, Michelle M
2012-08-01
Farm to School programs hold promise to address childhood obesity. These programs may increase students’ access to healthier foods, increase students’ knowledge of and desire to eat these foods, and increase their consumption of them. Implementing Farm to School programs requires the involvement of multiple people, including nutrition services, educators, and food producers. Because these groups have not traditionally worked together and each has different goals, it is important to demonstrate how Farm to School programs that are designed to decrease childhood obesity may also address others’ objectives, such as academic achievement and economic development. A logic model is an effective tool to help articulate a shared vision for how Farm to School programs may work to accomplish multiple goals. Furthermore, there is evidence that programs based on theory are more likely to be effective at changing individuals’ behaviors. Logic models based on theory may help to explain how a program works, aid in efficient and sustained implementation, and support the development of a coherent evaluation plan. This article presents a sample theory-based logic model for Farm to School programs. The presented logic model is informed by the polytheoretical model for food and garden-based education in school settings (PMFGBE). The logic model has been applied to multiple settings, including Farm to School program development and evaluation in urban and rural school districts. This article also includes a brief discussion on the development of the PMFGBE, a detailed explanation of how Farm to School programs may enhance the curricular, physical, and social learning environments of schools, and suggestions for the applicability of the logic model for practitioners, researchers, and policy makers.
System M: A Program Logic for Code Sandboxing and Identification
2014-07-22
drivers; and trusted computing platforms load programs from disk and only later verify loaded programs using the Trusted Plat- form Module ( TPM ) [32...service to respond with old (possibly compromised) passwords. Memoir solves this prob- lem by using the TPM to provide state integrity guarantees. Memoir...relies on the following TPM features: • Platform configuration registers (PCRs) contain 20-byte hashes known as measurements that summarize the
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...
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…
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 an...
DEFF Research Database (Denmark)
Bolander, Thomas
2003-01-01
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...... 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...
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...... analysis. With a tool such as Constraint Handling Rules, CHR, to be ex- plained below, the grammar writer or programmer working with language analysis can define his or her own constraint solvers specifically tailored for the linguistic problems at hand. We concentrate on grammars and lan- guage analysis...
Using Fuzzy Logic in Test Case Prioritization for Regression Testing Programs with Assertions
Directory of Open Access Journals (Sweden)
Ali M. Alakeel
2014-01-01
Full Text Available Program assertions have been recognized as a supporting tool during software development, testing, and maintenance. Therefore, software developers place assertions within their code in positions that are considered to be error prone or that have the potential to lead to a software crash or failure. Similar to any other software, programs with assertions must be maintained. Depending on the type of modification applied to the modified program, assertions also might have to undergo some modifications. New assertions may also be introduced in the new version of the program, while some assertions can be kept the same. This paper presents a novel approach for test case prioritization during regression testing of programs that have assertions using fuzzy logic. The main objective of this approach is to prioritize the test cases according to their estimated potential in violating a given program assertion. To develop the proposed approach, we utilize fuzzy logic techniques to estimate the effectiveness of a given test case in violating an assertion based on the history of the test cases in previous testing operations. We have conducted a case study in which the proposed approach is applied to various programs, and the results are promising compared to untreated and randomly ordered test cases.
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.
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.
Logic programming to infer complex RNA expression patterns from RNA-seq data.
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.
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.
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.
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.
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...
Energy Technology Data Exchange (ETDEWEB)
Hermenegildo, M.V.
1986-01-01
The term Logic Programming refers to a variety of computer languages and execution models based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in artificial intelligence, knowledge-based systems, and many other areas of computing. This dissertation presents an efficient parallel execution model for logic programs. The model is described from the source language level down to an Abstract Machine level, suitable for direct implementation on existing parallel systems or for the design of special purpose parallel architectures. Few assumptions are made at the source language level and, therefore, the techniques developed and the general Abstract Machine design are applicable to a variety of logic (and also functional) languages. These techniques offer efficient solutions to several areas of parallel Logic Programming implementation previously considered problematic or a source of considerable overhead, such as the detection and handling of variable binding conflicts in AND-parallelism, the specification of control and management of the execution tree, the treatment of distributed backtracking, and goal scheduling and memory management issues, etc. A parallel Abstract Machine design is offered, specifying data areas, operation, and a suitable instruction set.
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.
ISI program in ETRR-2 welded parts in form of logic flow charts
International Nuclear Information System (INIS)
Tawfik, Yasser E.
2003-01-01
A complete in-service inspection (ISI) program for nuclear research reactors requires several steps that have to be performed in sequence. These steps were described in many logic flow charts (LFC's). These logic flow charts might be separately used as a guide for future work in case of developing expert system software for research reactors. These charts included a general LFC describing the steps required to complete the ISI program. Details of this general LFC are given in many modules. The next step of the LFC is to define the class of the component to be inspected. For each component class there are related modules that should be followed (examination requirements modules, examination methods modules, and flaw acceptance/rejection modules.) If the component is accepted according to the requirements found in American Society of Mechanical Engineers (ASME) CODE section XI, the record and report requirement modules will be used to complete the ISI program. In the present work the inspection requirements for welded parts in the Second Egyptian Testing Research Reactor (ETRR-2) are considered. ETRR-2 is a pool-type reactor with an open water surface and variable core arrangement. Its core power is 22 MWth, cooled and moderated by light water and with beryllium reflectors. It contains plate- type fuel elements (MTR type, 19.7% enriched uranium) with aluminum clad. This reactor consists of 57 systems and around 200 subsystems, these systems contain many mechanical components such as; thanks, pipes, valves, pumps, heat exchangers, cooling tower, air compressors and supports. (author)
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.
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.
A Case Study on Cyber-security Program for the Programmable Logic Controller of Modern NPPs
International Nuclear Information System (INIS)
Song, S. H.; Lee, M. S.; Kim, T. H.; Park, C. H.; Park, S. P.; Kim, H. S.
2014-01-01
As instrumentation and control (I and C) systems for modern Nuclear Power Plants (NPPs) have been digitalized to cope with their growing complexity, the cyber-security has become an important issue. To protect the I and C systems adequately from cyber threats, such as Stuxnet that attacked Iran's nuclear facilities, regulations of many countries require a cyber-security program covering all the life cycle phases of the system development, from the concept to the retirement. This paper presents a case study of cyber-security program that has been performed during the development of the programmable logic controller (PLC) for modern NPPs of Korea. In the case study, a cyber-security plan, including technical, management, and operational controls, was established through a security risk assessment. Cyber-security activities, such as development of security functions and periodic inspections, were conducted according to the plan: the security functions were applied to the PLC as the technical controls, and periodic inspections and audits were held to check the security of the development environment, as the management and operational controls. A final penetration test was conducted to inspect all the security problems that had been issued during the development. The case study has shown that the systematic cyber-security program detected and removed the vulnerabilities of the target system, which could not be found otherwise, enhancing the cyber-security of the system
Montgomery, Valencia; Harris, Katie; Stabler, Anthony; Lu, Lisa H
2017-05-01
To examine how the duration of time delay between Wechsler Memory Scale (WMS) Logical Memory I and Logical Memory II (LM) affected participants' recall performance. There are 46,146 total Logical Memory administrations to participants diagnosed with either Alzheimer's disease (AD), vascular dementia (VaD), or normal cognition in the National Alzheimer's Disease Coordinating Center's Uniform Data Set. Only 50% of the sample was administered the standard 20-35 min of delay as specified by WMS-R and WMS-III. We found a significant effect of delay time duration on proportion of information retained for the VaD group compared to its control group, which remained after adding LMI raw score as a covariate. There was poorer retention of information with longer delay for this group. This association was not as strong for the AD and cognitively normal groups. A 24.5-min delay was most optimal for differentiating AD from VaD participants (47.7% classification accuracy), an 18.5-min delay was most optimal for differentiating AD versus normal participants (51.7% classification accuracy), and a 22.5-min delay was most optimal for differentiating VaD versus normal participants (52.9% classification accuracy). Considering diagnostic implications, our findings suggest that test administration should incorporate precise tracking of delay periods. We recommend a 20-min delay with 18-25-min range. Poor classification accuracy based on LM data alone is a reminder that story memory performance is only one piece of data that contributes to complex clinical decisions. However, strict adherence to the recommended range yields optimal data for diagnostic decisions.
DEFF Research Database (Denmark)
Poulsen, Kåre Harbo; Pop, Paul; Izosimov, Viacheslav
2007-01-01
We present a constraint logic programming (CLP) approach for synthesis of fault-tolerant hard real-time applications on distributed heterogeneous architectures. We address time-triggered systems, where processes and messages are statically scheduled based on schedule tables. We use process re-exe...
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....
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...
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 ...
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...
DEFF Research Database (Denmark)
Gallagher, John Patrick; Puebla, G.
2002-01-01
Set-based program analysis has many potential applications, including compiler optimisations, type-checking, debugging, verification and planning. One method of set-based analysis is to solve a set of {\\it set constraints} derived directly from the program text. Another approach is based...... constraint analysis of a particular program $P$ could be understood as an abstract interpretation over a finite domain of regular tree grammars, constructed from $P$. In this paper we define such an abstract interpretation for logic programs, formulated over a domain of non-deterministic finite tree automata...
West, Joseph F
2014-02-01
Diabetes remains a growing epidemic with widening health inequity gaps in disease management, self-management knowledge, access to care and outcomes. Yet there is a paucity of evaluation tools for community engaged interventions aimed at closing the gaps and improving health. The Guide to Community Preventive Services (the Community Guide) developed by the Task Force on Community Preventive Services (the Task Force) at the Centers for Disease Control and Prevention (CDC) recommends two healthcare system level interventions, case management interventions and disease management programs, to improve glycemic control. However, as a public health resource guide for diabetes interventions a model for community engagement is a glaringly absent component of the Community Guide recommendations. In large part there are few evidence-based interventions featuring community engagement as a practice and system-level focus of chronic disease and Type 2 diabetes management. The central argument presented in this paper is that the absence of these types of interventions is due to the lack of tools for modeling and evaluating such interventions, especially among disparate and poor populations. A conceptual model emphasizing action-oriented micro-level community engagement is needed to complement the Community Guide and serve as the basis for testing and evaluation of these kinds of interventions. A unique logic model advancing the Community Guide diabetes recommendations toward measureable and sustainable community engagement for improved Type 2 diabetes outcomes is presented. Copyright © 2013 Elsevier Ltd. All rights reserved.
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.
Cuevas, Eduardo J.
1997-01-01
Discusses cornerstone of Montessori theory, normalization, which asserts that if a child is placed in an optimum prepared environment where inner impulses match external opportunities, the undeviated self emerges, a being totally in harmony with its surroundings. Makes distinctions regarding normalization, normalized, and normality, indicating how…
[Effectiveness of an early discharge program after normal childbirth].
Teulón González, M; Martínez Pillado, M; Cuadrado Martín, M M; Rivero Martín, M J; Cerezuela Requena, J F
To implement a program of early hospital discharge after an uncomplicated birth, in order to improve the effectiveness, as well as ensuring clinical safety and patient acceptability. Descriptive study of the effectiveness of an early discharge program after uncomplicated delivery between February 2012 and September 2013. The populations are post-partum women and newborns admitted to the University Hospital of Fuenlabrada, with a duration of less than 24h after uncomplicated delivery that met the defined inclusion criteria. Satisfaction was assessed using a Likert scale. The effectiveness of the program was monitored by safety indicators, productivity, adaptation, and continuity of care. A total of 20% of cases capable of early discharge from Fuenlabrada University Hospital completed the program. Almost all (94%) were normal deliveries. The 188 cases included were from 911 patients with uncomplicated childbirth, accounting for 6.5% of the 2,857 total births. The mean stay of patients included showed a decrease of 50% (2.4 to 1.2 days). All patients received continuity of care after hospital discharge. The review consultation was reprogrammed for 4.8% of cases, with 2% of patients re-admitted within 96h. with no serious problems. Four newborns (2%) required attention in the emergency department (mother or newborn) before 96h. The assessment of patient satisfaction achieved a score of 4.5 out of 5. The program achieved a decrease in the average stay by 50%, favouring the autonomy of midwives. This acceptance level is in line with similar interventions. The deployment of the program may be useful for other changes in care processes. Copyright © 2016 SECA. Publicado por Elsevier España, S.L.U. All rights reserved.
Howard, Ayanna
2005-01-01
The Fuzzy Logic Engine is a software package that enables users to embed fuzzy-logic modules into their application programs. Fuzzy logic is useful as a means of formulating human expert knowledge and translating it into software to solve problems. Fuzzy logic provides flexibility for modeling relationships between input and output information and is distinguished by its robustness with respect to noise and variations in system parameters. In addition, linguistic fuzzy sets and conditional statements allow systems to make decisions based on imprecise and incomplete information. The user of the Fuzzy Logic Engine need not be an expert in fuzzy logic: it suffices to have a basic understanding of how linguistic rules can be applied to the user's problem. The Fuzzy Logic Engine is divided into two modules: (1) a graphical-interface software tool for creating linguistic fuzzy sets and conditional statements and (2) a fuzzy-logic software library for embedding fuzzy processing capability into current application programs. The graphical- interface tool was developed using the Tcl/Tk programming language. The fuzzy-logic software library was written in the C programming language.
Dasgupta, Abhijit; Paul, Debjyoti; De, Rajat K
2016-07-19
Dynamics of large nonlinear complex systems, like metabolic networks, depend on several parameters. A metabolic pathway may switch to another pathway in accordance with the current state of parameters in both normal and cancer cells. Here, most of the parameter values are unknown to us. A fuzzy logic controller (FLC) has been developed here for the purpose of modeling metabolic networks by approximating the reasons for the behaviour of a system and applying expert knowledge to track switching between metabolic pathways. The simulation results can track the switching between glycolysis and gluconeogenesis, as well as glycolysis and pentose phosphate pathways (PPP) in normal cells. Unlike normal cells, pyruvate kinase (M2 isoform) (PKM2) switches alternatively between its two oligomeric forms, i.e. an active tetramer and a relatively low activity dimer, in cancer cells. Besides, there is a coordination among PKM2 switching and enzymes catalyzing PPP. These phenomena help cancer cells to maintain their high energy demand and macromolecular synthesis. However, the reduction of initial adenosine triphosphate (ATP) to a very low concentration, decreasing initial glucose uptake, destroying coordination between glycolysis and PPP, and replacement of PKM2 by its relatively inactive oligomeric form (dimer) or inhibition of the translation of PKM2 may destabilize the mutated control mechanism of the mammalian central carbon metabolic (CCM) pathway in cancer cells. The performance of the model is compared appropriately with some existing ones.
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.
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...
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
The Role of PROLOG (PROgramming and LOGic) in Natural Language Processing.
1988-03-01
14 5. Bottom Up Parser (BUP) ... ......... . 19 6. Modular Logic Grammars (MLG) ........ . 22 7. Zen, Haiku and PROLOG...Both of these are welcome extensions to the Chat methodology. - 23 - CHAPTER 7 Zen, Haiku and PROLOG The intent of this chapter is two fold. First, the...34cut away the superfluous and what is left is reality". A realization of the spirit of Zen can be found in haiku . Haiku are short poems that strive for
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
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...
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.
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.
GOAL Agents Instantiate Intention Logic
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...
Logical Characterisation of Ontology Construction using Fuzzy Description Logics
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
Ontologies based on Description Logics (DLs) have proved to be effective in formally sharing knowledge across semantic technologies, e.g. Semantic Web, Natural Language Processing, Text Analytics, Business intelligence. Our main goal is analysing ontology construction considering vagueness. We have...... 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....
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…
Information Flow in Logical Environments
Kent, Robert E.
2016-01-01
This paper describes information flow within logical environments. The theory of information flow, the logic of distributed systems, was first defined by Barwise and Seligman (Information Flow: The Logic of Distributed Systems. 1997). Logical environments are a semantic-oriented version of institutions. The theory of institutions, which was initiated by Goguen and Burstall (Institutions: Abstract Model Theory for Specification and Programming. 1992), is abstract model theory. Information flow...
Purposeful Program Theory: Effective Use of Theories of Change and Logic Models
Funnell, Sue C.; Rogers, Patricia J.
2011-01-01
Between good intentions and great results lies a program theory--not just a list of tasks but a vision of what needs to happen, and how. Now widely used in government and not-for-profit organizations, program theory provides a coherent picture of how change occurs and how to improve performance. "Purposeful Program Theory" shows how to develop,…
A logical approach to determine a waste segregation/volume reduction program
International Nuclear Information System (INIS)
Shriner, G.D.; Carmel, P.G.; Shimmura, H.
1986-01-01
This paper discusses advantages and disadvantages of hand sorting versus use of automated radioactive waste segregation monitors and makes an analysis of costs/versus benefits based on volume with time. Many programs to be employed to prevent unnecessary waste generation with little or no additional cost to the power plant. Parameters needed to perform a cost analysis and methods used to obtain them are discussed. Recommendations on use of vendor-supplied services for segregation, volume reduction, and decontamination are given. The data provided will enable the selection of a program(s) to benefit the individual user's requirements
Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms
S-H. Nienhuys-Cheng (Shan-Hwei); W. van Laer; J. Ramon; L. de Raedt
2000-01-01
textabstractInductive Logic Programming considers almost exclusively universally quantied theories. To add expressiveness, prenex conjunctive normal forms (PCNF) with existential variables should also be considered. ILP mostly uses learning with refinement operators. To extend refinement operators
Tugué, Tosiyuki; Slaman, Theodore
1989-01-01
These proceedings include the papers presented at the logic meeting held at the Research Institute for Mathematical Sciences, Kyoto University, in the summer of 1987. The meeting mainly covered the current research in various areas of mathematical logic and its applications in Japan. Several lectures were also presented by logicians from other countries, who visited Japan in the summer of 1987.
Marchand-Geneste, Nathalie; Watson, Kimberly A; Alsberg, Bjørn K; King, Ross D
2002-01-17
A key problem in QSAR is the selection of appropriate descriptors to form accurate regression equations for the compounds under study. Inductive logic programming (ILP) algorithms are a class of machine-learning algorithms that have been successfully applied to a number of SAR problems. Unlike other QSAR methods, which use attributes to describe chemical structure, ILP uses relations. This gives ILP the advantages of not requiring explicit superimposition of individual compounds in a dataset, of dealing naturally with multiple conformations, and of using a language much closer to that used normally by chemists. We unify ILP and standard regression techniques to give a QSAR method that has the strength of ILP at describing steric structure with the familiarity and power of regression methods. Complex pharmacophores, correlating with activity, were identified and used as new indicator variables, along with the comparative molecular field analysis (CoMFA) prediction, to form predictive regression equations. We compared the formation of 3D-QSARs using standard CoMFA with the use of ILP on the well-studied thermolysin zinc protease inhibitor dataset and a glycogen phosphorylase inhibitor dataset. In each case the addition of ILP variables produced statistically better results (P thermolysin and P < 0.05 for GP datasets) than the CoMFA analysis. Moreover, the new ILP variables were not found to increase the complexity of the final QSAR equations and gave possible insight into the binding mechanism of the ligand-protein complex under study.
A propositional typicality logic for extending rational consequence
CSIR Research Space (South Africa)
Booth, R
2013-08-01
Full Text Available We introduce Propositional Typicality Logic (PTL), a logic for reasoning about typicality. We do so by enriching classical propositional logic with a typicality operator of which the intuition is to capture the most typical (or normal) situations...
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
Specification and Verification of GPGPU programs using Permission-based Separation logic
Huisman, Marieke; Mihelcic, M.
Graphics Processing Units (GPUs) are increasingly used for general-purpose applications because of their low price, energy efficiency and enormous computing power. Considering the importance of GPU applications, it is vital that the behaviour of GPU programs can be specified and proven correct
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
DEFF Research Database (Denmark)
Albert, Elvira; Puebla, German; Gallagher, John Patrick
2006-01-01
about purity can be added to programs using assertions without having to modify the partial deducer itself, and c) automatic, since (backwards) analysis can be used to automatically infer the required assertions. Our approach has been implemented in the context of Ciaopp, the abstract interpretation...
Imaging of jaw with dental CT software program: Normal Anatomy
International Nuclear Information System (INIS)
Kim, Myong Gon; Seo, Kwang Hee; Jung, Hak Young; Sung, Nak Kwan; Chung, Duk Soo; Kim, Ok Dong; Lee, Young Hwan
1994-01-01
Dental CT software program can provide reformatted cross-sectional and panoramic images that cannot be obtained with conventional axial and direct coronal CT scan. The purpose of this study is to describe the method of the technique and to identify the precise anatomy of jaw. We evaluated 13 mandibles and 7 maxillae of 15 subjects without bony disease who were being considered for endosseous dental implants. Reformatted images obtained by the use of bone algorithm performed on GE HiSpeed Advantage CT scanner were retrospectively reviewed for detailed anatomy of jaw. Anatomy related to neurovascular bundle(mandibular foramen, inferior alveolar canal, mental foramen, canal for incisive artery, nutrient canal, lingual foramen and mylohyoid groove), muscular insertion(mylohyoid line, superior and inferior genial tubercle and digastric fossa) and other anatomy(submandibular fossa, sublingual fossa, contour of alveolar process, oblique line, retromolar fossa, temporal crest and retromolar triangle) were well delineated in mandible. In maxilla, anatomy related to neurovascular bundle(greater palatine foramen and groove, nasopalatine canal and incisive foramen) and other anatomy(alveolar process, maxillary sinus and nasal fossa) were also well delineated. Reformatted images using dental CT software program provided excellent delineation of the jaw anatomy. Therefore, dental CT software program can play an important role in the preoperative assessment of mandible and maxilla for dental implants and other surgical conditions
Imaging of jaw with dental CT software program: Normal Anatomy
Energy Technology Data Exchange (ETDEWEB)
Kim, Myong Gon; Seo, Kwang Hee; Jung, Hak Young; Sung, Nak Kwan; Chung, Duk Soo; Kim, Ok Dong [School of Medicine, Taegu Catholic University, Taegu (Korea, Republic of); Lee, Young Hwan [Taegu Armed Forces General Hospital, Taegu (Korea, Republic of)
1994-07-15
Dental CT software program can provide reformatted cross-sectional and panoramic images that cannot be obtained with conventional axial and direct coronal CT scan. The purpose of this study is to describe the method of the technique and to identify the precise anatomy of jaw. We evaluated 13 mandibles and 7 maxillae of 15 subjects without bony disease who were being considered for endosseous dental implants. Reformatted images obtained by the use of bone algorithm performed on GE HiSpeed Advantage CT scanner were retrospectively reviewed for detailed anatomy of jaw. Anatomy related to neurovascular bundle(mandibular foramen, inferior alveolar canal, mental foramen, canal for incisive artery, nutrient canal, lingual foramen and mylohyoid groove), muscular insertion(mylohyoid line, superior and inferior genial tubercle and digastric fossa) and other anatomy(submandibular fossa, sublingual fossa, contour of alveolar process, oblique line, retromolar fossa, temporal crest and retromolar triangle) were well delineated in mandible. In maxilla, anatomy related to neurovascular bundle(greater palatine foramen and groove, nasopalatine canal and incisive foramen) and other anatomy(alveolar process, maxillary sinus and nasal fossa) were also well delineated. Reformatted images using dental CT software program provided excellent delineation of the jaw anatomy. Therefore, dental CT software program can play an important role in the preoperative assessment of mandible and maxilla for dental implants and other surgical conditions.
2016-01-01
Performance Story,” Evaluation and Program Planning , Vol. 22, No. 1, February 1999, pp. 65–72. Taylor-Powell, Ellen, and Ellen Henert, Developing a...RR1108.html McLaughlin, John A., and Gretchen B. Jordan, “Logic Models: A Tool for Telling Your Program’s Performance Story,” Evaluation and Program Planning , Vol
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.
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 ...
PROBABILISTIC COST ANALYSIS OF LOGIC PROGRAMS ANÁLISIS DE COSTO PROBABILÍSTICO DE PROGRAMAS LÓGICOS
Directory of Open Access Journals (Sweden)
Héctor Juan Soza Pollman
2009-08-01
Full Text Available Cost analyses of logic programs have been developed which make it possible to obtain automatically lower and upper bounds of runtime cost of computations. This information is very useful for a variety of purposes, including granularity control, query optimization in databases, and program transformation and synthesis. However, current techniques suffer a loss of accuracy in some cases which are quite representative (i.e., some divide-and-conquer programs as QuickSort. This paper describes an alternative probabilistic approach which makes it possible to figure out an estimate of the execution cost. One of its advantages is that it needs only a few changes over previously proposed schemes.Se han desarrollado análisis de costos de programas lógicos para obtener automáticamente cotas superiores e inferiores del costo del tiempo de ejecución de dicho tipo de programas. Esta información es muy útil para una variedad de propósitos, incluyendo control de granularidad, optimización de consultas en bases de datos, y transformación de programas y síntesis. Sin embargo, las técnicas actuales carecen de exactitud en algunos casos que son bastante representativos (por ejemplo, algunos programas de dividir para reinar como Quicksort. Este artículo describe un enfoque probabilístico alternativo que hace posible obtener una estimación más precisa del costo de ejecución. Una de sus ventajas es que plantea sólo unos pocos cambios sobre los esquemas propuestos previamente.
PABS: A Computer Program to Normalize Emission Probabilities and Calculate Realistic Uncertainties
International Nuclear Information System (INIS)
Caron, D.S.; Browne, E.; Norman, E.B.
2009-01-01
The program PABS normalizes relative particle emission probabilities to an absolute scale and calculates the relevant uncertainties on this scale. The program is written in Java using the JDK 1.6 library. For additional information about system requirements, the code itself, and compiling from source, see the README file distributed with this program. The mathematical procedures used are given.
Logical Characterisation of Ontology Construction using Fuzzy Description Logics
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
Ontologies based on Description Logics (DLs) have proved to be effective in formally sharing knowledge across semantic technologies, e.g. Semantic Web, Natural Language Processing, Text Analytics, Business intelligence. Our main goal is analysing ontology construction considering vagueness. We have......, 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....
Copies of classical logic in intuitionistic logic
Gaspar, Jaime
2012-01-01
Classical logic (the logic of non-constructive mathematics) is stronger than intuitionistic logic (the logic of constructive mathematics). Despite this, there are copies of classical logic in intuitionistic logic. All copies usually found in the literature are the same. This raises the question: is the copy unique? We answer negatively by presenting three different copies.
DEFF Research Database (Denmark)
Klose, Karl; Ostermann, Klaus
2010-01-01
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze the probl......In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze...
A Logic for Miranda, Revisited
Thompson, Simon
1995-01-01
This paper expands upon work begun in the author's paper 'A Logic for Miranda', Formal Aspects of Computing 1 (1989), in building a logic for the Miranda functional programming language. After summarising the work in that paper, a translation of Miranda definitions into logical formulas is presented, and illustrated by means of examples. This work expands upon the earlier paper in giving a complete treatment of sequences of equations, and by examining how to translate the local definitions in...
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....
Set-Theory and Logic in School
Kapadia, Ramesh
1976-01-01
The author argues that the emphasis on logic and set theory in the school mathematics program is unnecessary and possibly harmful. He discusses briefly the relationships between semantics and logic. (SD)
Eco-logical successes : January 2011
2011-01-01
This document identifies and explains each Eco-Logical signatory agency's strategic environmental programs, projects, and efforts that are either directly related to or share the vision set forth in Eco-Logical. A brief description of an agency's key...
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.
A Verification Logic for GOAL Agents
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.
Flow Logics and Operational Semantics
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1998-01-01
Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analysis...
A Resolution Prover for Coalition Logic
Directory of Open Access Journals (Sweden)
Cláudia Nalon
2014-04-01
Full Text Available We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolution-based calculus for Coalition Logic. We then give details of the implementation of CLProver and present the results for a comparison with an existing tableau-based solver.
Computer program determines exact two-sided tolerance limits for normal distributions
Friedman, H. A.; Webb, S. R.
1968-01-01
Computer program determines by numerical integration the exact statistical two-sided tolerance limits, when the proportion between the limits is at least a specified number. The program is limited to situations in which the underlying probability distribution for the population sampled is the normal distribution with unknown mean and variance.
Logic Programming for Linguistics
DEFF Research Database (Denmark)
Christiansen, Henning
2010-01-01
for modelling different linguistic phenomena. When modelling language in this way, as opposed to using only paper and pencil, your models go live: you can run and test your models and you can use them as automatic language analyzers. This way you will get a better understanding of the dynamics of languages...... – and with no additional effort, you can use it as an automatic language analyzer. I show also another important extension to Prolog, called Constraint Handling Rules, which boosts these grammars with capabilities for captur- ing semantics and pragmatics by abductive reasoning, in a way that I claim is considerably...... can be downloaded from the following website: http://www.ruc.dk/∼henning/LP-for-Linguists....
Modern Logical Frameworks Design
DEFF Research Database (Denmark)
Murawska, Agata Anna
2017-01-01
Throughout the years, logical frameworks have been a successful tool for prototyping and developing a number of logics and programming languages. However, to use the full power of the LF approach, the behaviour of variables in the system being mechanised must match the behaviour of those used...... 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...
Macian-Sorribes, Hector; Pulido-Velazquez, Manuel
2016-04-01
This contribution presents a methodology for defining optimal seasonal operating rules in multireservoir systems coupling expert criteria and stochastic optimization. Both sources of information are combined using fuzzy logic. The structure of the operating rules is defined based on expert criteria, via a joint expert-technician framework consisting in a series of meetings, workshops and surveys carried out between reservoir managers and modelers. As a result, the decision-making process used by managers can be assessed and expressed using fuzzy logic: fuzzy rule-based systems are employed to represent the operating rules and fuzzy regression procedures are used for forecasting future inflows. Once done that, a stochastic optimization algorithm can be used to define optimal decisions and transform them into fuzzy rules. Finally, the optimal fuzzy rules and the inflow prediction scheme are combined into a Decision Support System for making seasonal forecasts and simulate the effect of different alternatives in response to the initial system state and the foreseen inflows. The approach presented has been applied to the Jucar River Basin (Spain). Reservoir managers explained how the system is operated, taking into account the reservoirs' states at the beginning of the irrigation season and the inflows previewed during that season. According to the information given by them, the Jucar River Basin operating policies were expressed via two fuzzy rule-based (FRB) systems that estimate the amount of water to be allocated to the users and how the reservoir storages should be balanced to guarantee those deliveries. A stochastic optimization model using Stochastic Dual Dynamic Programming (SDDP) was developed to define optimal decisions, which are transformed into optimal operating rules embedding them into the two FRBs previously created. As a benchmark, historical records are used to develop alternative operating rules. A fuzzy linear regression procedure was employed to
Weak Completeness of Coalgebraic Dynamic Logics
Kupke, C.; Hansen, H.H.
2015-01-01
We present a coalgebraic generalisation of Fischer and Ladner’s Propositional Dynamic Logic (PDL) and Parikh’s Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a
Harding, John; Yang, Taewon
2015-12-01
Since the work of Crown (J. Natur. Sci. Math. 15(1-2), 11-25 1975) in the 1970's, it has been known that the projections of a finite-dimensional vector bundle E form an orthomodular poset ( omp) {P}(E). This result lies in the intersection of a number of current topics, including the categorical quantum mechanics of Abramsky and Coecke (2004), and the approach via decompositions of Harding (Trans. Amer. Math. Soc. 348(5), 1839-1862 1996). Moreover, it provides a source of omps for the quantum logic program close to the Hilbert space setting, and admitting a version of tensor products, yet having important differences from the standard logics of Hilbert spaces. It is our purpose here to initiate a basic investigation of the quantum logic program in the vector bundle setting. This includes observations on the structure of the omps obtained as {P}(E) for a vector bundle E, methods to obtain states on these omps, and automorphisms of these omps. Key theorems of quantum logic in the Hilbert setting, such as Gleason's theorem and Wigner's theorem, provide natural and quite challenging problems in the vector bundle setting.
Perhitungan Iuran Normal Program Pensiun dengan Asumsi Suku Bunga Mengikuti Model Vasicek
Directory of Open Access Journals (Sweden)
I Nyoman Widana
2017-12-01
Full Text Available Labor has a very important role for national development. One way to optimize their productivity is to guarantee a certainty to earn income after retirement. Therefore the government and the private sector must have a program that can ensure the sustainability of this financial support. One option is a pension plan. The purpose of this study is to calculate the normal cost with the interest rate assumed to follow the Vasicek model and analyze the normal contribution of the pension program participants. Vasicek model is used to match with the actual conditions. The method used in this research is the Projected Unit Credit Method and the Entry Age Normal method. The data source of this research is lecturers of FMIPA Unud. In addition, secondary data is also used in the form of the interest rate of Bank Indonesia for the period of January 2006-December 2015. The results of this study indicate that the older the age of the participants, when starting the pension program, the greater the first year normal cost and the smaller the benefit which he or she will get. Then, normal cost with constant interest rate greater than normal cost with Vasicek interest rate. This occurs because the Vasicek model predicts interest between 4.8879%, up to 6.8384%. While constant interest is only 4.25%. In addition, using normal cost that proportional to salary, it is found that the older the age of the participants the greater the proportion of the salary for normal cost.
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...
Malcolm, Norman; Altuner, Ilyas
2014-01-01
The paper deals exclusively with the doctrine called ‘Logical Behaviorism’. Although this position does not vogue it enjoyed in the 1930s and 1940s, it will always possess a compelling attraction for anyone who is perplexed by the psychological concepts, who has become aware of worthlessness of an appeal to introspection as an account of how we learn those concepts, and he has no inclination to identify mind with brain. There, of course, are other forms of behaviorism, and of reductionism, wh...
Logical consecutions in discrete linear temporal logic
Rybakov, V. V.
2005-01-01
We investigate logical consequence in temporal logics in terms of logical consecutions, i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be ’correct’ in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈 , ≤, ≥ 〉 of all integer numbers, is the prime object of...
Ewing, Gary; McDermott, Suzanne; Thomas-Koger, Marlo; Whitner, Wendy; Pierce, Kristen
2004-01-01
An evaluation was conducted to compare the impact of an 8-week cardiovascular disease risk reduction group teaching program for 92 individuals with mental retardation (MR; IQ less than 70) and 97 normal learners. The curriculum emphasized exercise, nutritional choices, and stress reduction. Body Mass Index (BMI; weight in kilograms, divided by…
Lwin, Thawdar; Aslam, Sarfraz; Mukhale, Phoebe Naliaka
2017-01-01
This study was an investigation of the international students' perceptions of their learning environment in graduate programs at one normal university in China. The study used both quantitative and qualitative research methods. The sample comprised 91 international students, 51 Master and 40 doctoral from three schools: Education, Life Sciences…
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.)
Carlton, David Bryan
The exponential improvements in speed, energy efficiency, and cost that the computer industry has relied on for growth during the last 50 years are in danger of ending within the decade. These improvements all have relied on scaling the size of the silicon-based transistor that is at the heart of every modern CPU down to smaller and smaller length scales. However, as the size of the transistor reaches scales that are measured in the number of atoms that make it up, it is clear that this scaling cannot continue forever. As a result of this, there has been a great deal of research effort directed at the search for the next device that will continue to power the growth of the computer industry. However, due to the billions of dollars of investment that conventional silicon transistors have received over the years, it is unlikely that a technology will emerge that will be able to beat it outright in every performance category. More likely, different devices will possess advantages over conventional transistors for certain applications and uses. One of these emerging computing platforms is nanomagnetic logic (NML). NML-based circuits process information by manipulating the magnetization states of single-domain nanomagnets coupled to their nearest neighbors through magnetic dipole interactions. The state variable is magnetization direction and computations can take place without passing an electric current. This makes them extremely attractive as a replacement for conventional transistor-based computing architectures for certain ultra-low power applications. In most work to date, nanomagnetic logic circuits have used an external magnetic clocking field to reset the system between computations. The clocking field is then subsequently removed very slowly relative to the magnetization dynamics, guiding the nanomagnetic logic circuit adiabatically into its magnetic ground state. In this dissertation, I will discuss the dynamics behind this process and show that it is greatly
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....
DEFF Research Database (Denmark)
Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker
2012-01-01
We present a logical relation for showing the correctness of program transformations based on a new type-and-eﬀect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number...... of interesting program transformations that rely on eﬀect annotations. In particular, we prove a Parallelization Theorem, which expresses when it is sound to run two expressions in parallel instead of sequentially. The conditions are expressed solely in terms of the types and eﬀects of the expressions...
The Pointer Assertion Logic Engine
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael Ignatieff
2001-01-01
in the logical tradition by encoding the programs and partial specifications as formulas in monadic second-order logic. Validity of these formulas is checked by the MONA tool, which also can provide explicit counterexamples to invalid formulas. To make verification decidable, the technique requires explicit loop...... restricted to simple special cases such as lists or trees. Even so, our current implementation is as fast as the previous specialized tools. Programs are annotated with partial specifications expressed in Pointer Assertion Logic, a new notation for expressing properties of the program store. We work......We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were...
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.
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....
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 projec...
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...... 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...... by developments within semantics for logic programming within computational logic and formal theories of truth within philosophical logic. The thesis provides a number of examples showing how the developed theories can be used as reasoning frameworks for agents with introspective abilities. In Danish...
Introduction to fuzzy logic using Matlab
Sivanandam, SN; Deepa, S N
2006-01-01
Fuzzy Logic, at present is a hot topic, among academicians as well various programmers. This book is provided to give a broad, in-depth overview of the field of Fuzzy Logic. The basic principles of Fuzzy Logic are discussed in detail with various solved examples. The different approaches and solutions to the problems given in the book are well balanced and pertinent to the Fuzzy Logic research projects. The applications of Fuzzy Logic are also dealt to make the readers understand the concept of Fuzzy Logic. The solutions to the problems are programmed using MATLAB 6.0 and the simulated results are given. The MATLAB Fuzzy Logic toolbox is provided for easy reference.
DESIGN POWER SYSTEM STABILIZER MENGGUNAKAN FUZZY LOGIC
Directory of Open Access Journals (Sweden)
Ivo Salvador Soares Miranda
2014-10-01
Full Text Available Stabiltas merupakan kemampuan sistem untuk menjaga kondisi operasi seimbang dan kembali kekondisi operasi normal ketika terjadi gangguan. Penerapan power system stabilizer pada sistem tenaga mampu memberikan sinyal respon yang cepat atas berbagai kondisi gangguan dan mengupayakan tidak meluasnya jangkauan gangguan. Dalam mendesign power system stabilizer menggunakan robust fuzzy logic, menggunakan satu sinyal input yaitu kecepatan deviasi rotor. Hasil simulasinya dibandingkan dengan metode fuzzy logic dan kovensional. Studi simulasi menunjukan, design power system stabilizer menggunakan robust fuzzy logic memiliki nilai sinyal peak time dan settling time relatif kecil dibandingkan dengan metode fuzzy logic dan konvensional.
Analogy: Justification for Logic.
Sacksteder, William
1979-01-01
Presents and defends the thesis that it is analogy which provides justification for any logic, and for any argument to the extent that it depends on logic for justification. Analogy acquires inept support from logic, but logic acquires adroit support from analogy. (JMF)
International Nuclear Information System (INIS)
Adam, J.; Tsupko-Sitnikov, V.M.
1996-01-01
A new, rigorously substantiated approach to construction of decay schemes on the basis of γ-γ coincidence data is described. Complete decay modes (concrete cascades of transitions from excited to the ground-state of a nucleus excited in a decay or a reaction) and continuity regions in complete modes (regions of successive transitions) are isolated by logical operations with rows (columns) of a symmetrical coincidence matrix where rows (columns) correspond to energies of coinciding transitions and matrix elements are unities and zeros, depending on the presence or absence of the given coincidence. To reject false complete modes and continuity regions arising from incompleteness of the coincidence data and errors in them, energy selection is introduced for complete modes and continuity regions, which demands that total energy of their constituent transitions should be equal to total energy of some other complete modes and continuity regions and to the energies of singles. With the continuity regions found, it is possible to order transitions in the selected complete modes and to algorithmize matching of complete modes into a decay scheme. 10 refs., 3 figs
Holtrop, Jodi Summers; Potworowski, Georges; Fitzpatrick, Laurie; Kowalk, Amy; Green, Lee A
2016-08-15
Care management in primary care can be effective in helping patients with chronic disease improve their health status, however, primary care practices are often challenged with implementation. Further, there are different ways to structure care management that may make implementation more or less successful. Normalization process theory (NPT) provides a means of understanding how a new complex intervention can become routine (normalized) in practice. In this study, we used NPT to understand how care management structure affected how well care management became routine in practice. Data collection involved semi-structured interviews and observations conducted at 25 practices in five physician organizations in Michigan, USA. Practices were selected to reflect variation in physician organizations, type of care management program, and degree of normalization. Data were transcribed, qualitatively coded and analyzed, initially using an editing approach and then a template approach with NPT as a guiding framework. Seventy interviews and 25 observations were completed. Two key structures for care management organization emerged: practice-based care management where the care managers were embedded in the practice as part of the practice team; and centralized care management where the care managers worked independently of the practice work flow and was located outside the practice. There were differences in normalization of care management across practices. Practice-based care management was generally better normalized as compared to centralized care management. Differences in normalization were well explained by the NPT, and in particular the collective action construct. When care managers had multiple and flexible opportunities for communication (interactional workability), had the requisite knowledge, skills, and personal characteristics (skill set workability), and the organizational support and resources (contextual integration), a trusting professional relationship
Stansfield, James L.; And Others
An Intelligent Computer Aided Instruction (ICAI) program that incorporates an Expert module which allows the tutor to compare the student's response to those generated by an expert was developed for use with Wumpus, a simple maze-exploration game. The Wumpus Advisor program offers advice to a player involved in choosing the best move in a game for…
Kats, L.C.; Visser, E.
2010-01-01
Software platforms such as the Java Virtual Machine or the CLR .NET virtual machine have their own ecosystem of a core programming language or instruction set, libraries, and developer community. Programming languages can target multiple software platforms to increase interoperability or to boost
Metamathematics of fuzzy logic
Hájek, Petr
1998-01-01
This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. Some important systems of real-valued propositional and predicate calculus are defined and investigated. The aim is to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named `fuzzy inference' can be naturally understood as logical deduction.
Logical formalization and the formalization of logic(s)
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav; Svoboda, Vladimír
2016-01-01
Roč. 59, č. 233 (2016), s. 55-80 ISSN 0024-5836 R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : logical formalization * logical analysis * reflective equilibrium Subject RIV: AA - Philosophy ; Religion
Logic Learning in Hopfield Networks
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.
Implementing Eco-Logical 2014-2015 Annual Report
2015-12-01
The Eco-Logical approach offers an ecosystem-based framework for integrated infrastructure and natural resource planning, project development, and delivery. The 2014/2015 Implementing Eco-Logical Program Annual Report provides updates on the Federal ...
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...
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...
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...
Energy Technology Data Exchange (ETDEWEB)
Greene, D.L.
1986-08-01
This report describes a computer program for calculating the value, in dollars per consumer, of the difference in consumer satisfaction between two different sets of alternatives from which consumers must choose. Multinomial Logit and Hedonic Demand formulations of discrete choice, random utility models are used to measure the difference in consumer surplus between the two sets of alternatives, which may differ both in number and characteristics. The user must supply attribute weights for the characteristics of interest, as well as quantitative measures of the characteristics themselves. The program also has limited capability to predict changes in market shares resulting from changes in vehicle attributes. Consumer surplus change in the Hedonic Demand Model is estimated by means of Monte Carlo integration. The program is written in FORTRAN 77 for an IBM PC, with an 8087 math coprocessor chip. 10 refs., 1 fig.
Flow Logic for Process Calculi
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Nielson, Flemming; Pilegaard, Henrik
2012-01-01
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...
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy student...
Many-valued Logic and Fuzzy Logic
Czech Academy of Sciences Publication Activity Database
Hájek, Petr
2011-01-01
Roč. 27, č. 2 (2011), s. 315-324 ISSN 0970-7794 R&D Projects: GA ČR GEICC/08/E018 Institutional research plan: CEZ:AV0Z10300504 Keywords : many valued logic * fuzzy logic Subject RIV: BA - General Mathematics
LMFBR. Off normal, transient test facilities and programs in the USA
International Nuclear Information System (INIS)
Herbst, R.J.
1985-01-01
The United States fast breeder reactor development program has included operational transient analyses and experiments to verify the predicted performance of core components. Operational transient testing has focused on off-normal operation during Plant Protection System terminated transient-overpower events. In-pile and out-of-pile tests have been used to simulate predicted thermal and mechanical strain cycles and measure component response. The spectrum of reactivity ramp rates investigated in TOP tests has recently been expanded to include rates of less than $0.1/s. These slow ramp rate studies are being done in cooperation with the Japanese. The US has also cooperated with the UK in the transient testing of Prototype Fast Reactor fuel pins
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.
Newton-Smith, WH
2003-01-01
A complete introduction to logic for first-year university students with no background in logic, philosophy or mathematics. In easily understood steps it shows the mechanics of the formal analysis of arguments.
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates...
National Research Council Canada - National Science Library
Bickford, Mark
2008-01-01
.... This report describes the design of an Event Logic Assistant (Elan) that provides powerful automated support for applying event logic to the design and implementation of high-assurance distributed protocols...
National Research Council Canada - National Science Library
Jaspan, Ciera; Quan, Trisha; Aldrich, Jonathan
2008-01-01
... it. In this paper, we introduce error reporting logic (ERL), an algorithm and tool that produces succinct explanations for why a target system violates a specification expressed in first order predicate logic...
Shalack, V.
2013-01-01
The article offers a look at the combinatorial logic as the logic of signs operating in the most general sense. For this it is proposed slightly reformulate it in terms of introducing and replacement of the definitions.
Fuzzy logic controller optimization
Sepe, Jr., Raymond B; Miller, John Michael
2004-03-23
A method is provided for optimizing a rotating induction machine system fuzzy logic controller. The fuzzy logic controller has at least one input and at least one output. Each input accepts a machine system operating parameter. Each output produces at least one machine system control parameter. The fuzzy logic controller generates each output based on at least one input and on fuzzy logic decision parameters. Optimization begins by obtaining a set of data relating each control parameter to at least one operating parameter for each machine operating region. A model is constructed for each machine operating region based on the machine operating region data obtained. The fuzzy logic controller is simulated with at least one created model in a feedback loop from a fuzzy logic output to a fuzzy logic input. Fuzzy logic decision parameters are optimized based on the simulation.
James, A. P.; Francis, L. R. V. J.; Kumar, D.
2013-01-01
We report a resistance based threshold logic family useful for mimicking brain like large variable logic functions in VLSI. A universal Boolean logic cell based on an analog resistive divider and threshold logic circuit is presented. The resistive divider is implemented using memristors and provides output voltage as a summation of weighted product of input voltages. The output of resistive divider is converted into a binary value by a threshold operation implemented by CMOS inverter and/or O...
Institutional Logics in Action
DEFF Research Database (Denmark)
Lounsbury, Michael; Boxenbaum, Eva
2013-01-01
This double volume presents state-of-the-art research and thinking on the dynamics of actors and institutional logics. In the introduction, we briefly sketch the roots and branches of institutional logics scholarship before turning to the new buds of research on the topic of how actors engage ins...... prolific stream of research on institutional logics by deepening our insight into the active use of institutional logics in organizational action and interaction, including the institutional effects of such (inter)actions....
FREC-4A: a computer program to predict fuel rod performance under normal reactor operation
International Nuclear Information System (INIS)
Harayama, Yasuo; Izumi, Fumio
1981-10-01
The program FREC-4A (Fuel Reliability Evaluation Code-version 4A) is used for predicting fuel rod performance in normal reactor operation. The performance is calculated in accordance with the irradiation history of fuel rods. Emphasis is placed on the prediction of the axial elongation of claddings induced by pellet-cladding mechanical interaction, including the influence of initially preloaded springs inserted in fuel rod lower plenums. In the FREC-4A, an fuel rod is divided into axial segments. In each segment, it is assumed that the temperature, stress and strain are axi-symmetrical, and the axial strain in constant in fuel pellets and in a cladding, though the values in the pellets and in the cladding are different. The calculation of the contact load and the clearance along the length of a fuel rod and the stress and strain in each segment is explained. The method adopted in the FREC-4A is simple, and suitable to predict the deformation of fuel rods over their full length. This report is described on the outline of the program, the method of solving the stiffness equations, the calculation models, the input data such as irradiation history, output distribution, material properties and pores, the printing-out of input data and calculated results. (Kako, I.)
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...
Indian Academy of Sciences (India)
andoh
1Indian Institute of Science Education and Research, Mohali. 2The Institute of Mathematical Sciences, Chennai ... Bottomline of this work: One can obtain very reliable Logic Circuit. Elements by exploiting nonlinearity in the presence of ... with the truth tables of the basic logic operations. Sudeshna Sinha. Logical Stochastic ...
DEFF Research Database (Denmark)
Berg Johansen, Christina; Waldorff, Susanne Boch
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...
DEFF Research Database (Denmark)
Lopez, Hugo Andres; Carbone, Marco; Hildebrandt, Thomas
2010-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for speciﬁcation and veriﬁcation of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL...
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...... simple verification of simple programs. Fictional Separation Logic allows multiple notions of disjointness to coexist in a verification framework, thereby extending the utility of the frame rule. Using techniques developed in the previous article, the exact meaning of disjointness can be made abstract......Separation logic is an extension of Hoare logic for reasoning about programs that use pointers or references to potentially-shared data. The problem with such programs, both in formal proofs and in informal understanding of them, is to know not only what data they change but also to know what data...
Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing
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.
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
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 Logical Analysis of Quantum Voting Protocols
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.
Symbolic logic and mechanical theorem proving
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.
International Nuclear Information System (INIS)
Lallement, Dominique.
1979-01-01
Nuclear reactors are monitored by several systems combined. The hydraulic and mechanical limitations on the equipment and the heat transfer requirements in the core set a reliable working range for the boiler defined with certain safety margins. The control system tends to keep the power plant within this working range. The protection system covers all the electrical and mechanical equipment needed to safeguard the boiler in the event of abnormal transients or accidents accounted for in the design of the plant. On units in service protection is handled by cabled automatic systems. For better reliability and safety operation, greater flexibility of use (modularity, adaptability) and improved start-up criteria by data processing the tendency is to use digital programmed systems. Computers are already present in control systems but their introduction into protection systems meets with some reticence on the part of the nuclear safety authorities. A study on the replacement of conventional by digital protection systems is presented. From choices partly made on the principles which should govern the hardware and software of a protection system the reliability of different structures and elements was examined and an experimental model built with its simulator and test facilities. A prototype based on these options and studies is being built and is to be set up on one of the CEN-G reactors for tests [fr
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....
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...
Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371)
Blanchette, Jasmin Christian; Fuhs, Carsten; Sofronie-Stokkermans, Viorica; Tinelli, Cesare
2018-01-01
This report documents the program and the outcomes of Dagstuhl Seminar 17371 "Deduction Beyond First-Order Logic." Much research in the past two decades was dedicated to automating first-order logic with equality. However, applications often need reasoning beyond this logic. This includes genuinely higher-order reasoning, reasoning in theories that are not finitely axiomatisable in first-order logic (such as those including transitive closure operators or standard arithmetic on integers o...
Proof-graphs for Minimal Implicational Logic
Directory of Open Access Journals (Sweden)
Marcela Quispe-Cruz
2014-03-01
Full Text Available It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs. The aim of this work is to study how to reduce the weight of propositional deductions. We present the formalism of proof-graphs for purely implicational logic, which are graphs of a specific shape that are intended to capture the logical structure of a deduction. The advantage of this formalism is that formulas can be shared in the reduced proof. In the present paper we give a precise definition of proof-graphs for the minimal implicational logic, together with a normalization procedure for these proof-graphs. In contrast to standard tree-like formalisms, our normalization does not increase the number of nodes, when applied to the corresponding minimal proof-graph representations.
A Graph Calculus for Predicate Logic
Directory of Open Access Journals (Sweden)
Paulo A. S. Veloso
2013-03-01
Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.
Runtime Analysis of Linear Temporal Logic Specifications
Giannakopoulou, Dimitra; Havelund, Klaus
2001-01-01
This report presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to B chi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.
APPLICATION OF FUZZY LOGIC TOOLBOX FOR MODELLING FUZZY LOGIC CONTROLLERS
Olesiak, Krzysztof
2017-01-01
Computer technology, which has been developing very fast in the recent years, can be also fruitfully applied in teaching. For example, the software package Matlab is highly useful in teaching students at Bachelor Programs of Electrical Engineering and Automatics and Robotics. Fuzzy Logic Toolbox of the Matlab package can be used for designing and modelling controllers. Thanks to a large number of pre-defined elements available in the libraries, it is possible to create even highly complicated...
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...
Session Types in Abelian Logic
Directory of Open Access Journals (Sweden)
Yoichi Hirai
2013-12-01
Full Text Available There was a PhD student who says "I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes." We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky's linear lambda calculus LF and characterizes Abelian logic.
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
Logical database design principles
Garmany, John; Clark, Terry
2005-01-01
INTRODUCTION TO LOGICAL DATABASE DESIGNUnderstanding a Database Database Architectures Relational Databases Creating the Database System Development Life Cycle (SDLC)Systems Planning: Assessment and Feasibility System Analysis: RequirementsSystem Analysis: Requirements Checklist Models Tracking and Schedules Design Modeling Functional Decomposition DiagramData Flow Diagrams Data Dictionary Logical Structures and Decision Trees System Design: LogicalSYSTEM DESIGN AND IMPLEMENTATION The ER ApproachEntities and Entity Types Attribute Domains AttributesSet-Valued AttributesWeak Entities Constraint
Energy Technology Data Exchange (ETDEWEB)
Wall, M.J.W.
1992-07-01
The notion of {open_quotes}probability{close_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.
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...... overlap. We demonstrate, via a range of examples, how fictional separation logic can be used to reason locally and modularly about mutable abstract data types, possibly implemented using sophisticated sharing. Fictional separation logic is defined on top of standard separation logic, and both the meta...
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
The purpose of the article is to demonstrate that in order to understand competition as a socially organizing phenomenon, we should not examine competition in isolation, but as constellations of heterogeneous logics. More precisely, the article is based on two main theoretical points: (1) Logics...... of a presumed logic of competition within EU law, whereas the second part focuses on particular legal logics. In this respect, the so-called ‘real link criterion’ (determining the access to transnational social rights for certain groups of unemployed people) is given special attention. What is particularly...
Directory of Open Access Journals (Sweden)
Marco Carbone
2011-10-01
Full Text Available We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL, a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a significant decidable fragment which we provide with a sound and complete proof system for checking validity of formulae.
Introduction to mathematical logic
Mendelson, Elliott
2015-01-01
The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.The sixth edition incorporates recent work on Gödel's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition. It is offered in th
Crossley, J N; Brickhill, CJ; Stillwell, JC
2010-01-01
Although mathematical logic can be a formidably abstruse topic, even for mathematicians, this concise book presents the subject in a lively and approachable fashion. It deals with the very important ideas in modern mathematical logic without the detailed mathematical work required of those with a professional interest in logic.The book begins with a historical survey of the development of mathematical logic from two parallel streams: formal deduction, which originated with Aristotle, Euclid, and others; and mathematical analysis, which dates back to Archimedes in the same era. The streams beg
Fuzzy Logic Based Automatic Door Control System
Directory of Open Access Journals (Sweden)
Harun SUMBUL
2017-12-01
Full Text Available In this paper, fuzzy logic based an automatic door control system is designed to provide for heat energy savings. The heat energy loss usually occurs in where outomotic doors are used. Designed fuzzy logic system’s Input statuses (WS: Walking Speed and DD: Distance Door and the output status (DOS: Door Opening Speed is determined. According to these cases, rule base (25 rules is created; the rules are processed by a fuzzy logic and by appyled to control of an automatic door. An interface program is prepared by using Matlab Graphical User Interface (GUI programming language and some sample results are checked on Matlab using fuzzy logic toolbox. Designed fuzzy logic controller is tested at different speed cases and the results are plotted. As a result; in this study, we have obtained very good results in control of an automatic door with fuzzy logic. The results of analyses have indicated that the controls performed with fuzzy logic provided heat energy savings, less heat energy loss and reliable, consistent controls and that are feasible to in real.
Towards a Formal Occurrence Logic based on Predicate Logic
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
2015-01-01
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...
Philosophical, logical and scientific perspectives in engineering
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
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...
Mapping Modular SOS to Rewriting Logic
DEFF Research Database (Denmark)
Braga, Christiano de Oliveira; Haeusler, Erik Hermann; Meseguer, José
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.
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.......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...
Understanding Social Media Logic
Directory of Open Access Journals (Sweden)
José van Dijck
2013-08-01
Full Text Available Over the past decade, social media platforms have penetrated deeply into the mechanics of everyday life, affecting people's informal interactions, as well as institutional structures and professional routines. Far from being neutral platforms for everyone, social media have changed the conditions and rules of social interaction. In this article, we examine the intricate dynamic between social media platforms, mass media, users, and social institutions by calling attention to social media logic—the norms, strategies, mechanisms, and economies—underpinning its dynamics. This logic will be considered in light of what has been identified as mass media logic, which has helped spread the media's powerful discourse outside its institutional boundaries. Theorizing social media logic, we identify four grounding principles—programmability, popularity, connectivity, and datafication—and argue that these principles become increasingly entangled with mass media logic. The logic of social media, rooted in these grounding principles and strategies, is gradually invading all areas of public life. Besides print news and broadcasting, it also affects law and order, social activism, politics, and so forth. Therefore, its sustaining logic and widespread dissemination deserve to be scrutinized in detail in order to better understand its impact in various domains. Concentrating on the tactics and strategies at work in social media logic, we reassess the constellation of power relationships in which social practices unfold, raising questions such as: How does social media logic modify or enhance existing mass media logic? And how is this new media logic exported beyond the boundaries of (social or mass media proper? The underlying principles, tactics, and strategies may be relatively simple to identify, but it is much harder to map the complex connections between platforms that distribute this logic: users that employ them, technologies that
Cut elimination in multifocused linear logic
DEFF Research Database (Denmark)
Guenot, Nicolas; Brock-Nannestad, Taus
2015-01-01
We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping rule instances in focusing phases. We show that cut...... elimination can be performed in a sensible way even though the proof requires some specific lemmas to deal with multifocusing phases, and discuss the difficulties arising with cut elimination when considering normal forms of proofs in linear logic....
Learning fuzzy logic control system
Lung, Leung Kam
1994-01-01
The performance of the Learning Fuzzy Logic Control System (LFLCS), developed in this thesis, has been evaluated. The Learning Fuzzy Logic Controller (LFLC) learns to control the motor by learning the set of teaching values that are generated by a classical PI controller. It is assumed that the classical PI controller is tuned to minimize the error of a position control system of the D.C. motor. The Learning Fuzzy Logic Controller developed in this thesis is a multi-input single-output network. Training of the Learning Fuzzy Logic Controller is implemented off-line. Upon completion of the training process (using Supervised Learning, and Unsupervised Learning), the LFLC replaces the classical PI controller. In this thesis, a closed loop position control system of a D.C. motor using the LFLC is implemented. The primary focus is on the learning capabilities of the Learning Fuzzy Logic Controller. The learning includes symbolic representation of the Input Linguistic Nodes set and Output Linguistic Notes set. In addition, we investigate the knowledge-based representation for the network. As part of the design process, we implement a digital computer simulation of the LFLCS. The computer simulation program is written in 'C' computer language, and it is implemented in DOS platform. The LFLCS, designed in this thesis, has been developed on a IBM compatible 486-DX2 66 computer. First, the performance of the Learning Fuzzy Logic Controller is evaluated by comparing the angular shaft position of the D.C. motor controlled by a conventional PI controller and that controlled by the LFLC. Second, the symbolic representation of the LFLC and the knowledge-based representation for the network are investigated by observing the parameters of the Fuzzy Logic membership functions and the links at each layer of the LFLC. While there are some limitations of application with this approach, the result of the simulation shows that the LFLC is able to control the angular shaft position of the
Criteria for logical formalization
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav; Svoboda, Vladimír
2013-01-01
Roč. 190, č. 14 (2013), s. 2897-2924 ISSN 0039-7857 R&D Projects: GA ČR(CZ) GAP401/10/1279 Institutional support: RVO:67985955 Keywords : logic * logical form * formalization * reflective equilibrium Subject RIV: AA - Philosophy ; Religion Impact factor: 0.637, year: 2013
CSIR Research Space (South Africa)
Klarman, S
2013-05-01
Full Text Available We introduce Description Logics of Context (DLCs) - an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy's tradition of treating contexts as formal objects over which one can quantify...
Directory of Open Access Journals (Sweden)
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.
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2012-01-01
In this paper we explore the logic of now, yesterday, today and tomorrow by combining the semantic approach to indexicality pioneered by Hans Kamp [9] and refined by David Kaplan [10] with hybrid tense logic. We first introduce a special now nominal (our @now corresponds to Kamp’s original now...
A. Ponse (Alban); M.B. van der Zwaag
2002-01-01
textabstractWe distinguish two interpretations for the truth value `undefined' in Kleene's three-valued logic. Combining these two interpretations leads to a four-valued propositional logic that characterizes two particular ingredients of process algebra: ``choice' and ``inaction'. We study two
Linear Logical Voting Protocols
DEFF Research Database (Denmark)
DeYoung, Henry; Schürmann, Carsten
2012-01-01
. In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW- FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise...
Indian Academy of Sciences (India)
andoh
Our motivation stems from an issue that is receiving considerable attention today: As computational devices and platforms continue to shrink in size .... Changing C changes the symmetry of the potential wells : leads to different logical responses. Morphing Logic Gate. In effect, we are able to obtain the basic ingredients of ...
Malhas, Othman Qasim
1993-10-01
The concept of “abacus logic” has recently been developed by the author (Malhas, n.d.). In this paper the relation of abacus logic to the concept of fuzziness is explored. It is shown that if a certain “regularity” condition is met, concepts from fuzzy set theory arise naturally within abacus logics. In particular it is shown that every abacus logic then has a “pre-Zadeh orthocomplementation”. It is also shown that it is then possible to associate a fuzzy set with every proposition of abacus logic and that the collection of all such sets satisfies natural conditions expected in systems of fuzzy logic. Finally, the relevance to quantum mechanics is discussed.
Microelectromechanical reprogrammable logic device
Hafiz, Md Abdullah Al
2016-03-29
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
Caulfield, H. John
2005-05-01
Progress of optical logic has been anything but uniform or even monotonic. The hope for "all optical computers" was largely abandoned after devastating critiques by Keyes. Over time, optical logic transformed into a very viable niche activity by the needs of optical communication for "all optical" logic and the advent of a critical component: the SOA or Semiconductor Optical Amplifier. I argue that a new phase in this uneven history can be defined - linear (single photon, not multiple entangled photon) quantum optical logic. These can perform conservative, reversible logic operations without energy or time penalties, but cascading requires the irreversible act of measurement, so only single devices or single layers can deliver those advantages.
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.
Holtrop, Jodi Summers; Potworowski, Georges; Fitzpatrick, Laurie; Kowalk, Amy; Green, Lee A.
2016-01-01
Background Care management in primary care can be effective in helping patients with chronic disease improve their health status, however, primary care practices are often challenged with implementation. Further, there are different ways to structure care management that may make implementation more or less successful. Normalization process theory (NPT) provides a means of understanding how a new complex intervention can become routine (normalized) in practice. In this study, we used NPT to u...
An Embedded Reconfigurable Logic Module
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.
Texture classification using logical operators.
Manian, V; Vasquez, R; Katiyar, P
2000-01-01
In this paper, a new algorithm for texture classification based on logical operators is presented. Operators constructed from logical building blocks are convolved with texture images. An optimal set of six operators are selected based on their texture discrimination ability. The responses are then converted to standard deviation matrices computed over a sliding window. Zonal sampling features are computed from these matrices. A feature selection process is applied and the new set of features are used for texture classification. Classification of several natural and synthetic texture images are presented demonstrating the excellent performance of the logical operator method. The computational superiority and classification accuracy of the algorithm is demonstrated by comparison with other popular methods. Experiments with different classifiers and feature normalization are also presented. The Euclidean distance classifier is found to perform best with this algorithm. The algorithm involves only convolutions and simple arithmetic in the various stages which allows faster implementations. The algorithm is applicable to different types of classification problems which is demonstrated by segmentation of remote sensing images, compressed and reconstructed images and industrial images.
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...
Log-normal spray drop distribution...analyzed by two new computer programs
Gerald S. Walton
1968-01-01
Results of U.S. Forest Service research on chemical insecticides suggest that large drops are not as effective as small drops in carrying insecticides to target insects. Two new computer programs have been written to analyze size distribution properties of drops from spray nozzles. Coded in Fortran IV, the programs have been tested on both the CDC 6400 and the IBM 7094...
Logic in elementary mathematics
Exner, Robert M
2011-01-01
This applications-related introductory treatment explores facets of modern symbolic logic useful in the exposition of elementary mathematics. The authors convey the material in a manner accessible to those trained in standard elementary mathematics but lacking any formal background in logic. Topics include the statement calculus, proof and demonstration, abstract mathematical systems, and the restricted predicate calculus. The final chapter draws upon the methods of logical reasoning covered in previous chapters to develop solutions of linear and quadratic equations, definitions of order and
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method.......Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...
International Nuclear Information System (INIS)
Bialkowski, J.; Moszynski, M.; Zagorski, A.
1981-01-01
The logic diagram principle of operation and some details of the design of the multiplicity logic unit are presented. This unit was specially designed to fulfil the requirements of a multidetector arrangement for gamma-ray multiplicity measurements. The unit is equipped with 16 inputs controlled by a common coincidence gate. It delivers a linear output pulse with the height proportional to the multiplicity of coincidences and logic pulses corresponding to 0, 1, ... up to >= 5-fold coincidences. These last outputs are used to steer the routing unit working with the multichannel analyser. (orig.)
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......, CWL contains modal operators indexed with rational numbers to predicate over the numerical labels of LWSs as well as a binary modal operator that encodes properties concerning the (de-) composition of LWSs. We develop a Hilbert-style axiomatic system for CWL and we prove weak- and strong......-completeness results for this logic. To complete these proofs we involve advanced topological techniques from Model Theory....
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
Print preparation of the logical INIS-character set for a digital LNO3 printer
International Nuclear Information System (INIS)
Mueller, M.; Nevyjel, A.
1987-09-01
The implementation of the revised INIS-character set (describedin INIS-Circular Letter No.131) made it necessary to develop a print preparation program, which transfers most of the new INIS logical characters to characters, which are printable on a local LNO3 laser printer. The program is written in PL/I and runs under VAX/VMS on a VAX 11/750. It reads a normal print file and replaces the encoded logical characters by special control sequences, which generate the corresponding images on the LNO3 printer. The program is used for print preparation of any INIS-data records, both input preparation and output tape utilisation on the local VAX system. (Author)
Experimental program on fuel rod behaviour under off-normal conditions
International Nuclear Information System (INIS)
Languille, A.; Cecchi, P.
1985-01-01
During LMFBR plant operation, fuel developments are primarily concerned with the fuel pin irradiation behaviour under steady-state conditions up to high burn-up levels. But additional studies under off-normal conditions are necessary in order to assess fuel pin performance and to define operational limits. (author)
DEFF Research Database (Denmark)
Rapin, Nicolas; Bagger, Frederik Otzen; Jendholm, Johan
2014-01-01
Gene expression profiling has been used extensively to characterize cancer, identify novel subtypes, and improve patient stratification. However, it has largely failed to identify transcriptional programs that differ between cancer and corresponding normal cells and has not been efficient in iden......-karyotype AML, which allowed for the generation of a highly prognostic survival signature. Collectively, our CvN method holds great potential as a tool for the analysis of gene expression profiles of cancer patients....
DEFF Research Database (Denmark)
Aiello, Marco; Bezhanishvili, Guram; Bloch, Isabelle
2012-01-01
Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora...... of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones in the logical representation of space and investigate current trends. In doing so......, we do not only consider classical logic, but we indulge ourselves with modal logics. These present themselves naturally by providing simple axiomatizations of different geometries, topologies, space-time causality, and vector spaces....
Henson, C Ward; Kechris, Alexander S; Odell, Edward; Finet, Catherine; Michaux, Christian; Cassels, J W S
2003-01-01
This volume comprises articles from four outstanding researchers who work at the cusp of analysis and logic. The emphasis is on active research topics; many results are presented that have not been published before and open problems are formulated.
DEFF Research Database (Denmark)
Monica, Dario Della; Goranko, Valentin; Montanari, Angelo
2011-01-01
We discuss a family of modal logics for reasoning about relational structures of intervals over (usually) linear orders, with modal operators associated with the various binary relations between such intervals, known as Allen’s interval relations. The formulae of these logics are evaluated...... at intervals rather than points and the main eect of that semantic feature is substantially higher expressiveness and computational complexity of the interval logics as compared to point-based ones. Without purporting to provide a comprehensive survey of the field, we take the reader to a journey through...... the main developments in it over the past 10 years and outline some landmark results on expressiveness and (un)decidability of the satisfiability problem for the family of interval logics....
Medan, R. T.; Ray, K. S.
1974-01-01
A description of and users manual are presented for a U.S.A. FORTRAN 4 computer program which evaluates spanwise and chordwise loading distributions, lift coefficient, pitching moment coefficient, and other stability derivatives for thin wings in linearized, steady, subsonic flow. The program is based on a kernel function method lifting surface theory and is applicable to a large class of planforms including asymmetrical ones and ones with mixed straight and curved edges.
Characterization of quantum logics
International Nuclear Information System (INIS)
Lahti, P.J.
1980-01-01
The quantum logic approach to axiomatic quantum mechanics is used to analyze the conceptual foundations of the traditional quantum theory. The universal quantum of action h>0 is incorporated into the theory by introducing the uncertainty principle, the complementarity principle, and the superposition principle into the framework. A characterization of those quantum logics (L,S) which may provide quantum descriptions is then given. (author)
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
1999-01-01
Conceptual spaces have been proposed as topological or geometric means for establishing conceptual structures and models. This paper, after briey reviewing conceptual spaces, focusses on the relationship between conceptual spaces and logical concept languages with operations for combining concepts...... to form concepts. Speci cally is introduced an algebraic concept logic, for which conceptual spaces are installed as semantic domain as replacement for, or enrichment of, the traditional....
Logic and declarative language
Downward, M
2004-01-01
Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.
Directory of Open Access Journals (Sweden)
Y.O. Ostapenko
2014-04-01
Full Text Available Purpose: to improve vocational and applied physical training of students of economics. Material: the pedagogical study involved 72 male students (aged 19-20 years. Results: job study was conducted. Defined professionally significant neurobehavioral performance of students of information logical group. Matched professionally applied exercises for their development. The results showed that in the process of purposeful muscle activity improved mechanisms of regulation of neural processes, adaptive changes occur that affect the temporal parameters of sensorimotor motor responses. A comparative analysis of the psychophysiological indicators of students of the control and experimental groups was done. Conclusions: it was found that matched professionally applied exercises positively affect the development of psycho-physiological qualities of students information and logical group of specialties.
Cell-Type-Specific Gene Programs of the Normal Human Nephron Define Kidney Cancer Subtypes.
Lindgren, David; Eriksson, Pontus; Krawczyk, Krzysztof; Nilsson, Helén; Hansson, Jennifer; Veerla, Srinivas; Sjölund, Jonas; Höglund, Mattias; Johansson, Martin E; Axelson, Håkan
2017-08-08
Comprehensive transcriptome studies of cancers often rely on corresponding normal tissue samples to serve as a transcriptional reference. In this study, we performed in-depth analyses of normal kidney tissue transcriptomes from the TCGA and demonstrate that the histological variability in cellularity, inherent in the kidney architecture, lead to considerable transcriptional differences between samples. This should be considered when comparing expression profiles of normal and cancerous kidney tissues. We exploited these differences to define renal-cell-specific gene signatures and used these as a framework to analyze renal cell carcinoma (RCC) ontogeny. Chromophobe RCCs express FOXI1-driven genes that define collecting duct intercalated cells, whereas HNF-regulated genes, specific for proximal tubule cells, are an integral part of clear cell and papillary RCC transcriptomes. These networks may be used as a framework for understanding the interplay between genomic changes in RCC subtypes and the lineage-defining regulatory machinery of their non-neoplastic counterparts. Copyright © 2017 The Author(s). Published by Elsevier Inc. All rights reserved.
Philosophical Foundations of Intuitionistic Logic
Directory of Open Access Journals (Sweden)
L Nabavi
2013-02-01
Full Text Available Intuitionistic logic, as a non-classical logic, encompasses the principles of logical reasoning which were used by L. E. J. Brouwer in developing his intuitionistic mathematics. Brouwer rejected the principle of the excluded middle on the basis of his philosophy. In his philosophical view, logic is the application of mathematics to the language of mathematics. In other words, logic studies the patterns that characterize valid inference. The resulting linguistic system of logic may be studied mathematically, even independently of the mathematical activities that it was originally abstracted from. In this paper, the philosophical basis of Brouwerâs view about Logic and Mathematics is explained.
Philosophical Foundations of Intuitionistic Logic
Directory of Open Access Journals (Sweden)
L Nabavi
2013-03-01
Full Text Available Intuitionistic logic, as a non-classical logic, encompasses the principles of logical reasoning which were used by L. E. J. Brouwer in developing his intuitionistic mathematics. Brouwer rejected the principle of the excluded middle on the basis of his philosophy. In his philosophical view, logic is the application of mathematics to the language of mathematics. In other words, logic studies the patterns that characterize valid inference. The resulting linguistic system of logic may be studied mathematically, even independently of the mathematical activities that it was originally abstracted from. In this paper, the philosophical basis of Brouwer’s view about Logic and Mathematics is explained.
A Paraconsistent Higher Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen
2004-01-01
of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order...... logic with countable infinite indeterminacy, where each basic formula can get its own indeterminate truth value (or as we prefer: truth code). The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. The adequacy...
Paul N. Somerville
1998-01-01
Let X' = (X1,X2, ... ,Xk) have the multivariate normal distribution f(X) = MVN(μ, ∑σ2) where ∑ is a known positive definite matrix, and σ2 is a constant. There are many problems in statistics which require the evaluation of f(x) over some convex region A. That is P = ∫A f(X) dX. If σ2 is known, then without loss of generality, set μ = 0, σ =1 and let ∑ be the correlation matrix. For the case where the region A is rectangular, the problem has been addressed by many authors. They include ...
Non-logic devices in logic processes
Ma, Yanjun
2017-01-01
This book shows readers how to design semiconductor devices using the most common and lowest cost logic CMOS processes. Readers will benefit from the author’s extensive, industrial experience and the practical approach he describes for designing efficiently semiconductor devices that typically have to be implemented using specialized processes that are expensive, time-consuming, and low-yield. The author presents an integrated picture of semiconductor device physics and manufacturing techniques, as well as numerous practical examples of device designs that are tried and true.
Desai, Karishma M; Kale, Alka D
2017-01-01
Oral squamous cell carcinoma (OSCC) is the frequently reported cancer of the head and neck. Recent studies are being conducted to evaluate the role of potential markers for diagnosing the stages of development of OSCC from normal cells. The aim of this study is to evaluate and compare the immunoexpression of programmed cell death 4 (PDCD4) protein in normal oral mucosa, oral epithelial dysplasia (OED) and OSCC. Histologically diagnosed, formalin-fixed paraffin-embedded archived cases ( n = 100) of normal mucosa ( n = 10), OED ( n = 60) and OSCC ( n = 30) were analyzed immunohistochemically in the present retrospective study using monoclonal rabbit antihuman PDCD4. OED and squamous cell carcinoma were graded according to the World Health Organization and Broder's histological grading criteria, respectively. Clinical parameters and immunohistochemical results were analyzed by Fisher exact test using SPSS software. P oral mucosa, OED and OSCC. The maximum expression was observed in the normal oral mucosa, which reduced significantly in OED and OSCC ( P = 0.017). With the increase in the transformation from normal cells to cancer cells, a shift from nuclear to cytoplasmic staining was observed indicating predominant cytoplasmic localization of stain as a feature of altered cells. The present study delineates the molecular difference between the normal, dysplastic and carcinomatous cells; and points toward the role of PDCD4 localization in the proliferation of cells. This study thus highlights the need for further research with inclusion of long follow-up period and other pathological criteria such as inflammation and microenvironment, immune status of patient and tumor stage, which could aid in the development of prospective diagnostic options.
The effect of a Lucia jig for 30 minutes on neuromuscular re-programming, in normal subjects
Directory of Open Access Journals (Sweden)
Mariangela Salles Pereira Nassar
2012-12-01
Full Text Available The Lucia jig is a technique that promotes neuromuscular reprogramming of the masticatory system and allows the stabilization of the mandible without the interference of dental contacts, maintaining the mandible position in harmonic condition with the musculature in normal subjects or in patients with temporomandibular dysfunction (TMD. This study aimed to electromyographically analyze the activity (RMS of the masseter and temporal muscles in normal subjects (control group during the use of an anterior programming device, the Lucia jig, in place for 0, 5, 10, 20 and 30 minutes to demonstrate its effect on the stomatognathic system. Forty-two healthy dentate individuals (aged 21 to 40 years with normal occlusion and without parafunctional habits or temporomandibular dysfunction (RDC/TMD were evaluated on the basis of the electromyographic activity of the masseter and temporal muscles before placement of a neuromuscular re-programming device, the Lucia jig, on the upper central incisors. There were no statistically significant differences (p < 0.05 in the electromyographic activity of the masticatory muscles in the different time periods. The Lucia jig changed the electromyographic activity by promoting a neuromuscular reprogramming. In most of the time periods, it decreased the activation of the masticatory muscles, showing that this device has wide applicability in dentistry. The use of a Lucia jig over 0, 5, 10, 15, 20 and 30 minutes did not promote any statistically significant increase in muscle activity despite differences in the data, thus showing that this intra-oral device can be used in dentistry.
The effect of a Lucia jig for 30 minutes on neuromuscular re-programming, in normal subjects.
Nassar, Mariangela Salles Pereira; Palinkas, Marcelo; Regalo, Simone Cecilio Hallak; Sousa, Luiz Gustavo de; Siéssere, Selma; Semprini, Marisa; Bataglion, Cristiane; Bataglion, César
2012-01-01
The Lucia jig is a technique that promotes neuromuscular reprogramming of the masticatory system and allows the stabilization of the mandible without the interference of dental contacts, maintaining the mandible position in harmonic condition with the musculature in normal subjects or in patients with temporomandibular dysfunction (TMD). This study aimed to electromyographically analyze the activity (RMS) of the masseter and temporal muscles in normal subjects (control group) during the use of an anterior programming device, the Lucia jig, in place for 0, 5, 10, 20 and 30 minutes to demonstrate its effect on the stomatognathic system. Forty-two healthy dentate individuals (aged 21 to 40 years) with normal occlusion and without parafunctional habits or temporomandibular dysfunction (RDC/TMD) were evaluated on the basis of the electromyographic activity of the masseter and temporal muscles before placement of a neuromuscular re-programming device, the Lucia jig, on the upper central incisors. There were no statistically significant differences (p jig changed the electromyographic activity by promoting a neuromuscular reprogramming. In most of the time periods, it decreased the activation of the masticatory muscles, showing that this device has wide applicability in dentistry. The use of a Lucia jig over 0, 5, 10, 15, 20 and 30 minutes did not promote any statistically significant increase in muscle activity despite differences in the data, thus showing that this intra-oral device can be used in dentistry.
Uncertain Reasoning in Justification Logic
Kokkinis, Ioannis
2016-01-01
This thesis studies the combination of two well known formal systems for knowledge representation: probabilistic logic and justification logic. Our aim is to design a formal framework that allows the analysis of epistemic situations with incomplete information. In order to achieve this we introduce two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J. We prove soundness and completeness theorems for our logics and estab...
Fuzzy logic and neural network technologies
Villarreal, James A.; Lea, Robert N.; Savely, Robert T.
1992-01-01
Applications of fuzzy logic technologies in NASA projects are reviewed to examine their advantages in the development of neural networks for aerospace and commercial expert systems and control. Examples of fuzzy-logic applications include a 6-DOF spacecraft controller, collision-avoidance systems, and reinforcement-learning techniques. The commercial applications examined include a fuzzy autofocusing system, an air conditioning system, and an automobile transmission application. The practical use of fuzzy logic is set in the theoretical context of artificial neural systems (ANSs) to give the background for an overview of ANS research programs at NASA. The research and application programs include the Network Execution and Training Simulator and faster training algorithms such as the Difference Optimized Training Scheme. The networks are well suited for pattern-recognition applications such as predicting sunspots, controlling posture maintenance, and conducting adaptive diagnoses.
Connections among quantum logics. Pt. 1. Quantum propositional logics
Energy Technology Data Exchange (ETDEWEB)
Lock, P.F. (Saint Lawrence Univ., Canton, New York (USA). Dept. of Mathematics); Hardegree, G.M. (Massachusetts Univ., Amherst (USA). Dept. of Philosophy)
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.
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.
Logical reasoning with diagrams
Allwein, Gerard
1996-01-01
PART A: Theoretical Issues. 1. Visual Information and Valid Reasoning, Jon Barwise and John Etchemendy. 2. Operational Constraints in Diagrammatic Reasoning, Atsushi Shimojima. 3. Diagrams and the Concept of Logical System, Jon Barwise and Eric Hammer. PART B: Case Studies. 4. Situation-Theoretic Account of Valid Reasoning with Venn Diagrams, Sun-Joo Shin. 5. Towards a Model Theory of Venn Diagrams, eric Hammer and Norman Danner. 6. Peircean Graphs for Propositional Logic, Eric Hammer. 7. A Diagrammatic Subsystem of Hilbert''s Geometry, Isabel Luengo. PART C: Heterogenous Systems. 8. Heterogenous Logic, Jon Barwise and John Etchemendy. 9. Toward the Rigorous Use of Diagrams in Reasoning about Hardware, Steven D. Johnson, Jon Barwise, and Gerard Allwein. 10. Exploiting the Potential of Diagrams in Guiding Hardware Reasoning, Kathi D. Fisler
Directory of Open Access Journals (Sweden)
Zoltan Erdei
2011-12-01
Full Text Available In this paper the authors present the usefulness of fuzzy logic in controlling engineering processes or applications. Although fuzzy logic does not represent a novelty for the scientific and engineering field, it enjoys a great appreciation from those involved in the two domains. The fact that fuzzy logic uses sentences kindred with the natural language make it easier to comprehend that a complex mathematical model required by the classic control theory. In MatLab software there are dedicated toolboxes to this subject that make the design of a fuzzy controller a facile one. In the paper design methods of a fuzzy controller are being presented both in Simulink and MatLab.
Rushton, Andrew
2011-01-01
Many engineers encountering VHDL (very high speed integrated circuits hardware description language) for the first time can feel overwhelmed by it. This book bridges the gap between the VHDL language and the hardware that results from logic synthesis with clear organisation, progressing from the basics of combinational logic, types, and operators; through special structures such as tristate buses, register banks and memories, to advanced themes such as developing your own packages, writing test benches and using the full range of synthesis types. This third edition has been substantially rewritten to include the new VHDL-2008 features that enable synthesis of fixed-point and floating-point hardware. Extensively updated throughout to reflect modern logic synthesis usage, it also contains a complete case study to demonstrate the updated features. Features to this edition include: * a common VHDL subset which will work across a range of different synthesis systems, targeting a very wide range of technologies...
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...... case studies and it has been extended in several directions. The aim of this paper is to provide a thorough presentation of the logic.......The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Carlsson, Christer; Fullér, Robert
2004-01-01
Fuzzy Logic in Management demonstrates that difficult problems and changes in the management environment can be more easily handled by bringing fuzzy logic into the practice of management. This explicit theme is developed through the book as follows: Chapter 1, "Management and Intelligent Support Technologies", is a short survey of management leadership and what can be gained from support technologies. Chapter 2, "Fuzzy Sets and Fuzzy Logic", provides a short introduction to fuzzy sets, fuzzy relations, the extension principle, fuzzy implications and linguistic variables. Chapter 3, "Group Decision Support Systems", deals with group decision making, and discusses methods for supporting the consensus reaching processes. Chapter 4, "Fuzzy Real Options for Strategic Planning", summarizes research where the fuzzy real options theory was implemented as a series of models. These models were thoroughly tested on a number of real life investments, and validated in 2001. Chapter 5, "Soft Computing Methods for Reducing...
Energy Technology Data Exchange (ETDEWEB)
Dickerson, L.S.; Pope, R.B.; Michelhaugh, R.D.; Harrison, I.G.; Hermann, B.; Lester, P.B.
1999-06-01
The US Department of Energy (DOE) Occurrence Reporting and Processing System (ORPS) is an interactive computer system designed to support DOE-owned or -operated facilities in reporting and processing information concerning occurrences related to facility operations. The Oak Ridge National Laboratory has been charged by the DOE National Transportation Program Albuquerque (NTPA) with the responsibility of retrieving reports and information pertaining to packaging and transportation (P and T) incidents from the centralized ORPS database. These selected reports are analyzed for trends, impact on P and T operations and safety concerns, and ''lessons learned'' in P and T safety.
Conventions and Institutional Logics
DEFF Research Database (Denmark)
Westenholz, Ann
Two theoretical approaches – Conventions and Institutional Logics – are brought together and the similarities and differences between the two are explored. It is not the intention to combine the approaches, but I would like to open both ‘boxes’ and make them available to each other with the purpose...... analyses. The theoretical quest of both Conventions and Institutional Logics has been to understand the increasing indeterminacy, uncertainty and ambiguity in people’s lives where a sense of reality, of value, of moral, of feelings is not fixed. Both approaches have created new theoretical insights...
Stoll, Robert R
1979-01-01
Set Theory and Logic is the result of a course of lectures for advanced undergraduates, developed at Oberlin College for the purpose of introducing students to the conceptual foundations of mathematics. Mathematics, specifically the real number system, is approached as a unity whose operations can be logically ordered through axioms. One of the most complex and essential of modern mathematical innovations, the theory of sets (crucial to quantum mechanics and other sciences), is introduced in a most careful concept manner, aiming for the maximum in clarity and stimulation for further study in
Gibson, J
2013-01-01
Most branches of organizing utilize digital electronic systems. This book introduces the design of such systems using basic logic elements as the components. The material is presented in a straightforward manner suitable for students of electronic engineering and computer science. The book is also of use to engineers in related disciplines who require a clear introduction to logic circuits. This third edition has been revised to encompass the most recent advances in technology as well as the latest trends in components and notation. It includes a wide coverage of application specific integrate
Evens, Aden
2015-01-01
Building a foundational understanding of the digital, Logic of the Digital reveals a unique digital ontology. Beginning from formal and technical characteristics, especially the binary code at the core of all digital technologies, Aden Evens traces the pathways along which the digital domain of abstract logic encounters the material, human world. How does a code using only 0s and 1s give rise to the vast range of applications and information that constitutes a great and growing portion of our world? Evens' analysis shows how any encounter between the actual and the digital must cross an ontolo
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artefacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D -algebra....
Progress in Programmable Logic
Directory of Open Access Journals (Sweden)
Jozef Cuntala
2004-01-01
Full Text Available Programmable logic devices (PLD are situated on important place among microelectronic components thanks to the continuing technological development of semiconductor components, due to new architectures and new approaches to digital systems design. Software design of various complicated digital systems becomes advantageous article of many firms. The Department of Electronics and Electrotechnology pays pemanent attention to mentioned components in application field. The collective of authors wants in this article point out on possibilities of design of digital system using the PLD. The paper plan contains the following basic parts: Technological aspects that influence development of configurable logic devices, Methodology od design and implementation and Flexibility of PLD interface.
Quantum logics with existence property
Energy Technology Data Exchange (ETDEWEB)
Schindler, C. (Univ. Bern (Switzerland))
1991-04-01
A quantum logic ({sigma}-orthocomplete orthomodular poset L with a convex, unital, and separating set {Delta} of states) is said to have the existence property if the expectation functionals on lin({Delta}) 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).
Functions and generality of logic reflections on Dedekind's and Frege's logicisms
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 ...
Directory of Open Access Journals (Sweden)
José Silva-Nunes
2013-04-01
Full Text Available Objective: To assess different factors influencing adiponectinemia in obese and normal-weight women; to identify factors associated with the variation (Δ in adiponectinemia in obese women following a 6-month weight loss program, according to surgical/non-surgical interventions. Methods: We studied 100 normal-weight women and 112 obese premenopausal women; none of them was on any medical treatment. Women were characterized for anthropometrics, daily macronutrient intake, smoking status, contraceptives use, adiponectin as well as IL-6 and TNF-α serum concentrations. Results: Adiponectinemia was lower in obese women (p 2 = 0.436. After weight loss interventions, a significant modification in macronutrient intake occurs followed by anthropometrics decrease (chiefly after bariatric procedures and adiponectinemia increase (similar after surgical and non-surgical interventions. After bariatric intervention, Δ adiponectinemia was inversely correlated to Δ waist circumference and Δ carbohydrate intake (r2 = 0.706. Conclusion: Anthropometrics, diet, smoking, and TNF-α levels all influence adiponectinemia in normal-weight women, although explaining less than 50% of it. In obese women, anthropometrics modestly explain adiponectinemia. Opposite to non-surgical interventions, after bariatric surgery adiponectinemia increase is largely explained by diet composition and anthropometric changes.
DEFF Research Database (Denmark)
Filipiuk, Piotr; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping of analyses and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases...
Temporal logic motion planning
CSIR Research Space (South Africa)
Seotsanyana, M
2010-01-01
Full Text Available In this paper, a critical review on temporal logic motion planning is presented. The review paper aims to address the following problems: (a) In a realistic situation, the motion planning problem is carried out in real-time, in a dynamic, uncertain...
Foundations of mathematical logic
Curry, Haskell B
2010-01-01
Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods, including algorithms and epitheory, and offers a brief treatment of Markov's approach to algorithms, explains elementary facts about lattices and similar algebraic systems, and more. 1963 edition.
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML. To ...
Czech Academy of Sciences Publication Activity Database
Svoboda, Vladimír; Peregrin, Jaroslav
2016-01-01
Roč. 30, č. 3 (2016), s. 263-287 ISSN 0920-427X R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : argumentation * logical form * incorrect argument * correct arguments Subject RIV: AA - Philosophy ; Religion Impact factor: 0.689, year: 2016
Dynamic epistemic temporal logic
Renne, B.; Sack, Joshua; Yap, Audrey; He, X.; Horty, J.; Pacuit, E.
2009-01-01
We introduce a new type of arrow in the update frames (or "action models") of Dynamic Epistemic Logic in a way that enables us to reason about epistemic temporal dynamics in multi-agent systems that need not be synchronous. Since van Benthem and Pacuit (later joined by Hoshi and Gerbrandy) showed
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav
2010-01-01
Roč. 4, č. 2 (2010), s. 207-223 ISSN 1661-8297 R&D Projects: GA ČR(CZ) GAP401/10/1279 Institutional research plan: CEZ:AV0Z9009908 Keywords : logic * natural selection * modus potens * inferentialism Subject RIV: AA - Philosophy ; Religion
Expressivist Perspective on Logicality
Czech Academy of Sciences Publication Activity Database
Arazim, Pavel
2017-01-01
Roč. 11, č. 4 (2017), s. 409-419 ISSN 1661-8297 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : logical constant * expressivism * topic-neutrality * proof-theory * conservativity Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology
Czech Academy of Sciences Publication Activity Database
Klev, Ansten
2017-01-01
Roč. 25, č. 3 (2017), s. 341-368 ISSN 0031-8019 Institutional support: RVO:67985955 Keywords : Philosophy of mathematics * logicism * Richard Dedekind Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology Impact factor: 0.419, year: 2016
Parametric Linear Dynamic Logic
Directory of Open Access Journals (Sweden)
Peter Faymonville
2014-08-01
Full Text Available We introduce Parametric Linear Dynamic Logic (PLDL, which extends Linear Dynamic Logic (LDL by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL that is able to express all ω-regular specifications while still maintaining many of LTL's desirable properties like an intuitive syntax and a translation into non-deterministic Büchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all ω-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our main technical contribution is a translation of PLDL formulas into non-deterministic Büchi word automata of exponential size via alternating automata. This yields a PSPACE model checking algorithm and a realizability algorithm with doubly-exponential running time. Furthermore, we give tight upper and lower bounds on optimal parameter values for both problems. These results show that PLDL model checking and realizability are not harder than LTL model checking and realizability.
Logicism, intuitionism, and formalism
Symons, John
2008-01-01
Aims to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. This work is suitable for researchers and graduate students of philosophy, logic, mathematics and theoretical computer science.
Greek, Indian and Arabic logic
Gabbay, Dov M
2004-01-01
Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and Renaissance Logic and Logic: A History of its Central. In designing the Handbook of the History of Logic, the Editors have taken the view that the history of logic holds more than an antiquarian interest, and that a knowledge of logic's rich and sophisticated development is, in various respects, relevant to the research programmes of the present day. Ancient logic is no exception. The present volume attests to the distant origins of some of modern logic's most important features, such as can be found in the claim by the authors of t...
Extending Value Logic Thinking to Value Logic Portfolios
DEFF Research Database (Denmark)
Ritter, Thomas; Andersen, Poul Houman
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...... and for research into strategic management....
Boudreau, Aaron; van't Veer, Laura J; Bissell, Mina J
2012-01-01
The year 2011 marked the 40 year anniversary of Richard Nixon signing the National Cancer Act, thus declaring the beginning of the "War on Cancer" in the United States. Whereas we have made tremendous progress toward understanding the genetics of tumors in the past four decades, and in developing enabling technology to dissect the molecular underpinnings of cancer at unprecedented resolution, it is only recently that the important role of the stromal microenvironment has been studied in detail. Cancer is a tissue-specific disease, and it is becoming clear that much of what we know about breast cancer progression parallels the biology of the normal breast differentiation, of which there is still much to learn. In particular, the normal breast and breast tumors share molecular, cellular, systemic and microenvironmental influences necessary for their progression. It is therefore enticing to consider a tumor to be a "rogue hacker"--one who exploits the weaknesses of a normal program for personal benefit. Understanding normal mammary gland biology and its "security vulnerabilities" may thus leave us better equipped to target breast cancer. In this review, we will provide a brief overview of the heterotypic cellular and molecular interactions within the microenvironment of the developing mammary gland that are necessary for functional differentiation, provide evidence suggesting that similar biology--albeit imbalanced and exaggerated--is observed in breast cancer progression particularly during the transition from carcinoma in situ to invasive disease. Lastly we will present evidence suggesting that the multigene signatures currently used to model cancer heterogeneity and clinical outcome largely reflect signaling from a heterogeneous microenvironment-a recurring theme that could potentially be exploited therapeutically.
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 ...
Logical analysis of biological systems
DEFF Research Database (Denmark)
Mardare, Radu Iulian
2005-01-01
R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005.......R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005....
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...
Nguyen, Hung T
2005-01-01
THE CONCEPT OF FUZZINESS Examples Mathematical modeling Some operations on fuzzy sets Fuzziness as uncertainty Exercises SOME ALGEBRA OF FUZZY SETS Boolean algebras and lattices Equivalence relations and partitions Composing mappings Isomorphisms and homomorphisms Alpha-cuts Images of alpha-level sets Exercises FUZZY QUANTITIES Fuzzy quantities Fuzzy numbers Fuzzy intervals Exercises LOGICAL ASPECTS OF FUZZY SETS Classical two-valued logic A three-valued logic Fuzzy logic Fuzzy and Lukasiewi
Directory of Open Access Journals (Sweden)
Baranov G. V.
2016-12-01
Full Text Available in this article the logic perspective in information culture is investigated. The contents of four laws of logical thinking in their value for thinking and humanitarian culture of the personality are described. Formal and logical laws are characterized by a condition of uniform information culture of mankind.
Modal Logics for Cryptographic Processes
DEFF Research Database (Denmark)
Frendrup, U.; Huttel, Hans; Jensen, N. J.
2002-01-01
We present three modal logics for the spi-calculus and show that they capture strong versions of the environment sensitive bisimulation introduced by Boreale et al. Our logics differ from conventional modal logics for process calculi in that they allow us to describe the knowledge of an attacker ...
Lectures on Logic and Computation
DEFF Research Database (Denmark)
The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers fo...
Games for topological fixpoint logic
Bezhanishvili, N.; Kupke, C.
2016-01-01
Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
This article shows how individual Petri nets form models of Girard's intuitionistic linear logic. It explores questions of expressiveness and completeness of linear logic with respect to this interpretation. An aim is to use Petri nets to give an understanding of linear logic and give some apprai...
2013-01-01
Background Implementing shared decision making into routine practice is proving difficult, despite considerable interest from policy-makers, and is far more complex than merely making decision support interventions available to patients. Few have reported successful implementation beyond research studies. MAking Good Decisions In Collaboration (MAGIC) is a multi-faceted implementation program, commissioned by The Health Foundation (UK), to examine how best to put shared decision making into routine practice. In this paper, we investigate healthcare professionals’ perspectives on implementing shared decision making during the MAGIC program, to examine the work required to implement shared decision making and to inform future efforts. Methods The MAGIC program approached implementation of shared decision making by initiating a range of interventions including: providing workshops; facilitating development of brief decision support tools (Option Grids); initiating a patient activation campaign (‘Ask 3 Questions’); gathering feedback using Decision Quality Measures; providing clinical leads meetings, learning events, and feedback sessions; and obtaining executive board level support. At 9 and 15 months (May and November 2011), two rounds of semi-structured interviews were conducted with healthcare professionals in three secondary care teams to explore views on the impact of these interventions. Interview data were coded by two reviewers using a framework derived from the Normalization Process Theory. Results A total of 54 interviews were completed with 31 healthcare professionals. Partial implementation of shared decision making could be explained using the four components of the Normalization Process Theory: ‘coherence,’ ‘cognitive participation,’ ‘collective action,’ and ‘reflexive monitoring.’ Shared decision making was integrated into routine practice when clinical teams shared coherent views of role and purpose (‘coherence’). Shared
DEFF Research Database (Denmark)
Madsen, Louise Sofia; Handberg, Charlotte
2018-01-01
BACKGROUND: The present study explored the reflections on cancer survivorship care of lymphoma survivors in active treatment. Lymphoma survivors have survivorship care needs, yet their participation in cancer survivorship care programs is still reported as low. OBJECTIVE: The aim of this study...... implying an influence on whether to participate in cancer survivorship care programs. Because of "pursuing normality," 8 of 9 participants opted out of cancer survivorship care programming due to prospects of "being cured" and perceptions of cancer survivorship care as "a continuation of the disease...
Magnetic Logic Circuits for Extreme Environments, Phase I
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...
Conventions and Institutional Logics
DEFF Research Database (Denmark)
Westenholz, Ann
Two theoretical approaches – Conventions and Institutional Logics – are brought together and the similarities and differences between the two are explored. It is not the intention to combine the approaches, but I would like to open both ‘boxes’ and make them available to each other with the purpose...... of creating a space for dialog. Both approaches were developed in the mid-1980s as a reaction to rational-choice economic theory and collectivistic sociological theory. These two theories were oversimplifying social life as being founded either in actor-micro level analyses or in structure-macro level...... analyses. The theoretical quest of both Conventions and Institutional Logics has been to understand the increasing indeterminacy, uncertainty and ambiguity in people’s lives where a sense of reality, of value, of moral, of feelings is not fixed. Both approaches have created new theoretical insights...
Pascal, Robert; Pross, Addy
2016-11-01
In this paper we propose a logical connection between the physical and biological worlds, one resting on a broader understanding of the stability concept. We propose that stability manifests two facets - time and energy, and that stability's time facet, expressed as persistence, is more general than its energy facet. That insight leads to the logical formulation of the Persistence Principle, which describes the general direction of material change in the universe, and which can be stated most simply as: nature seeks persistent forms. Significantly, the principle is found to express itself in two mathematically distinct ways: in the replicative world through Malthusian exponential growth, and in the `regular' physical/chemical world through Boltzmann's probabilistic considerations. By encompassing both `regular' and replicative worlds, the principle appears to be able to help reconcile two of the major scientific theories of the 19th century - the Second Law of Thermodynamics and Darwin's theory of evolution - within a single conceptual framework.
Coordinated signal control for arterial intersections using fuzzy logic
Kermanian, Davood; Zare, Assef; Balochian, Saeed
2013-09-01
Every day growth of the vehicles has become one of the biggest problems of urbanism especially in major cities. This can waste people's time, increase the fuel consumption, air pollution, and increase the density of cars and vehicles. Fuzzy controllers have been widely used in many consumer products and industrial applications with success over the past two decades. This article proposes a comprehensive model of urban traffic network using state space equations and then using Fuzzy Logic Tool Box and SIMULINK Program MATLAB a fuzzy controller in order to optimize and coordinate signal control at two intersections at an arterial road. The fuzzy controller decides to extend, early cut or terminate a signal phase and phase sequence to ensure smooth flow of traffic with minimal waiting time and length of queue. Results show that the performance of the proposed traffic controller at novel fuzzy model is better that of conventional controllers under normal and abnormal traffic conditions.
Probabilistic Logical Characterization
DEFF Research Database (Denmark)
Hermanns, Holger; Parma, Augusto; Segala, Roberto
2011-01-01
Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance...... modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata....
Magnetoresistive logic and biochip
International Nuclear Information System (INIS)
Brueckl, Hubert; Brzeska, Monika; Brinkmann, Dirk; Schotter, J.Joerg; Reiss, Guenter; Schepper, Willi; Kamp, P.-B.; Becker, Anke
2004-01-01
While some magnetoresistive devices based on giant magnetoresistance or spin-dependent tunneling are already commercialized, a new branch of development is evolving towards magnetoresistive logic with magnetic tunnel junctions. Furthermore, the new magnetoelectronic effects show promising properties in magnetoresistive biochips, which are capable of detecting even single molecules (e.g. DNA) by functionalized magnetic markers. The unclear limits of this approach are discussed with two model systems
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
Marketing Logics, Ambidexterity and Influence
DEFF Research Database (Denmark)
Tollin, Karin; Schmidt, Marcus
2012-01-01
in four CMOs have taken on this challenge, or adopted a marketing logic which could be referred to as ambidextrous. Furthermore, the study shows that this logic exerts a stronger impact on marketing's influence, compared to logics related to assuring brand consistency and measuring the performance...... of marketing processes. Three other ways to enact marketing management were also revealed, namely: an innovation; a communication; and a supporting marketing logic. This leads us to conclude that the influence of companies' marketing functions show up a heterogeneous picture within which the marketing logics...
Lectures on Logic and Computation
DEFF Research Database (Denmark)
The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers...... foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. During two weeks, around 50 courses and 10 workshops are offered to the attendants, each of 1...
Querying Natural Logic Knowledge Bases
DEFF Research Database (Denmark)
Andreasen, Troels; Bulskov, Henrik; Jensen, Per Anker
2017-01-01
This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes in ontol......This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes...... in ontologies and class-relationships such as are common in life-science descriptions. The paper adopts a version of natural logic with recursive restrictive clauses such as relative clauses and adnominal prepositional phrases. It includes passive as well as active voice sentences. We outline a prototype...
Concrete Quantum Logics and Δ -Logics, States and Δ -States
Hroch, Michal; Pták, Pavel
2017-12-01
By a concrete quantum logic (in short, by a logic) we mean the orthomodular poset that is set-representable. If L=({Ω },L) is a logic and L is closed under the formation of symmetric difference, Δ , we call L a Δ -logic. In the first part we situate the known results on logics and states to the context of Δ -logics and Δ -states (the Δ -states are the states that are subadditive with respect to the symmetric difference). Moreover, we observe that the rather prominent logic E^{ {even}}_{Ω } of all even-coeven subsets of the countable set Ω possesses only Δ -states. Then we show when a state on the logics given by the divisibility relation allows for an extension as a state. In the next paragraph we consider the so called density logic and its Δ -closure. We find that the Δ -closure coincides with the power set. Then we investigate other properties of the density logic and its factor.
A Denotational Account of Untyped Normalization by Evaluation
DEFF Research Database (Denmark)
Filinski, Andrzej; Rohde, Henning Korsholm
2004-01-01
We show that the standard normalization-by-evaluation construction for the simply-typed λβγ-calculus has a natural counterpart for the untyped λβ-calculus, with the central type-indexed logical relation replaced by a recursively defined invariant relation, in the style of Pitts. In fact, the cons...... proof for the normalization algorithm, expressed as a functional program in an ML-like call-by-value language. A version of this article with detailed proofs is available as a technical report [5]....
DECODING OF STRUCTURALLY AND LOGICAL CODES
Directory of Open Access Journals (Sweden)
Yu. D. Ivanov
2016-01-01
Full Text Available The article deals with the description of the main points of the structural and logical coding and the features of SLC codes. There are shown the basic points of the generalized algorithm of decoding SLC, which is based on the method of perfect matrix arrangement (PMA of the n-dimensional cube vertices for adequate representation and transformation of boolean functions, which is based on the method of generating sequences of variables for building the maximum coverage of the cube vertices. The structural and logical codes (SLC use natural logic redundancy of the infimum disjunctive normal forms (IDNF of boolean functions, which make the basis for building the SLC codes and correcting the errors, that occur during data transfer in real discrete channels, on the channels with independent errors. The main task is to define the basic relations between the implemented SLC codes of the logical redundancy and boundary values of multiplicity of independent errors which are corrected. The principal difference between the SLC codes and the well-known correcting codes is that the redundancy, that is needed to correct the errors in converting the discrete information, is not introduced into an additional code sequence but is defined in a natural way, during the construction of codewords of SLC.
Fuzzy logic controller for weaning neonates from mechanical ventilation.
Hatzakis, G. E.; Davis, G. M.
2002-01-01
Weaning from mechanical ventilation is the gradual detachment from any ventilatory support till normal spontaneous breathing can be fully resumed. To date, we have developed a fuzzy logic controller for weaning COPD adults using pressure support ventilation (PS). However, adults and newborns differ in the pathophysiology of lung disease. We therefore used our fuzzy logic-based weaning platform to develop modularized components for weaning newborns with lung disease. Our controller uses the he...
DEFF Research Database (Denmark)
Pilegaard, Henrik
2003-01-01
general Normal clauses accepted by both solvers and run the experiments for all three possible combinations of input and solver. This allows the solvers to be tested on even ground and enables the reuse of existing analyses and their corresponding ALFP constraint generators. The performance...
Higher-Order Separation Logic in Isabelle/HOLCF
DEFF Research Database (Denmark)
Varming, Carsten; Birkedal, Lars
2008-01-01
or greatest fixed points etc. The higher-order logic ensures that we can show non-trivial algorithms correct without having to extend the semantics of the language as was done previously in verifications based on first-order separation logic [2,20]. We provide non-trivial examples to support this claim...... and to show how the higher-order logic enables natural assertions in specifications. To support abstract reasoning we have implemented rules for representation hiding and data abstraction as seen in [1]. The logic is represented as lemmas for reasoning about the denotational semantics of the programming......We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a way that one may use any theory defined in Isabelle/HOLCF to construct assertions, e.g., primitive recursion, least...
de Silva, A Prasanna
2011-03-01
Chemists are now able to emulate the ideas and instruments of mathematics and computer science with molecules. The integration of molecular logic gates into small arrays has been a growth area during the last few years. The design principles underlying a collection of these cases are examined. Some of these computing molecules are applicable in medical- and biotechnologies. Cases of blood diagnostics, 'lab-on-a-molecule' systems, and molecular computational identification of small objects are included. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Flexible programmable logic module
Robertson, Perry J.; Hutchinson, Robert L.; Pierson, Lyndon G.
2001-01-01
The circuit module of this invention is a VME board containing a plurality of programmable logic devices (PLDs), a controlled impedance clock tree, and interconnecting buses. The PLDs are arranged to permit systolic processing of a problem by offering wide data buses and a plurality of processing nodes. The board contains a clock reference and clock distribution tree that can drive each of the PLDs with two critically timed clock references. External clock references can be used to drive additional circuit modules all operating from the same synchronous clock reference.
Krötzsch, M
2010-01-01
Ontological modelling today is applied in many areas of science and technology,including the Semantic Web. The W3C standard OWL defines one of the most important ontology languages based on the semantics of description logics. An alternative is to use rule languages in knowledge modelling, as proposed in the W3C's RIF standard. So far, it has often been unclear how to combine both technologies without sacrificing essential computational properties. This book explains this problem and presents new solutions that have recently been proposed. Extensive introductory chapters provide the necessary
DEFF Research Database (Denmark)
Øhrstrøm, Peter
2009-01-01
This paper deals with A.N. Prior's analysis of the concepts of dynamic and static time, i.e. McTaggart's so-called A- and B-concepts. The relations and mutual dependencies between these temporal concepts are investigated, and Prior's response to McTaggart's views is discussed. Futhermore, Prior......'s notion of branching time is analysed. It is argued that Prior can be criticized for identifying 'plain future'. Finally, Prior's four grades of tense-logical involvement are introduced and discussed. It is argued that the third grade is the most attractive form a philosophical point of view....
Computability, complexity, logic
Börger, Egon
1989-01-01
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes an
Bright, Liam Kofi
2017-10-01
The logical empiricists expressed a consistent attitude to racial categorisation in both the ethical and scientific spheres. Their attitude may be captured in the following slogan: human racial taxonomy is an empirically meaningful mode of classifying persons that we should refrain from deploying. I offer an interpretation of their position that would render coherent their remarks on race with positions they adopted on the scientific status of taxonomy in general, together with their potential moral or political motivations for adopting that position. Copyright © 2017 Elsevier Ltd. All rights reserved.
T Atanassov, Krassimir
2017-01-01
The book offers a comprehensive survey of intuitionistic fuzzy logics. By reporting on both the author’s research and others’ findings, it provides readers with a complete overview of the field and highlights key issues and open problems, thus suggesting new research directions. Starting with an introduction to the basic elements of intuitionistic fuzzy propositional calculus, it then provides a guide to the use of intuitionistic fuzzy operators and quantifiers, and lastly presents state-of-the-art applications of intuitionistic fuzzy sets. The book is a valuable reference resource for graduate students and researchers alike.
Dascalu, Ana Maria; Cherecheanu, Alina Popa; Stana, Daniela; Serban, Dragoş
2013-01-01
to quantify the inter-test variability (dB) for the Optopol PTS automated perimeter, Glaucoma Fast threshold program. A prospective study was performed on 166 glaucomatous patients and a control group of 30 normal subjects, tested by complete ophthalmological exam and automated perimetry (Optopol PTS-910). The visual field was tested weekly for 4 consecutive weeks. The visual field defects were classified according to the Aulhorn-Karmeyer descriptive scale. For the control group, the medium inter-test variability was of 1.57 +/- 0.24 dB, lower next to fixation and increasing towards the 50 degree isopter. The medium inter-test variability increases along with the perimetric stage :1.57 +/- 0.66 dB for pre-perimetric glaucoma, 2.13 + 1.04 dB for non-specific defects group, 3.23 + 1.01 dB for the stage 1, 3.52 + 2.61 dB, for the stage 2, 3.65 + 1.19dB for the stage 3 and 5.82 +/- 1.67dB for the stage 4. For the cases of preperimetric glaucoma and non-specific defects, a similar profile of variability to the normal subjects can be observed. For the stages 2-4, the profile of the areas with maxim inter-test variability moves towards the relative scotoma and the surrounding area. A better description of the inter-test variability and the evolution of this intricate parameter of the retinal light sensitivity is useful for the differential diagnostic between the real change and the "background noise" in early detection of the functional progression in glaucoma.
Classical Mathematical Logic The Semantic Foundations of Logic
Epstein, Richard L
2011-01-01
In Classical Mathematical Logic, Richard L. Epstein relates the systems of mathematical logic to their original motivations to formalize reasoning in mathematics. The book also shows how mathematical logic can be used to formalize particular systems of mathematics. It sets out the formalization not only of arithmetic, but also of group theory, field theory, and linear orderings. These lead to the formalization of the real numbers and Euclidean plane geometry. The scope and limitations of modern logic are made clear in these formalizations. The book provides detailed explanations of all proo
The Logic of Practice in the Practice of Logics
DEFF Research Database (Denmark)
Raviola, Elena; Dubini, Paola
2016-01-01
This paper investigates the workings of institutional logics in practice, by focusing in particular on the interplay between material, practical and linguistic dimensions of practices. In other words, drawing on Bourdieu's sens pratique, the paper explores the logic of practice in the practice...... 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...
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
Games for Topological Fixpoint Logic
Directory of Open Access Journals (Sweden)
Nick Bezhanishvili
2016-09-01
Full Text Available Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators are interpreted via clopen sets. We develop a game-theoretic semantics for this logic. First we introduce games characterising clopen fixpoints of monotone operators on Stone spaces. These fixpoint games allow us to characterise the semantics for our topological fixpoint logic using a two-player graph game. Adequacy of this game is the main result of our paper. Finally, we define bisimulations for the topological structures under consideration and use our game semantics to prove that the truth of a formula of our topological fixpoint logic is bisimulation-invariant.
Magnetic logic based on diode-assisted magnetoresistance
Directory of Open Access Journals (Sweden)
Zhaochu Luo
2017-05-01
Full Text Available Conventional computer suffers from the von Neumann performance bottleneck due to its hardware architecture that non-volatile memory and logic are separated. The new emerging magnetic logic coupling the extra dimension of spin, shows the potential to overcome this performance bottleneck. Here, we propose a novel category of magnetic logic based on diode-assisted magnetoresistance. By coupling Hall effect and nonlinear transport property in silicon, all four basic Boolean logic operations including AND, NAND, OR and NOR, can be programmed at room temperature with high output ratio in one silicon-based device. Further introducing anomalous Hall effect of magnetic material into magnetic logic, we achieve perpendicular magnetic anisotropy-based magnetic logic which combines the advantages of both high output ratio (>103 % and low work magnetic field (∼1 mT. Integrated with non-volatile magnetic memory, our logic device with unique magnetoelectric properties has the advantages of current-controlled reconfiguration, zero refresh consumption, instant-on performance and would bridge the processor-memory gap. Our findings would pave the way in magnetic logic and offer a feasible platform to build a new kind of magnetic microprocessor with potential of high performance.
Superconducting digital logic amplifier
International Nuclear Information System (INIS)
Przybysz, J.X.
1989-01-01
This paper describes a superconducting digital logic amplifier for interfacing between a Josephson junction logic circuit having output current and a higher voltage semiconductor circuit input. The amplifier comprising: an input terminal for connection to a; an output terminal for connection to a semiconductor circuit input; an input, lower critical current, Josephson junction having first and second terminals; a first series string of at least three lower critical current Josephson junctions. The first series string being connected to the first terminal of the input Josephson junction such that the first series string is in series with the input Josephson junction to provide a series combination. The input terminal being connected to the first terminal of the input Josephson junction, and with the critical current of the lower critical current Josephson junctions of the input Josephson junction and the first series Josephson junctions being less than the output current of the low voltage Josephson junction circuit; a second series string of at least four higher critical current Josephson junctions. The second string being connected in parallel with the series combination to provide parallel strings having an upper common connection and a lower common connection. The lower common connection being connected to the second terminal of the input Josephson junction and the upper common connection being connected to the output terminal; and a pulsed DC current source connected the parallel strings at the upper common connection. The DC current source having a current at least equal to the critical current of the higher critical current Josephson junctions
Completeness of Hoare Logic over Nonstandard Models
Xu, Zhaowei; Sui, Yuefei; Zhang, Wenhui
2017-01-01
The nonstandard approach to program semantics has successfully resolved the completeness problem of Floyd-Hoare logic. The known versions of nonstandard semantics, the Hungary semantics and axiomatic semantics, are so general that they are absent either from mathematical elegance or from practical usefulness. The aim of this paper is to exhibit a not only mathematically elegant but also practically useful nonstandard semantics. A basic property of computable functions in the standard model $N...
PM 3655 PHILIPS Logic analyzer
A logic analyzer is an electronic instrument that captures and displays multiple signals from a digital system or digital circuit. A logic analyzer may convert the captured data into timing diagrams, protocol decodes, state machine traces, assembly language, or may correlate assembly with source-level software. Logic Analyzers have advanced triggering capabilities, and are useful when a user needs to see the timing relationships between many signals in a digital system.
Logical Full Abstraction and PCF
Longley, John R; Plotkin, Gordon
2000-01-01
We introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with “parallel” operations. The main result is that, for standard interpretations, logical full abstraction is equivalent to equational full abstraction together with universality; the proof involves constructing enumeration operators. We also consider restrictions on logical complexity and on the level of types.
Annotating Logical Forms for EHR Questions.
Roberts, Kirk; Demner-Fushman, Dina
2016-05-01
This paper discusses the creation of a semantically annotated corpus of questions about patient data in electronic health records (EHRs). The goal is to provide the training data necessary for semantic parsers to automatically convert EHR questions into a structured query. A layered annotation strategy is used which mirrors a typical natural language processing (NLP) pipeline. First, questions are syntactically analyzed to identify multi-part questions. Second, medical concepts are recognized and normalized to a clinical ontology. Finally, logical forms are created using a lambda calculus representation. We use a corpus of 446 questions asking for patient-specific information. From these, 468 specific questions are found containing 259 unique medical concepts and requiring 53 unique predicates to represent the logical forms. We further present detailed characteristics of the corpus, including inter-annotator agreement results, and describe the challenges automatic NLP systems will face on this task.
Tensor product of quantum logics
Pulmannová, Sylvia
1985-01-01
A quantum logic is the couple (L,M) where L is an orthomodular σ-lattice and M is a strong set of states on L. The Jauch-Piron property in the σ-form is also supposed for any state of M. A ``tensor product'' of quantum logics is defined. This definition is compared with the definition of a free orthodistributive product of orthomodular σ-lattices. The existence and uniqueness of the tensor product in special cases of Hilbert space quantum logics and one quantum and one classical logic are studied.
Optimization methods for logical inference
Chandru, Vijay
2011-01-01
Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in
Contextual logic for quantum systems
International Nuclear Information System (INIS)
Domenech, Graciela; Freytes, Hector
2005-01-01
In this work we build a quantum logic that allows us to refer to physical magnitudes pertaining to different contexts from a fixed one without the contradictions with quantum mechanics expressed in no-go theorems. This logic arises from considering a sheaf over a topological space associated with the Boolean sublattices of the ortholattice of closed subspaces of the Hilbert space of the physical system. Different from standard quantum logics, the contextual logic maintains a distributive lattice structure and a good definition of implication as a residue of the conjunction
Admissibility of logical inference rules
Rybakov, VV
1997-01-01
The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and
DEFF Research Database (Denmark)
A.N. Prior (1914-69) in the course of the 1950s and 1960s founded a new and revolutionary paradigm in philosophy and logic. Its most central feature is the preoccupation with time and the development of the logic of time. However, this was inseparably interwoven with fundamental questions about...... human freedom, ethics, and existence. This remarkable integration of themes also embodies an original and in fact revolutionary conception of logic. The book series, Logic and Philosophy of Time, is dedicated to a deep investigation and also the further development of Prior’s paradigm. ...
Popular lectures on mathematical logic
Wang, Hao
2014-01-01
A noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. Author Hao Wang surveys the central concepts and theories of the discipline in a historical and developmental context, and then focuses on the four principal domains of contemporary mathematical logic: set theory, model theory, recursion theory and constructivism, and proof theory.Topics include the place of problems in the development of theories of logic and logic's relation to computer science. Specific attention is given to Gödel's incomplete
Logic from nonlinear dynamical evolution
Energy Technology Data Exchange (ETDEWEB)
Murali, K. [J. Crayton Pruitt Family Department of Biomedical Engineering, University of Florida, Gainesville, FL 32611-6131 (United States); Department of Physics, Anna University, Chennai 600 025 (India)], E-mail: kmurali@annauniv.edu; Miliotis, Abraham; Ditto, William L. [J. Crayton Pruitt Family Department of Biomedical Engineering, University of Florida, Gainesville, FL 32611-6131 (United States); Sinha, Sudeshna [Institute of Mathematical Sciences, C.I.T. Campus, Chennai 600 113 (India)
2009-03-30
We propose a direct and flexible implementation of logic operations using the dynamical evolution of a nonlinear system. The concept involves the observation of the state of the system at different times to obtain different logic outputs. We explicitly implement the basic NAND, AND, NOR, OR and XOR logic gates, as well as multiple-input XOR and XNOR logic gates. Further we demonstrate how the single dynamical system can do more complex operations such as bit-by-bit addition in just a few iterations.
Logic from nonlinear dynamical evolution
International Nuclear Information System (INIS)
Murali, K.; Miliotis, Abraham; Ditto, William L.; Sinha, Sudeshna
2009-01-01
We propose a direct and flexible implementation of logic operations using the dynamical evolution of a nonlinear system. The concept involves the observation of the state of the system at different times to obtain different logic outputs. We explicitly implement the basic NAND, AND, NOR, OR and XOR logic gates, as well as multiple-input XOR and XNOR logic gates. Further we demonstrate how the single dynamical system can do more complex operations such as bit-by-bit addition in just a few iterations
Implicational (Semilinear) Logics I: A New Hierarchy
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Noguera, C.
2010-01-01
Roč. 49, č. 4 (2010), s. 417-446 ISSN 1432-0665 R&D Projects: GA ČR GEICC/08/E018 Institutional research plan: CEZ:AV0Z10300504 Keywords : abstract algebraic logic * hierarchy of implicational logics * implicative logics * Leibniz hierarchy * linearly ordered logical matrices * mathematical fuzzy logic * non-classical logics * semilinear logics Subject RIV: BA - General Mathematics Impact factor: 0.414, year: 2010
Ziviani, Jenny; Darlington, Yvonne; Feeney, Rachel; Head, Brian
2011-01-01
The benefits of providing early intervention services (including multidisciplinary therapy and family support) for children with physical disabilities and their families are widely acknowledged. Evidence, however, of their efficacy is not well documented. Furthermore, many studies fail to adequately describe the programs being evaluated and how…
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 - Gen eral Mathematics; BA - Gen eral Mathematics (UTIA-B) Impact factor: 2.718, year: 2016
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
2005-01-01
A new all-electronic Particle Image Velocimetry technique that can efficiently map high speed gas flows has been developed in-house at the NASA Lewis Research Center. Particle Image Velocimetry is an optical technique for measuring the instantaneous two component velocity field across a planar region of a seeded flow field. A pulsed laser light sheet is used to illuminate the seed particles entrained in the flow field at two instances in time. One or more charged coupled device (CCD) cameras can be used to record the instantaneous positions of particles. Using the time between light sheet pulses and determining either the individual particle displacements or the average displacement of particles over a small subregion of the recorded image enables the calculation of the fluid velocity. Fuzzy logic minimizes the required operator intervention in identifying particles and computing velocity. Using two cameras that have the same view of the illumination plane yields two single exposure image frames. Two competing techniques that yield unambiguous velocity vector direction information have been widely used for reducing the single-exposure, multiple image frame data: (1) cross-correlation and (2) particle tracking. Correlation techniques yield averaged velocity estimates over subregions of the flow, whereas particle tracking techniques give individual particle velocity estimates. For the correlation technique, the correlation peak corresponding to the average displacement of particles across the subregion must be identified. Noise on the images and particle dropout result in misidentification of the true correlation peak. The subsequent velocity vector maps contain spurious vectors where the displacement peaks have been improperly identified. Typically these spurious vectors are replaced by a weighted average of the neighboring vectors, thereby decreasing the independence of the measurements. In this work, fuzzy logic techniques are used to determine the true
Denotational World-indexed Logical Relations and Friends
DEFF Research Database (Denmark)
Thamsborg, Jacob Junker
As part of the long-standing drive for mathematical machinery to reason about computer programs, we use the technique of denotational logical relations to prove contextual equivalence of stateful programs. We propose the notion of approximate locations to solve the non-trivial problem of existence...... of a classical xed-point theorem for functors on certain metric spaces by America and Rutten. Also we investigate the use of recursively dened metric worlds in an operational setting and arrive at constructions akin to step-indexed models. On a dierent, though related, note, we explore a relational reading...... 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...
Towards an arithmetical logic the arithmetical foundations of logic
Gauthier, Yvon
2015-01-01
This book offers an original contribution to the foundations of logic and mathematics, and focuses on the internal logic of mathematical theories, from arithmetic or number theory to algebraic geometry. Arithmetical logic is the term used to refer to the internal logic of classical arithmetic, here called Fermat-Kronecker arithmetic, and combines Fermat’s method of infinite descent with Kronecker’s general arithmetic of homogeneous polynomials. The book also includes a treatment of theories in physics and mathematical physics to underscore the role of arithmetic from a constructivist viewpoint. The scope of the work intertwines historical, mathematical, logical and philosophical dimensions in a unified critical perspective; as such, it will appeal to a broad readership from mathematicians to logicians, to philosophers interested in foundational questions. Researchers and graduate students in the fields of philosophy and mathematics will benefit from the author’s critical approach to the foundations of l...
Borresen, Jon; Lynch, Stephen
2012-01-01
In the 1940s, the first generation of modern computers used vacuum tube oscillators as their principle components, however, with the development of the transistor, such oscillator based computers quickly became obsolete. As the demand for faster and lower power computers continues, transistors are themselves approaching their theoretical limit and emerging technologies must eventually supersede them. With the development of optical oscillators and Josephson junction technology, we are again presented with the possibility of using oscillators as the basic components of computers, and it is possible that the next generation of computers will be composed almost entirely of oscillatory devices. Here, we demonstrate how coupled threshold oscillators may be used to perform binary logic in a manner entirely consistent with modern computer architectures. We describe a variety of computational circuitry and demonstrate working oscillator models of both computation and memory. PMID:23173034
Partial quantum logics revisited
Vetterlein, Thomas
2011-01-01
Partial Boolean algebras (PBAs) were introduced by Kochen and Specker as an algebraic model reflecting the mutual relationships among quantum-physical yes-no tests. The fact that not all pairs of tests are compatible was taken into special account. In this paper, we review PBAs from two sides. First, we generalise the concept, taking into account also those yes-no tests which are based on unsharp measurements. Namely, we introduce partial MV-algebras, and we define a corresponding logic. Second, we turn to the representation theory of PBAs. In analogy to the case of orthomodular lattices, we give conditions for a PBA to be isomorphic to the PBA of closed subspaces of a complex Hilbert space. Hereby, we do not restrict ourselves to purely algebraic statements; we rather give preference to conditions involving automorphisms of a PBA. We conclude by outlining a critical view on the logico-algebraic approach to the foundational problem of quantum physics.
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2014-01-01
We study the international standard XACML 3.0 for describing security access control policies in a compositional way. Our main contributions are (i) to derive a logic that precisely captures the intentions of the standard, (ii) to formally define a semantics for the XACML 3.0 component evaluation......, and (iii) to define a semantics for the XACML 3.0 standard combining operators. To guard against modeling artefacts we provide an alternative lattice based way of characterizing the policy combining operators and we formally prove the equivalence of these approaches thereby increasing our faith in either...... one. We then discuss several ways of extending XACML: one direction is to extend XACML with new combining operators, and another direction is to incorporate the notion of conflict into XACML. We conclude by discussing the possibility of analysing XACML policies for gaps and conflicts....
Cleaveland, Rance; Luettgen, Gerald; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, LPC extends Milner's Calculus of Communicating Systems with operators from the alternation-free linear-time mu-calculus (LT(mu)). Semantically, LPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must-testing preorder as well as LT(mu's) satisfaction relation, while being compositional for all LPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of: (1) both minimal and maximal fixed-point operators and (2) an unimple-mentability predicate on process terms, which tags inconsistent specifications. The utility of LPC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification.
Logical entropy of quantum dynamical systems
Directory of Open Access Journals (Sweden)
Ebrahimzadeh Abolfazl
2016-01-01
Full Text Available This paper introduces the concepts of logical entropy and conditional logical entropy of hnite partitions on a quantum logic. Some of their ergodic properties are presented. Also logical entropy of a quantum dynamical system is dehned and ergodic properties of dynamical systems on a quantum logic are investigated. Finally, the version of Kolmogorov-Sinai theorem is proved.
Reversible logic gates on Physarum Polycephalum
International Nuclear Information System (INIS)
Schumann, Andrew
2015-01-01
In this paper, we consider possibilities how to implement asynchronous sequential logic gates and quantum-style reversible logic gates on Physarum polycephalum motions. We show that in asynchronous sequential logic gates we can erase information because of uncertainty in the direction of plasmodium propagation. Therefore quantum-style reversible logic gates are more preferable for designing logic circuits on Physarum polycephalum
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
Flat Coalgebraic Fixed Point Logics
Schröder, Lutz; Venema, Yde
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the μ-calculus. The family of such flat fixed point logics includes, e.g., CTL, the *-nesting-free fragment of PDL, and the logic of common knowledge. Here, we extend this notion to the generic semantic framework of coalgebraic logic, thus covering a wide range of logics beyond the standard μ-calculus including, e.g., flat fragments of the graded μ-calculus and the alternating-time μ-calculus (such as ATL), as well as probabilistic and monotone fixed point logics. Our main results are completeness of the Kozen-Park axiomatization and a timed-out tableaux method that matches ExpTime upper bounds inherited from the coalgebraic μ-calculus but avoids using automata.
Methods in Logic Based Control
DEFF Research Database (Denmark)
Christensen, Georg Kronborg
1999-01-01
Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...
Injection--ejection protection logic
International Nuclear Information System (INIS)
Brown, H.
1975-01-01
A brief sketch is given of the beginnings of the protective logic which would be needed to guard against quenches or damage in the ISA rings. Two logic diagrams are presented which illustrate the most obvious facets of the hard-wired protection system
DEFF Research Database (Denmark)
By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s)....
Dynamic Logics of Belief Change
van Benthem, J.; Smets, S.; van Ditmarsch, H.; Halpern, J.; van der Hoek, W.; Kooi, B.
2015-01-01
This chapter gives an overview of current dynamic logics that describe belief update and revision, both for single agents and in multi-agent settings. We employ a mixture of ideas from AGM belief revision theory and dynamic-epistemic logics of information-driven agency. After describing the basic
Hybrid logics with Sahlqvist axioms
ten Cate, B.; Marx, M.; Viana, P.
2005-01-01
We show that every extension of the basic hybrid logic with modal Sahlqvist axioms is complete. As a corollary of our approach, we also obtain the Beth property for a large class of hybrid logics. Finally, we show that the new completeness result cannot be combined with the existing general
Japanese Logic Puzzles and Proof
Wanko, Jeffrey J.
2009-01-01
An understanding of proof does not start in a high school geometry course. Rather, attention to logical reasoning throughout a student's school experience can help the development of proof readiness. In the spirit of problem solving, the author has begun to use some Japanese logic puzzles other than sudoku to help students develop additional…
Epistemic logics for sceptical agents
Czech Academy of Sciences Publication Activity Database
Bílková, M.; Majer, Ondrej; Peliš, Michal
2016-01-01
Roč. 26, č. 6 (2016), s. 1815-1841 ISSN 0955-792X R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : epistemic logic * substructural logic * frame semantics Subject RIV: AA - Philosophy ; Religion Impact factor: 0.909, year: 2016
Towards Logical Designs In Biology
Indian Academy of Sciences (India)
Towards Logical Designs in Biology. Garima Agarwal. General Article Volume 12 Issue 2 February 2007 pp 29-38. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/012/02/0029-0038. Keywords. Synthetic biology; logic gates; regulatory modules; gene circuits. Author Affiliations.
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
Zalta on Unnecessary Logical Truths
Directory of Open Access Journals (Sweden)
MA Hojati
2013-09-01
Full Text Available According to a traditional view all logical truths are necessary however, this thesis recently has been faced with various critiques from different points of view. Introducing some logical operators, David Kaplan and Edward Zalta claim that there are logical truths regarding common definition ‒ that are not necessary. William Hanson objects Zalta's examples believing that they rely on unjustified presuppositions especially he does not accept real world validity as a proper notion for presenting logical truth. Nelson and Zalta reply to his objections claiming that they have unacceptable grounds. In this paper, we introduce logical truths, then present Kaplan's and Zalta's examples and explore Hanson's objections together with their replies. At last we try to show the metaphysical roots of the debates.
Zalta on Unnecessary Logical Truths
Directory of Open Access Journals (Sweden)
SH Shahryari
2013-08-01
Full Text Available According to a traditional view all logical truths are necessary however, this thesis recently has been faced with various critiques from different points of view. Introducing some logical operators, David Kaplan and Edward Zalta claim that there are logical truths regarding common definition â that are not necessary. William Hanson objects Zalta's examples believing that they rely on unjustified presuppositions especially he does not accept real world validity as a proper notion for presenting logical truth. Nelson and Zalta reply to his objections claiming that they have unacceptable grounds. In this paper, we introduce logical truths, then present Kaplan's and Zalta's examples and explore Hanson's objections together with their replies. At last we try to show the metaphysical roots of the debates.
Logical independence and quantum randomness
International Nuclear Information System (INIS)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C; Prevedel, R; Klimek, P
2010-01-01
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Logical independence and quantum randomness
Energy Technology Data Exchange (ETDEWEB)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C [Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna (Austria); Prevedel, R; Klimek, P [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)], E-mail: tomasz.paterek@univie.ac.at
2010-01-15
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Nakajima, Kenichi; Okuda, Koichi; Matsuo, Shinro; Kiso, Keisuke; Kinuya, Seigo; Garcia, Ernest V
2017-04-01
Left ventricular (LV) phase dyssynchrony parameters based on gated myocardial perfusion imaging varied among software programs. The aim of this study was to determine normal ranges and factors affecting phase parameters. Normal databases were derived from the Japanese Society of Nuclear Medicine working group (n = 69). The programs were Emory Cardiac Toolbox with SyncTool (ECTb), Quantitative Gated SPECT (QGS), Heart Function View (HFV), and cardioREPO (cREPO); parameters of phase standard deviation (PSD), 95% bandwidth, and entropy were compared with parameters with ECTb as a reference. PSD (degree) was 5.3 ± 3.3 for QGS (P < .0001), 5.4 ± 2.5 for HFV (P < .0001), and 10.3 ± 3.2 for cREPO (P = n. s.) compared with 11.5 ± 5.5 for ECTb. Phase bandwidth with three programs differed significantly from ECTb. Gender differences were significant for all programs, indicating larger variation in males. After adjustment of LV volumes between genders, the difference disappeared except for QGS. The phase parameters showed wider variations in patients with the lower ejection fraction (EF) and larger LV volumes, depending on software types. Based on normal ranges of phase dyssynchrony parameters in four software programs, dependency on genders, LV volume, and EF should be considered, indicating the need for careful comparison among different software programs.
Fan, Daoqing; Shang, Changshuai; Gu, Wenling; Wang, Erkang; Dong, Shaojun
2017-08-09
Glutathione (GSH) plays crucial roles in various biological functions, the level alterations of which have been linked to varieties of diseases. Herein, we for the first time expanded the application of oxidase-like property of MnO 2 nanosheet (MnO 2 NS) to fluorescent substrates of peroxidase. Different from previously reported fluorescent quenching phenomena, we found that MnO 2 NS could not only largely quench the fluorescence of highly fluorescent Scopoletin (SC) but also surprisingly enhance that of nonfluorescent Amplex Red (AR) via oxidation reaction. If MnO 2 NS is premixed with GSH, it will be reduced to Mn 2+ and lose the oxidase-like property, accompanied by subsequent increase in SC's fluorescence and decrease in AR's. On the basis of the above mechanism, we construct the first MnO 2 NS-based ratiometric fluorescent sensor for ultrasensitive and selective detection of GSH. Notably, this ratiometric sensor is programmed by the cascade logic circuit (an INHIBIT gate cascade with a 1 to 2 decoder). And a linear relationship between ratiometric fluorescent intensities of the two substrates and logarithmic values of GSH's concentrations is obtained. The detection limit of GSH is as low as 6.7 nM, which is much lower than previous ratiometric fluorescent sensors, and the lowest MnO 2 NS-based fluorescent GSH sensor reported so far. Furthermore, this sensor is simple, label-free, and low-cost; it also presents excellent applicability in human serum samples.
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.
Logic regression and its extensions.
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.
Kral, M J
1994-01-01
Although suicide is not viewed as a mental disorder per se, it is viewed by many if not most clinicians, researchers, and lay people as a real or natural symptom of depression. It is at least most typically seen as the unfortunate, severe, yet logical end result of a chain of negative self-appraisals, negative events, and hopelessness. Extending an approach articulated by the early French sociologist Gabriel Tarde, in this paper I argue that suicide is merely an idea, albeit a very bad one, having more in common with societal beliefs and norms regarding such things as divorce, abortion, sex, politics, consumer behavior, and fashion. I make a sharp contrast between perturbation and lethality, concepts central to Edwin S. Shneidman's theory of suicide. Evidence supportive of suicide as an idea is discussed based on what we are learning from the study of history and culture, and about contagion/cluster phenomena, media/communication, and choice of method. It is suggested that certain individuals are more vulnerable to incorporate the idea and act of suicide into their concepts of self, based on the same principles by which ideas are spread throughout society. Just as suicide impacts on society, so does society impact on suicide.
Remmel, Jeffrey; Shore, Richard; Sweedler, Moss; Progress in Computer Science and Applied Logic
1993-01-01
The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematica...
Modelling object typicality in description logics - [Workshop on Description Logics
CSIR Research Space (South Africa)
Britz, K
2009-07-01
Full Text Available The authors presents a semantic model of typicality of concept members in description logics that accords well with a binary, globalist cognitive model of class membership and typicality. The authors define a general preferential semantic framework...
Logic with a Probability Semantics
Hailperin, Theodore
2010-01-01
The present study is an extension of the topic introduced in Dr. Hailperin's Sentential Probability Logic, where the usual true-false semantics for logic is replaced with one based more on probability, and where values ranging from 0 to 1 are subject to probability axioms. Moreover, as the word "sentential" in the title of that work indicates, the language there under consideration was limited to sentences constructed from atomic (not inner logical components) sentences, by use of sentential connectives ("no," "and," "or," etc.) but not including quantifiers ("for all," "there is"). An initial
Nanoelectromechanical resonator for logic operations
Kazmi, Syed N. R.
2017-08-29
We report an electro-thermally tunable in-plane doubly-clamped nanoelectromechanical resonator capable of dynamically performing NOR, NOT, XNOR, XOR, and AND logic operations. Toward this, a silicon based resonator is fabricated using standard e-beam lithography and surface nanomachining of a highly conductive device layer of a silicon-on-insulator (SOI) wafer. The performance of this logic device is examined at elevated temperatures, ranging from 25 °C to 85 °C, demonstrating its resilience for most of the logic operations; thereby paving the way towards nano-elements-based mechanical computing.
Meta-Logical Reasoning in Higher-Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen; Schlichtkrull, Anders; Hess, Andreas Viktor
The semantics of first-order logic (FOL) can be described in the meta-language of higher-order logic (HOL). Using HOL one can prove key properties of FOL such as soundness and completeness. Furthermore, one can prove sentences in FOL valid using the formalized FOL semantics. To aid in the constru...... in the construction of the proof an interactive proof assistant like Isabelle can be used. The proof assistant can even automate simple proofs using the formalized FOL semantics....
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
Directory of Open Access Journals (Sweden)
Yaritza Tardo Fernández
2013-02-01
Full Text Available The cultural, technological and eminently social character of the computer programming problems solving process, joined with the complexity and difficulties detected in their teaching, has contributed to increase the concern about the study of the processes of communication, transmission and understanding of computer programming and to attract the attention of a wide scientific community in correspondence with the growing development that this reaches at the present time. That is the reason why this paper has the objective of discover, from the didactic point of view, the integrators axes of an algorithmic logic that solves the contradiction that is revealed in the formative process between the mathematic modeling and their algorithmic systematization to empower an efficient performance of the professionals of Computer Science and Computer Engineering. In this sense a new didactic proposal is based, that consist in an algorithmic logic, in which are specified and explained those essentials processes that should be carry out to solve computer programming problems. Based on the theoretical fundaments, we concluded that these processes constitute didactics moments, required in order to solve the contradiction mentioned before.RESUMENEl carácter eminentemente social, cultural y tecnológico del proceso de resolución de problemas de programación computacional, junto a la complejidad y dificultades detectadas en su enseñanza, han contribuido a despertar la preocupación por el estudio de los procesos de comunicación, transmisión y comprensión de la Programación y a interesar a una amplia comunidad científica en correspondencia con el creciente desarrollo que ésta alcanza en la actualidad. Razón por la cual este trabajo tiene como objetivo que se develen, desde el punto de vista didáctico, los ejes integradores de una lógica algorítmica que sea contentiva de la solución a la contradicción que se revela en el proceso formativo entre la
A Simple Model of Separation Logic for Higher-order Store
DEFF Research Database (Denmark)
Birkedal, Lars; Reus, Bernhard; Schwinghammer, Jan
2008-01-01
Separation logic is a Hoare-style logic for reasoning about pointer-manipulating programs. Its core ideas have recently been extended from low-level to richer, high-level languages. In this paper we develop a new semantics of the logic for a programming language where code can be stored (i.......e., with higher-order store). The main improvement on previous work is the simplicity of the model. As a consequence, several restrictions imposed by the semantics are removed, leading to a considerably more natural assertion language with a powerful specification logic....
Preferential reasoning for modal logics
CSIR Research Space (South Africa)
Britz, K
2011-11-01
Full Text Available representation results for both preferential and rational consequence, which paves the way for effective decision procedures for modal preferential reasoning. They then illustrate applications of their constructions to modal logics widely used in AI, notably...
Dependence logic theory and applications
Kontinen, Juha; Väänänen, Jouko; Vollmer, Heribert
2016-01-01
In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning ...
Counting proofs in propositional logic
David, René; Zaionc, Marek
2009-01-01
International audience; We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.
Observation Predicates in Flow Logic
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis; Sun, Hongyan
2003-01-01
in such a way that the hard constraints are satisfi ed exactly when the observation predicates report no violations. The development is carried out in a large fragment of a first order logic with negation and also takes care of the transformations necessary in order to adhere to the stratification restrictions...... inherent in Alternation-free Least Fixed Point Logic and similar formalisms such as Datalog....
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 RA. Part B of Vols. 1 and 2 focuses on the D ampersand D of contaminated facilities. Part C of Vols. 1 and 2 focuses on WM. Each part of Vol. 1 contains an overview of the TM, an explanation of the problems facing the volume-specific program, a review of identified technologies, and rankings of technologies applicable to the site. 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. This volume provides the technology evaluation data sheets (TEDS) for ER/WM activities (D ampersand D, RA and WM) that are referenced by a TEDS code number in Vol. 2 of the TLD. Each of these sheets represents a single logic trace across the TLD. These sheets contain more detail than is given for the technologies in Vol. 2
Normalized medical information visualization.
Sánchez-de-Madariaga, Ricardo; Muñoz, Adolfo; Somolinos, Roberto; Castro, Antonio; Velázquez, Iker; Moreno, Oscar; García-Pacheco, José L; Pascual, Mario; Salvador, Carlos H
2015-01-01
A new mark-up programming language is introduced in order to facilitate and improve the visualization of ISO/EN 13606 dual model-based normalized medical information. This is the first time that visualization of normalized medical information is addressed and the programming language is intended to be used by medical non-IT professionals.
On Structural Completeness of Tabular Superintuitionistic Logics
Citkin, Alexander
2015-01-01
As usual, the superintuitionistic (propositional) logics (that is, logics extending intuitionistic logic) are being studied “modulo derivability”, meaning such logics are viewed extensionally — they are identified with the set of formulae that are valid (derivable in the corresponding calculus) in
DEFF Research Database (Denmark)
Friche, Nanna; Normann Andersen, Vibeke
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...... combined with state funding through a taximeter scheme (pay per student). Secondly, party governance system involving labor market partners at both national and local level formalized through a national Council for Vocational Training and 50 local trade committees as well as local education committees...
Logic and Lattices for Distributed Programming
2012-06-22
for supporting “ escrow ” trans- actions, which allow operations that are only commutative when a certain limited resource is available [27]. For exam...exploring how to add support for escrow operations to BloomL. To support concurrent editing of shared documents, the 12 groupware community has studied a...Algorithms, 1989. [27] P. E. O’Neil. The Escrow transactional method. ACM TODS, 11(4):405–430, Dec. 1986. [28] Oracle Corporation. Streams Conflict
Proposal for the Formalization of Dialectical Logic
Directory of Open Access Journals (Sweden)
José Luis Usó-Doménech
2016-12-01
Full Text Available Classical logic is typically concerned with abstract analysis. The problem for a synthetic logic is to transcend and unify available data to reconstruct the object as a totality. Three rules are proposed to pass from classic logic to synthetic logic. We present the category logic of qualitative opposition using examples from various sciences. This logic has been defined to include the neuter as part of qualitative opposition. The application of these rules to qualitative opposition, and, in particular, its neuter, demonstrated that a synthetic logic allows the truth of some contradictions. This synthetic logic is dialectical with a multi-valued logic, which gives every proposition a truth value in the interval [0,1] that is the square of the modulus of a complex number. In this dialectical logic, contradictions of the neuter of an opposition may be true.
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.
Linear logical relations and observational equivalences for session-based concurrency
Perez, Jorge A.; Caires, Luis; Pfenning, Frank; Toninho, Bernardo
2014-01-01
We investigate strong normalization, confluence, and behavioral equality in the realm of session-based concurrency. These interrelated issues underpin advanced correctness analysis in models of structured communications. The starting point for our study is an interpretation of linear logic
KT an S4 satisfiability in a constraint logic environment
CSIR Research Space (South Africa)
Stevenson, L
2008-12-01
Full Text Available satisfaction problem (CSP) [5, 6]. In this paper, we further investigate the feasibility of the constraint-based ap- proach proposed by Brand et al. [5, 6]. A modal formula is stratified into layers, each of which is solved using the constraint logic.... The solver developed by Brand et al. is, however, limited to the modal logic K. It only deals with formulae that are in conjunctive normal form (CNF), and have not been optimized using any of the standard techniques such as caching. In this paper, we...
International Nuclear Information System (INIS)
Nielsen, Niels
2000-01-01
A one-page article announces that BC Hydro of Canada has developed a decision support software (called TAPlogic) for electric utilities and asset-based companies. TAPlogic assists managers to make decisions on their financial investments, thus maximising the benefits from their generation assets. TAPlogic applies standard economic and financial analytical frameworks to annual budgeting, long-term planning and short-term decision analysis. It gives data on assets, thus facilitating reviewing of decisions on the basis of normal business decision criteria such as net income, economic value added, cash flows and benefit/cost ratios
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 science s, 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
Directory of Open Access Journals (Sweden)
Iryna Khomenko
2018-04-01
Full Text Available The challenges of the global time require new solutions and up-to-date ways of thinking and communication. These challenges call for the ability to use critical thinking to face the ever-changing world and the ability to maintain a dialog based on the effective skills of communication. Studies in the fields of logic and argumentation theory are of particular importance in this regard. Nowadays they can be presented as a mix of theoretical and practical approaches. In this paper, I will present my reflections on informal logic, which was formed in the late 1970s. Unfortunately, in spite of numerous papers, books, and text-books published over the last forty years, consensus on many issues in this field has not been achieved so far. Therefore, it is difficult to treat informal logic as one of the well-defined approaches to argumentation. The goal of this paper is to take a look at the place of informal logic in state-of-the art study of argumentation by clarifying its subject matter and figuring out the realm to which informal logic belongs.
Fuzzy logic of Aristotelian forms
Energy Technology Data Exchange (ETDEWEB)
Perlovsky, L.I. [Nichols Research Corp., Lexington, MA (United States)
1996-12-31
Model-based approaches to pattern recognition and machine vision have been proposed to overcome the exorbitant training requirements of earlier computational paradigms. However, uncertainties in data were found to lead to a combinatorial explosion of the computational complexity. This issue is related here to the roles of a priori knowledge vs. adaptive learning. What is the a-priori knowledge representation that supports learning? I introduce Modeling Field Theory (MFT), a model-based neural network whose adaptive learning is based on a priori models. These models combine deterministic, fuzzy, and statistical aspects to account for a priori knowledge, its fuzzy nature, and data uncertainties. In the process of learning, a priori fuzzy concepts converge to crisp or probabilistic concepts. The MFT is a convergent dynamical system of only linear computational complexity. Fuzzy logic turns out to be essential for reducing the combinatorial complexity to linear one. I will discuss the relationship of the new computational paradigm to two theories due to Aristotle: theory of Forms and logic. While theory of Forms argued that the mind cannot be based on ready-made a priori concepts, Aristotelian logic operated with just such concepts. I discuss an interpretation of MFT suggesting that its fuzzy logic, combining a-priority and adaptivity, implements Aristotelian theory of Forms (theory of mind). Thus, 2300 years after Aristotle, a logic is developed suitable for his theory of mind.
Strategies and logics of internationalization
Directory of Open Access Journals (Sweden)
Mahjouba Ben Salem
2013-07-01
Full Text Available The race between firms to acquire capacities worldwide has evolved in a chronological order which centered at first around products, then around position to move later on to skills and to focus currently on networks. Similarly, when observing the evolution of the different international development strategies, it was found out that they have started by the exportation and the setting up of production subsidiaries to move more recently to such strategies as mergers & acquisitions and international alliances. The present paper investigates the relationship between the internationalization strategies and logics and comes to the conclusion that, a particular logic is behind every choice made. Indeed, the present work was conducted within the Tunisian food enterprises and helped confirm this hypothesis as it was found out that the position logic is behind the choice of exportation and the creation of production subsidiaries while the choice of partnership is based on the logic of skills. The option for merger, on the other hand, is motivated by the networks logic.
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
Meaning and proscription in formal logic variations on the propositional logic of William T. Parry
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...
Impossible Worlds and Logical Omniscience
DEFF Research Database (Denmark)
Bjerring, Jens Christian Krarup
2013-01-01
”. But I prove that it is impossible to develop an impossible-world framework that can do this job and that satisfies certain standard conditions. Effectively, I show that attempts to model moderately ideal agents in a world-involving framework collapse to modeling either logical omniscient agents......In this paper, I investigate whether we can use a world-involving framework to model the epistemic states of non-ideal agents. The standard possible-world framework falters in this respect because of a commitment to logical omniscience. A familiar attempt to overcome this problem centers around...... falsehoods, they are nevertheless able to rule out blatantly impossible worlds that verify obvious logical falsehoods. To model moderately ideal agents, I argue, the job is to construct a modal space that contains only possible and non-trivially impossible worlds where it is not the case that “anything goes...
Fuzzy Logic Reliability Centered Maintenance
Directory of Open Access Journals (Sweden)
Felecia .
2014-01-01
Full Text Available Reliability Centered Maintenence (RCM is a systematic maintenence strategy based on system reliability. Application of RCM process will not always come out with a binary output of “yes” and “no”. Most of the time they are not supported with available detail information to calculate system reliability. The fuzzy logic method attempts to eliminate the uncertainty by providing “truth” in different degrees.Data and responses from maintenance department will be processed using the two methods (reliability centered maintenance and fuzzy logic to design maintenance strategy for the company. The results of the fuzzy logic RCM application are maintenance strategy which fit with current and future condition.
Fuzzy logic particle tracking velocimetry
Wernet, Mark P.
1993-01-01
Fuzzy logic has proven to be a simple and robust method for process control. Instead of requiring a complex model of the system, a user defined rule base is used to control the process. In this paper the principles of fuzzy logic control are applied to Particle Tracking Velocimetry (PTV). Two frames of digitally recorded, single exposure particle imagery are used as input. The fuzzy processor uses the local particle displacement information to determine the correct particle tracks. Fuzzy PTV is an improvement over traditional PTV techniques which typically require a sequence (greater than 2) of image frames for accurately tracking particles. The fuzzy processor executes in software on a PC without the use of specialized array or fuzzy logic processors. A pair of sample input images with roughly 300 particle images each, results in more than 200 velocity vectors in under 8 seconds of processing time.
Improvements to Earthquake Location with a Fuzzy Logic Approach
Gökalp, Hüseyin
2018-01-01
In this study, improvements to the earthquake location method were investigated using a fuzzy logic approach proposed by Lin and Sanford (Bull Seismol Soc Am 91:82-93, 2001). The method has certain advantages compared to the inverse methods in terms of eliminating the uncertainties of arrival times and reading errors. In this study, adopting this approach, epicentral locations were determined based on the results of a fuzzy logic space concerning the uncertainties in the velocity models. To map the uncertainties in arrival times into the fuzzy logic space, a trapezoidal membership function was constructed by directly using the travel time difference between the two stations for the P- and S-arrival times instead of the P- and S-wave models to eliminate the need for obtaining information concerning the velocity structure of the study area. The results showed that this method worked most effectively when earthquakes occurred away from a network or when the arrival time data contained phase reading errors. In this study, to resolve the problems related to determining the epicentral locations of the events, a forward modeling method like the grid search technique was used by applying different logical operations (i.e., intersection, union, and their combination) with a fuzzy logic approach. The locations of the events were depended on results of fuzzy logic outputs in fuzzy logic space by searching in a gridded region. The process of location determination with the defuzzification of only the grid points with the membership value of 1 obtained by normalizing all the maximum fuzzy output values of the highest values resulted in more reliable epicentral locations for the earthquakes than the other approaches. In addition, throughout the process, the center-of-gravity method was used as a defuzzification operation.
Sequential logic analysis and synthesis
Cavanagh, Joseph
2007-01-01
Until now, there was no single resource for actual digital system design. Using both basic and advanced concepts, Sequential Logic: Analysis and Synthesis offers a thorough exposition of the analysis and synthesis of both synchronous and asynchronous sequential machines. With 25 years of experience in designing computing equipment, the author stresses the practical design of state machines. He clearly delineates each step of the structured and rigorous design principles that can be applied to practical applications. The book begins by reviewing the analysis of combinatorial logic and Boolean a
The logical foundations of mathematics
Hatcher, William S
1981-01-01
The Logical Foundations of Mathematics offers a study of the foundations of mathematics, stressing comparisons between and critical analyses of the major non-constructive foundational systems. The position of constructivism within the spectrum of foundational philosophies is discussed, along with the exact relationship between topos theory and set theory.Comprised of eight chapters, this book begins with an introduction to first-order logic. In particular, two complete systems of axioms and rules for the first-order predicate calculus are given, one for efficiency in proving metatheorems, and
An exercise in 'anhomomorphic logic'
International Nuclear Information System (INIS)
Sorkin, Rafael D
2007-01-01
A classical logic exhibits a threefold inner structure comprising an algebra of propositions U, a space of 'truth values' V, and a distinguished family of mappings φ from propositions to truth values. Classically U is a Boolean algebra, V = Z 2 , and the admissible maps φ: U Z 2 are homomorphisms. If one admits a larger set of maps, one obtains an anhomomorphic logic that seems better suited to quantal reality (and the needs of quantum gravity). I explain these ideas and illustrate them with three simple examples
Logical space and the origins of pluralism in logic
Czech Academy of Sciences Publication Activity Database
Arazim, Pavel
-, č. 2 (2017), s. 7-26 ISSN 0567-8293 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : pluralism * expressivism * logical space * geometry * holism Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology
An Evaluation of SMES Control Logics for Power System Stabilization Based on Analogue Simulation
Taguchi, Akira; Imayoshi, Tadakazu; Hayashi, Hidemi; Ishii, Toshinori
Focusing on control that can be used to efficiently regulate SMES, unique control logics for power system stabilization were devised by combining the popularly used power deviation (ΔP) of a generator with the angular velocity deviation (Δω) of a generator or the phase correction. In the previous paper, we analyzed the performance and characteristics of the new control logics (ΔP + Δω control logic, ΔP + Δω + phase correction control logic) on both one-and multi-machine infinite-bus systems using the Y-method power system dynamics analysis program, and suggested that the new logics could improve the stability of power systems in comparison to the conventional ΔP control logic. For the next phase of research, we have evaluated the performance and characteristics of the control logics mentioned above based on analogue simulation. As a result, the logics have showed the same tendency as the case of the digital simulation and it have been confirmed that the logics, especially ΔP + Δω+ phase correction control logic, have the superior effect on the improvement of the stability of power system.
California Geriatric Education Center Logic Model: An Evaluation and Communication Tool
Price, Rachel M.; Alkema, Gretchen E.; Frank, Janet C.
2009-01-01
A logic model is a communications tool that graphically represents a program's resources, activities, priority target audiences for change, and the anticipated outcomes. This article describes the logic model development process undertaken by the California Geriatric Education Center in spring 2008. The CGEC is one of 48 Geriatric Education…
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...
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
Strong Normalization for HA + EM1 by Non-Deterministic Choice
Directory of Open Access Journals (Sweden)
Federico Aschieri
2013-09-01
Full Text Available We study the strong normalization of a new Curry-Howard correspondence for HA + EM1, constructive Heyting Arithmetic with the excluded middle on Sigma01-formulas. The proof-term language of HA + EM1 consists in the lambda calculus plus an operator ||_a which represents, from the viewpoint of programming, an exception operator with a delimited scope, and from the viewpoint of logic, a restricted version of the excluded middle. We give a strong normalization proof for the system based on a technique of "non-deterministic immersion".
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...
"Modeling" Youth Work: Logic Models, Neoliberalism, and Community Praxis
Carpenter, Sara
2016-01-01
This paper examines the use of logic models in the development of community initiatives within the AmeriCorps program. AmeriCorps is the civilian national service programme in the U.S., operating as a grants programme to local governments and not-for-profit organisations and providing low-cost labour to address pressing issues of social…
Reasoning about Object Capabilities with Logical Relations and Effect Parametricity
DEFF Research Database (Denmark)
Devriese, Dominique; Piessens, Frank; Birkedal, Lars
-of-the-art techniques from programming languages research, we define a logical relation for a core calculus of JavaScript that better characterises capability-safety. The relation is powerful enough to reason about typical capability patterns and supports evolvable invariants on shared data structures, capabilities...
Timed Automaton Models for Simple Programmable Logic Controllers
Mader, Angelika H.; Wupper, Hanno
We give timed automaton models for a class of Programmable Logic Controller (PLC) applications, that are programmed in a simple fragment of the language Instruction Lists as defined in the standard IEC 1131-3. Two different approaches for modelling timers are suggested, that lead to two different
LicenseScript: A Logical Language for Digital Rights Management
Chong, C.N.; Corin, R.J.; Doumen, J.M.; Etalle, Sandro; Hartel, Pieter H.; Law, Y.W.; Tokmakoff, Andrew
We propose LicenseScript, a language for digital rights management (DRM) based on multiset rewriting and logic programming. LicenseScript enjoys a precise syntax and semantics, and it is rich enough to embed other rights expression languages (REL). We show that LicenseScript is expressive and
Using Spare Logic Resources To Create Dynamic Test Points
Katz, Richard; Kleyner, Igor
2011-01-01
A technique has been devised to enable creation of a dynamic set of test points in an embedded digital electronic system. As a result, electronics contained in an application specific circuit [e.g., gate array, field programmable gate array (FPGA)] can be internally probed, even when contained in a closed housing during all phases of test. In the present technique, the test points are not fixed and limited to a small number; the number of test points can vastly exceed the number of buffers or pins, resulting in a compact footprint. Test points are selected by means of spare logic resources within the ASIC(s) and/or FPGA(s). A register is programmed with a command, which is used to select the signals that are sent off-chip and out of the housing for monitoring by test engineers and external test equipment. The register can be commanded by any suitable means: for example, it could be commanded through a command port that would normally be used in the operation of the system. In the original application of the technique, commanding of the register is performed via a MIL-STD-1553B communication subsystem.
Petri Nets as Models of Linear Logic
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
1990-01-01
The chief purpose of this paper is to appraise the feasibility of Girad's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear logic in Petri nets, with respect to which we investigate the expressive power of the logic......The chief purpose of this paper is to appraise the feasibility of Girad's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear logic in Petri nets, with respect to which we investigate the expressive power of the logic...
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
Microelectromechanical resonator based digital logic elements
Hafiz, Md Abdullah Al
2016-10-20
Micro/nano-electromechanical resonator based mechanical computing has recently attracted significant attention. However, its full realization has been hindered by the difficulty in realizing complex combinational logics, in which the logic function is constructed by cascading multiple smaller logic blocks. In this work we report an alternative approach for implementation of digital logic core elements, multiplexer and demultiplexer, which can be used to realize combinational logic circuits by suitable concatenation. Toward this, shallow arch shaped microresonators are electrically connected and their resonance frequencies are tuned based on an electrothermal frequency modulation scheme. This study demonstrates that by reconfiguring the same basic building block, the arch microresonator, complex logic circuits can be realized.
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
Lloyd, Amy; Joseph-Williams, Natalie; Edwards, Adrian; Rix, Andrew; Elwyn, Glyn
2013-01-01
Background\\ud Implementing shared decision making into routine practice is proving difficult, despite considerable interest from policy-makers, and is far more complex than merely making decision support interventions available to patients. Few have reported successful implementation beyond research studies. MAking Good Decisions In Collaboration (MAGIC) is a multi-faceted implementation program, commissioned by The Health Foundation (UK), to examine how best to put shared decision making int...
Reasoning with Computer Code: a new Mathematical Logic
Pissanetzky, Sergio
2013-01-01
A logic is a mathematical model of knowledge used to study how we reason, how we describe the world, and how we infer the conclusions that determine our behavior. The logic presented here is natural. It has been experimentally observed, not designed. It represents knowledge as a causal set, includes a new type of inference based on the minimization of an action functional, and generates its own semantics, making it unnecessary to prescribe one. This logic is suitable for high-level reasoning with computer code, including tasks such as self-programming, objectoriented analysis, refactoring, systems integration, code reuse, and automated programming from sensor-acquired data. A strong theoretical foundation exists for the new logic. The inference derives laws of conservation from the permutation symmetry of the causal set, and calculates the corresponding conserved quantities. The association between symmetries and conservation laws is a fundamental and well-known law of nature and a general principle in modern theoretical Physics. The conserved quantities take the form of a nested hierarchy of invariant partitions of the given set. The logic associates elements of the set and binds them together to form the levels of the hierarchy. It is conjectured that the hierarchy corresponds to the invariant representations that the brain is known to generate. The hierarchies also represent fully object-oriented, self-generated code, that can be directly compiled and executed (when a compiler becomes available), or translated to a suitable programming language. The approach is constructivist because all entities are constructed bottom-up, with the fundamental principles of nature being at the bottom, and their existence is proved by construction. The new logic is mathematically introduced and later discussed in the context of transformations of algorithms and computer programs. We discuss what a full self-programming capability would really mean. We argue that self-programming
Contextual Validity in Hybrid Logic
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2013-01-01
of Hans Kamp and David Kaplan. We introduce a simple proof rule, which we call the Kamp Rule, and first we show that it is all we need to take us from logical validities involving now to contextual validities involving now too. We then go on to show that this deductive bridge is strong enough to carry us...
Testing Superconductor Logic Integrated Circuits
Arun, A.J.; Kerkhoff, Hans G.
2005-01-01
Superconductor logic has the potential of extremely low-power consumption and ultra-fast digital signal processing. Unfortunately, the obtained yield of the present processes is low and specific faults occur. This paper deals with fault-modelling, Design-for-Test structures, and ATPG for these
Complexity Issues in Basic Logic
Czech Academy of Sciences Publication Activity Database
Aguzzoli, S.; Gerla, B.; Haniková, Zuzana
2005-01-01
Roč. 9, - (2005), s. 919-934 ISSN 1432-7643 R&D Projects: GA MŠk LN00A056 Institutional research plan: CEZ:AV0Z10300504 Keywords : basic fuzzy logic (BL) * computational complexity * functional representation Subject RIV: BA - General Mathematics Impact factor: 0.538, year: 2005
Using Logical Problems in ESP.
Dorrity, Terry
1983-01-01
A course in scientific English for science researchers and advanced civil engineering students in Belgium has a central problem--the heterogeneous nature of the group and lack of common research experience around which to build a curriculum. An attempt to overcome this difficulty by using two logical problems for discussion is presented. (MSE)
Towards Logical Designs In Biology
Indian Academy of Sciences (India)
Administrator
This article highlights an emerging field known as syn- thetic biology that envisions integrating designed circuits into living organisms in order to instruct them to make logical decisions based on the prevailing intracellular and extracellular conditions and produce a reliable behavior. The attempt is to design cells capable of ...
Generic physical protection logic trees
Energy Technology Data Exchange (ETDEWEB)
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle.
Probabilistic Logic and Probabilistic Networks
Haenni, R.; Romeijn, J.-W.; Wheeler, G.; Williamson, J.
2009-01-01
While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches
Logics of communication and change
van Benthem, Johan; van Eijck, Jan; Kooi, Barteld
2006-01-01
Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that
Boggle Logic Puzzles: Minimal Solutions
Needleman, Jonathan
2013-01-01
Boggle logic puzzles are based on the popular word game Boggle played backwards. Given a list of words, the problem is to recreate the board. We explore these puzzles on a 3 x 3 board and find the minimum number of three-letter words needed to create a puzzle with a unique solution. We conclude with a series of open questions.
Mathematical Induction: Deductive Logic Perspective
Dogan, Hamide
2016-01-01
Many studies mentioned the deductive nature of Mathematical Induction (MI) proofs but almost all fell short in explaining its potential role in the formation of the misconceptions reported in the literature. This paper is the first of its kind looking at the misconceptions from the perspective of the abstract of the deductive logic from one's…
Generic physical protection logic trees
International Nuclear Information System (INIS)
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle
Contexts in Dynamic Predicate Logic
Visser, A.
1995-01-01
In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests/conditions and random resettings in the case that we are working
Logical Empiricism, Politics, and Professionalism
Edgar, Scott
2009-01-01
This paper considers George A. Reisch's account of the role of Cold War political forces in shaping the apolitical stance that came to dominate philosophy of science in the late 1940s and 1950s. It argues that at least as early as the 1930s, Logical Empiricists such as Rudolf Carnap already held that philosophy of science could not properly have…
Coreflections in Algebraic Quantum Logic
Jacobs, Bart; Mandemaker, Jorik
2012-07-01
Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular po-sets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflections.
Linguistics, Logic, and Finite Trees
Blackburn, P.; Meyer-Viol, W.
1993-01-01
A modal logic is developed to deal with finite ordered binary trees as they are used in (computational) linguistics. A modal language is introduced with operators for the 'mother of', 'first daughter of' and 'second daughter of' relations together with their transitive reflexive closures.
An overview of Interpretability Logic
Visser, A.
A miracle happens. In one hand we have a class of marvelously complex theories in predicate logic, theories with 'sufficient coding potential', like PA (Peano Arithmetic) or ZF (Zermelo Fraenkel Set Theory). In the other we have certain modal propositional theories of striking simplicity. We
Morpho (?) phono (?) logical fuzzy edges
African Journals Online (AJOL)
Open Access DOWNLOAD FULL TEXT Subscription or Fee Access. Morpho (?) phono (?) logical fuzzy edges: The case of {-/}/{-/U/} semantic (?) contrast in Shona. K. G. Mkangwanwi. Abstract. (ZAMBEZIA: Journal of Humanities of the Univ of Zimbabwe, 2000 27(1): 47-54). Full Text: EMAIL FULL TEXT EMAIL FULL TEXT
Symmetric normalisation for intuitionistic logic
DEFF Research Database (Denmark)
Guenot, Nicolas; Straßburger, Lutz
2014-01-01
We present two proof systems for implication-only intuitionistic logic in the calculus of structures. The first is a direct adaptation of the standard sequent calculus to the deep inference setting, and we describe a procedure for cut elimination, similar to the one from the sequent calculus...
Completeness for Coalgebraic Fixpoint Logic
Enqvist, S.; Seifan, F.; Venema, Y.
2016-01-01
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema as a generalization, based on Moss' coalgebraic modality, of the well-known modal mu-calculus. Our axiomatization can be seen as a generalization of Kozen's proof system for the modal mu-calculus to
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 10; Issue 11. The Logic of Animal Conflict. Raghavendra Gadagkar. Article-in-a-Box Volume 10 Issue 11 November 2005 pp 5-5. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/010/11/0005-0005 ...
Complex cellular logic computation using ribocomputing devices.
Green, Alexander A; Kim, Jongmin; Ma, Duo; Silver, Pamela A; Collins, James J; Yin, Peng
2017-08-03
Synthetic biology aims to develop engineering-driven approaches to the programming of cellular functions that could yield transformative technologies. Synthetic gene circuits that combine DNA, protein, and RNA components have demonstrated a range of functions such as bistability, oscillation, feedback, and logic capabilities. However, it remains challenging to scale up these circuits owing to the limited number of designable, orthogonal, high-performance parts, the empirical and often tedious composition rules, and the requirements for substantial resources for encoding and operation. Here, we report a strategy for constructing RNA-only nanodevices to evaluate complex logic in living cells. Our 'ribocomputing' systems are composed of de-novo-designed parts and operate through predictable and designable base-pairing rules, allowing the effective in silico design of computing devices with prescribed configurations and functions in complex cellular environments. These devices operate at the post-transcriptional level and use an extended RNA transcript to co-localize all circuit sensing, computation, signal transduction, and output elements in the same self-assembled molecular complex, which reduces diffusion-mediated signal losses, lowers metabolic cost, and improves circuit reliability. We demonstrate that ribocomputing devices in Escherichia coli can evaluate two-input logic with a dynamic range up to 900-fold and scale them to four-input AND, six-input OR, and a complex 12-input expression (A1 AND A2 AND NOT A1*) OR (B1 AND B2 AND NOT B2*) OR (C1 AND C2) OR (D1 AND D2) OR (E1 AND E2). Successful operation of ribocomputing devices based on programmable RNA interactions suggests that systems employing the same design principles could be implemented in other host organisms or in extracellular settings.
The Complexity of Model Checking Higher-Order Fixpoint Logic
DEFF Research Database (Denmark)
Axelsson, Roland; Lange, Martin; Somla, Rafal
2007-01-01
Higher Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal μ-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal μ-calculus. This paper...... of solving rather large parity games of small index. As a consequence of this we obtain an ExpTime upper bound on the expression complexity of each HFLk,m. The lower bound is established by a reduction from the word problem for alternating (k-1)-fold exponential space bounded Turing Machines. As a corollary...
FUZZY LOGIC IN LEGAL EDUCATION
Directory of Open Access Journals (Sweden)
Z. Gonul BALKIR
2011-04-01
Full Text Available The necessity of examination of every case within its peculiar conditions in social sciences requires different approaches complying with the spirit and nature of social sciences. Multiple realities require different and various perceptual interpretations. In modern world and social sciences, interpretation of perception of valued and multi-valued have been started to be understood by the principles of fuzziness and fuzzy logic. Having the verbally expressible degrees of truthness such as true, very true, rather true, etc. fuzzy logic provides the opportunity for the interpretation of especially complex and rather vague set of information by flexibility or equivalence of the variables’ of fuzzy limitations. The methods and principles of fuzzy logic can be benefited in examination of the methodological problems of law, especially in the applications of filling the legal loopholes arising from the ambiguities and interpretation problems in order to understand the legal rules in a more comprehensible and applicable way and the efficiency of legal implications. On the other hand, fuzzy logic can be used as a technical legal method in legal education and especially in legal case studies and legal practice applications in order to provide the perception of law as a value and the more comprehensive and more quality perception and interpretation of value of justice, which is the core value of law. In the perception of what happened as it has happened in legal relationships and formations, the understanding of social reality and sociological legal rules with multi valued sense perspective and the their applications in accordance with the fuzzy logic’s methods could create more equivalent and just results. It can be useful for the young lawyers and law students as a facilitating legal method especially in the materialization of the perception and interpretation of multi valued and variables. Using methods and principles of fuzzy logic in legal
Mathematical logic foundations for information science
Li, Wei
2010-01-01
This book presents the basic principles and formal calculus of mathematical logic. It covers core contents, extensions and developments of classical mathematical logic, and it offers formal proofs and concrete examples for all theoretical results.
Logic functions and equations examples and exercises
Steinbach, Bernd
2009-01-01
With a free, downloadable software package available to help solve the exercises, this book focuses on practical and relevant problems that arise in the field of binary logics, with its two main applications - digital circuit design, and propositional logics.
Process algebra with four-valued logic
Bergstra, J.A.; Ponse, A.
2000-01-01
We propose a combination of a fragment of four-valued logic and process algebra. We present an operational semantics in SOS-style, and a completeness result for ACP with conditionals and four-valued logic.
Preface. Philosophy and History of Talmudic Logic
Directory of Open Access Journals (Sweden)
Schumann Andrew
2017-06-01
Full Text Available This volume contains the papers presented at the Philosophy and History of Talmudic Logic Affiliated Workshop of Krakow Conference on History of Logic (KHL2016, held on October 27, 2016, in Krakow, Poland.
Protein networks as logic functions in development and cancer.
Directory of Open Access Journals (Sweden)
Janusz Dutkowski
2011-09-01
Full Text Available Many biological and clinical outcomes are based not on single proteins, but on modules of proteins embedded in protein networks. A fundamental question is how the proteins within each module contribute to the overall module activity. Here, we study the modules underlying three representative biological programs related to tissue development, breast cancer metastasis, or progression of brain cancer, respectively. For each case we apply a new method, called Network-Guided Forests, to identify predictive modules together with logic functions which tie the activity of each module to the activity of its component genes. The resulting modules implement a diverse repertoire of decision logic which cannot be captured using the simple approximations suggested in previous work such as gene summation or subtraction. We show that in cancer, certain combinations of oncogenes and tumor suppressors exert competing forces on the system, suggesting that medical genetics should move beyond cataloguing individual cancer genes to cataloguing their combinatorial logic.
Synthetic Computation: Chaos Computing, Logical Stochastic Resonance, and Adaptive Computing
Kia, Behnam; Murali, K.; Jahed Motlagh, Mohammad-Reza; Sinha, Sudeshna; Ditto, William L.
Nonlinearity and chaos can illustrate numerous behaviors and patterns, and one can select different patterns from this rich library of patterns. In this paper we focus on synthetic computing, a field that engineers and synthesizes nonlinear systems to obtain computation. We explain the importance of nonlinearity, and describe how nonlinear systems can be engineered to perform computation. More specifically, we provide an overview of chaos computing, a field that manually programs chaotic systems to build different types of digital functions. Also we briefly describe logical stochastic resonance (LSR), and then extend the approach of LSR to realize combinational digital logic systems via suitable concatenation of existing logical stochastic resonance blocks. Finally we demonstrate how a chaotic system can be engineered and mated with different machine learning techniques, such as artificial neural networks, random searching, and genetic algorithm, to design different autonomous systems that can adapt and respond to environmental conditions.
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.
Logics and falsifications a new perspective on constructivist semantics
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 ...
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
MULTISITE OF EDUCATIONAL EVALUATION IN NORMAL SCHOOLS IN THE STATE OF MEXICO
Directory of Open Access Journals (Sweden)
Ireri Báez Chávez
2013-09-01
Full Text Available From the logic of Educational Technology, the research was conducted at three moments: Descriptive, Diagnostic and Confirmatory. Process was documented by Diagnostic Evaluation Committees for the Evaluation of Higher Education (CIEES at 36 State Normal Schools Mexico. The objective was to determine the indicators meet the educational programs for accreditation. The results are 51 educational programs evaluated, 36 institutions and 12 undergraduate participants, 66.6% with Level 1 and Level 2 33.3%. This has had an impact on state learning achievements expressed general knowledge tests, going from an average of 60.5 points in 2009 to 67.5 in 2012.
Czech Academy of Sciences Publication Activity Database
Horčík, Rostislav; Noguera, C.; Petrík, M.
2007-01-01
Roč. 53, č. 3 (2007), s. 268-288 ISSN 0942-5616 R&D Projects: GA AV ČR 1ET100300517 Institutional research plan: CEZ:AV0Z10300504 Keywords : algebraic logic * fuzzy logics * generalized contraction * generalized excluded middle * left-continuous t-norms * MTL-algebras * non-classical logics * residuated lattices * standard completeness * substructural logics * varieties * weak cancellation Subject RIV: BA - General Mathematics Impact factor: 0.317, year: 2007
Logic without energy or bandwidth limits
Caulfield, Henry J.; Westphal, Jonathan
2003-07-01
Boolean logic is an inherently irreversible, hence lossy operation. It has a well-known energy cost and an obvious time cost. To avoid those costs, we must do a different kind of logic. But, it is Boolean logic that we wish to do. We solved that dilemma by using a quantum optical logic gate that is fully reversible that yields the Boolean result after the irreversible loss of information in detection occurs.
FOLE: The First-order Logical Environment
Kent, Robert E.
2013-01-01
This paper describes the first-order logical environment FOLE. Institutions in general, and logical environments in particular, give equivalent heterogeneous and homogeneous representations for logical systems. As such, they offer a rigorous and principled approach to distributed interoperable information systems via system consequence. Since FOLE is a particular logical environment, this provides a rigorous and principled approach to distributed interoperable first-order information systems....
BIO Logical Agents: Norms, Beliefs, Intentions in Defeasible Logic
Governatori, Guido; Rotolo, Antonino
2007-01-01
In this paper we follow the BOID (Belief, Obligation, Intention, Desire) architecture to describe agents and agent types in Defeasible Logic. We argue, in particular, that the introduction of obligations can provide a new reading of the concepts of intention and intentionality. Then we examine the notion of social agent (i.e., an agent where obligations prevail over intentions) and discuss some computational and philosophical issues related to it. We show th...
Translating Dominant Institutional Logics in Practice
DEFF Research Database (Denmark)
Agger Nielsen, Jeppe; Jensen, Tina Blegind
In this paper we examine the proliferation of a new mobile technology in a structured setting of home care in Denmark, focusing on how actions at multiple levels interact to enable technology diffusion and institutionalization. The case study shows how a dominating field level logic...... that combining an institutional logic perspective with a translation perspective furthers our understanding of the malleability of institutional logics....
An Adequate First Order Logic of Intervals
DEFF Research Database (Denmark)
Chaochen, Zhou; Hansen, Michael Reichhardt
1998-01-01
This paper introduces left and right neighbourhoods as primitive interval modalities to define other unary and binary modalities of intervals in a first order logic with interval length. A complete first order logic for the neighbourhood modalities is presented. It is demonstrated how the logic can...... support formal specification and verification of liveness and fairness, and also of various notions of real analysis....
Towards a formal logic of design rationalization
DEFF Research Database (Denmark)
Galle, Per
1997-01-01
Certain extensions to standard predicate logic are proposed and used as a framework for critical logical study of patterns of inference in design reasoning. It is shown that within this framework a modal logic of design rationalization (suggested by an empirical study reported earlier) can be for...
Dialogues as a dynamic framework for logic
Rückert, Helge
2007-01-01
Dialogical logic is a game-theoretical approach to logic. Logic is studied with the help of certain games, which can be thought of as idealized argumentations. Two players, the Proponent, who puts forward the initial thesis and tries to defend it, and the Opponent, who tries to attack the
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
Piaget's Logic of Meanings: Still Relevant Today
Wavering, Michael James
2011-01-01
In his last book, "Toward a Logic of Meanings" (Piaget & Garcia, 1991), Jean Piaget describes how thought can be categorized into a form of propositional logic, a logic of meanings. The intent of this article is to offer this analysis by Piaget as a means to understand the language and teaching of science. Using binary propositions, conjunctions,…
On Product Logic with Truth-Constants
Czech Academy of Sciences Publication Activity Database
Savický, Petr; Cignoli, R.; Esteva, F.; Godo, L.; Noguera, C.
2006-01-01
Roč. 16, č. 2 (2006), s. 205-225 ISSN 0955-792X R&D Projects: GA MŠk 1M0545 Keywords : non-classical logic * fuzzy logic * product logic * truth-constants * standard completeness Subject RIV: BA - General Mathematics Impact factor: 0.840, year: 2006
Parity Games and Automata for Game Logic
Hansen, H.H.; Kupke, C.; Marti, J.; Venema, Y.; Madeira, A.; Benevides, M.
2018-01-01
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal
The dynamic turn in quantum logic
Baltag, Alexandru; Smets, Sonja
In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the
Hybrid Logical Analyses of the Ambient Calculus
DEFF Research Database (Denmark)
Bolander, Thomas; Hansen, Rene Rydhof
2010-01-01
In this paper, hybrid logic is used to formulate three control flow analyses for Mobile Ambients, a process calculus designed for modelling mobility. We show that hybrid logic is very well-suited to express the semantic structure of the ambient calculus and how features of hybrid logic can...
Intuitionistic Rules : Admissible Rules of Intermediate Logics
Goudsmit, J.P.
2015-01-01
In this thesis, we investigate the admissible rules of intermediate logics. On the one hand, one can characterize the admissibility of rules in certain logic, and on the other hand, one can characterize logics through their admissible rules. We take both approaches, and reach new results in both
Logics of Business Education for Sustainability
Andersson, Pernilla; Öhman, Johan
2016-01-01
This paper explores various kinds of logics of "business education for sustainability" and how these "logics" position the subject business person, based on eight teachers' reasoning of their own practices. The concept of logics developed within a discourse theoretical framework is employed to analyse the teachers' reasoning.…
Applications of Logic Coverage Criteria and Logic Mutation to Software Testing
Kaminski, Garrett K.
2011-01-01
Logic is an important component of software. Thus, software logic testing has enjoyed significant research over a period of decades, with renewed interest in the last several years. One approach to detecting logic faults is to create and execute tests that satisfy logic coverage criteria. Another approach to detecting faults is to perform mutation…
Energy Technology Data Exchange (ETDEWEB)
Kang, D. Y.; Kim, M. H.; Kim, Y. D.; Kim, D. K. [Donga University College of Medicine, Busan (Korea, Republic of)
2002-07-01
Absolute value of the functional data of gated myocardial perfusion SPECT is necessary to determine that individual patient is normal or not. Tc-99m MIBI gated myocardial perfusion SPECT was performed using emory cardiac tool box program. All patients (M:F=15:36, age 64{+-}10 yrs) showed normal myocardial perfusion. The patients with following characteristics were excluded; previous angina or MI, ECG change with Q wave or ST-T change, diabetes mellitus, hypercholesterolemia, typical chest pain and hypertension. In all patients, myocardial mass is 117{+-}23 g in stress gated SPECT, 106{+-}22 g in stress ungated SPECT and 102{+-}21 g in rest ungated SPECT. EDV is 90{+-}28 ml, ESV 26{+-}20 ml, SV 66{+-}21 ml, EF 73{+-}10 % and TID 1.06{+-}0.14. Myocardial mass in rest ungated SPECT is significantly different between men and women (p=0.025). Myocardial mass is significantly different between stress gated SPECT and stress ungated SPECT (p=0.000), and between stress ungated SPECT and rest ungated SPECT (p=0.003). We provide normal value of functional parameters to determine the abnormality of individual patients in patients with low risk of coronary artery disease.
Can we trust subjective logic for information fusion?
Dezert, J.; Tchamova, A.; Han, D.; Tacnet, J.M.
2014-01-01
International audience; In this paper, we provide a deep examination of the main bases of Subjective Logic (SL) and reveal serious problems with them. A new interesting alternative way for building a normal coarsened basic belief assignment from a refined one is also proposed. The defects in the SL fusion rule and the problems in the link between opinion and Beta probability density functions are also analyzed. Some numerical examples and related analyses are provided to justify our viewpoints.