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.

Evaluating system behavior through Dynamic Master Logic Diagram (DMLD) modeling

International Nuclear Information System (INIS)

Hu, Y.-S.; Modarres, Mohammad

1999-01-01

In this paper, the Dynamic Master Logic Diagram (DMLD) is introduced for representing full-scale time-dependent behavior and uncertain behavior of complex physical systems. Conceptually, the DMLD allows one to decompose a complex system hierarchically to model and to represent: (1) partial success/failure of the system, (2) full-scale logical, physical and fuzzy connectivity relations, (3) probabilistic, resolutional or linguistic uncertainty, (4) multiple-state system dynamics, and (5) floating threshold and transition effects. To demonstrate the technique, examples of using DMLD to model, to diagnose and to control dynamic behavior of a system are presented. A DMLD-based expert system building tool, called Dynamic Reliability Expert System (DREXs), is introduced to automate the DMLD modeling process

Application of laws of diagramic logic to calculation of middle coefficient of friction for turbulent boundary layer

International Nuclear Information System (INIS)

Denisov, A.S.

1994-01-01

Canonical formalization of an phenomenon of reasoning by images consists of eight laws of diagramic logic, providing an structural diagram of exploring object as main unit of operating. That laws are divided into three groups: (1) The first channel of application for structural diagrams is the deduction of necessary result from previous theorems of author. (2) The second channel of application for structural diagrams is the deduction of necessary result from parallel theorems of other author. (3) The third channel of application for structural diagrams is the deduction of necessary result by means of modification of nuclear theory

Logic Programming: PROLOG.

Science.gov (United States)

Lopez, Antonio M., Jr.

1989-01-01

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

Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4. Volume 1: Technology evaluation

International Nuclear Information System (INIS)

1994-09-01

During World War 11, the Oak Ridge Y-12 Plant was built as part of the Manhattan Project to supply enriched uranium for weapons production. In 1945, Building 9201-4 (Alpha-4) was originally used to house a uranium isotope separation process based on electromagnetic separation technology. With the startup of the Oak Ridge K-25 Site gaseous diffusion plant In 1947, Alpha-4 was placed on standby. In 1953, the uranium enrichment process was removed, and installation of equipment for the Colex process began. The Colex process--which uses a mercury solvent and lithium hydroxide as the lithium feed material-was shut down in 1962 and drained of process materials. Residual Quantities of mercury and lithium hydroxide have remained in the process equipment. Alpha-4 contains more than one-half million ft 2 of floor area; 15,000 tons of process and electrical equipment; and 23,000 tons of insulation, mortar, brick, flooring, handrails, ducts, utilities, burnables, and sludge. Because much of this equipment and construction material is contaminated with elemental mercury, cleanup is necessary. The goal of the Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4 is to provide a planning document that relates decontamination and decommissioning and waste management problems at the Alpha-4 building to the technologies that can be used to remediate these problems. The Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4 builds on the methodology transferred by the U.S. Air Force to the Environmental Management organization with DOE and draws from previous technology logic diagram-efforts: logic diagrams for Hanford, the K-25 Site, and ORNL

Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4. Volume 1: Technology evaluation

Energy Technology Data Exchange (ETDEWEB)

NONE

1994-09-01

During World War 11, the Oak Ridge Y-12 Plant was built as part of the Manhattan Project to supply enriched uranium for weapons production. In 1945, Building 9201-4 (Alpha-4) was originally used to house a uranium isotope separation process based on electromagnetic separation technology. With the startup of the Oak Ridge K-25 Site gaseous diffusion plant In 1947, Alpha-4 was placed on standby. In 1953, the uranium enrichment process was removed, and installation of equipment for the Colex process began. The Colex process--which uses a mercury solvent and lithium hydroxide as the lithium feed material-was shut down in 1962 and drained of process materials. Residual Quantities of mercury and lithium hydroxide have remained in the process equipment. Alpha-4 contains more than one-half million ft{sup 2} of floor area; 15,000 tons of process and electrical equipment; and 23,000 tons of insulation, mortar, brick, flooring, handrails, ducts, utilities, burnables, and sludge. Because much of this equipment and construction material is contaminated with elemental mercury, cleanup is necessary. The goal of the Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4 is to provide a planning document that relates decontamination and decommissioning and waste management problems at the Alpha-4 building to the technologies that can be used to remediate these problems. The Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4 builds on the methodology transferred by the U.S. Air Force to the Environmental Management organization with DOE and draws from previous technology logic diagram-efforts: logic diagrams for Hanford, the K-25 Site, and ORNL.

Oak Ridge National Laboratory Technology Logic Diagram. Volume 3, Technology evaluation data sheets: Part B, Dismantlement, Remedial action

Energy Technology Data Exchange (ETDEWEB)

1993-09-01

The Oak Ridge National Laboratory Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates environmental restoration (ER) and waste management (WM) problems at Oak Ridge National Laboratory (ORNL) to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration testing, and evaluation needed to develop these technologies to a state that allows technology transfer and application to decontamination and decommissioning (D&D), remedial action (RA), and WM activities. The TLD consists of three fundamentally separate volumes: Vol. 1, Technology Evaluation; Vol. 2, Technology Logic Diagram and Vol. 3, Technology EvaLuation Data Sheets. Part A of Vols. 1 and 2 focuses on RA. Part B of Vols. 1 and 2 focuses on the D&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&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.

Y-12 Plant decontamination and decommissioning technology logic diagram for Building 9201-4. Volume 3: Technology evaluation data sheets; Part A: Characterization, dismantlement

Energy Technology Data Exchange (ETDEWEB)

NONE

1994-09-01

The Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4 (TLD) was developed to provide a decision-support tool that relates decontamination and decommissioning (D and D) problems at Bldg. 9201-4 to potential technologies that can remediate these problems. The TLD uses information from the Strategic Roadmap for the Oak Ridge Reservation, the Oak Ridge K-25 Site Technology Logic Diagram, the Oak Ridge National Laboratory Technology Logic Diagram, and a previous Hanford logic diagram. This TLD identifies the research, development, demonstration, testing, and evaluation needed for sufficient development of these technologies to allow for technology transfer and application to D and D and waste management (WM) activities. It is essential that follow-on engineering studies be conducted to build on the output of this project. These studies will begin by selecting the most promising technologies identified in the TLD and by finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk. This report consists of the characterization and dismantlement data sheets.

Y-12 Plant decontamination and decommissioning technology logic diagram for Building 9201-4. Volume 3: Technology evaluation data sheets; Part A: Characterization, dismantlement

International Nuclear Information System (INIS)

1994-09-01

The Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4 (TLD) was developed to provide a decision-support tool that relates decontamination and decommissioning (D and D) problems at Bldg. 9201-4 to potential technologies that can remediate these problems. The TLD uses information from the Strategic Roadmap for the Oak Ridge Reservation, the Oak Ridge K-25 Site Technology Logic Diagram, the Oak Ridge National Laboratory Technology Logic Diagram, and a previous Hanford logic diagram. This TLD identifies the research, development, demonstration, testing, and evaluation needed for sufficient development of these technologies to allow for technology transfer and application to D and D and waste management (WM) activities. It is essential that follow-on engineering studies be conducted to build on the output of this project. These studies will begin by selecting the most promising technologies identified in the TLD and by finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk. This report consists of the characterization and dismantlement data sheets

Y-12 Plant remedial action Technology Logic Diagram: Volume 3, Technology evaluation data sheets: Part A, Remedial action

International Nuclear Information System (INIS)

1994-09-01

The Y-12 Plant Remedial Action Technology Logic Diagram (TLD) was developed to provide a decision-support tool that relates environmental restoration (ER) problems at the Y-12 Plant to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration, testing, and evaluation needed for sufficient development of these technologies to allow for technology transfer and application to remedial action (RA) activities. The TLD consists of three volumes. Volume 1 contains an overview of the TLD, an explanation of the program-specific responsibilities, a review of identified technologies, and the rankings of remedial technologies. Volume 2 contains the logic linkages among environmental management goals, environmental problems and the various technologies that have the potential to solve these problems. Volume 3 contains the TLD data sheets. This report is Part A of Volume 3 and contains the Remedial Action section

Y-12 Plant remedial action Technology Logic Diagram: Volume 3, Technology evaluation data sheets: Part A, Remedial action

Energy Technology Data Exchange (ETDEWEB)

NONE

1994-09-01

The Y-12 Plant Remedial Action Technology Logic Diagram (TLD) was developed to provide a decision-support tool that relates environmental restoration (ER) problems at the Y-12 Plant to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration, testing, and evaluation needed for sufficient development of these technologies to allow for technology transfer and application to remedial action (RA) activities. The TLD consists of three volumes. Volume 1 contains an overview of the TLD, an explanation of the program-specific responsibilities, a review of identified technologies, and the rankings of remedial technologies. Volume 2 contains the logic linkages among environmental management goals, environmental problems and the various technologies that have the potential to solve these problems. Volume 3 contains the TLD data sheets. This report is Part A of Volume 3 and contains the Remedial Action section.

Oak Ridge National Laboratory Technology Logic Diagram. Volume 3, Technology evaluation data sheets: Part C, Robotics/automation, Waste management

Energy Technology Data Exchange (ETDEWEB)

1993-09-01

The Oak Ridge National Laboratory Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates environmental restoration (ER) and waste management (WM) problems at Oak Ridge National Laboratory (ORNL) to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration testing, and evaluation needed to develop these technologies to a state that allows technology transfer and application to decontamination and decommissioning (D&D), remedial action (RA), and WM activities. The TLD consists of three fundamentally separate volumes: Vol. 1, Technology Evaluation; Vol. 2, Technology Logic Diagram and Vol. 3, Technology EvaLuation Data Sheets. Part A of Vols. 1 and 2 focuses on RA. Part B of Vols. 1 and 2 focuses on the D&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&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.

Semantic theory for logic programming

Energy Technology Data Exchange (ETDEWEB)

Brown, F M

1981-01-01

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

Oak Ridge K-25 Site Technology Logic Diagram. Volume 1, Technology evaluation

Energy Technology Data Exchange (ETDEWEB)

Fellows, R.L. [ed.

1993-02-26

The Oak Ridge K-25 Technology Logic Diagram (TLD), a decision support tool for the K-25 Site, was developed to provide a planning document that relates environmental restoration and waste management problems at the Oak Ridge K-25 Site to potential technologies that can remediate these problems. The TLD technique identifies the research necessary to develop these technologies to a state that allows for technology transfer and application to waste management, remedial action, and decontamination and decommissioning activities. The TLD consists of four separate volumes-Vol. 1, Vol. 2, Vol. 3A, and Vol. 3B. This Volume, Volume 1 provides introductory and overview information about the TLD. Volume 2 contains logic diagrams. Volume 3 has been divided into two separate volumes to facilitate handling and use. This volume is divided into ten chapters. The first chapter is a brief introduction, and the second chapter details the technical approach of the TLD. These categories are the work activities necessary for successful decontamination and decommissioning, waste management, and remedial action of the K-25 Site. The categories are characterization, decontamination, dismantlement, robotics and automation, remedial action, and waste management. Materials disposition is addressed in Chap. 9. The final chapter contains regulatory compliance information concerning waste management, remedial action, and decontamination and decommissioning.

Programmable Array Logic Design

International Nuclear Information System (INIS)

Demon Handoyo; Djen Djen Djainal

2007-01-01

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

A Denotational Semantics for Logic Programming

DEFF Research Database (Denmark)

Frandsen, Gudmund Skovbjerg

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

Y-12 Plant remedial action Technology Logic Diagram: Volume 3, Technology evaluation data sheets: Part B, Characterization; robotics/automation

International Nuclear Information System (INIS)

1994-09-01

The Y-12 Plant Remedial Action Technology Logic Diagram (TLD) was developed to provide a decision-support tool that relates environmental restoration (ER) problems at the Y-12 Plant to potential technologies that can remediate theses problems. The TLD identifies the research, development, demonstration, testing, and evaluation needed for sufficient development of these technologies to allow for technology transfer and application to remedial action (RA) activities. The TLD consists of three volumes. Volume 1 contains an overview of the TLD, an explanation of the program-specific responsibilities, a review of identified technologies, and the rankings of remedial technologies. Volume 2 contains the logic linkages among environmental management goals, environmental problems, and the various technologies that have the potential to solve these problems. Volume 3 contains the TLD data sheets. This report is Part B of Volume 3 and contains the Characterization and Robotics/Automation sections

MORT User's Manual for use with the Management Oversight and Risk Tree analytical logic diagram. [Contains a list of System Safety Development Center publications

Energy Technology Data Exchange (ETDEWEB)

Knox, N.W.; Eicher, R.W.

1992-02-01

This report contains the User's Manual for MORT (Management Oversight and Risk Tree), a logic diagram in the form of a work sheet'' that illustrates a long series of interrelated questions. MORT is a comprehensive analytical procedure that provides a disciplined method for determining the causes and contributing factors of major accidents. Alternatively, it serves as a tool to evaluate the quality of an existing system. While similar in many respects to fault tree analysis, MORT is more generalized and presents over 1,500 specific elements of an ideal universal'' management program for optimizing environment, safety and health, and other programs. This User's Manual is intended to be used with the MORT diagram dated February 1992.

Y-12 Plant decontamination and decommissioning technology logic diagram for Building 9201-4. Volume 3: Technology evaluation data sheets; Part B: Decontamination, robotics/automation, waste management

International Nuclear Information System (INIS)

1994-09-01

The Y-12 Plant Decontamination and Decommissioning Technology Logic Diagram for Building 9201-4 (TLD) was developed to provide a decision-support tool that relates decontamination and decommissioning (D and D) problems at Bldg. 9201-4 to potential technologies that can remediate these problems. The TLD uses information from the Strategic Roadmap for the Oak Ridge Reservation, the Oak Ridge K-25 Site Technology Logic Diagram, the Oak Ridge National Laboratory Technology Logic Diagram, and a previous Hanford logic diagram. This TLD identifies the research, development, demonstration, testing, and evaluation needed for sufficient development of these technologies to allow for technology transfer and application to D and D and waste management (WM) activities. It is essential that follow-on engineering studies be conducted to build on the output of this project. These studies will begin by selecting the most promising technologies identified in the TLD and by finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk. This report consists of the decontamination, robotics/automation, and WM data sheets

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

Enhancing programming logic thinking using analogy mapping

Science.gov (United States)

Sukamto, R. A.; Megasari, R.

2018-05-01

Programming logic thinking is the most important competence for computer science students. However, programming is one of the difficult subject in computer science program. This paper reports our work about enhancing students' programming logic thinking using Analogy Mapping for basic programming subject. Analogy Mapping is a computer application which converts source code into analogies images. This research used time series evaluation and the result showed that Analogy Mapping can enhance students' programming logic thinking.

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.

Idaho National Engineering Laboratory Waste Area Groups 1-7 and 10 Technology Logic Diagram

International Nuclear Information System (INIS)

O'Brien, M.C.; Meservey, R.H.; Little, M.; Ferguson, J.S.; Gilmore, M.C.

1993-09-01

The Idaho National Engineering Laboratory (INEL) Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates Environmental Restoration (ER) and Waste Management (WM) problems at the INEL 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 an environmental restoration need. It is essential that follow-on engineering and system studies be conducted to build on the output of this project. These studies will begin by selecting the most promising technologies identified in this TLD and finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk to meet the site windows of opportunity. The TLD consists of three separate volumes: Volume I includes the purpose and scope of the TLD, a brief history of the INEL Waste Area Groups, and environmental problems they represent. A description of the TLD, definitions of terms, a description of the technology evaluation process, and a summary of each subelement, is presented. Volume II describes the overall layout and development of the TLD in logic diagram format. This section addresses the environmental restoration of contaminated INEL sites. Volume III (this volume) provides the Technology Evaluation Data Sheets (TEDS) for Environmental Restoration and Waste Management (EM) activities that are reference by a TEDS code number in Volume II. Each of these sheets represents a single logic trace across the TLD. These sheets contain more detail than provided for technologies in Volume II. Data sheets are arranged alphanumerically by the TEDS code number in the upper right corner of each sheet

Oak Ridge K-25 Site Technology Logic Diagram. Volume 3, Technology evaluation data sheets; Part A, Characterization, decontamination, dismantlement

Energy Technology Data Exchange (ETDEWEB)

Fellows, R.L. [ed.

1993-02-26

The Oak Ridge K-25 Technology Logic Diagram (TLD), a decision support tool for the K-25 Site, was developed to provide a planning document that relates environmental restoration and waste management problems at the Oak Ridge K-25 Site to potential technologies that can remediate these problems. The TLD technique identifies the research necessary to develop these technologies to a state that allows for technology transfer and application to waste management, remedial action, and decontamination and decommissioning activities. The TLD consists of four separate volumes-Vol. 1, Vol. 2, Vol. 3A, and Vol. 3B. Volume 1 provides introductory and overview information about the TLD. Volume 2 contains logic diagrams. Volume 3 has been divided into two separate volumes to facilitate handling and use. This report is part A of Volume 3 concerning characterization, decontamination, and dismantlement.

Idaho National Engineering Laboratory Waste Area Groups 1-7 and 10 Technology Logic Diagram

International Nuclear Information System (INIS)

O'Brien, M.C.; Meservey, R.H.; Little, M.; Ferguson, J.S.; Gilmore, M.C.

1993-09-01

The Idaho National Engineering Laboratory (INEL) Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates Environmental Restoration (ER) and Waste Management (WM) problems at the INEL 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 an environmental restoration need. It is essential that follow-on engineering and system studies be conducted to build on the output of this project. These studies will begin by selecting the most promising technologies identified in this TLD and finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk to meet the site windows of opportunity. The TLD consists of three separate volumes: Volume I includes the purpose and scope of the TLD, a brief history of the INEL Waste Area Groups, and environmental problems they represent. A description of the TLD, definitions of terms, a description of the technology evaluation process, and a summary of each subelement, is presented. Volume II (this volume) describes the overall layout and development of the TLD in logic diagram format. This section addresses the environmental restoration of contaminated INEL sites. Specific INEL problem areas/contaminants are identified along with technology solutions, the status of the technologies, precise science and technology needs, and implementation requirements. Volume III provides the Technology Evaluation Data Sheets (TEDS) for Environmental Restoration and Waste Management (EM) activities that are referenced by a TEDS codenumber in Volume II. Each of these sheets represents a single logic trace across the TLD. These sheets contain more detail than provided for technologies in Volume II

Abduction, ASP and Open Logic Programs

OpenAIRE

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

Abstract Interpretation of PIC programs through Logic Programming

DEFF Research Database (Denmark)

Henriksen, Kim Steen; Gallagher, John Patrick

2006-01-01

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

A Program Transformation for Backwards Analysis of Logic Programs

DEFF Research Database (Denmark)

Gallagher, John Patrick

2003-01-01

The input to backwards analysis is a program together with properties that are required to hold at given program points. The purpose of the analysis is to derive initial goals or pre-conditions that guarantee that, when the program is executed, the given properties hold. The solution for logic...... 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...

Logical database design principles

CERN Document Server

Garmany, John; Clark, Terry

2005-01-01

INTRODUCTION TO LOGICAL DATABASE DESIGNUnderstanding a Database Database Architectures Relational Databases Creating the Database System Development Life Cycle (SDLC)Systems Planning: Assessment and Feasibility System Analysis: RequirementsSystem Analysis: Requirements Checklist Models Tracking and Schedules Design Modeling Functional Decomposition DiagramData Flow Diagrams Data Dictionary Logical Structures and Decision Trees System Design: LogicalSYSTEM DESIGN AND IMPLEMENTATION The ER ApproachEntities and Entity Types Attribute Domains AttributesSet-Valued AttributesWeak Entities Constraint

Coinductive Logic Programming with Negation

Science.gov (United States)

Min, Richard; Gupta, Gopal

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

Deciding Full Branching Time Logic by Program Transformation

Science.gov (United States)

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.

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

Logic of non-interacting programs and reactive systems

OpenAIRE

Shelekhov, Vladimir; Tumurov, Erdem

2012-01-01

The notion of a program logic is introduced to denote a set of predicates which are true in different program points. The program logic can be easily constructed for different kinds of statements of an imperative or a functional language with data types except pointers. For a non-interacting program, a total correctness formula based on the program logic is defined. The rules of program correctness proof have been developed for proving the statements of various kinds. For a reactive system, t...

Permission-Based Separation Logic for Multithreaded Java Programs

NARCIS (Netherlands)

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

2011-01-01

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

Automated termination proofs for logic programs by term rewriting

NARCIS (Netherlands)

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

2009-01-01

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

Idaho National Engineering Laboratory Waste Area Groups 1-7 and 10 Technology Logic Diagram. Volume 3

Energy Technology Data Exchange (ETDEWEB)

O`Brien, M.C.; Meservey, R.H.; Little, M.; Ferguson, J.S.; Gilmore, M.C.

1993-09-01

The Idaho National Engineering Laboratory (INEL) Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates Environmental Restoration (ER) and Waste Management (WM) problems at the INEL 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 an environmental restoration need. It is essential that follow-on engineering and system studies be conducted to build on the output of this project. These studies will begin by selecting the most promising technologies identified in this TLD and finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk to meet the site windows of opportunity. The TLD consists of three separate volumes: Volume I includes the purpose and scope of the TLD, a brief history of the INEL Waste Area Groups, and environmental problems they represent. A description of the TLD, definitions of terms, a description of the technology evaluation process, and a summary of each subelement, is presented. Volume II describes the overall layout and development of the TLD in logic diagram format. This section addresses the environmental restoration of contaminated INEL sites. Volume III (this volume) provides the Technology Evaluation Data Sheets (TEDS) for Environmental Restoration and Waste Management (EM) activities that are reference by a TEDS code number in Volume II. Each of these sheets represents a single logic trace across the TLD. These sheets contain more detail than provided for technologies in Volume II. Data sheets are arranged alphanumerically by the TEDS code number in the upper right corner of each sheet.

Towards automatic verification of ladder logic programs

OpenAIRE

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

2003-01-01

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

Oak Ridge National Laboratory Technology Logic Diagram. Volume 1, Technology Evaluation: Part A, Decontamination and Decommissioning

Energy Technology Data Exchange (ETDEWEB)

1993-09-01

The Strategic Roadmap for the Oak Ridge Reservation is a generalized planning document that identifies broad categories of issues that keep ORNL outside full compliance with the law and other legally binding agreements. Possible generic paths to compliance, issues, and the schedule for resolution of the issues one identified. The role of the Oak Ridge National Laboratory Technology Logic Diagram (TLD) is then to identify specific site issues (problems), identify specific technologies that can be brought to bear on the issues, and assess the current status and readiness of these remediation technologies within the constraints of the schedule commitment. Regulatory requirements and commitments contained in the Strategic Roadmap for the Oak Ridge Reservation are also included in the TLD as constraints to the application of immature technological solutions. Some otherwise attractive technological solutions may not be employed because they may not be deployable on the schedule enumerated in the regulatory agreements. The roadmap for ORNL includes a list of 46 comprehensive logic diagrams for WM of low-level, radioactive-mixed, hazardous, sanitary and industrial. and TRU waste. The roadmapping process gives comparisons of the installation as it exists to the way the installation should exist under full compliance. The identification of the issues is the goal of roadmapping. This allows accurate and timely formulation of activities.

Idaho National Engineering Laboratory Waste Area Groups 1-7 and 10 Technology Logic Diagram. Volume 2

Energy Technology Data Exchange (ETDEWEB)

O`Brien, M.C.; Meservey, R.H.; Little, M.; Ferguson, J.S.; Gilmore, M.C.

1993-09-01

The Idaho National Engineering Laboratory (INEL) Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates Environmental Restoration (ER) and Waste Management (WM) problems at the INEL 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 an environmental restoration need. It is essential that follow-on engineering and system studies be conducted to build on the output of this project. These studies will begin by selecting the most promising technologies identified in this TLD and finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk to meet the site windows of opportunity. The TLD consists of three separate volumes: Volume I includes the purpose and scope of the TLD, a brief history of the INEL Waste Area Groups, and environmental problems they represent. A description of the TLD, definitions of terms, a description of the technology evaluation process, and a summary of each subelement, is presented. Volume II (this volume) describes the overall layout and development of the TLD in logic diagram format. This section addresses the environmental restoration of contaminated INEL sites. Specific INEL problem areas/contaminants are identified along with technology solutions, the status of the technologies, precise science and technology needs, and implementation requirements. Volume III provides the Technology Evaluation Data Sheets (TEDS) for Environmental Restoration and Waste Management (EM) activities that are referenced by a TEDS codenumber in Volume II. Each of these sheets represents a single logic trace across the TLD. These sheets contain more detail than provided for technologies in Volume II.

Permission-based separation logic for multi-threaded Java programs

NARCIS (Netherlands)

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

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

Electronic diagrams

CERN Document Server

Colwell, Morris A

1976-01-01

Electronic Diagrams is a ready reference and general guide to systems and circuit planning and in the preparation of diagrams for both newcomers and the more experienced. This book presents guidelines and logical procedures that the reader can follow and then be equipped to tackle large complex diagrams by recognition of characteristic 'building blocks' or 'black boxes'. The goal is to break down many of the barriers that often seem to deter students and laymen in learning the art of electronics, especially when they take up electronics as a spare time occupation. This text is comprised of nin

Proving termination of logic programs with delay declarations

NARCIS (Netherlands)

E. Marchiori; F. Teusink (Frank)

1996-01-01

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

Procedural and Logic Programming: A Comparison.

Science.gov (United States)

Watkins, Will; And Others

1988-01-01

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

Fast logic modules with programmed functions

International Nuclear Information System (INIS)

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

1987-01-01

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

Testing Automation of Context-Oriented Programs Using Separation Logic

Directory of Open Access Journals (Sweden)

Mohamed A. El-Zawawy

2014-01-01

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

Master Logic Diagram: An Approach to Identify Initiating Events of HTGRs

Science.gov (United States)

Purba, J. H.

2018-02-01

Initiating events of a nuclear power plant being evaluated need to be firstly identified prior to applying probabilistic safety assessment on that plant. Various types of master logic diagrams (MLDs) have been proposedforsearching initiating events of the next generation of nuclear power plants, which have limited data and operating experiences. Those MLDs are different in the number of steps or levels and different in the basis for developing them. This study proposed another type of MLD approach to find high temperature gas cooled reactor (HTGR) initiating events. It consists of five functional steps starting from the top event representing the final objective of the safety functions to the basic event representing the goal of the MLD development, which is an initiating event. The application of the proposed approach to search for two HTGR initiating events, i.e. power turbine generator trip and loss of offsite power, is provided. The results confirmed that the proposed MLD is feasiblefor finding HTGR initiating events.

Logic programming and metadata specifications

Science.gov (United States)

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

1992-01-01

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

Logic Programming in LISP.

Science.gov (United States)

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

From use cases to UML class diagrams using logic grammars and constraints

DEFF Research Database (Denmark)

Christiansen, Henning; Have, Christian Theil; Tveitane, Knut

2007-01-01

We investigate the possibilities for automated transition from Use Cases in a restricted natural language syntax into UML class diagrams, by trying to capture the semantics of the natural language and map it into building blocks of the object oriented programming paradigm (classes, objects, methods...

Molecular implementation of simple logic programs.

Science.gov (United States)

Ran, Tom; Kaplan, Shai; Shapiro, Ehud

2009-10-01

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

A binary-decision-diagram-based two-bit arithmetic logic unit on a GaAs-based regular nanowire network with hexagonal topology

International Nuclear Information System (INIS)

Zhao Hongquan; Kasai, Seiya; Shiratori, Yuta; Hashizume, Tamotsu

2009-01-01

A two-bit arithmetic logic unit (ALU) was successfully fabricated on a GaAs-based regular nanowire network with hexagonal topology. This fundamental building block of central processing units can be implemented on a regular nanowire network structure with simple circuit architecture based on graphical representation of logic functions using a binary decision diagram and topology control of the graph. The four-instruction ALU was designed by integrating subgraphs representing each instruction, and the circuitry was implemented by transferring the logical graph structure to a GaAs-based nanowire network formed by electron beam lithography and wet chemical etching. A path switching function was implemented in nodes by Schottky wrap gate control of nanowires. The fabricated circuit integrating 32 node devices exhibits the correct output waveforms at room temperature allowing for threshold voltage variation.

Logic Programming with Requests

NARCIS (Netherlands)

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

1999-01-01

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

Modular Logic Programming for Web Data, Inheritance and Agents

Science.gov (United States)

Karali, Isambo

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

Algorithms and programs for consequence diagram and fault tree construction

International Nuclear Information System (INIS)

Hollo, E.; Taylor, J.R.

1976-12-01

A presentation of algorithms and programs for consequence diagram and sequential fault tree construction that are intended for reliability and disturbance analysis of large systems. The system to be analyzed must be given as a block diagram formed by mini fault trees of individual system components. The programs were written in LISP programming language and run on a PDP8 computer with 8k words of storage. A description is given of the methods used and of the program construction and working. (author)

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

Science.gov (United States)

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

2009-01-01

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

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

Science.gov (United States)

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

2009-01-01

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

Constraint Logic Programming approach to protein structure prediction

Directory of Open Access Journals (Sweden)

Fogolari Federico

2004-11-01

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

Constraint Logic Programming approach to protein structure prediction.

Science.gov (United States)

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

2004-11-30

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

Logic Programming for Linguistics

DEFF Research Database (Denmark)

Christiansen, Henning

2010-01-01

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

Logic-programming language enriches design processes

Energy Technology Data Exchange (ETDEWEB)

Kitson, B.; Ow-Wing, K.

1984-03-22

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

Logic integer programming models for signaling networks.

Science.gov (United States)

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

2009-05-01

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

Quantum probabilistic logic programming

Science.gov (United States)

Balu, Radhakrishnan

2015-05-01

We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.

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

Science.gov (United States)

Peyton, David J; Scicchitano, Michael

2017-12-01

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

Identification of initiating events using a master logic diagram in low-power and shutdown PSA for nuclear power plant

International Nuclear Information System (INIS)

Han, S. J.; Park, J. H.; Kim, T. W.; Ha, J. J.

2003-01-01

It is necessary to apply a formal technique instead of an empirical technique in the identification of initiating events for Low Power and ShutDown (LPSD) Probabilistic Safety Assessment (PSA) of Nuclear Power Plant (NPP). The present study focuses on the examination of Master Logic Diagram (MLD) technique as a formal technique in the identification of initiating events. The MLD technique is a deductive tool using top-down approach for the formal and logical indentification of initiating events. The present study modified the MLD used in the full power PSA considering the characteristics of LPSD operation. The modified MLD introduced a systematic formation in decomposition process of which the MLD for full power PSA lacked. The modified MLD was able to identify initiating events systematic and logical. However, the formal techniques including the MLD have a limitation for precisely identifying all of the initiating events. In order to overcome this limitation, it is necessary to combine it with an empirical technique. We expect that the modified MLD can be used in an upgrade of the current LPSD PSAs

A Logic Programming Testbed for Inductive Thought and Specification.

Science.gov (United States)

Neff, Norman D.

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

Phonotactics in inductive logic programming

NARCIS (Netherlands)

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

2004-01-01

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

Core TuLiP - Logic Programming for Trust Management

NARCIS (Netherlands)

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

2007-01-01

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

Oak Ridge K-25 Site Technology Logic Diagram. Volume 3, Technology evaluation data sheets; Part B, Remedial action, robotics/automation, waste management

Energy Technology Data Exchange (ETDEWEB)

Fellows, R.L. [ed.

1993-02-26

The Oak Ridge K-25 Technology Logic Diagram (TLD), a decision support tool for the K-25 Site, was developed to provide a planning document that relates environmental restoration (ER) and waste management (WN) problems at the Oak Ridge K-25 Site. The TLD technique identifies the research necessary to develop these technologies to a state that allows for technology transfer and application to waste management, remediation, decontamination, and decommissioning activities. The TLD consists of four separate volumes-Vol. 1, Vol. 2, Vol. 3A, and Vol. 3B. Volume 1 provides introductory and overview information about the TLD. Volume 2 contains logic diagrams. Volume 3 has been divided into two separate volumes to facilitate handling and use. This volume 3 B provides the Technology Evaluation Data Sheets (TEDS) for ER/WM activities (Remedial Action Robotics and Automation, Waste Management) 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 each technology in Vol. 2. The TEDS are arranged alphanumerically by the TEDS code number in the upper right corner of each data sheet. Volume 3 can be used in two ways: (1) technologies that are identified from Vol. 2 can be referenced directly in Vol. 3 by using the TEDS codes, and (2) technologies and general technology areas (alternatives) can be located in the index in the front of this volume.

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

CERN Document Server

Cellucci, Carlo

2014-01-01

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

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

Science.gov (United States)

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

2014-07-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2014-07-10

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

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

International Nuclear Information System (INIS)

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

2014-01-01

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

The lazy functional side of logic programming

NARCIS (Netherlands)

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

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

The Application of Logic Programming to Communication Education.

Science.gov (United States)

Sanford, David L.

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

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

NARCIS (Netherlands)

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

2012-01-01

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

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

PM 3655 PHILIPS Logic analyzer

CERN Multimedia

A logic analyzer is an electronic instrument that captures and displays multiple signals from a digital system or digital circuit. A logic analyzer may convert the captured data into timing diagrams, protocol decodes, state machine traces, assembly language, or may correlate assembly with source-level software. Logic Analyzers have advanced triggering capabilities, and are useful when a user needs to see the timing relationships between many signals in a digital system.

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

DEFF Research Database (Denmark)

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

Shared Reed-Muller Decision Diagram Based Thermal-Aware AND-XOR Decomposition of Logic Circuits

Directory of Open Access Journals (Sweden)

Apangshu Das

2016-01-01

Full Text Available The increased number of complex functional units exerts high power-density within a very-large-scale integration (VLSI chip which results in overheating. Power-densities directly converge into temperature which reduces the yield of the circuit. An adverse effect of power-density reduction is the increase in area. So, there is a trade-off between area and power-density. In this paper, we introduce a Shared Reed-Muller Decision Diagram (SRMDD based on fixed polarity AND-XOR decomposition to represent multioutput Boolean functions. By recursively applying transformations and reductions, we obtained a compact SRMDD. A heuristic based on Genetic Algorithm (GA increases the sharing of product terms by judicious choice of polarity of input variables in SRMDD expansion and a suitable area and power-density trade-off has been enumerated. This is the first effort ever to incorporate the power-density as a measure of temperature estimation in AND-XOR expansion process. The results of logic synthesis are incorporated with physical design in CADENCE digital synthesis tool to obtain the floor-plan silicon area and power profile. The proposed thermal-aware synthesis has been validated by obtaining absolute temperature of the synthesized circuits using HotSpot tool. We have experimented with 29 benchmark circuits. The minimized AND-XOR circuit realization shows average savings up to 15.23% improvement in silicon area and up to 17.02% improvement in temperature over the sum-of-product (SOP based logic minimization.

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

Science.gov (United States)

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

2009-02-10

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

Initiating events identification of the IS process using the master logic diagram

International Nuclear Information System (INIS)

Cho, Nam Chul; Jae, Moo Sung; Yang, Joon Eon

2005-01-01

Hydrogen is very attractive as a future secondary energy carrier considering environmental problems. It is important to produce hydrogen from water by use of carbon free primary energy source. The thermochemical water decomposition cycle is one of the methods for the hydrogen production process from water. Japan Atomic Energy Research Institute (JAERI) has been carrying out an R and D on the IS (iodine.sulfur) process that was first proposed by GA (General Atomic Co.) focusing on demonstration the 'closed-cycle' continuous hydrogen production on developing a feasible and efficient scheme for the HI processing, and on screening and/or developing materials of construction to be used in the corrosive process environment. The successful continuous operation of the IS-process was demonstrated and this process is one of the thermochemical processes, which is the closest to being industrialized. Currently, Korea has also started a research about the IS process and the construction of the IS process system is planned. In this study, for risk analysis of the IS process, initiating events of the IS process are identified by using the Master Logic Diagram (MLD) that is method for initiating event identification

A multiplicity logic unit

International Nuclear Information System (INIS)

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

1981-01-01

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

Equational binary decision diagrams

NARCIS (Netherlands)

J.F. Groote (Jan Friso); J.C. van de Pol (Jaco)

2000-01-01

textabstractWe incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satisfiability and

Post optimization paradigm in maximum 3-satisfiability logic programming

Science.gov (United States)

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

2017-08-01

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

Efficient dynamic optimization of logic programs

Science.gov (United States)

Laird, Phil

1992-01-01

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

Programming Games for Logical Thinking

Directory of Open Access Journals (Sweden)

H. Tsalapatas

2013-03-01

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

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

Science.gov (United States)

Shakman, Karen; Rodriguez, Sheila M.

2015-01-01

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

Logic-based hierarchies for modeling behavior of complex dynamic systems with applications

International Nuclear Information System (INIS)

Hu, Y.S.; Modarres, M.

2000-01-01

Most complex systems are best represented in the form of a hierarchy. The Goal Tree Success Tree and Master Logic Diagram (GTST-MLD) are proven powerful hierarchic methods to represent complex snap-shot of plant knowledge. To represent dynamic behaviors of complex systems, fuzzy logic is applied to replace binary logic to extend the power of GTST-MLD. Such a fuzzy-logic-based hierarchy is called Dynamic Master Logic Diagram (DMLD). This chapter discusses comparison of the use of GTST-DMLD when applied as a modeling tool for systems whose relationships are modeled by either physical, binary logical or fuzzy logical relationships. This is shown by applying GTST-DMLD to the Direct Containment Heating (DCH) phenomenon at pressurized water reactors which is an important safety issue being addressed by the nuclear industry. (orig.)

Application of the cause-consequence diagram method to static systems

International Nuclear Information System (INIS)

Andrews, J.D.; Ridley, L.M.

2002-01-01

In the last 30 years, various mathematical models have been used to identify the effect of component failures on the performance of a system. The most frequently used technique for system reliability assessment is Fault Tree Analysis (FTA) and a large proportion of its popularity can be attributed to the fact that it provides a very good documentation of the way that the system failure logic was developed. Exact quantification of the fault tree, however, can be problematic for very large systems and in such situations, approximations can be used. Alternatively, an exact result can be obtained via the conversion of the fault tree into a binary decision diagram (BDD). The BDD, however, loses all failure logic documentation during the conversion process. This paper outlines the use of the cause-consequence diagram method as a tool for system risk and reliability analysis. As with the FTA method, the cause-consequence diagram documents the failure logic of the system. In addition to this the cause-consequence diagram produces the exact failure probability in a very efficient calculation procedure. The cause-consequence diagram technique has been applied to a static system and shown to yield the same result as those produced by the solution of the equivalent fault tree and BDD. On the basis of this general rules have been devised for the correct construction of the cause-consequence diagram given a static system. The use of the cause-consequence method in this manner has significant implications in terms of efficiency of the reliability analysis and can be shown to have benefits for static systems

Programming Programmable Logic Controller. High-Technology Training Module.

Science.gov (United States)

Lipsky, Kevin

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

Verification and Planning Based on Coinductive Logic Programming

Science.gov (United States)

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

2008-01-01

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

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

International Nuclear Information System (INIS)

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

2005-01-01

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

A novel decision diagrams extension method

International Nuclear Information System (INIS)

Li, Shumin; Si, Shubin; Dui, Hongyan; Cai, Zhiqiang; Sun, Shudong

2014-01-01

Binary decision diagram (BDD) is a graph-based representation of Boolean functions. It is a directed acyclic graph (DAG) based on Shannon's decomposition. Multi-state multi-valued decision diagram (MMDD) is a natural extension of BDD for the symbolic representation and manipulation of the multi-valued logic functions. This paper proposes a decision diagram extension method based on original BDD/MMDD while the scale of a reliability system is extended. Following a discussion of decomposition and physical meaning of BDD and MMDD, the modeling method of BDD/MMDD based on original BDD/MMDD is introduced. Three case studies are implemented to demonstrate the presented methods. Compared with traditional BDD and MMDD generation methods, the decision diagrams extension method is more computationally efficient as shown through the running time

On Verification of PLC-Programs Written in the LD-Language

Directory of Open Access Journals (Sweden)

E. V. Kuzmin

2012-01-01

Full Text Available We discuss some questions connected with the construction of a technology of analysing correctness of Programmable Logic Controller programs. We consider an example of modeling and automated verification of PLC-programs written in the Ladder Diagram language (including timed function blocks of the IEC 61131-3 standard. We use the Cadence SMV for symbolic model checking. Program properties are written in the linear-time temporal logic LTL.

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

Proving deadlock freedom of logic programs with dynamic scheduling

NARCIS (Netherlands)

E. Marchiori; F. Teusink (Frank)

1996-01-01

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

Defining, illustrating and reflecting on logic analysis with an example from a professional development program.

Science.gov (United States)

Tremblay, Marie-Claude; Brousselle, Astrid; Richard, Lucie; Beaudet, Nicole

2013-10-01

Program designers and evaluators should make a point of testing the validity of a program's intervention theory before investing either in implementation or in any type of evaluation. In this context, logic analysis can be a particularly useful option, since it can be used to test the plausibility of a program's intervention theory using scientific knowledge. Professional development in public health is one field among several that would truly benefit from logic analysis, as it appears to be generally lacking in theorization and evaluation. This article presents the application of this analysis method to an innovative public health professional development program, the Health Promotion Laboratory. More specifically, this paper aims to (1) define the logic analysis approach and differentiate it from similar evaluative methods; (2) illustrate the application of this method by a concrete example (logic analysis of a professional development program); and (3) reflect on the requirements of each phase of logic analysis, as well as on the advantages and disadvantages of such an evaluation method. Using logic analysis to evaluate the Health Promotion Laboratory showed that, generally speaking, the program's intervention theory appeared to have been well designed. By testing and critically discussing logic analysis, this article also contributes to further improving and clarifying the method. Copyright © 2013 Elsevier Ltd. All rights reserved.

Logical Characterisation of Ontology Construction using Fuzzy Description Logics

DEFF Research Database (Denmark)

Badie, Farshad; Götzsche, Hans

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

Automated logic conversion method for plant controller systems

International Nuclear Information System (INIS)

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

1990-01-01

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

Visual Temporal Logic as a Rapid Prototying Tool

DEFF Research Database (Denmark)

Fränzle, Martin; Lüth, Karsten

2001-01-01

Within this survey article, we explain real-time symbolic timing diagrams and the ICOS tool-box supporting timing-diagram-based requirements capture and rapid prototyping. Real-time symbolic timing diagrams are a full-fledged metric-time temporal logic, but with a graphical syntax reminiscent...... of the informal timing diagrams widely used in electrical engineering. ICOS integrates a variety of tools, ranging from graphical specification editors over tautology checking and counterexample generation to code generators emitting C or VHDL, thus bridging the gap from formal specification to rapid prototype...

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 TRSs have been studied for decades. However, a challenge is to handle languages with more complex evaluation strategies (such as Prolog, where predicates like the cut influence the control flow). We present a general methodology for the analysis of such programs. Here, the logic program is first...... information on the termination or complexity of the original logic program. More information can be found in the full paper [1]. © 2013 Springer-Verlag....

Probabilistic Abductive Logic Programming in Constraint Handling Rules

DEFF Research Database (Denmark)

Christiansen, Henning

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

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

NARCIS (Netherlands)

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

2009-01-01

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

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

Science.gov (United States)

Mørk, Søren; Holmes, Ian

2012-03-01

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

Formal Analysis Of Use Case Diagrams

Directory of Open Access Journals (Sweden)

Radosław Klimek

2010-01-01

Full Text Available Use case diagrams play an important role in modeling with UML. Careful modeling is crucialin obtaining a correct and efficient system architecture. The paper refers to the formalanalysis of the use case diagrams. A formal model of use cases is proposed and its constructionfor typical relationships between use cases is described. Two methods of formal analysis andverification are presented. The first one based on a states’ exploration represents a modelchecking approach. The second one refers to the symbolic reasoning using formal methodsof temporal logic. Simple but representative example of the use case scenario verification isdiscussed.

ROLE OF UML SEQUENCE DIAGRAM CONSTRUCTS IN OBJECT LIFECYCLE CONCEPT

Directory of Open Access Journals (Sweden)

Miroslav Grgec

2007-06-01

Full Text Available When modeling systems and using UML concepts, a real system can be viewed in several ways. The RUP (Rational Unified Process defines the "4 + 1 view": 1. Logical view (class diagram (CD, object diagram (OD, sequence diagram (SD, collaboration diagram (COD, state chart diagram (SCD, activity diagram (AD, 2.Process view (use case diagram, CD, OD, SD, COD, SCD, AD, 3. Development view (package diagram, component diagram, 4. Physical view (deployment diagram, and 5. Use case view (use case diagram, OD, SD, COD, SCD, AD which combines the four mentioned above. With sequence diagram constructs we are describing object behavior in scope of one use case and their interaction. Each object in system goes through a so called lifecycle (create, supplement object with data, use object, decommission object. The concept of the object lifecycle is used to understand and formalize the behavior of objects from creation to deletion. With help of sequence diagram concepts our paper will describe the way of interaction modeling between objects through lifeline of each of them, and their importance in software development.

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

Programming the diagnosis logic by means of the conversational graphic input to the CRT display device

International Nuclear Information System (INIS)

Kato, A.; Tsuji, H.; Okamoto, Y.

1984-01-01

A plant diagnostic method using Cause Consequence Tree (CCT) has been recognized as a powerful means to identify and analyze plant fault events. The off-line support program called the 'CCT diagram editor' was developed and it could generate the computer object program by inputting the CCT diagram itself using the CRT display, tablet and key-board just as the computer aided design (CAD). The CCT diagram editor has improved the problems of the programming error, difficulty of correction or modification and productivity of the program. The system can be used also for safety analysis of nuclear power plants. (author)

Peircean diagrams of time

DEFF Research Database (Denmark)

Øhrstrøm, Peter

2011-01-01

Some very good arguments can be given in favor of the Augustinean wisdom, according to which it is impossible to provide a satisfactory definition of the concept of time. However, even in the absence of a proper definition, it is possible to deal with conceptual problems regarding time. It can...... be done in terms of analogies and metaphors. In particular, it is attractive to make use of Peirce's diagrams by means of which various kinds of conceptual experimentation can be carried out. This paper investigates how Peircean diagrams can be used within the study of time. In particular, we discuss 1......) the topological properties of time, 2) the implicative structure in tense logic, 3) the notions of open future and branching time models, and finally 4) tenselogical alternatives to branching time models....

Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules

DEFF Research Database (Denmark)

Christiansen, Henning

2008-01-01

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

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

Directory of Open Access Journals (Sweden)

Angelos Charalambidis

2015-09-01

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

Realization of logical functions by vector programs

Energy Technology Data Exchange (ETDEWEB)

Lapkin, L Ya

1983-03-01

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

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

Science.gov (United States)

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

2014-03-01

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

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

Science.gov (United States)

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

2013-01-01

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

Agent Programming Languages and Logics in Agent-Based Simulation

DEFF Research Database (Denmark)

Larsen, John

2018-01-01

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

Improvements to the adaptive maneuvering logic program

Science.gov (United States)

Burgin, George H.

1986-01-01

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

Improving the Functional Diagnostic Process using Dynamic Master Logic Diagram (DMLD) Modeling Strategy

International Nuclear Information System (INIS)

Mohamed, A.H.

2008-01-01

In recent years, state based functional diagnostic systems have gained a growing attention among the model based diagnostic systems. They have been used to diagnose the new faults of the complex systems. On the other hand, a main point considered against it is its subjective, and the inability of reusing the knowledge gathered from one engineer by others. Different methods have been' suggested to solve these problems. In the same way, the suggested functional diagnostic system introduces the uses of Dynamic Master Logic Diagram (DMLD) modeling strategy for the functional diagnostic systems. DMLD has proven its power as a good modeling strategy. It can model the functions of the system's components in terms of a set of defined primitives for the domain of applications. However, the suggested system can use the DMLD technique to model the small functions of the system according to the defined primitives of its domain. So, the modeling process of the system is relatively invariant from one modeler to another. Also, the functions defined can be reused by other users in the domain for solving different problems. Besides, it can deal with the complex system in a flexible manner. Thus, the proposed system can improve the performance of the state based functional diagnostic systems. It can be applied for a wide area of the complex systems. It has been applied for a fluid system as a case of the real-time systems. The suggested system has proved its success as a powerful practical state based functional diagnostic system

Contour tracking and corner detection in a logic programming environment

DEFF Research Database (Denmark)

Bell, Benjamin; Pau, L. F.

1990-01-01

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

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

International Nuclear Information System (INIS)

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

1981-01-01

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

CERPHASE: Computer-generated phase diagrams

International Nuclear Information System (INIS)

Ruys, A.J.; Sorrell, C.C.; Scott, F.H.

1990-01-01

CERPHASE is a collection of computer programs written in the programming language basic and developed for the purpose of teaching the principles of phase diagram generation from the ideal solution model of thermodynamics. Two approaches are used in the generation of the phase diagrams: freezing point depression and minimization of the free energy of mixing. Binary and ternary phase diagrams can be generated as can diagrams containing the ideal solution parameters used to generate the actual phase diagrams. Since the diagrams generated utilize the ideal solution model, data input required from the operator is minimal: only the heat of fusion and melting point of each component. CERPHASE is menu-driven and user-friendly, containing simple instructions in the form of screen prompts as well as a HELP file to guide the operator. A second purpose of CERPHASE is in the prediction of phase diagrams in systems for which no experimentally determined phase diagrams are available, enabling the estimation of suitable firing or sintering temperatures for otherwise unknown systems. Since CERPHASE utilizes ideal solution theory, there are certain limitations imposed on the types of systems that can be predicted reliably. 6 refs., 13 refs

Verification of Imperative Programs by Constraint Logic Program Transformation

Directory of Open Access Journals (Sweden)

Emanuele De Angelis

2013-09-01

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

Relational Parametricity and Separation Logic

DEFF Research Database (Denmark)

Birkedal, Lars; Yang, Hongseok

2008-01-01

Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types. Our interpretation is based on Reynolds's relational...... parametricity, and it provides a formal connection between separation logic and data abstraction. Udgivelsesdato: 2008...

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

Science.gov (United States)

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

2017-09-01

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

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

Science.gov (United States)

Martin, Ian; Carey, John

2014-01-01

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

A Formal Verification Method of Function Block Diagram

International Nuclear Information System (INIS)

Koh, Kwang Yong; Seong, Poong Hyun; Jee, Eun Kyoung; Jeon, Seung Jae; Park, Gee Yong; Kwon, Kee Choon

2007-01-01

Programmable Logic Controller (PLC), an industrial computer specialized for real-time applications, is widely used in diverse control systems in chemical processing plants, nuclear power plants or traffic control systems. As a PLC is often used to implement safety, critical embedded software, rigorous safety demonstration of PLC code is necessary. Function block diagram (FBD) is a standard application programming language for the PLC and currently being used in the development of a fully-digitalized reactor protection system (RPS), which is called the IDiPS, under the KNICS project. Therefore, verification issue of FBD programs is a pressing problem, and hence is of great importance. In this paper, we propose a formal verification method of FBD programs; we defined FBD programs formally in compliance with IEC 61131-3, and then translate the programs into Verilog model, and finally the model is verified using a model checker SMV. To demonstrate the feasibility and effective of this approach, we applied it to IDiPS which currently being developed under KNICS project. The remainder of this paper is organized as follows. Section 2 briefly describes Verilog and Cadence SMV. In Section 3, we introduce FBD2V which is a tool implemented to support the proposed FBD verification framework. A summary and conclusion are provided in Section 4

A Verification Logic for GOAL Agents

Science.gov (United States)

Hindriks, K. V.

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

Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

Science.gov (United States)

Rosu, Grigore; Havelund, Klaus

2001-01-01

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

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

Science.gov (United States)

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

2018-03-01

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

Automation of Feynman diagram evaluations

International Nuclear Information System (INIS)

Tentyukov, M.N.

1998-01-01

A C-program DIANA (DIagram ANAlyser) for the automation of Feynman diagram evaluations is presented. It consists of two parts: the analyzer of diagrams and the interpreter of a special text manipulating language. This language can be used to create a source code for analytical or numerical evaluations and to keep the control of the process in general

Separation Logic

DEFF Research Database (Denmark)

Reynolds, John C.

2002-01-01

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

How Young Children Learn to Program with Sensor, Action, and Logic Blocks

Science.gov (United States)

Wyeth, Peta

2008-01-01

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

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

Institute of Scientific and Technical Information of China (English)

陈文彬; 王驹

2003-01-01

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

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

Science.gov (United States)

Rodríguez, Daniela C; Peterson, Lauren A

2016-05-06

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

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

NARCIS (Netherlands)

Huisman, Marieke

2001-01-01

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

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

Science.gov (United States)

Vosinakis, Spyros; Anastassakis, George; Koutsabasis, Panayiotis

2018-01-01

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

A Visual Basic program to plot sediment grain-size data on ternary diagrams

Science.gov (United States)

Poppe, L.J.; Eliason, A.H.

2008-01-01

Sedimentologic datasets are typically large and compiled into tables or databases, but pure numerical information can be difficult to understand and interpret. Thus, scientists commonly use graphical representations to reduce complexities, recognize trends and patterns in the data, and develop hypotheses. Of the graphical techniques, one of the most common methods used by sedimentologists is to plot the basic gravel, sand, silt, and clay percentages on equilateral triangular diagrams. This means of presenting data is simple and facilitates rapid classification of sediments and comparison of samples.The original classification scheme developed by Shepard (1954) used a single ternary diagram with sand, silt, and clay in the corners and 10 categories to graphically show the relative proportions among these three grades within a sample. This scheme, however, did not allow for sediments with significant amounts of gravel. Therefore, Shepard's classification scheme was later modified by the addition of a second ternary diagram with two categories to account for gravel and gravelly sediment (Schlee, 1973). The system devised by Folk (1954, 1974)\\ is also based on two triangular diagrams, but it has 21 categories and uses the term mud (defined as silt plus clay). Patterns within the triangles of both systems differ, as does the emphasis placed on gravel. For example, in the system described by Shepard, gravelly sediments have more than 10% gravel; in Folk's system, slightly gravelly sediments have as little as 0.01% gravel. Folk's classification scheme stresses gravel because its concentration is a function of the highest current velocity at the time of deposition as is the maximum grain size of the detritus that is available; Shepard's classification scheme emphasizes the ratios of sand, silt, and clay because they reflect sorting and reworking (Poppe et al., 2005).The program described herein (SEDPLOT) generates verbal equivalents and ternary diagrams to

Constraints and Logic Programming in Grammars and Language Analysis

DEFF Research Database (Denmark)

Christiansen, Henning

2014-01-01

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

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

DEFF Research Database (Denmark)

Bolander, Thomas

2003-01-01

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

Application of Logic Models in a Large Scientific Research Program

Science.gov (United States)

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

2011-01-01

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

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

Directory of Open Access Journals (Sweden)

Annegrete Juul Nielsen

2012-11-01

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

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

International Nuclear Information System (INIS)

1981-10-01

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

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

Science.gov (United States)

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

2017-08-02

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

Programmable logic controller (PLC) for safety systems of nuclear plants

International Nuclear Information System (INIS)

Sen, S.K.; Karmakar, G.; Joseph, Jose; Patil, R.K.

2002-01-01

Full text: A programmable logic controller (PLC) has been developed by RCnD, BARC for use in the safety critical systems in nuclear power plants. This PLC uses qualified hardware developed in RCnD for use in NPP. The programming software conforms to IEC-61131 part 3. The application programming is done on function block diagram (FBD) editor and the FBD is automatically converted into code in high level language (C / C++). This feature makes the application easily decipherable and therefore easily subjected to reviews and other validation techniques. The key to make quality software for use in nuclear systems is to enforce various standards in the design and development of the software, something, which is not possible to do with a commercially available PLC. This PLC with its software completely transparent lends itself to rigorous verification and validation easily

Using of Finite Automation at Programming PLC

Directory of Open Access Journals (Sweden)

Karol Rastocny

2004-01-01

Full Text Available The paper is concerning with systematic advances at programming programmable logic controllers (PLC, which comes out from algebraic description of behaviour of sequential circuit, in the way of finite automaton. This kind of access is streamlining the work of a programmer and enabling to use formalisms in the of whole process of system development, that is from process of analysing demands to process of verification and validation created program. The paper considers about using of ladder diagram at programming PLC.

Flow Logic for Process Calculi

DEFF Research Database (Denmark)

Nielson, Hanne Riis; Nielson, Flemming; Pilegaard, Henrik

2012-01-01

Flow Logic is an approach to statically determining the behavior of programs and processes. It borrows methods and techniques from Abstract Interpretation, Data Flow Analysis and Constraint Based Analysis while presenting the analysis in a style more reminiscent of Type Systems. Traditionally...... developed for programming languages, this article provides a tutorial development of the approach of Flow Logic for process calculi based on a decade of research. We first develop a simple analysis for the π-calculus; this consists of the specification, semantic soundness (in the form of subject reduction......, and finally, we extend it to a relational analysis. A Flow Logic is a program logic---in the same sense that a Hoare’s logic is. We conclude with an executive summary presenting the highlights of the approach from this perspective including a discussion of theoretical properties as well as implementation...

Improvement and test of alarm cause tracking system for Kori nuclear power plant units 3 and 4

International Nuclear Information System (INIS)

Lee, Jung Woon; Park, Jae Chang; Lee, Jung Woon; Kim, Jung Taek; Lyu, Sung Pil; Kim, Eun Ju; Park, Joong Pal

2003-05-01

The proposed system, ACTS(Alarm Cause Tracking System), in the 1st development period(2002. 7 ∼ 2003. 6), tracks and displays the causes of alarms on-line from computerized logic diagrams. And the system highlights the specific procedures related the causes in the procedure of the alarm. But, some problems were found in ACTS on editing logic diagram and logic processing in realtime for 2000 logic diagrams. In 2nd development period, we improved the data structure of graphic information for logic diagram and changed function oriented programming to object oriented programming for logic elements. Also, the display of precedent alarms which introduce many following alarms is provided to avoid confusion from the followed nuisance alarms. And logic input signal generator was developed to test the ACTS which generates input signal in time sequence of events acquired from simulator or real plant

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

NARCIS (Netherlands)

Kamareddine, F.

1992-01-01

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

Area–Oriented Technology Mapping for LUT–Based Logic Blocks

Directory of Open Access Journals (Sweden)

Kubica Marcin

2017-03-01

Full Text Available One of the main aspects of logic synthesis dedicated to FPGA is the problem of technology mapping, which is directly associated with the logic decomposition technique. This paper focuses on using configurable properties of CLBs in the process of logic decomposition and technology mapping. A novel theory and a set of efficient techniques for logic decomposition based on a BDD are proposed. The paper shows that logic optimization can be efficiently carried out by using multiple decomposition. The essence of the proposed synthesis method is multiple cutting of a BDD. A new diagram form called an SMTBDD is proposed. Moreover, techniques that allow finding the best technology mapping oriented to configurability of CLBs are presented. In the experimental section, the presented method (MultiDec is compared with academic and commercial tools. The experimental results show that the proposed technology mapping strategy leads to good results in terms of the number of CLBs.

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

DEFF Research Database (Denmark)

Møller, Anders

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

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

Science.gov (United States)

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

Anticoincidence logic using PALs

International Nuclear Information System (INIS)

Bolanos, L.; Arista Romeu, E.

1997-01-01

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

THRESHOLD LOGIC IN ARTIFICIAL INTELLIGENCE

Science.gov (United States)

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

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

Science.gov (United States)

Sherman, Paul David

2016-04-01

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

GOAL Agents Instantiate Intention Logic

OpenAIRE

Hindriks, Koen; van der Hoek, Wiebe

2008-01-01

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

Contribution of Warsaw Logicians to Computational Logic

Directory of Open Access Journals (Sweden)

Damian Niwiński

2016-06-01

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

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

Science.gov (United States)

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

2015-10-01

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

XLOOPS - a package calculating one- and two-loop diagrams

International Nuclear Information System (INIS)

Bruecher, L.

1997-01-01

A program package for calculating massive one- and two-loop diagrams is introduced. It consists of five parts: - a graphical user interface, - routines for generating diagrams from particle input, - procedures for calculating one-loop integrals both analytically and numerically, - routines for massive two-loop integrals, - programs for numerical integration of two-loop diagrams. Here the graphical user interface and the text interface to Maple are presented. (orig.)

Meaning and Abduction as Process-Structure: A Diagram of Reasoning

Directory of Open Access Journals (Sweden)

Inna Semetsky

2009-11-01

Full Text Available This paper is informed by Charles Sanders Peirce’s philosophy as semiotics or the doctrine of signs. The paper’s purpose is to explore Peirce’s category of abduction as not being limited to the inference to the best explanation. In the context of the logic of discovery, abduction is posited as a necessary although not sufficient condition for the production of meanings. The structure of a genuine sign is triadic and represents a synthesis between precognitive ideas and conceptual representations. The novel model of reasoning is offered, based on the mathematical formalism borrowed from Gauss’ interpretation of the complex number. It is suggested that this model in a form of a diagram not only represents a semiotic process-structure but also overcomes the long-standing paradox of new knowledge. For Peirce, it is a diagram as a visual representation that may yield solutions to the otherwise unsolvable logical problems. What appears to us as a paradox is the very presence of abductive, or hypothetical, inference, as Peircean generic category of Firstness within the Thirdness of the total thought-process. Firstness (feeling, Secondness (action, and Thirdness (reason together constitute a dynamic structure of experience.

Ultra Low Energy Binary Decision Diagram Circuits Using Few Electron Transistors

Science.gov (United States)

Saripalli, Vinay; Narayanan, Vijay; Datta, Suman

Novel medical applications involving embedded sensors, require ultra low energy dissipation with low-to-moderate performance (10kHz-100MHz) driving the conventional MOSFETs into sub-threshold operation regime. In this paper, we present an alternate ultra-low power computing architecture using Binary Decision Diagram based logic circuits implemented using Single Electron Transistors (SETs) operating in the Coulomb blockade regime with very low supply voltages. We evaluate the energy - performance tradeoff metrics of such BDD circuits using time domain Monte Carlo simulations and compare them with the energy-optimized CMOS logic circuits. Simulation results show that the proposed approach achieves better energy-delay characteristics than CMOS realizations.

Pembuatan Kakas Bantu untuk Mendeteksi Ketidaksesuaian Diagram Urutan (Sequence Diagram dengan Diagram Kasus Penggunaan (Use Case Diagram

Directory of Open Access Journals (Sweden)

Andrias Meisyal Yuwantoko

2017-03-01

Full Text Available Sebuah diagram urutan dibuat  berdasarkan alur yang ada pada deskripsi kasus penggunaan. Alur tersebut dire- presentasikan dalam  bentuk  interaksi antara aktor  dan  sistem. Pemeriksaan rancangan diagram urutan perlu dilakukan untuk mengetahui ketidaksesuaian urutan alur  kasus penggunaan dengan urutan pesan yang dikirimkan oleh objek-objek pada diagram urutan. Rancangan diagram yang sesuai merupakan kunci ketepatan (correctness implementasi  perangkat lunak. Namun, pemeriksaan ketidaksesuaian masih dilakukan secara manual. Hal ini menjadi masalah apabila sebuah proyek perangkat lunak memiliki banyak  rancangan diagram dan sumber daya manusia tidak  mencukupi. Pemeriksaan membutuhkan waktu yang lama dan memiliki dampak pada waktu pengembangan perangkat lunak. Penelitian ini mengusulkan pembuatan kakas bantu  untuk mendeteksi ketidaksesuaian diagram urutan dengan diagram kasus penggunaan. Ketidaksesuaian dilihat dari kemiripan semantik kalimat antara alur pada deskripsi kasus penggunaan dan triplet. Dari hasil pembuatan kakas bantu, kakas bantu yang dibuat dapat mendeteksi ketidaksesuaian diagram urutan dengan diagram kasus penggunaan. Kakas  bantu ini diharapkan tidak hanya membantu pemeriksaan rancangan diagram akan tetapi mempercepat waktu pengembangan perangkat lunak.

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

Science.gov (United States)

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

2007-05-01

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

Fuzzy Logic vs. Neutrosophic Logic: Operations Logic

Directory of Open Access Journals (Sweden)

Salah Bouzina

2016-12-01

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

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

Science.gov (United States)

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

2014-01-01

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

From State Diagram to Class Diagram

DEFF Research Database (Denmark)

Borch, Ole; Madsen, Per Printz

2009-01-01

UML class diagram and Java source code are interrelated and Java code is a kind of interchange format. Working with UML state diagram in CASE tools, a corresponding xml file is maintained. Designing state diagrams is mostly performed manually using design patterns and coding templates - a time...... consuming process. This article demonstrates how to compile such a diagram into Java code and later, by reverse engineering, produce a class diagram. The process from state diagram via intermediate SAX parsed xml file to Apache Velocity generated Java code is described. The result is a fast reproducible...

First-order modal logic theorem proving and standard PROLOG

OpenAIRE

Nonnengart, A.

1992-01-01

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

An adaptive maneuvering logic computer program for the simulation of one-on-one air-to-air combat. Volume 1: General description

Science.gov (United States)

Burgin, G. H.; Fogel, L. J.; Phelps, J. P.

1975-01-01

A technique for computer simulation of air combat is described. Volume 1 decribes the computer program and its development in general terms. Two versions of the program exist. Both incorporate a logic for selecting and executing air combat maneuvers with performance models of specific fighter aircraft. In the batch processing version the flight paths of two aircraft engaged in interactive aerial combat and controlled by the same logic are computed. The realtime version permits human pilots to fly air-to-air combat against the adaptive maneuvering logic (AML) in Langley Differential Maneuvering Simulator (DMS). Volume 2 consists of a detailed description of the computer programs.

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

DEFF Research Database (Denmark)

Henriksen, Kim Steen

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

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.

Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams

DEFF Research Database (Denmark)

Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif

1999-01-01

The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...

PDL as a multi-agent strategy logic

NARCIS (Netherlands)

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

2013-01-01

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

Combining Self-Explaining with Computer Architecture Diagrams to Enhance the Learning of Assembly Language Programming

Science.gov (United States)

Hung, Y.-C.

2012-01-01

This paper investigates the impact of combining self explaining (SE) with computer architecture diagrams to help novice students learn assembly language programming. Pre- and post-test scores for the experimental and control groups were compared and subjected to covariance (ANCOVA) statistical analysis. Results indicate that the SE-plus-diagram…

Performance evaluation of enterprise architecture using fuzzy sequence diagram

Directory of Open Access Journals (Sweden)

Mohammad Atasheneh

2014-01-01

Full Text Available Developing an Enterprise Architecture is a complex task and to control the complexity of the regulatory framework we need to measure the relative performance of one system against other available systems. On the other hand, enterprise architecture cannot be organized without the use of a logical structure. The framework provides a logical structure for classifying architectural output. Among the common architectural framework, the C4ISR framework and methodology of the product is one of the most popular techniques. In this paper, given the existing uncertainties in system development and information systems, a new version of UML called Fuzzy-UML is proposed for enterprise architecture development based on fuzzy Petri nets. In addition, the performance of the system is also evaluated based on Fuzzy sequence diagram.

Quantum Logic and Quantum Reconstruction

OpenAIRE

Stairs, Allen

2015-01-01

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

From Interpreter to Logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2003-01-01

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

From Interpreter to Logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2004-01-01

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

From Interpreter to logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2003-01-01

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

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

Science.gov (United States)

Martin, Nancy L.

2015-01-01

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

[Identification of meridian-acupoint diagrams and meridian diagrams].

Science.gov (United States)

Shen, Wei-hong

2008-08-01

In acu-moxibustion literature, there are two kinds of diagrams, meridian-acupoint diagrams and meridian diagrams. Because they are very similar in outline, and people now have seldom seen the typical ancient meridian diagrams, meridian-acupoint diagrams have been being incorrectly considered to be the meridian diagrams for a long time. It results in confusion in acu-moxibustion academia. The present paper stresses its importance in academic research and introduces some methods for identifying them correctly. The key points for identification of meridian-acupoint diagrams and meridian diagrams are: the legend of diagrams and the drawing style of the ancient charts. In addition, the author makes a detailed explanation about some acu-moxibustion charts which are easily confused. In order to distinguish meridian-acupoint diagrams and meridian diagrams correctly, he or she shoulnd understand the diagrams' intrinsic information as much as possible and make a comprehensive analysis about them.

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.

Microsoft excel's automatic data processing and diagram drawing of RIA internal quality control parameters

International Nuclear Information System (INIS)

Zeng Pingfan; Liu Guoqiang

2006-01-01

We did automatic data processing and diagram drawing of various parameters of RIA' s internal quality control (IQC)by the use of Microsoft Excel (ME). By use of AVERAGE and STDEV of ME, we got x-bar, s and CV%. With pearson, we got the serum quality control coefficients (r). Inputing the original data to diagram's self-definition item, the diagram was drawn automatically. By the use of logic judging, we got the quality control judging results with the status, timing and data of various quality control parameters. For the past four years, the ME data processing and diagram drawing as well as quality control judging have been showed to be accurate, convenient and correct. It was quick and easy to manage and the automatic computer processing of RIA's IQC was realized. Conclusion: the method is applicable to all types of RIA' s IQC. (authors)

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

Science.gov (United States)

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

2013-09-15

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

Development of Application Programming Tool for Safety Grade PLC (POSAFE-Q)

International Nuclear Information System (INIS)

Koo, Kyungmo; You, Byungyong; Kim, Tae-Wook; Cho, Sengjae; Lee, Jin S.

2006-01-01

The pSET (POSAFE-Q Software Engineering Tool) is an application programming tool of the POSAFE-Q which is a safety graded programmable logic controller (PLC) developed for the reactor protect system of the nuclear power plant. The pSET provides an integrated development environment (IDE) which includes editors, compiler, simulator, down loader, debugger, and monitor. The pSET supports the IEC61131-3 standard software model and languages such as LD (ladder diagram) and FBD (function block diagram) which are two of the most widely used PLC programming languages in industry fields. The pSET will also support SFC (sequential function chart) language. The pSET is developed as a part of a Korea Nuclear Instrumentation and Control System (KNICS) project

Knowledge discovery from structured mammography reports using inductive logic programming.

Science.gov (United States)

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

2005-01-01

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

Formal verification of Simulink/Stateflow diagrams a deductive approach

CERN Document Server

Zhan, Naijun; Zhao, Hengjun

2017-01-01

This book presents a state-of-the-art technique for formal verification of continuous-time Simulink/Stateflow diagrams, featuring an expressive hybrid system modelling language, a powerful specification logic and deduction-based verification approach, and some impressive, realistic case studies. Readers will learn the HCSP/HHL-based deductive method and the use of corresponding tools for formal verification of Simulink/Stateflow diagrams. They will also gain some basic ideas about fundamental elements of formal methods such as formal syntax and semantics, and especially the common techniques applied in formal modelling and verification of hybrid systems. By investigating the successful case studies, readers will realize how to apply the pure theory and techniques to real applications, and hopefully will be inspired to start to use the proposed approach, or even develop their own formal methods in their future work.

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

Science.gov (United States)

Schultz, Leah

2011-01-01

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

Introduction to fuzzy logic using Matlab

CERN Document Server

Sivanandam, SN; Deepa, S N

2006-01-01

Fuzzy Logic, at present is a hot topic, among academicians as well various programmers. This book is provided to give a broad, in-depth overview of the field of Fuzzy Logic. The basic principles of Fuzzy Logic are discussed in detail with various solved examples. The different approaches and solutions to the problems given in the book are well balanced and pertinent to the Fuzzy Logic research projects. The applications of Fuzzy Logic are also dealt to make the readers understand the concept of Fuzzy Logic. The solutions to the problems are programmed using MATLAB 6.0 and the simulated results are given. The MATLAB Fuzzy Logic toolbox is provided for easy reference.

MANUAL LOGIC CONTROLLER (MLC)

OpenAIRE

Claude Ziad Bayeh

2015-01-01

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

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

DEFF Research Database (Denmark)

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

2008-01-01

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

All-optical 10 Gb/s AND logic gate in a silicon microring resonator

DEFF Research Database (Denmark)

Xiong, Meng; Lei, Lei; Ding, Yunhong

2013-01-01

An all-optical AND logic gate in a single silicon microring resonator is experimentally demonstrated at 10 Gb/s with 50% RZ-OOK signals. By setting the wavelengths of two intensity-modulated input pumps on the resonances of the microring resonator, field-enhanced four-wave mixing with a total inp...... power of only 8.5 dBm takes place in the ring, resulting in the generation of an idler whose intensity follows the logic operation between the pumps. Clear and open eye diagrams with a bit-error- ratio below 10−9 are achieved....

A logical treatment of secondary storage

International Nuclear Information System (INIS)

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

1986-01-01

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

Automatic Function Annotations for Hoare Logic

Directory of Open Access Journals (Sweden)

Daniel Matichuk

2012-11-01

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

JaxoDraw: A graphical user interface for drawing Feynman diagrams

Science.gov (United States)

Binosi, D.; Theußl, L.

2004-08-01

JaxoDraw is a Feynman graph plotting tool written in Java. It has a complete graphical user interface that allows all actions to be carried out via mouse click-and-drag operations in a WYSIWYG fashion. Graphs may be exported to postscript/EPS format and can be saved in XML files to be used for later sessions. One of JaxoDraw's main features is the possibility to create ? code that may be used to generate graphics output, thus combining the powers of ? with those of a modern day drawing program. With JaxoDraw it becomes possible to draw even complicated Feynman diagrams with just a few mouse clicks, without the knowledge of any programming language. Program summaryTitle of program: JaxoDraw Catalogue identifier: ADUA Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADUA Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Distribution format: tar gzip file Operating system: Any Java-enabled platform, tested on Linux, Windows ME, XP, Mac OS X Programming language used: Java License: GPL Nature of problem: Existing methods for drawing Feynman diagrams usually require some 'hard-coding' in one or the other programming or scripting language. It is not very convenient and often time consuming, to generate relatively simple diagrams. Method of solution: A program is provided that allows for the interactive drawing of Feynman diagrams with a graphical user interface. The program is easy to learn and use, produces high quality output in several formats and runs on any operating system where a Java Runtime Environment is available. Number of bytes in distributed program, including test data: 2 117 863 Number of lines in distributed program, including test data: 60 000 Restrictions: Certain operations (like internal latex compilation, Postscript preview) require the execution of external commands that might not work on untested operating systems. Typical running time: As an interactive program, the running time depends on the complexity

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

CERN Document Server

Benis-Sinaceur, Hourya; Sandu, Gabriel

2015-01-01

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

A Logical Analysis of Quantum Voting Protocols

Science.gov (United States)

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

2017-12-01

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

Choreographies, Logically

DEFF Research Database (Denmark)

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

2014-01-01

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

Enabling Concise and Modular Specifications in Separation Logic

DEFF Research Database (Denmark)

Jensen, Jonas Buhrkal

2014-01-01

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

Model Checking Is Static Analysis of Modal Logic

DEFF Research Database (Denmark)

Nielson, Flemming; Nielson, Hanne Riis

2010-01-01

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

Roles of programmable logic controllers in fuel reprocessing plants

International Nuclear Information System (INIS)

Mishra, Hrishikesh; Balakrishnan, V.P.; Pandya, G.J.

1999-01-01

Fuel charging facility is another application of Programmable Logic Controllers (PLC) in fuel reprocessing plants, that involves automatic operation of fuel cask dolly, charging motor, pneumatic doors, clutches, clamps, stepper motors and rod pushers in a pre-determined sequence. Block diagram of ACF system is given for underlining the scope of control and interlocks requirements involved for automation of the fuel charging system has been provided for the purpose at KARP Plant, Kalpakkam

Safety assurance logic techniques for evaluation of accident prevention and mitigation

International Nuclear Information System (INIS)

McWethy, L.M.; Hagan, J.W.

1976-01-01

Safety assurance methods have been developed and applied in reactor safety assessments of FFTF. These methods promote visibility of the total safety provided by the plant, both in prevention of off-normal or accident conditions as well as provision of various features which terminate conditions within acceptable bounds if such conditions should occur. One of the primary techniques applied in safety assurance is the development of safety assurance diagrams. These diagrams explicitly identify the multiple lines of defense which prevent accident progression. The diagrams graphically demonstrate the defense-in-depth provided by the plant for each postulated occurrence. Lines of defense are shown against ever having an occurrence in the first place; thus giving appropriate emphasis on accident prevention, and visibility to the designer's role in promoting this level of safety. These diagrams, or accident process trees, also show graphically the various paths of postulated accident progression to their logical termination. Evaluation of the importance and strength of each line-of-defense assures fulfillment of the safety objectives of the overall plant system

Purwarupa Sistem Kontrol Elevator Berbasis Programable Logic Control

Directory of Open Access Journals (Sweden)

Fathahillah Fathahillah

2017-12-01

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

Optical programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2011-11-10

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

Symbolic logic and mechanical theorem proving

CERN Document Server

Chang, Chin-Liang

1969-01-01

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

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.

Criteria for evaluating programme theory diagrams in quality improvement initiatives: a structured method for appraisal.

Science.gov (United States)

Issen, Laurel; Woodcock, Thomas; McNicholas, Christopher; Lennox, Laura; Reed, Julie E

2018-04-09

Despite criticisms that many quality improvement (QI) initiatives fail due to incomplete programme theory, there is no defined way to evaluate how programme theory has been articulated. The objective of this research was to develop, and assess the usability and reliability of scoring criteria to evaluate programme theory diagrams. Criteria development was informed by published literature and QI experts. Inter-rater reliability was tested between two evaluators. About 63 programme theory diagrams (42 driver diagrams and 21 action-effect diagrams) were reviewed to establish whether the criteria could support comparative analysis of different approaches to constructing diagrams. Components of the scoring criteria include: assessment of overall aim, logical overview, clarity of components, cause-effect relationships, evidence and measurement. Independent reviewers had 78% inter-rater reliability. Scoring enabled direct comparison of different approaches to developing programme theory; action-effect diagrams were found to have had a statistically significant but moderate improvement in programme theory quality over driver diagrams; no significant differences were observed based on the setting in which driver diagrams were developed. The scoring criteria summarise the necessary components of programme theory that are thought to contribute to successful QI projects. The viability of the scoring criteria for practical application was demonstrated. Future uses include assessment of individual programme theory diagrams and comparison of different approaches (e.g. methodological, teaching or other QI support) to produce programme theory. The criteria can be used as a tool to guide the production of better programme theory diagrams, and also highlights where additional support for QI teams could be needed.

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

CERN Document Server

Perréard, S

1993-01-01

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

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

Science.gov (United States)

Ragonis, Noa; Shilo, Gila

2014-01-01

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

A cell-based design approach for RSFQ circuits using a binary decision diagram

International Nuclear Information System (INIS)

Yoshikawa, N.; Koshiyama, J.

1999-01-01

We propose a cell-based design approach for rapid single flux quantum (RSFQ) circuits based on a binary decision diagram (BDD). The BDD is a way to represent a logical function using a directed graph which consists of binary switches having one input and two outputs. Since complex logic circuits can be implemented in the form of regular arrays of the BDD binary switches, we can use a cell-based layout methodology for the design of the RSFQ circuits. In this study, we implemented the BDD binary switches by a D 2 flip-flop. In the BDD design approach we made a cell library which contains a binary switch, pulse splitters, confluence buffers and Josephson transmission lines. All cell layouts in the library have identical widths and heights, so that any logic function can be laid out by simple connection of the library cells. As a case study, we implemented a 1-bit RSFQ half-adder and a 3-bit encoder for a flash AD converter. (author)

Phase Stability Diagrams for High Temperature Corrosion Processes

Directory of Open Access Journals (Sweden)

J. J. Ramos-Hernandez

2013-01-01

Full Text Available Corrosion phenomena of metals by fused salts depend on chemical composition of the melt and environmental conditions of the system. Detail knowledge of chemistry and thermodynamic of aggressive species formed during the corrosion process is essential for a better understanding of materials degradation exposed to high temperature. When there is a lack of kinetic data for the corrosion processes, an alternative to understand the thermodynamic behavior of chemical species is to utilize phase stability diagrams. Nowadays, there are several specialized software programs to calculate phase stability diagrams. These programs are based on thermodynamics of chemical reactions. Using a thermodynamic data base allows the calculation of different types of phase diagrams. However, sometimes it is difficult to have access to such data bases. In this work, an alternative way to calculate phase stability diagrams is presented. The work is exemplified in the Na-V-S-O and Al-Na-V-S-O systems. This system was chosen because vanadium salts is one of the more aggressive system for all engineering alloys, especially in those processes where fossil fuels are used.

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

Science.gov (United States)

Cooper, Jeff

2009-01-01

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

BeHealthy Charities Aid Foundation Program, Russia: a Program Impact Pathways (PIP) analysis.

Science.gov (United States)

Mukhina, Marina; Novikova, Irina

2014-09-01

In 2007, the Charities Aid Foundation Branch in Russia, under the initiative of and with financial support from the Mondelēz International Foundation and Mondelēz International, launched the charitable BeHealthy Program. The program's main focus is the implementation of four interrelated activities: conducting lessons for schoolchildren on healthy nutrition, with an emphasis on breakfast; healthy cooking lessons with children; cultivating nutritional plants; and providing conditions to encourage children to engage in more physical activity. The program serves more than 13,000 children attending public schools in the Leningrad (Lomonosovskii District), Vladimir, and Novgorod regions. BeHealthy provides funding for schools and comprehensive educational materials to help schoolchildren develop habits of healthy nutrition and physical activity, as well as consulting and expert support for school staff and other key stakeholders. The program brings in experts on program implementation and training for teachers. Curriculum support also includes printed and Web-based healthy lifestyle educational materials on best practices and positive experience, as well as meetings and conferences with school representatives and local authorities. One of the biggest challenges for program managers is to fully understand the complexities of the program, and why and how it is expected to induce changes in healthy lifestyle behaviors of the schoolchildren. For more comprehensive understanding, we performed a Program Impact Pathways (PIP) analysis to identify Critical Quality Control Points (CCPs) and a suite of core indicators of the program's impact on healthy lifestyles. The findings were presented at the Healthy Life-styles Program Evaluation Workshop held in Granada, Spain, 13-14 September 2013, under the auspices of the Mondelēz International Foundation. First, we developed an updated logic model based on how the program was executed. We then translated the logic model into a PIP

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

OpenAIRE

Möbus, Claus

1987-01-01

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

RNA secondary structure diagrams for very large molecules: RNAfdl

DEFF Research Database (Denmark)

Hecker, Nikolai; Wiegels, Tim; Torda, Andrew E.

2013-01-01

There are many programs that can read the secondary structure of an RNA molecule and draw a diagram, but hardly any that can cope with 10 3 bases. RNAfdl is slow but capable of producing intersection-free diagrams for ribosome-sized structures, has a graphical user interface for adjustments...

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

Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing

KAUST Repository

Luo, Zhaochu

2016-11-16

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

Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing

KAUST Repository

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

2016-01-01

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

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

Science.gov (United States)

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

2006-01-01

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

Diagram Size vs. Layout Flaws: Understanding Quality Factors of UML Diagrams

DEFF Research Database (Denmark)

Störrle, Harald

2016-01-01

, though, is our third goal of extending our analysis aspects of diagram quality. Method: We improve our definition of diagram size and add a (provisional) definition of diagram quality as the number of topographic layout flaws. We apply these metrics on 60 diagrams of the five most commonly used types...... of UML diagram. We carefully analyze the structure of our diagram samples to ensure representativeness. We correlate diagram size and layout quality with modeler performance data obtained in previous experiments. The data set is the largest of its kind (n-156). Results: We replicate earlier findings......, and extend them to two new diagram types. We provide an improved definition of diagram size, and provide a definition of topographic layout quality, which is one more step towards a comprehensive definition of diagram quality as such. Both metrics are shown to be objectively applicable. We quantify...

Advances in temporal logic

CERN Document Server

Fisher, Michael; Gabbay, Dov; Gough, Graham

2000-01-01

Time is a fascinating subject that has captured mankind's imagination from ancient times to the present. It has been, and continues to be studied across a wide range of disciplines, from the natural sciences to philosophy and logic. More than two decades ago, Pnueli in a seminal work showed the value of temporal logic in the specification and verification of computer programs. Today, a strong, vibrant international research community exists in the broad community of computer science and AI. This volume presents a number of articles from leading researchers containing state-of-the-art results in such areas as pure temporal/modal logic, specification and verification, temporal databases, temporal aspects in AI, tense and aspect in natural language, and temporal theorem proving. Earlier versions of some of the articles were given at the most recent International Conference on Temporal Logic, University of Manchester, UK. Readership: Any student of the area - postgraduate, postdoctoral or even research professor ...

Modular Logic Metaprogramming

DEFF Research Database (Denmark)

Klose, Karl; Ostermann, Klaus

2010-01-01

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

From Interpreter to Logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2004-01-01

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

From Interpreter to Logic Engine by Defunctionalization

DEFF Research Database (Denmark)

Biernacki, Dariusz; Danvy, Olivier

2003-01-01

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

Learning Probabilistic Logic Models from Probabilistic Examples.

Science.gov (United States)

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

2008-10-01

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

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

Science.gov (United States)

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

2016-11-01

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

IGDS/TRAP Interface Program (ITIP). Software User Manual (SUM). [network flow diagrams for coal gasification studies

Science.gov (United States)

Jefferys, S.; Johnson, W.; Lewis, R.; Rich, R.

1981-01-01

This specification establishes the requirements, concepts, and preliminary design for a set of software known as the IGDS/TRAP Interface Program (ITIP). This software provides the capability to develop at an Interactive Graphics Design System (IGDS) design station process flow diagrams for use by the NASA Coal Gasification Task Team. In addition, ITIP will use the Data Management and Retrieval System (DMRS) to maintain a data base from which a properly formatted input file to the Time-Line and Resources Analysis Program (TRAP) can be extracted. This set of software will reside on the PDP-11/70 and will become the primary interface between the Coal Gasification Task Team and IGDS, DMRS, and TRAP. The user manual for the computer program is presented.

Mapping Modular SOS to Rewriting Logic

DEFF Research Database (Denmark)

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

2003-01-01

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

Abductive Inference using Array-Based Logic

DEFF Research Database (Denmark)

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

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

Project of computer program for designing the steel with the assumed CCT diagram

OpenAIRE

S. Malara; J. Trzaska; L.A. Dobrzański

2007-01-01

Purpose: The aim of this paper was developing a project of computer aided method for designing the chemicalcomposition of steel with the assumed CCT diagram.Design/methodology/approach: The purpose has been achieved in four stages. At the first stage characteristicpoints of CCT diagram have been determined. At the second stage neural networks have been developed, andnext CCT diagram terms of similarity have been worked out- at the third one. In the last one steel chemicalcomposition optimizat...

UTP and Temporal Logic Model Checking

Science.gov (United States)

Anderson, Hugh; Ciobanu, Gabriel; Freitas, Leo

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

Roundhouse Diagrams.

Science.gov (United States)

Ward, Robin E.; Wandersee, James

2000-01-01

Students must understand key concepts through reasoning, searching out related concepts, and making connections within multiple systems to learn science. The Roundhouse diagram was developed to be a concise, holistic, graphic representation of a science topic, process, or activity. Includes sample Roundhouse diagrams, a diagram checklist, and…

Ontology learning from interpretations in lightweight description logics

CSIR Research Space (South Africa)

Klarman, S

2015-08-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

1988-06-01

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

Safety- barrier diagrams

DEFF Research Database (Denmark)

Duijm, Nijs Jan

2008-01-01

Safety-barrier diagrams and the related so-called 'bow-tie' diagrams have become popular methods in risk analysis. This paper describes the syntax and principles for constructing consistent and valid safety-barrier diagrams. The relation of safety-barrier diagrams to other methods such as fault...... trees and Bayesian networks is discussed. A simple method for quantification of safety-barrier diagrams is proposed. It is concluded that safety-barrier diagrams provide a useful framework for an electronic data structure that integrates information from risk analysis with operational safety management....

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

OpenAIRE

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

2010-01-01

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

Demonstration of optical computing logics based on binary decision diagram.

Science.gov (United States)

Lin, Shiyun; Ishikawa, Yasuhiko; Wada, Kazumi

2012-01-16

Optical circuits are low power consumption and fast speed alternatives for the current information processing based on transistor circuits. However, because of no transistor function available in optics, the architecture for optical computing should be chosen that optics prefers. One of which is Binary Decision Diagram (BDD), where signal is processed by sending an optical signal from the root through a serial of switching nodes to the leaf (terminal). Speed of optical computing is limited by either transmission time of optical signals from the root to the leaf or switching time of a node. We have designed and experimentally demonstrated 1-bit and 2-bit adders based on the BDD architecture. The switching nodes are silicon ring resonators with a modulation depth of 10 dB and the states are changed by the plasma dispersion effect. The quality, Q of the rings designed is 1500, which allows fast transmission of signal, e.g., 1.3 ps calculated by a photon escaping time. A total processing time is thus analyzed to be ~9 ps for a 2-bit adder and would scales linearly with the number of bit. It is two orders of magnitude faster than the conventional CMOS circuitry, ~ns scale of delay. The presented results show the potential of fast speed optical computing circuits.

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

OpenAIRE

Nuno David; Jaime Simão Sichman; Helder Coelho

2005-01-01

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

BOKASUN: a fast and precise numerical program to calculate the Master Integrals of the two-loop sunrise diagrams

OpenAIRE

Caffo, Michele; Czyz, Henryk; Gunia, Michal; Remiddi, Ettore

2008-01-01

We present the program BOKASUN for fast and precise evaluation of the Master Integrals of the two-loop self-mass sunrise diagram for arbitrary values of the internal masses and the external four-momentum. We use a combination of two methods: a Bernoulli accelerated series expansion and a Runge-Kutta numerical solution of a system of linear differential equations.

Short-circuit logic

NARCIS (Netherlands)

Bergstra, J.A.; Ponse, A.

2010-01-01

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

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

DEFF Research Database (Denmark)

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

2003-01-01

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

Answer Sets in a Fuzzy Equilibrium Logic

Science.gov (United States)

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

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

Optical reversible programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2012-07-20

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

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

Science.gov (United States)

Le, Nguyen-Thinh; Menzel, Wolfgang

2009-01-01

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

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

OpenAIRE

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

2014-01-01

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

Flow Logics and Operational Semantics

DEFF Research Database (Denmark)

Nielson, Flemming; Nielson, Hanne Riis

1998-01-01

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

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

Science.gov (United States)

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

2013-04-01

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

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

Science.gov (United States)

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

2017-04-01

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

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

DEFF Research Database (Denmark)

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

2005-01-01

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

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

Four logics of governance

DEFF Research Database (Denmark)

Friche, Nanna; Normann Andersen, Vibeke

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

Diagnosable structured logic array

Science.gov (United States)

Whitaker, Sterling (Inventor); Miles, Lowell (Inventor); Gambles, Jody (Inventor); Maki, Gary K. (Inventor)

2009-01-01

A diagnosable structured logic array and associated process is provided. A base cell structure is provided comprising a logic unit comprising a plurality of input nodes, a plurality of selection nodes, and an output node, a plurality of switches coupled to the selection nodes, where the switches comprises a plurality of input lines, a selection line and an output line, a memory cell coupled to the output node, and a test address bus and a program control bus coupled to the plurality of input lines and the selection line of the plurality of switches. A state on each of the plurality of input nodes is verifiably loaded and read from the memory cell. A trusted memory block is provided. The associated process is provided for testing and verifying a plurality of truth table inputs of the logic unit.

BOKASUN: A fast and precise numerical program to calculate the Master Integrals of the two-loop sunrise diagrams

Science.gov (United States)

Caffo, Michele; Czyż, Henryk; Gunia, Michał; Remiddi, Ettore

2009-03-01

We present the program BOKASUN for fast and precise evaluation of the Master Integrals of the two-loop self-mass sunrise diagram for arbitrary values of the internal masses and the external four-momentum. We use a combination of two methods: a Bernoulli accelerated series expansion and a Runge-Kutta numerical solution of a system of linear differential equations. Program summaryProgram title: BOKASUN Catalogue identifier: AECG_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECG_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 9404 No. of bytes in distributed program, including test data, etc.: 104 123 Distribution format: tar.gz Programming language: FORTRAN77 Computer: Any computer with a Fortran compiler accepting FORTRAN77 standard. Tested on various PC's with LINUX Operating system: LINUX RAM: 120 kbytes Classification: 4.4 Nature of problem: Any integral arising in the evaluation of the two-loop sunrise Feynman diagram can be expressed in terms of a given set of Master Integrals, which should be calculated numerically. The program provides a fast and precise evaluation method of the Master Integrals for arbitrary (but not vanishing) masses and arbitrary value of the external momentum. Solution method: The integrals depend on three internal masses and the external momentum squared p. The method is a combination of an accelerated expansion in 1/p in its (pretty large!) region of fast convergence and of a Runge-Kutta numerical solution of a system of linear differential equations. Running time: To obtain 4 Master Integrals on PC with 2 GHz processor it takes 3 μs for series expansion with pre-calculated coefficients, 80 μs for series expansion without pre-calculated coefficients, from a few seconds up to a few minutes for Runge-Kutta method (depending

Philosophical, logical and scientific perspectives in engineering

CERN Document Server

Sen, Zekâi

2013-01-01

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

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

Safety-barrier diagrams

DEFF Research Database (Denmark)

Duijm, Nijs Jan

2007-01-01

Safety-barrier diagrams and the related so-called "bow-tie" diagrams have become popular methods in risk analysis. This paper describes the syntax and principles for constructing consistent and valid safety-barrier diagrams. The relation with other methods such as fault trees and Bayesian networks...... are discussed. A simple method for quantification of safety-barrier diagrams is proposed, including situations where safety barriers depend on shared common elements. It is concluded that safety-barrier diagrams provide a useful framework for an electronic data structure that integrates information from risk...... analysis with operational safety management....

Proceedings of the sixteenth international symposium on multiple-valued logic

International Nuclear Information System (INIS)

Anon.

1986-01-01

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

Data Logic

DEFF Research Database (Denmark)

Nilsson, Jørgen Fischer

A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students......A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students...

Knowledge discovery in variant databases using inductive logic programming.

Science.gov (United States)

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

2013-01-01

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

Logic Learning in Hopfield Networks

OpenAIRE

Sathasivam, Saratha; Abdullah, Wan Ahmad Tajuddin Wan

2008-01-01

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

Systems analysis programs for hands-on integrated reliability evaluations (SAPHIRE) Version 5.0. Fault tree, event tree, and piping ampersand instrumentation diagram (FEP) editors reference manual: Volume 7

International Nuclear Information System (INIS)

McKay, M.K.; Skinner, N.L.; Wood, S.T.

1994-07-01

The Systems Analysis Programs for Hands-on Integrated Reliability Evaluations (SAPHIRE) refers to a set of several microcomputer programs that were developed to create and analyze probabilistic risk assessments (PRAs), primarily for nuclear power plants. The Fault Tree, Event Tree, and Piping and Instrumentation Diagram (FEP) editors allow the user to graphically build and edit fault trees, and event trees, and piping and instrumentation diagrams (P and IDs). The software is designed to enable the independent use of the graphical-based editors found in the Integrated Reliability and Risk Assessment System (IRRAS). FEP is comprised of three separate editors (Fault Tree, Event Tree, and Piping and Instrumentation Diagram) and a utility module. This reference manual provides a screen-by-screen guide of the entire FEP System

Extending Value Logic Thinking to Value Logic Portfolios

DEFF Research Database (Denmark)

Andersen, Poul Houman; Ritter, Thomas

2014-01-01

Based on value creation logic theory (Stabell & Fjeldstad, 1998), this paper suggests an extension of the original Stabell & Fjeldstad model by an additional fourth value logic, the value system logic. Furthermore, instead of only allowing one dominant value creation logic for a given firm...... or transaction, an understanding of firms and transactions as a portfolio of value logics (i.e. an interconnected coexistence of different value creation logics) is proposed. These additions to the original value creation logic theory imply interesting avenues for both, strategic decision making in firms...

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

International Nuclear Information System (INIS)

SEEMAN, S.E.

2000-01-01

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

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

OpenAIRE

Gutmann, Bernd

2011-01-01

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

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

Science.gov (United States)

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

2008-06-01

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

A practical introduction to fuzzy logic using LISP

CERN Document Server

Argüelles Mendez, Luis

2016-01-01

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

A logic programming approach to medical errors in imaging.

Science.gov (United States)

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

2011-09-01

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

Revised Pourbaix diagrams for Copper at 5-150 C

International Nuclear Information System (INIS)

Beverskog, B.; Puigdomenech, I.

1995-10-01

Pourbaix diagrams have been revised. Predominance diagrams for dissolved copper species have also been calculated. Five different total concentrations for dissolved copper have been used in the calculations (from 10 -3 to 10 -9 ). The complete hydrolysis series of copper(I) and (II) have not been included in earlier published Pourbaix diagrams, and these species are covered for the first time in this work. At acidic pH, increasing temperature decreases the immunity area, and therefore, it increases the corrosion of the copper. At alkaline pH-values corrosion also increases with the temperature due to the decrease of both passivity and immunity areas. The calculated diagrams are used as a base for the discussion of the corrosion behaviour of the copper canisters in the Swedish radioactive waste management program. 62 refs, 37 figs, 3 tabs

Three-valued logics in modal logic

NARCIS (Netherlands)

Kooi, Barteld; Tamminga, Allard

2013-01-01

Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we

Selected area growth integrated wavelength converter based on PD-EAM optical logic gate

International Nuclear Information System (INIS)

Niu Bin; Zhou Daibing; Zhang Can; Liang Song; Lu Dan; Zhao Lingjuan; Wang Wei; Qiu Jifang; Wu Jian

2014-01-01

A selected area growth wavelength converter based on a PD-EAM optical logic gate for WDM application is presented, integrating an EML transmitter and a SOA-PD receiver. The design, fabrication, and DC characters were analyzed. A 2 Gb/s NRZ signal based on the C-band wavelength converted to 1555 nm with the highest extinction ratio of 7 dB was achieved and wavelength converted eye diagrams with eyes opened were presented. (semiconductor devices)

Towards a Formal Occurrence Logic based on Predicate Logic

DEFF Research Database (Denmark)

Badie, Farshad; Götzsche, Hans

2015-01-01

In this discussion we will concentrate on the main characteristics of an alternative kind of logic invented by Hans Götzsche: Occurrence Logic, which is not based on truth functionality. Our approach is based on temporal logic developed and elaborated by A. N. Prior. We will focus on characterising...... argumentation based on formal Occurrence Logic concerning events and occurrences, and illustrate the relations between Predicate Logic and Occurrence Logic. The relationships (and dependencies) is conducive to an approach that can analyse the occurrences of ”logical statements based on different logical...... principles” in different moments. We will also conclude that the elaborated Götzsche’s Occurrence Logic could be able to direct us to a truth-functional independent computer-based logic for analysing argumentation based on events and occurrences....

Classical Syllogisms in Logic Teaching

DEFF Research Database (Denmark)

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

2013-01-01

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

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

Science.gov (United States)

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

2017-01-01

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

CONCEPTUAL STRUCTURALLOGIC DIAGRAM PRODUCTION AUTOMATION EXPERT STUDY ON THE ISSUE OF CORRECTNESS OF CALCULATION OF THE TAX ON PROFIT OF ORGANIZATIONS

Directory of Open Access Journals (Sweden)

Andrey N. Ishchenko

2014-01-01

Full Text Available In this article the possibility of automation of an expert study on the questionof correctness of tax calculation profi t organization. Considered are the problemsof formalization of the expert research inthis field, specify the structure of imprisonment. The author proposes a conceptual structural-logic diagram automation expertresearch in this area.

Algorithmic phase diagrams

Science.gov (United States)

Hockney, Roger

1987-01-01

Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example, the recent results are shown of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered the prediction being read directly from the diagram without complex calculation.

Intuitionistic hybrid logic

DEFF Research Database (Denmark)

Braüner, Torben

2011-01-01

Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area.......Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area....

Importance analysis based on logical differential calculus and Binary Decision Diagram

International Nuclear Information System (INIS)

Zaitseva, Elena; Levashenko, Vitaly; Kostolny, Jozef

2015-01-01

System availability evaluation, sensitivity analysis, Importance Measures, and optimal design are important issues that have become research topics for reliability engineering. There are different mathematical approaches to the development of these topics. The structure function based approach is one of them. Structure function enables one to analyse a system of any complexity. But computational complexity of structure function based methods is time consuming for large-scale networks. We propose to use two mathematical approaches for decision to this problem for system importance analysis. The first of them is Direct Partial Boolean Derivative. New equations for calculating the Importance Measures are developed in terms of these derivatives. The second is Binary Decision Diagram (BDD), that supports efficient manipulation of Boolean algebra. Two algorithms for calculating Direct Partial Boolean Derivative based on BDD of structure function are proposed in this paper. The experimental results show the efficiency of new algorithms for calculating Direct Partial Boolean Derivative and Importance Measures. - Highlights: • New approach for calculation of Importance Measures is proposed. • Direct Partial Boolean Derivatives are used for calculation of Importance Measures. • New equations for Importance Measures are obtained. • New algorithm to calculate Direct Partial Boolean Derivatives by BDD is developed

Programming Guidelines for FBD Programs in Reactor Protection System Software

International Nuclear Information System (INIS)

Jung, Se Jin; Lee, Dong Ah; Kim, Eui Sub; Yoo, Jun Beom; Lee, Jang Su

2014-01-01

Properties of programming languages, such as reliability, traceability, etc., play important roles in software development to improve safety. Several researches are proposed guidelines about programming to increase the dependability of software which is developed for safety critical systems. Misra-c is a widely accepted programming guidelines for the C language especially in the sector of vehicle industry. NUREG/CR-6463 helps engineers in nuclear industry develop software in nuclear power plant systems more dependably. FBD (Function Block Diagram), which is one of programming languages defined in IEC 61131-3 standard, is often used for software development of PLC (programmable logic controllers) in nuclear power plants. Software development for critical systems using FBD needs strict guidelines, because FBD is a general language and has easily mistakable elements. There are researches about guidelines for IEC 61131-3 programming languages. They, however, do not specify details about how to use languages. This paper proposes new guidelines for the FBD based on NUREG/CR-6463. The paper introduces a CASE (Computer-Aided Software Engineering) tool to check FBD programs with the new guidelines and shows availability with a case study using a FBD program in a reactor protection system. The paper is organized as follows

Programming Guidelines for FBD Programs in Reactor Protection System Software

Energy Technology Data Exchange (ETDEWEB)

Jung, Se Jin; Lee, Dong Ah; Kim, Eui Sub; Yoo, Jun Beom [Division of Computer Science and Engineering College of Information and Communication, Konkuk University, Seoul (Korea, Republic of); Lee, Jang Su [Man-Machine Interface System team Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

2014-10-15

Properties of programming languages, such as reliability, traceability, etc., play important roles in software development to improve safety. Several researches are proposed guidelines about programming to increase the dependability of software which is developed for safety critical systems. Misra-c is a widely accepted programming guidelines for the C language especially in the sector of vehicle industry. NUREG/CR-6463 helps engineers in nuclear industry develop software in nuclear power plant systems more dependably. FBD (Function Block Diagram), which is one of programming languages defined in IEC 61131-3 standard, is often used for software development of PLC (programmable logic controllers) in nuclear power plants. Software development for critical systems using FBD needs strict guidelines, because FBD is a general language and has easily mistakable elements. There are researches about guidelines for IEC 61131-3 programming languages. They, however, do not specify details about how to use languages. This paper proposes new guidelines for the FBD based on NUREG/CR-6463. The paper introduces a CASE (Computer-Aided Software Engineering) tool to check FBD programs with the new guidelines and shows availability with a case study using a FBD program in a reactor protection system. The paper is organized as follows.

Knowledge discovery for pancreatic cancer using inductive logic programming.

Science.gov (United States)

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

2014-08-01

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

Automated Methodologies for the Design of Flow Diagrams for Development and Maintenance Activities

Science.gov (United States)

Shivanand M., Handigund; Shweta, Bhat

The Software Requirements Specification (SRS) of the organization is a text document prepared by strategic management incorporating the requirements of the organization. These requirements of ongoing business/ project development process involve the software tools, the hardware devices, the manual procedures, the application programs and the communication commands. These components are appropriately ordered for achieving the mission of the concerned process both in the project development and the ongoing business processes, in different flow diagrams viz. activity chart, workflow diagram, activity diagram, component diagram and deployment diagram. This paper proposes two generic, automatic methodologies for the design of various flow diagrams of (i) project development activities, (ii) ongoing business process. The methodologies also resolve the ensuing deadlocks in the flow diagrams and determine the critical paths for the activity chart. Though both methodologies are independent, each complements other in authenticating its correctness and completeness.

VennPainter: A Tool for the Comparison and Identification of Candidate Genes Based on Venn Diagrams.

Directory of Open Access Journals (Sweden)

Guoliang Lin

Full Text Available VennPainter is a program for depicting unique and shared sets of genes lists and generating Venn diagrams, by using the Qt C++ framework. The software produces Classic Venn, Edwards' Venn and Nested Venn diagrams and allows for eight sets in a graph mode and 31 sets in data processing mode only. In comparison, previous programs produce Classic Venn and Edwards' Venn diagrams and allow for a maximum of six sets. The software incorporates user-friendly features and works in Windows, Linux and Mac OS. Its graphical interface does not require a user to have programing skills. Users can modify diagram content for up to eight datasets because of the Scalable Vector Graphics output. VennPainter can provide output results in vertical, horizontal and matrix formats, which facilitates sharing datasets as required for further identification of candidate genes. Users can obtain gene lists from shared sets by clicking the numbers on the diagram. Thus, VennPainter is an easy-to-use, highly efficient, cross-platform and powerful program that provides a more comprehensive tool for identifying candidate genes and visualizing the relationships among genes or gene families in comparative analysis.

Classical logic and logicism in human thought

OpenAIRE

Elqayam, Shira

2012-01-01

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

Classical Process diagrams and Service oriented Architecture

Directory of Open Access Journals (Sweden)

Milan Mišovič

2013-01-01

services communicate with each other. The communication can involve either simple data or it could two or more services coordinating some activity. From the above mentioned we can pronounce a brief description of SOA. “SOA is an architectural style for consistency of business process logic and service architecture of the target software.”It is a complex of means for solution of special analysis, design, and integration of enterprise applications based on the use of enterprise services. The service solutions of the classic business process logic are, of course, based on the application of at least seven key principles of SOA (free relations, service contract, autonomy, abstraction, reusing, composition, no states. Key attributes of SOA are verbally described in (Erl, 2006. They are so important that a separate article should be devoted to their nature and formalization. On the other hand, there is also clear that each service solution of business logic should respect the principles published in SOA Manifesto, 2009, which are essentially derived from the key principles of SOA.In many publications there are given the SOA reference models usually composed of several layers (presentation layer, business process layer, composite services layer, application layer giving a meta idea of SOA implementation. Perfect knowledge of the business process logic is a necessary condition for the development of a proper service solution. The different types of business processes should be described in the necessary details and contexts.Interestingly, the SOA paradigm does not provide its own method of finding and describing business processes by giving a layered transparent business process diagram. On the other hand, the methodology provides deep understanding of not only the characteristics of services, but also their functionality and implementation of the key principles of SOA (Erl, 2006.Let us assume that the required process diagrams can be achieved by using some of the advanced

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

Science.gov (United States)

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

2012-07-11

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

Design of reconfigurable logic controllers

CERN Document Server

Bukowiec, Arkadiusz; Doligalski, Michał; Tkacz, Jacek

2016-01-01

This book presents the original concepts and modern techniques for specification, synthesis, optimisation and implementation of parallel logical control devices. It deals with essential problems of reconfigurable control systems like dependability, modularity and portability. Reconfigurable systems require a wider variety of design and verification options than the application-specific integrated circuits. The book presents a comprehensive selection of possible design techniques. The diversity of the modelling approaches covers Petri nets, state machines and activity diagrams. The preferences of the presented optimization and synthesis methods are not limited to increasing of the efficiency of resource use. One of the biggest advantages of the presented methods is the platform independence, the FPGA devices and single board computers are some of the examples of possible platforms. These issues and problems are illustrated with practical cases of complete control systems. If you expect a new look at the recon...

The golden ratio and Loshu-Fibonacci Diagram: novel research view on relationship of Chinese medicine and modern biology.

Science.gov (United States)

Chen, Zhao-xue; Huang, Yun-kun; Sun, Ying

2014-02-01

Associating geometric arrangements of 9 Loshu numbers modulo 5, investigating property of golden rectangles and characteristics of Fibonacci sequence modulo 10 as well as the two subsequences of its modular sequence by modulo 5, the Loshu-Fibonacci Diagram is created based on strict logical deduction in this paper, which can disclose inherent relationship among Taiji sign, Loshu and Fibonacci sequence modulo 10 perfectly and unite such key ideas of holism, symmetry, holographic thought and yin-yang balance pursuit from Chinese medicine as a whole. Based on further analysis and reasoning, the authors discover that taking the golden ratio and Loshu-Fibonacci Diagram as a link, there is profound and universal association existing between researches of Chinese medicine and modern biology.

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

Science.gov (United States)

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

2006-01-01

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

A Verification Study on the Loop-Breaking Logic of FTREX

International Nuclear Information System (INIS)

Choi, Jong Soo

2008-01-01

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

Logical labyrinths

CERN Document Server

Smullyan, Raymond

2008-01-01

This book features a unique approach to the teaching of mathematical logic by putting it in the context of the puzzles and paradoxes of common language and rational thought. It serves as a bridge from the author's puzzle books to his technical writing in the fascinating field of mathematical logic. Using the logic of lying and truth-telling, the author introduces the readers to informal reasoning preparing them for the formal study of symbolic logic, from propositional logic to first-order logic, a subject that has many important applications to philosophy, mathematics, and computer science. T

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

Science.gov (United States)

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

2011-03-23

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

Construction of Eh-pH and other stability diagrams of uranium in a multicomponent system with a microcomputer

International Nuclear Information System (INIS)

Haung, H.; Cuentas, L.

1989-01-01

Stability diagrams for a multicomponent system in aqueous chemistry provide important information for hydrometallurgy, corrosion science, geochemistry and environmental science. Two distinct types of diagrams constructed are predominance diagrams and distribution diagrams. The ability to construct stability diagrams easily, quickly and accurately is most helpful in research and development and in academic programs. The use of a microcomputer is handicapped by slow speed and limited memory. Developing program methods that promote easy calculation and plot the diagram directly on a CRT or a plotter is a primary concern. As presented in this paper, the calculation of equilibrium and boundary constraints, combined with isolation of stability areas, works well for constructing predominance diagrams. Equilibrium constraints can be obtained based on free energies of formation. Boundary constraints for the ligand component are the boundary of the diagram, and constraints for the main component are the surrounding lines of each dominant ligand. Other considerations regarding the chemical model, mathematics computation and the use of microcomputers pertaining to diagram construction are discussed. The uranium in a multicomponent system is used for demonstration

Viral pathogenesis in diagrams

National Research Council Canada - National Science Library

Tremblay, Michel; Berthiaume, Laurent; Ackermann, Hans-Wolfgang

2001-01-01

.... The 268 diagrams in Viral Pathogenesis in Diagrams were selected from over 800 diagrams of English and French virological literature, including one derived from a famous drawing by Leonardo da Vinci...

Use of an influence diagram and fuzzy probability for evaluating accident management in a BWR

International Nuclear Information System (INIS)

Yu, Donghan; Okrent, D.; Kastenberg, W.E.

1993-01-01

This paper develops a new approach for evaluating severe accident management strategies. At first, this approach considers accident management as a decision problem (i.e., ''applying a strategy'' vs. ''do nothing'') and uses influence diagrams. This approach introduces the concept of a ''fuzzy probability'' in the evaluation of an influence diagram. When fuzzy logic is applied, fuzzy probabilities in an influence diagram can be easily propagated to obtain results. In addition, the results obtained provide not only information similar to the classical approach using point-estimate values, but also additional information regarding the impact from imprecise input data. The proposed methodology is applied to the evaluation of the drywell flooding strategy for a long-term station blackout sequence in the Peach Bottom nuclear power plant. The results show that the drywell flooding strategy seems to be beneficial for preventing reactor vessel breach. It is also effective for reducing the probability of the containment failure for both liner melt-through and late overpressurization. Even though there exists uncertainty in the results, ''flooding'' is preferred to ''do nothing'' when evaluated in terms of expected consequences, i.e., early and late fatalities

The Eh-pH Diagram and Its Advances

Directory of Open Access Journals (Sweden)

Hsin-Hsiung Huang

2016-01-01

as the concentration of a given ligand, temperature or showing the solubility of stable solids. A personal computer is capable of drawing the diagram by utilizing a 3D program, such as ParaView, or VisIt, or MATLAB. Two 3D wireframe volume plots of a Uranium-carbonate system from Garrels and Christ were used to verify the Eh-pH calculation and the presentation from ParaView. Although a two-dimensional drawing is still much clearer to read, a 3D graph can allow one to visualize an entire system by executing rotation, clipping, slicing and making a movie.

Interactive Land-Use Optimization Using Laguerre Voronoi Diagram with Dynamic Generating Point Allocation

Science.gov (United States)

Chaidee, S.; Pakawanwong, P.; Suppakitpaisarn, V.; Teerasawat, P.

2017-09-01

In this work, we devise an efficient method for the land-use optimization problem based on Laguerre Voronoi diagram. Previous Voronoi diagram-based methods are more efficient and more suitable for interactive design than discrete optimization-based method, but, in many cases, their outputs do not satisfy area constraints. To cope with the problem, we propose a force-directed graph drawing algorithm, which automatically allocates generating points of Voronoi diagram to appropriate positions. Then, we construct a Laguerre Voronoi diagram based on these generating points, use linear programs to adjust each cell, and reconstruct the diagram based on the adjustment. We adopt the proposed method to the practical case study of Chiang Mai University's allocated land for a mixed-use complex. For this case study, compared to other Voronoi diagram-based method, we decrease the land allocation error by 62.557 %. Although our computation time is larger than the previous Voronoi-diagram-based method, it is still suitable for interactive design.

Turbine flow diagram of Paks-1 reactor

International Nuclear Information System (INIS)

Vancso, Tamas

1983-01-01

Computer calculations and programs are presented which inform the operators on the effect projected on the turbine and thermal efficiency of the modification in the flow diagram and in the starting parameters of the power cycle. In the program the expansion line of steam turbine type K-220-44 and the thermo-technical parameters of the elements of the feed-water heater system are determined. Detailed degree calculations for turbine unit of high pressure can be made. (author)

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

Science.gov (United States)

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

2006-06-01

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

Accuracy of Currently Used Paper Burn Diagram vs a Three-Dimensional Computerized Model.

Science.gov (United States)

Benjamin, Nicole C; Lee, Jong O; Norbury, William B; Branski, Ludwik K; Wurzer, Paul; Jimenez, Carlos J; Benjamin, Debra A; Herndon, David N

Burn units have historically used paper diagrams to estimate percent burn; however, unintentional errors can occur. The use of a computer program that incorporates wound mapping from photographs onto a three-dimensional (3D) human diagram could decrease subjectivity in preparing burn diagrams and subsequent calculations of TBSA burned. Analyses were done on 19 burned patients who had an estimated TBSA burned of ≥20%. The patients were admitted to Shriners Hospitals for Children or the University of Texas Medical Branch in Galveston, Texas, from July 2012 to September 2013 for treatment. Digital photographs were collected before the patient's first surgery. Using BurnCase 3D (RISC Software GmbH, Hagenberg, Austria), a burn mapping software, the user traced partial- and full-thickness burns from photographs. The program then superimposed tracings onto a 3D model and calculated percent burned. The results were compared with the Lund and Browder diagrams completed after the first operation. A two-tailed t-test was used to calculate statistical differences. For partial-thickness burns, burn sizes calculated using Lund and Browder diagrams were significantly larger than those calculated using BurnCase 3D (15% difference, P < .01). The opposite was found for full-thickness burns, with burn sizes being smaller when calculated using Lund and Browder diagrams (11% difference, P < .05). In conclusion, substantial differences exist in percent burn estimations derived from BurnCase 3D and paper diagrams. In our studied cohort, paper diagrams were associated with overestimation of partial-thickness burn size and underestimation of full-thickness burn size. Additional studies comparing BurnCase 3D with other commonly used methods are warranted.

Diagram, a Learning Environment for Initiation to Object-Oriented Modeling with UML Class Diagrams

Science.gov (United States)

Py, Dominique; Auxepaules, Ludovic; Alonso, Mathilde

2013-01-01

This paper presents Diagram, a learning environment for object-oriented modelling (OOM) with UML class diagrams. Diagram an open environment, in which the teacher can add new exercises without constraints on the vocabulary or the size of the diagram. The interface includes methodological help, encourages self-correcting and self-monitoring, and…

VennDiagram: a package for the generation of highly-customizable Venn and Euler diagrams in R

Directory of Open Access Journals (Sweden)

Boutros Paul C

2011-01-01

Full Text Available Abstract Background Visualization of orthogonal (disjoint or overlapping datasets is a common task in bioinformatics. Few tools exist to automate the generation of extensively-customizable, high-resolution Venn and Euler diagrams in the R statistical environment. To fill this gap we introduce VennDiagram, an R package that enables the automated generation of highly-customizable, high-resolution Venn diagrams with up to four sets and Euler diagrams with up to three sets. Results The VennDiagram package offers the user the ability to customize essentially all aspects of the generated diagrams, including font sizes, label styles and locations, and the overall rotation of the diagram. We have implemented scaled Venn and Euler diagrams, which increase graphical accuracy and visual appeal. Diagrams are generated as high-definition TIFF files, simplifying the process of creating publication-quality figures and easing integration with established analysis pipelines. Conclusions The VennDiagram package allows the creation of high quality Venn and Euler diagrams in the R statistical environment.

VennDiagram: a package for the generation of highly-customizable Venn and Euler diagrams in R.

Science.gov (United States)

Chen, Hanbo; Boutros, Paul C

2011-01-26

Visualization of orthogonal (disjoint) or overlapping datasets is a common task in bioinformatics. Few tools exist to automate the generation of extensively-customizable, high-resolution Venn and Euler diagrams in the R statistical environment. To fill this gap we introduce VennDiagram, an R package that enables the automated generation of highly-customizable, high-resolution Venn diagrams with up to four sets and Euler diagrams with up to three sets. The VennDiagram package offers the user the ability to customize essentially all aspects of the generated diagrams, including font sizes, label styles and locations, and the overall rotation of the diagram. We have implemented scaled Venn and Euler diagrams, which increase graphical accuracy and visual appeal. Diagrams are generated as high-definition TIFF files, simplifying the process of creating publication-quality figures and easing integration with established analysis pipelines. The VennDiagram package allows the creation of high quality Venn and Euler diagrams in the R statistical environment.

Introduction to Feynman diagrams

CERN Document Server

Bilenky, Samoil Mikhelevich

1974-01-01

Introduction to Feynman Diagrams provides Feynman diagram techniques and methods for calculating quantities measured experimentally. The book discusses topics Feynman diagrams intended for experimental physicists. Topics presented include methods for calculating the matrix elements (by perturbation theory) and the basic rules for constructing Feynman diagrams; techniques for calculating cross sections and polarizations; processes in which both leptons and hadrons take part; and the electromagnetic and weak form factors of nucleons. Experimental physicists and graduate students of physics will

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

Science.gov (United States)

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

2003-11-01

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

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

Directory of Open Access Journals (Sweden)

A Santos Jose C

2012-07-01

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

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

Science.gov (United States)

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

2010-01-01

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

Vérification des propriétés temporisées des automates programmables industriels

OpenAIRE

Bel Mokadem , Houda

2006-01-01

Vérification of PLC (Programmable Logic Controller) programs is important when these programs are to control critical applications for reactive systems. This context has already been study for untimed programs. In this thesis, We are interested to timed properties and programs. More precisely, we give a formal semantics to (partial) Ladder diagrams and TON blocks, with timed automata. We also propose a timed logic in order to abstract transient events, where transient properties is parameteri...

Diagrams benefit symbolic problem-solving.

Science.gov (United States)

Chu, Junyi; Rittle-Johnson, Bethany; Fyfe, Emily R

2017-06-01

The format of a mathematics problem often influences students' problem-solving performance. For example, providing diagrams in conjunction with story problems can benefit students' understanding, choice of strategy, and accuracy on story problems. However, it remains unclear whether providing diagrams in conjunction with symbolic equations can benefit problem-solving performance as well. We tested the impact of diagram presence on students' performance on algebra equation problems to determine whether diagrams increase problem-solving success. We also examined the influence of item- and student-level factors to test the robustness of the diagram effect. We worked with 61 seventh-grade students who had received 2 months of pre-algebra instruction. Students participated in an experimenter-led classroom session. Using a within-subjects design, students solved algebra problems in two matched formats (equation and equation-with-diagram). The presence of diagrams increased equation-solving accuracy and the use of informal strategies. This diagram benefit was independent of student ability and item complexity. The benefits of diagrams found previously for story problems generalized to symbolic problems. The findings are consistent with cognitive models of problem-solving and suggest that diagrams may be a useful additional representation of symbolic problems. © 2017 The British Psychological Society.

Manipulating potential wells in Logical Stochastic Resonance to obtain XOR logic

International Nuclear Information System (INIS)

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

2012-01-01

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

Classical Mathematical Logic The Semantic Foundations of Logic

CERN Document Server

Epstein, Richard L

2011-01-01

In Classical Mathematical Logic, Richard L. Epstein relates the systems of mathematical logic to their original motivations to formalize reasoning in mathematics. The book also shows how mathematical logic can be used to formalize particular systems of mathematics. It sets out the formalization not only of arithmetic, but also of group theory, field theory, and linear orderings. These lead to the formalization of the real numbers and Euclidean plane geometry. The scope and limitations of modern logic are made clear in these formalizations. The book provides detailed explanations of all proo

Transforming equality logic to propositional logic

NARCIS (Netherlands)

Zantema, H.; Groote, J.F.

2003-01-01

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

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

Directory of Open Access Journals (Sweden)

Yurii I. Sinko

2010-09-01

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

Optimizing UML Class Diagrams

Directory of Open Access Journals (Sweden)

Sergievskiy Maxim

2018-01-01

Full Text Available Most of object-oriented development technologies rely on the use of the universal modeling language UML; class diagrams play a very important role in the design process play, used to build a software system model. Modern CASE tools, which are the basic tools for object-oriented development, can’t be used to optimize UML diagrams. In this manuscript we will explain how, based on the use of design patterns and anti-patterns, class diagrams could be verified and optimized. Certain transformations can be carried out automatically; in other cases, potential inefficiencies will be indicated and recommendations given. This study also discusses additional CASE tools for validating and optimizing of UML class diagrams. For this purpose, a plugin has been developed that analyzes an XMI file containing a description of class diagrams.

Programmable logic control applied to a coal preparation plant complex

Energy Technology Data Exchange (ETDEWEB)

Krahenbil, L W

1979-02-01

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

Logic and Ontology

Directory of Open Access Journals (Sweden)

Newton C. A. da Costa

2002-12-01

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

Structural Logical Relations

DEFF Research Database (Denmark)

Schürmann, Carsten; Sarnat, Jeffrey

2008-01-01

Tait's method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed lambda-calculi. Historically, these proofs have been extremely difficult to formalize in proof assistants with weak meta-logics......, such as Twelf, and yet they are often straightforward in proof assistants with stronger meta-logics. In this paper, we propose structural logical relations as a technique for conducting these proofs in systems with limited meta-logical strength by explicitly representing and reasoning about an auxiliary logic...

[The Application of the Fault Tree Analysis Method in Medical Equipment Maintenance].

Science.gov (United States)

Liu, Hongbin

2015-11-01

In this paper, the traditional fault tree analysis method is presented, detailed instructions for its application characteristics in medical instrument maintenance is made. It is made significant changes when the traditional fault tree analysis method is introduced into the medical instrument maintenance: gave up the logic symbolic, logic analysis and calculation, gave up its complicated programs, and only keep its image and practical fault tree diagram, and the fault tree diagram there are also differences: the fault tree is no longer a logical tree but the thinking tree in troubleshooting, the definition of the fault tree's nodes is different, the composition of the fault tree's branches is also different.

BDI Logics

NARCIS (Netherlands)

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

2015-01-01

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

Fuzzy logic and intelligent technologies in nuclear science

International Nuclear Information System (INIS)

Ruan, D.

1998-01-01

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

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

Science.gov (United States)

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

2016-01-13

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

Many-valued logics

CERN Document Server

Bolc, Leonard

1992-01-01

Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of excluded middle" in classical logic. The first many-valued formal systems were developed by J. Lukasiewicz in Poland and E.Post in the U.S.A. in the 1920s, and since then the field has expanded dramatically as the applicability of the systems to other philosophical and semantic problems was recognized. Intuitionisticlogic, for example, arose from deep problems in the foundations of mathematics. Fuzzy logics, approximation logics, and probability logics all address questions that classical logic alone cannot answer. All these interpretations of many-valued calculi motivate specific formal systems thatallow detailed mathematical treatment. In this volume, the authors are concerned with finite-valued logics, and especially with three-valued logical calculi. Matrix constructions, axiomatizations of propositional and predicate calculi, syntax, semantic structures, and methodology are discussed. Separate chapters deal w...

Stage line diagram: An age-conditional reference diagram for tracking development

NARCIS (Netherlands)

Buuren, S. van; Ooms, J.C.L.

2009-01-01

This paper presents a method for calculating stage line diagrams, a novel type of reference diagram useful for tracking developmental processes over time. Potential fields of applications include: dentistry (tooth eruption), oncology (tumor grading, cancer staging), virology (HIV infection and

Stage line diagram: an age-conditional reference diagram for tracking development.

NARCIS (Netherlands)

Van Buuren, S.; Ooms, J.C.L.

2009-01-01

This paper presents a method for calculating stage line diagrams, a novel type of reference diagram useful for tracking developmental processes over time. Potential fields of applications include: dentistry (tooth eruption), oncology (tumor grading, cancer staging), virology (HIV infection and

Quantum Logic as a Dynamic Logic

NARCIS (Netherlands)

Baltag, A.; Smets, S.

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

Quantum logic as a dynamic logic

NARCIS (Netherlands)

Baltag, Alexandru; Smets, Sonja

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

Product Lukasiewicz Logic

Czech Academy of Sciences Publication Activity Database

Horčík, Rostislav; Cintula, Petr

2004-01-01

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

Against Logical Form

Directory of Open Access Journals (Sweden)

P N Johnson-Laird

2010-10-01

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

Para-equilibrium phase diagrams

International Nuclear Information System (INIS)

Pelton, Arthur D.; Koukkari, Pertti; Pajarre, Risto; Eriksson, Gunnar

2014-01-01

Highlights: • A rapidly cooled system may attain a state of para-equilibrium. • In this state rapidly diffusing elements reach equilibrium but others are immobile. • Application of the Phase Rule to para-equilibrium phase diagrams is discussed. • A general algorithm to calculate para-equilibrium phase diagrams is described. - Abstract: If an initially homogeneous system at high temperature is rapidly cooled, a temporary para-equilibrium state may result in which rapidly diffusing elements have reached equilibrium but more slowly diffusing elements have remained essentially immobile. The best known example occurs when homogeneous austenite is quenched. A para-equilibrium phase assemblage may be calculated thermodynamically by Gibbs free energy minimization under the constraint that the ratios of the slowly diffusing elements are the same in all phases. Several examples of calculated para-equilibrium phase diagram sections are presented and the application of the Phase Rule is discussed. Although the rules governing the geometry of these diagrams may appear at first to be somewhat different from those for full equilibrium phase diagrams, it is shown that in fact they obey exactly the same rules with the following provision. Since the molar ratios of non-diffusing elements are the same in all phases at para-equilibrium, these ratios act, as far as the geometry of the diagram is concerned, like “potential” variables (such as T, pressure or chemical potentials) rather than like “normal” composition variables which need not be the same in all phases. A general algorithm to calculate para-equilibrium phase diagrams is presented. In the limit, if a para-equilibrium calculation is performed under the constraint that no elements diffuse, then the resultant phase diagram shows the single phase with the minimum Gibbs free energy at any point on the diagram; such calculations are of interest in physical vapor deposition when deposition is so rapid that phase

Superconductor fluxoid logic

International Nuclear Information System (INIS)

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

1993-01-01

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

Advances in Modal Logic

DEFF Research Database (Denmark)

Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume...... is the proceedings of the conference of record in its fi eld, Advances in Modal Logic. Its contributions are state-of-the-art papers. The topics include decidability and complexity results for specifi c modal logics, proof theory of modal logic, logics for reasoning about time and space, provability logic, dynamic...... epistemic logic, and the logic of evidence....

Mathematical logic

CERN Document Server

Kleene, Stephen Cole

1967-01-01

Undergraduate students with no prior instruction in mathematical logic will benefit from this multi-part text. Part I offers an elementary but thorough overview of mathematical logic of 1st order. Part II introduces some of the newer ideas and the more profound results of logical research in the 20th century. 1967 edition.

Indeterministic Temporal Logic

Directory of Open Access Journals (Sweden)

Trzęsicki Kazimierz

2015-09-01

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

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

International Nuclear Information System (INIS)

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

2009-01-01

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

HYPROLOG: A New Logic Programming Language with Assumptions and Abduction

DEFF Research Database (Denmark)

Christiansen, Henning; Dahl, Veronica

2005-01-01

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

Classical Logic and Quantum Logic with Multiple and Common Lattice Models

Directory of Open Access Journals (Sweden)

Mladen Pavičić

2016-01-01

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

Sintering diagrams of UO2

International Nuclear Information System (INIS)

Mohan, A.; Soni, N.C.; Moorthy, V.K.

1979-01-01

Ashby's method (see Acta Met., vol. 22, p. 275, 1974) of constructing sintering diagrams has been modified to obtain contribution diagrams directly from the computer. The interplay of sintering variables and mechanisms are studied and the factors that affect the participation of mechanisms in UO 2 are determined. By studying the physical properties, it emerges that the order of inaccuracies is small in most cases and do not affect the diagrams. On the other hand, even a 10% error in activation energies, which is quite plausible, would make a significant difference to the diagram. The main criticism of Ashby's approach is that the numerous properties and equations used, communicate their inaccuracies to the diagrams and make them unreliable. The present study has considerably reduced the number of factors that need to be refined to make the sintering diagrams more meaningful. (Auth.)

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

Science.gov (United States)

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

2013-01-01

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

Magnetic Logic Circuits for Extreme Environments, Phase I

Data.gov (United States)

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

Propositional Logics of Dependence

NARCIS (Netherlands)

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

2016-01-01

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

An automatic system for elaboration of chip breaking diagrams

DEFF Research Database (Denmark)

Andreasen, Jan Lasson; De Chiffre, Leonardo

1998-01-01

A laboratory system for fully automatic elaboration of chip breaking diagrams has been developed and tested. The system is based on automatic chip breaking detection by frequency analysis of cutting forces in connection with programming of a CNC-lathe to scan different feeds, speeds and cutting...

Feynman diagram drawing made easy

International Nuclear Information System (INIS)

Baillargeon, M.

1997-01-01

We present a drawing package optimised for Feynman diagrams. These can be constructed interactively with a mouse-driven graphical interface or from a script file, more suitable to work with a diagram generator. It provides most features encountered in Feynman diagrams and allows to modify every part of a diagram after its creation. Special attention has been paid to obtain a high quality printout as easily as possible. This package is written in Tcl/Tk and in C. (orig.)

Modern Logical Frameworks Design

DEFF Research Database (Denmark)

Murawska, Agata Anna

2017-01-01

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

Applications of phase diagrams in metallurgy and ceramics

International Nuclear Information System (INIS)

Carter, G.C.

1978-03-01

The workshop represents an effort to coordinate and reinforce the current efforts on compilation of phase diagrams of alloys and ceramics. Many research groups and individual scientists throughout the world are concerned with phase equilibrium data. Specialized expertise exists in small institutions as well as large laboratories. If this talent can be effecively utilized through a cooperative effort, the needs for such data can be met. The Office of Standard Reference Data, which serves as the program management office for the National Standard Reference Data System, is eager to work with all groups concerned with this problem. Through a cooperative international effort we can carry out a task which has become too large for an individual. Volume 2 presents computational techniques for phase diagram construction

Abductive Logic Grammars

DEFF Research Database (Denmark)

Christiansen, Henning; Dahl, Veronica

2009-01-01

By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting....... We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also -- in a significant departure from...

Applications of Logic Coverage Criteria and Logic Mutation to Software Testing

Science.gov (United States)

Kaminski, Garrett K.

2011-01-01

Logic is an important component of software. Thus, software logic testing has enjoyed significant research over a period of decades, with renewed interest in the last several years. One approach to detecting logic faults is to create and execute tests that satisfy logic coverage criteria. Another approach to detecting faults is to perform mutation…

The Semiotic Structure of Geometry Diagrams: How Textbook Diagrams Convey Meaning

Science.gov (United States)

Dimmel, Justin K.; Herbst, Patricio G.

2015-01-01

Geometry diagrams use the visual features of specific drawn objects to convey meaning about generic mathematical entities. We examine the semiotic structure of these visual features in two parts. One, we conduct a semiotic inquiry to conceptualize geometry diagrams as mathematical texts that comprise choices from different semiotic systems. Two,…

Stage line diagram: an age-conditional reference diagram for tracking development.

Science.gov (United States)

van Buuren, Stef; Ooms, Jeroen C L

2009-05-15

This paper presents a method for calculating stage line diagrams, a novel type of reference diagram useful for tracking developmental processes over time. Potential fields of applications include: dentistry (tooth eruption), oncology (tumor grading, cancer staging), virology (HIV infection and disease staging), psychology (stages of cognitive development), human development (pubertal stages) and chronic diseases (stages of dementia). Transition probabilities between successive stages are modeled as smoothly varying functions of age. Age-conditional references are calculated from the modeled probabilities by the mid-P value. It is possible to eliminate the influence of age by calculating standard deviation scores (SDS). The method is applied to the empirical data to produce reference charts on secondary sexual maturation. The mean of the empirical SDS in the reference population is close to zero, whereas the variance depends on age. The stage line diagram provides quick insight into both status (in SDS) and tempo (in SDS/year) of development of an individual child. Other measures (e.g. height SDS, body mass index SDS) from the same child can be added to the chart. Diagrams for sexual maturation are available as a web application at http://vps.stefvanbuuren.nl/puberty. The stage line diagram expresses status and tempo of discrete changes on a continuous scale. Wider application of these measures scores opens up new analytic possibilities. (c) 2009 John Wiley & Sons, Ltd.

Ring diagrams and phase transitions

International Nuclear Information System (INIS)

Takahashi, K.

1986-01-01

Ring diagrams at finite temperatures carry most infrared-singular parts among Feynman diagrams. Their effect to effective potentials are in general so significant that one must incorporate them as well as 1-loop diagrams. The author expresses these circumstances in some examples of supercooled phase transitions

Stochastic coalgebraic logic

CERN Document Server

Doberkat, Ernst-Erich

2009-01-01

Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles of coalgebraic logic from a categorical perspective. Modal logics are also discussed, including probabilistic interpretations and an analysis of Kripke models.

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

Science.gov (United States)

Korkmaz, Özgen

2016-01-01

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

Stereo 3D spatial phase diagrams

Energy Technology Data Exchange (ETDEWEB)

Kang, Jinwu, E-mail: kangjw@tsinghua.edu.cn; Liu, Baicheng, E-mail: liubc@tsinghua.edu.cn

2016-07-15

Phase diagrams serve as the fundamental guidance in materials science and engineering. Binary P-T-X (pressure–temperature–composition) and multi-component phase diagrams are of complex spatial geometry, which brings difficulty for understanding. The authors constructed 3D stereo binary P-T-X, typical ternary and some quaternary phase diagrams. A phase diagram construction algorithm based on the calculated phase reaction data in PandaT was developed. And the 3D stereo phase diagram of Al-Cu-Mg ternary system is presented. These phase diagrams can be illustrated by wireframe, surface, solid or their mixture, isotherms and isopleths can be generated. All of these can be displayed by the three typical display ways: electronic shutter, polarization and anaglyph (for example red-cyan glasses). Especially, they can be printed out with 3D stereo effect on paper, and watched by the aid of anaglyph glasses, which makes 3D stereo book of phase diagrams come to reality. Compared with the traditional illustration way, the front of phase diagrams protrude from the screen and the back stretches far behind of the screen under 3D stereo display, the spatial structure can be clearly and immediately perceived. These 3D stereo phase diagrams are useful in teaching and research. - Highlights: • Stereo 3D phase diagram database was constructed, including binary P-T-X, ternary, some quaternary and real ternary systems. • The phase diagrams can be watched by active shutter or polarized or anaglyph glasses. • The print phase diagrams retains 3D stereo effect which can be achieved by the aid of anaglyph glasses.

Studies on the QCD Phase Diagram at SPS and FAIR

International Nuclear Information System (INIS)

Blume, Christoph

2013-01-01

A review of results of the energy scan program at the CERN-SPS by the NA49 experiment is given. Presented are observables related to the search for a critical point in the QCD phase diagram and for the onset of deconfinement. Furthermore, the ongoing experimental program of NA61 at the CRRN-SPS and the plans of the CBM experiment at FAIR are discussed.

Towards an arithmetical logic the arithmetical foundations of logic

CERN Document Server

Gauthier, Yvon

2015-01-01

This book offers an original contribution to the foundations of logic and mathematics, and focuses on the internal logic of mathematical theories, from arithmetic or number theory to algebraic geometry. Arithmetical logic is the term used to refer to the internal logic of classical arithmetic, here called Fermat-Kronecker arithmetic, and combines Fermat’s method of infinite descent with Kronecker’s general arithmetic of homogeneous polynomials. The book also includes a treatment of theories in physics and mathematical physics to underscore the role of arithmetic from a constructivist viewpoint. The scope of the work intertwines historical, mathematical, logical and philosophical dimensions in a unified critical perspective; as such, it will appeal to a broad readership from mathematicians to logicians, to philosophers interested in foundational questions. Researchers and graduate students in the fields of philosophy and mathematics will benefit from the author’s critical approach to the foundations of l...

Meta-Logical Reasoning in Higher-Order Logic

DEFF Research Database (Denmark)

Villadsen, Jørgen; Schlichtkrull, Anders; Hess, Andreas Viktor

The semantics of first-order logic (FOL) can be described in the meta-language of higher-order logic (HOL). Using HOL one can prove key properties of FOL such as soundness and completeness. Furthermore, one can prove sentences in FOL valid using the formalized FOL semantics. To aid...

Trimming a hazard logic tree with a new model-order-reduction technique

Science.gov (United States)

Porter, Keith; Field, Edward; Milner, Kevin R

2017-01-01

The size of the logic tree within the Uniform California Earthquake Rupture Forecast Version 3, Time-Dependent (UCERF3-TD) model can challenge risk analyses of large portfolios. An insurer or catastrophe risk modeler concerned with losses to a California portfolio might have to evaluate a portfolio 57,600 times to estimate risk in light of the hazard possibility space. Which branches of the logic tree matter most, and which can one ignore? We employed two model-order-reduction techniques to simplify the model. We sought a subset of parameters that must vary, and the specific fixed values for the remaining parameters, to produce approximately the same loss distribution as the original model. The techniques are (1) a tornado-diagram approach we employed previously for UCERF2, and (2) an apparently novel probabilistic sensitivity approach that seems better suited to functions of nominal random variables. The new approach produces a reduced-order model with only 60 of the original 57,600 leaves. One can use the results to reduce computational effort in loss analyses by orders of magnitude.

Connections among quantum logics

International Nuclear Information System (INIS)

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

1985-01-01

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

Designing Experiments to Discriminate Families of Logic Models.

Science.gov (United States)

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

2015-01-01

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

Paraconsistent Computational Logic

DEFF Research Database (Denmark)

Jensen, Andreas Schmidt; Villadsen, Jørgen

2012-01-01

In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....

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

Science.gov (United States)

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

2011-01-01

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

Quantum logic as superbraids of entangled qubit world lines

International Nuclear Information System (INIS)

Yepez, Jeffrey

2010-01-01

Presented is a topological representation of quantum logic that views entangled qubit spacetime histories (or qubit world lines) as a generalized braid, referred to as a superbraid. The crossing of world lines can be quantum-mechanical in nature, most conveniently expressed analytically with ladder-operator-based quantum gates. At a crossing, independent world lines can become entangled. Complicated superbraids are systematically reduced by recursively applying quantum skein relations. If the superbraid is closed (e.g., representing quantum circuits with closed-loop feedback, quantum lattice gas algorithms, loop or vacuum diagrams in quantum field theory), then one can decompose the resulting superlink into an entangled superposition of classical links. Thus, one can compute a superlink invariant, for example, the Jones polynomial for the square root of a classical knot.

YakYak: Parsing with Logical Side Constraints

DEFF Research Database (Denmark)

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

2000-01-01

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

The REGENT-PLR-precompiler, execution logic

International Nuclear Information System (INIS)

Enderle, G.; Steil, A.

1976-11-01

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

What are Institutional Logics

DEFF Research Database (Denmark)

Berg Johansen, Christina; Waldorff, Susanne Boch

This study presents new insights into the explanatory power of the institutional logics perspective. With outset in a discussion of seminal theory texts, we identify two fundamental topics that frame institutional logics: overarching institutional orders guides by institutional logics, as well...... as change and agency generated by friction between logics. We use these topics as basis for an analysis of selected empirical papers, with the aim of understanding how institutional logics contribute to institutional theory at large, and which social matters institutional logics can and cannot explore...

A Concurrent Logical Relation

DEFF Research Database (Denmark)

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

2012-01-01

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

Dispositional logic

Science.gov (United States)

Le Balleur, J. C.

1988-01-01

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

Logic and structure

CERN Document Server

Dalen, Dirk

1983-01-01

A book which efficiently presents the basics of propositional and predicate logic, van Dalen’s popular textbook contains a complete treatment of elementary classical logic, using Gentzen’s Natural Deduction. Propositional and predicate logic are treated in separate chapters in a leisured but precise way. Chapter Three presents the basic facts of model theory, e.g. compactness, Skolem-Löwenheim, elementary equivalence, non-standard models, quantifier elimination, and Skolem functions. The discussion of classical logic is rounded off with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, one chapter is devoted to intuitionistic logic. Completeness is established for Kripke semantics. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property have been incorporated. The power and elegance of natural deduction is demonstrated best in the part of proof theory cal...

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

Science.gov (United States)

2011-06-22

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

Nonlinear dynamics based digital logic and circuits.

Science.gov (United States)

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

2015-01-01

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

Integration of functions in logic database systems

NARCIS (Netherlands)

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

1990-01-01

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

First-Order Hybrid Logic

DEFF Research Database (Denmark)

Braüner, Torben

2011-01-01

Hybrid logic is an extension of modal logic which allows us to refer explicitly to points of the model in the syntax of formulas. It is easy to justify interest in hybrid logic on applied grounds, with the usefulness of the additional expressive power. For example, when reasoning about time one...... often wants to build up a series of assertions about what happens at a particular instant, and standard modal formalisms do not allow this. What is less obvious is that the route hybrid logic takes to overcome this problem often actually improves the behaviour of the underlying modal formalism....... For example, it becomes far simpler to formulate proof-systems for hybrid logic, and completeness results can be proved of a generality that is simply not available in modal logic. That is, hybridization is a systematic way of remedying a number of known deficiencies of modal logic. First-order hybrid logic...

Metamathematics of fuzzy logic

CERN Document Server

Hájek, Petr

1998-01-01

This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. Some important systems of real-valued propositional and predicate calculus are defined and investigated. The aim is to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named `fuzzy inference' can be naturally understood as logical deduction.

Equational type logic

NARCIS (Netherlands)

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

1990-01-01

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

Henkin and Hybrid Logic

DEFF Research Database (Denmark)

Blackburn, Patrick Rowan; Huertas, Antonia; Manzano, Maria

2014-01-01

Leon Henkin was not a modal logician, but there is a branch of modal logic that has been deeply influenced by his work. That branch is hybrid logic, a family of logics that extend orthodox modal logic with special proposition symbols (called nominals) that name worlds. This paper explains why...... Henkin’s techniques are so important in hybrid logic. We do so by proving a completeness result for a hybrid type theory called HTT, probably the strongest hybrid logic that has yet been explored. Our completeness result builds on earlier work with a system called BHTT, or basic hybrid type theory...... is due to the first-order perspective, which lies at the heart of Henin’s best known work and hybrid logic....

Institutional Logics in Action

DEFF Research Database (Denmark)

Lounsbury, Michael; Boxenbaum, Eva

2013-01-01

This double volume presents state-of-the-art research and thinking on the dynamics of actors and institutional logics. In the introduction, we briefly sketch the roots and branches of institutional logics scholarship before turning to the new buds of research on the topic of how actors engage...... institutional logics in the course of their organizational practice. We introduce an exciting line of new works on the meta-theoretical foundations of logics, institutional logic processes, and institutional complexity and organizational responses. Collectively, the papers in this volume advance the very...... prolific stream of research on institutional logics by deepening our insight into the active use of institutional logics in organizational action and interaction, including the institutional effects of such (inter)actions....

Greek, Indian and Arabic logic

CERN Document Server

Gabbay, Dov M

2004-01-01

Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and Renaissance Logic and Logic: A History of its Central. In designing the Handbook of the History of Logic, the Editors have taken the view that the history of logic holds more than an antiquarian interest, and that a knowledge of logic's rich and sophisticated development is, in various respects, relevant to the research programmes of the present day. Ancient logic is no exception. The present volume attests to the distant origins of some of modern logic's most important features, such as can be found in the claim by the authors of t...

Simulation of mixed bond graphs and block diagrams on personal computers using TUTSIM

NARCIS (Netherlands)

Beukeboom, J.J.A.J.; van Dixhoorn, J.J.; Meerman, J.W.

1985-01-01

The TUTSIM simulation program for continuous dynamic systems accepts (nonlinear) block diagrams, bond graphs or a free mix of both. The simulation is “hands on” interactive, providing a direct contact with the model. The implementation of the program on existing personal computers (Apple II, IBM PC)

Abstract quantum computing machines and quantum computational logics

Science.gov (United States)

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

2016-06-01

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

VennDiagramWeb: a web application for the generation of highly customizable Venn and Euler diagrams.

Science.gov (United States)

Lam, Felix; Lalansingh, Christopher M; Babaran, Holly E; Wang, Zhiyuan; Prokopec, Stephenie D; Fox, Natalie S; Boutros, Paul C

2016-10-03

Visualization of data generated by high-throughput, high-dimensionality experiments is rapidly becoming a rate-limiting step in computational biology. There is an ongoing need to quickly develop high-quality visualizations that can be easily customized or incorporated into automated pipelines. This often requires an interface for manual plot modification, rapid cycles of tweaking visualization parameters, and the generation of graphics code. To facilitate this process for the generation of highly-customizable, high-resolution Venn and Euler diagrams, we introduce VennDiagramWeb: a web application for the widely used VennDiagram R package. VennDiagramWeb is hosted at http://venndiagram.res.oicr.on.ca/ . VennDiagramWeb allows real-time modification of Venn and Euler diagrams, with parameter setting through a web interface and immediate visualization of results. It allows customization of essentially all aspects of figures, but also supports integration into computational pipelines via download of R code. Users can upload data and download figures in a range of formats, and there is exhaustive support documentation. VennDiagramWeb allows the easy creation of Venn and Euler diagrams for computational biologists, and indeed many other fields. Its ability to support real-time graphics changes that are linked to downloadable code that can be integrated into automated pipelines will greatly facilitate the improved visualization of complex datasets. For application support please contact Paul.Boutros@oicr.on.ca.

Recurrence relations for three-loop prototypes of bubble diagrams with a mass

International Nuclear Information System (INIS)

Avdeev, L.V.

1995-01-01

Recurrence relations derived via the Chetyrkin-Tkachev method of integration by parts are applied to reduce scalar three-loop bubble (vacuum) diagrams with a mass to a limited number of master integrals. The reduction is implemented as a package of computer programs for analytic evaluation in FORM. The algorithms are applicable to diagrams with any integer powers on the lines in an arbitrary dimension. A physical application is the evaluation of the three-loop QCD correction to the electroweak ρ-parameter. 8 refs., 1 fig

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

Energy Technology Data Exchange (ETDEWEB)

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

2017-04-15

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

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

OpenAIRE

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

2013-01-01

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

Real Islamic Logic

NARCIS (Netherlands)

Bergstra, J.A.

2011-01-01

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

OOAspectZ and aspect-oriented UML class diagrams for Aspect-oriented software modelling (AOSM

Directory of Open Access Journals (Sweden)

Cristian Vidal Silva

2013-09-01

Full Text Available Regarding modularised software development, Aspect-oriented programming (AOP identifies and represents individually crosscutting concerns during the software development cycle’s programming stage. This article proposes and applies OOAspectZ to formal Aspect-oriented requirement specifications for prior stages of the software development cycle. It particularly concerns requirement specification and the structural design of data and behaviour, along with describing and applying Aspect-oriented UML class diagrams to designing classes, aspects and associations among classes and aspects during Aspect-oriented software development (AOSD.OOAspectZ is a language integrating both Object-Z and AspectZ formal languages whereas Aspect-oriented UML class diagrams represent AOP code, object class and crosscutting concern class structure by means of stereotypes. This article shows and applies the main OOAspectZ and AO UML class diagram characteristics to Aspect-oriented software modelling (AOSM using a classic example of AOP. Ideas for future work concerning an actual AOP version are also indicated.

What are Institutional Logics

OpenAIRE

Berg Johansen, Christina; Bock Waldorff, Susanne

2015-01-01

This study presents new insights into the explanatory power of the institutional logics perspective. With outset in a discussion of seminal theory texts, we identify two fundamental topics that frame institutional logics: overarching institutional orders guided by institutional logics, as well as change and agency generated by friction between logics. We use these topics as basis for an analysis of selected empirical papers, with the aim of understanding how institutional logics contribute to...

Genus Ranges of Chord Diagrams.

Science.gov (United States)

Burns, Jonathan; Jonoska, Nataša; Saito, Masahico

2015-04-01

A chord diagram consists of a circle, called the backbone, with line segments, called chords, whose endpoints are attached to distinct points on the circle. The genus of a chord diagram is the genus of the orientable surface obtained by thickening the backbone to an annulus and attaching bands to the inner boundary circle at the ends of each chord. Variations of this construction are considered here, where bands are possibly attached to the outer boundary circle of the annulus. The genus range of a chord diagram is the genus values over all such variations of surfaces thus obtained from a given chord diagram. Genus ranges of chord diagrams for a fixed number of chords are studied. Integer intervals that can be, and those that cannot be, realized as genus ranges are investigated. Computer calculations are presented, and play a key role in discovering and proving the properties of genus ranges.

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

International Nuclear Information System (INIS)

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

1992-01-01

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

GRAPHIC REALIZATION FOUNDATIONS OF LOGIC-SEMANTIC MODELING IN DIDACTICS

Directory of Open Access Journals (Sweden)

V. E. Steinberg

2017-01-01

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

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

Directory of Open Access Journals (Sweden)

Widasari Edita Rosana

2018-01-01

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

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

Directory of Open Access Journals (Sweden)

Hiroko Nakamura

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

ARBUS: A FORTRAN tool for generating tree structure diagrams

International Nuclear Information System (INIS)

Ferrero, C.; Zanger, M.

1992-02-01

The FORTRAN77 stand-alone code ARBUS has been designed to aid the user by providing a tree structure diagram generating utility for computer programs written in FORTRAN language. This report is intended to describe the main purpose and features of ARBUS and to highlight some additional applications of the code by means of practical test cases. (orig.) [de

Compact representations for the design of quantum logic

CERN Document Server

Niemann, Philipp

2017-01-01

This book discusses modern approaches and challenges of computer-aided design (CAD) of quantum circuits with a view to providing compact representations of quantum functionality. Focusing on the issue of quantum functionality, it presents Quantum Multiple-Valued Decision Diagrams (QMDDs – a means of compactly and efficiently representing and manipulating quantum logic. For future quantum computers, going well beyond the size of present-day prototypes, the manual design of quantum circuits that realize a given (quantum) functionality on these devices is no longer an option. In order to keep up with the technological advances, methods need to be provided which, similar to the design and synthesis of conventional circuits, automatically generate a circuit description of the desired functionality. To this end, an efficient representation of the desired quantum functionality is of the essence. While straightforward representations are restricted due to their (exponentially) large matrix descriptions and other de...

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

Directory of Open Access Journals (Sweden)

V. I. Freyman

2015-11-01

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

Collaborative diagramming during problem based learning in medical education: Do computerized diagrams support basic science knowledge construction?

Science.gov (United States)

De Leng, Bas; Gijlers, Hannie

2015-05-01

To examine how collaborative diagramming affects discussion and knowledge construction when learning complex basic science topics in medical education, including its effectiveness in the reformulation phase of problem-based learning. Opinions and perceptions of students (n = 70) and tutors (n = 4) who used collaborative diagramming in tutorial groups were collected with a questionnaire and focus group discussions. A framework derived from the analysis of discourse in computer-supported collaborative leaning was used to construct the questionnaire. Video observations were used during the focus group discussions. Both students and tutors felt that collaborative diagramming positively affected discussion and knowledge construction. Students particularly appreciated that diagrams helped them to structure knowledge, to develop an overview of topics, and stimulated them to find relationships between topics. Tutors emphasized that diagramming increased interaction and enhanced the focus and detail of the discussion. Favourable conditions were the following: working with a shared whiteboard, using a diagram format that facilitated distribution, and applying half filled-in diagrams for non-content expert tutors and\\or for heterogeneous groups with low achieving students. The empirical findings in this study support the findings of earlier more descriptive studies that diagramming in a collaborative setting is valuable for learning complex knowledge in medicine.

Some remarks on non-planar Feynman diagrams

International Nuclear Information System (INIS)

Bielas, Krzysztof; Dubovyk, Ievgen; Gluza, Janusz

2013-12-01

Two criteria for planarity of a Feynman diagram upon its propagators (momentum ows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while one can planarize non-planar graphs by embedding them on higher-genus surfaces (in the example it is a torus), there is still a problem with defining appropriate dual variables since the corresponding faces of the graph are absorbed by torus generators.

Some remarks on non-planar Feynman diagrams

Energy Technology Data Exchange (ETDEWEB)

Bielas, Krzysztof; Dubovyk, Ievgen; Gluza, Janusz [Silesia Univ., Katowice (Poland). Inst. of Physics; Riemann, Tord [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)

2013-12-15

Two criteria for planarity of a Feynman diagram upon its propagators (momentum ows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while one can planarize non-planar graphs by embedding them on higher-genus surfaces (in the example it is a torus), there is still a problem with defining appropriate dual variables since the corresponding faces of the graph are absorbed by torus generators.

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

Science.gov (United States)

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

2003-07-01

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

Concurrent weighted logic

DEFF Research Database (Denmark)

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

2015-01-01

We introduce Concurrent Weighted Logic (CWL), a multimodal logic for concurrent labeled weighted transition systems (LWSs). The synchronization of LWSs is described using dedicated functions that, in various concurrency paradigms, allow us to encode the compositionality of LWSs. To reflect these......-completeness results for this logic. To complete these proofs we involve advanced topological techniques from Model Theory....

Computer Programs for Sun and Moon Illuminance with Contingent Tables and Diagrams

Science.gov (United States)

1987-02-19

data provided by the computer routines are also available from the tables and diagrams. Tables required for manual calculation of the Moon’s...8217 Winona MONTANA 104 45 Albion 110 45 Alpine 113 46 Anaconda 114 49 Apgar 104 46 Baker 110 48 Big Sandy 110 46 Big Timber 109 46 Billings 107

Logic-based aggregation methods for ranking student applicants

Directory of Open Access Journals (Sweden)

Milošević Pavle

2017-01-01

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

Action Type Deontic Logic

DEFF Research Database (Denmark)

Bentzen, Martin Mose

2014-01-01

A new deontic logic, Action Type Deontic Logic, is presented. To motivate this logic, a number of benchmark cases are shown, representing inferences a deontic logic should validate. Some of the benchmark cases are singled out for further comments and some formal approaches to deontic reasoning...... are evaluated with respect to the benchmark cases. After that follows an informal introduction to the ideas behind the formal semantics, focussing on the distinction between action types and action tokens. Then the syntax and semantics of Action Type Deontic Logic is presented and it is shown to meet...

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

Asymptotic laws for random knot diagrams

Science.gov (United States)

Chapman, Harrison

2017-06-01

We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices n, as first established in recent work with Cantarella and Mastin. The knot diagram model is an exciting new model which captures both the random geometry of space curve models of knotting as well as the ease of computing invariants from diagrams. We prove that unknot diagrams are asymptotically exponentially rare, an analogue of Sumners and Whittington’s landmark result for self-avoiding polygons. Our proof uses the same key idea: we first show that knot diagrams obey a pattern theorem, which describes their fractal structure. We examine how quickly this behavior occurs in practice. As a consequence, almost all diagrams are asymmetric, simplifying sampling from this model. We conclude with experimental data on knotting in this model. This model of random knotting is similar to those studied by Diao et al, and Dunfield et al.

Quantifiers for quantum logic

OpenAIRE

Heunen, Chris

2008-01-01

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

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

Science.gov (United States)

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

2017-11-20

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

Drawing Euler Diagrams with Circles

OpenAIRE

Stapleton, Gem; Zhang, Leishi; Howse, John; Rodgers, Peter

2010-01-01

Euler diagrams are a popular and intuitive visualization tool which are used in a wide variety of application areas, including biological and medical data analysis. As with other data visualization methods, such as graphs, bar charts, or pie charts, the automated generation of an Euler diagram from a suitable data set would be advantageous, removing the burden of manual data analysis and the subsequent task of drawing an appropriate diagram. Various methods have emerged that automatically dra...

Neutrosophic Probability, Set, And Logic (first version)

OpenAIRE

Smarandache, Florentin

2000-01-01

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

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

Directory of Open Access Journals (Sweden)

Abdullah Alper Efe

2018-01-01

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

Planning using dynamic epistemic logic: Correspondence and complexity

DEFF Research Database (Denmark)

Jensen, Martin Holm

2013-01-01

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

Introduction to type-2 fuzzy logic control theory and applications

CERN Document Server

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

2014-01-01

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

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

Science.gov (United States)

2015-01-01

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

Thermodynamic study of CVD-ZrO2 phase diagrams

International Nuclear Information System (INIS)

Torres-Huerta, A.M.; Vargas-Garcia, J.R.; Dominguez-Crespo, M.A.; Romero-Serrano, J.A.

2009-01-01

Chemical vapor deposition (CVD) of zirconium oxide (ZrO 2 ) from zirconium acetylacetonate Zr(acac) 4 has been thermodynamically investigated using the Gibbs' free energy minimization method and the FACTSAGE program. Thermodynamic data Cp o , ΔH o and S o for Zr(acac) 4 have been estimated using the Meghreblian-Crawford-Parr and Benson methods because they are not available in the literature. The effect of deposition parameters, such as temperature and pressure, on the extension of the region where pure ZrO 2 can be deposited was analyzed. The results are presented as calculated CVD stability diagrams. The phase diagrams showed two zones, one of them corresponds to pure monoclinic phase of ZrO 2 and the other one corresponds to a mix of monoclinic phase of ZrO 2 and graphite carbon.

Logic delays of 5-μm resistor coupled Josephson logic

International Nuclear Information System (INIS)

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

1982-01-01

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

Radiation tolerant combinational logic cell

Science.gov (United States)

Maki, Gary R. (Inventor); Gambles, Jody W. (Inventor); Whitaker, Sterling (Inventor)

2009-01-01

A system has a reduced sensitivity to Single Event Upset and/or Single Event Transient(s) compared to traditional logic devices. In a particular embodiment, the system includes an input, a logic block, a bias stage, a state machine, and an output. The logic block is coupled to the input. The logic block is for implementing a logic function, receiving a data set via the input, and generating a result f by applying the data set to the logic function. The bias stage is coupled to the logic block. The bias stage is for receiving the result from the logic block and presenting it to the state machine. The state machine is coupled to the bias stage. The state machine is for receiving, via the bias stage, the result generated by the logic block. The state machine is configured to retain a state value for the system. The state value is typically based on the result generated by the logic block. The output is coupled to the state machine. The output is for providing the value stored by the state machine. Some embodiments of the invention produce dual rail outputs Q and Q'. The logic block typically contains combinational logic and is similar, in size and transistor configuration, to a conventional CMOS combinational logic design. However, only a very small portion of the circuits of these embodiments, is sensitive to Single Event Upset and/or Single Event Transients.

Erotetic epistemic logic

Czech Academy of Sciences Publication Activity Database

Peliš, Michal

2017-01-01

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

Universal file processing program for field programmable integrated circuits

International Nuclear Information System (INIS)

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

1985-01-01

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

The Football of Logic

Directory of Open Access Journals (Sweden)

Schang Fabien

2017-03-01

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

Spent nuclear fuels project: FY 1995 multi-year program plan, WBS {number_sign}1.4

Energy Technology Data Exchange (ETDEWEB)

Denning, J.L.

1994-09-01

The mission of the Spent Nuclear Fuel (SNF) program is to safely, reliably, and efficiently manage, condition, transport, and store Department of Energy (DOE)-owned SNF, so that it meets acceptance criteria for disposal in a permanent repository. The Hanford Site Spent Nuclear Fuel strategic plan for accomplishing the project mission is: Establish near-term safe storage in the 105-K Basins; Complete national Environmental Policy Act (NEPA) process to obtain a decision on how and where spent nuclear fuel will be managed on the site; Define and establish alternative interim storage on site or transport off site to support implementation of the NEPA decision; and Define and establish a waste package qualified for final disposition. This report contains descriptions of the following: Work Breakdown Structure; WBS Dictionary; Responsibility Assignment Matrix; Program Logic Diagrams; Program Master Baseline Schedule; Program Performance Baseline Schedule; Milestone List; Milestone Description Sheets; Cost Baseline Summary by Year; Basis of Estimate; Waste Type Data; Planned Staffing; and Fiscal Year Work Plan.

Spent nuclear fuels project: FY 1995 multi-year program plan, WBS number-sign 1.4

International Nuclear Information System (INIS)

Denning, J.L.

1994-09-01

The mission of the Spent Nuclear Fuel (SNF) program is to safely, reliably, and efficiently manage, condition, transport, and store Department of Energy (DOE)-owned SNF, so that it meets acceptance criteria for disposal in a permanent repository. The Hanford Site Spent Nuclear Fuel strategic plan for accomplishing the project mission is: Establish near-term safe storage in the 105-K Basins; Complete national Environmental Policy Act (NEPA) process to obtain a decision on how and where spent nuclear fuel will be managed on the site; Define and establish alternative interim storage on site or transport off site to support implementation of the NEPA decision; and Define and establish a waste package qualified for final disposition. This report contains descriptions of the following: Work Breakdown Structure; WBS Dictionary; Responsibility Assignment Matrix; Program Logic Diagrams; Program Master Baseline Schedule; Program Performance Baseline Schedule; Milestone List; Milestone Description Sheets; Cost Baseline Summary by Year; Basis of Estimate; Waste Type Data; Planned Staffing; and Fiscal Year Work Plan

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

Directory of Open Access Journals (Sweden)

Baltasar Trancón y Widemann

2017-01-01

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

The Logic of Practice in the Practice of Logics

DEFF Research Database (Denmark)

Raviola, Elena; Dubini, Paola

2016-01-01

of logics through a six months full-time ethnographic study at Il Sole-24 Ore, the largest Italian financial newspaper, between 2007 and 2008. An original conceptual framework is developed to analyse how the logic of journalism is enacted vis-à-vis that of advertising in a setting in which an old technology...... for news production – print newspaper – coexists with a new one – website – and thus encounters between new and old technological possibilities make workings of institutional logics particularly visible. The findings point out different mechanisms of institutional work dealing with actions that, made...

A Rewriting Logic Approach to Type Inference

Science.gov (United States)

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

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

Evaluation Framework for Telemedicine Using the Logical Framework Approach and a Fishbone Diagram.

Science.gov (United States)

Chang, Hyejung

2015-10-01

Technological advances using telemedicine and telehealth are growing in healthcare fields, but the evaluation framework for them is inconsistent and limited. This paper suggests a comprehensive evaluation framework for telemedicine system implementation and will support related stakeholders' decision-making by promoting general understanding, and resolving arguments and controversies. This study focused on developing a comprehensive evaluation framework by summarizing themes across the range of evaluation techniques and organized foundational evaluation frameworks generally applicable through studies and cases of diverse telemedicine. Evaluation factors related to aspects of information technology; the evaluation of satisfaction of service providers and consumers, cost, quality, and information security are organized using the fishbone diagram. It was not easy to develop a monitoring and evaluation framework for telemedicine since evaluation frameworks for telemedicine are very complex with many potential inputs, activities, outputs, outcomes, and stakeholders. A conceptual framework was developed that incorporates the key dimensions that need to be considered in the evaluation of telehealth implementation for a formal structured approach to the evaluation of a service. The suggested framework consists of six major dimensions and the subsequent branches for each dimension. To implement telemedicine and telehealth services, stakeholders should make decisions based on sufficient evidence in quality and safety measured by the comprehensive evaluation framework. Further work would be valuable in applying more comprehensive evaluations to verify and improve the comprehensive framework across a variety of contexts with more factors and participant group dimensions.

A fast-slow logic system

International Nuclear Information System (INIS)

Kawashima, Hideo.

1977-01-01

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

An Embedded Reconfigurable Logic Module

Science.gov (United States)

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

2002-01-01

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

Scaffold hopping in drug discovery using inductive logic programming.

Science.gov (United States)

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

2008-05-01

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

An Innovative Fuzzy-Logic-Based Methodology for Trend Identification

International Nuclear Information System (INIS)

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

2001-01-01

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

Logic for Physicists

Science.gov (United States)

Pereyra, Nicolas A.

2018-06-01

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

Logic of likelihood

International Nuclear Information System (INIS)

Wall, M.J.W.

1992-01-01

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

A Logic Model for Evaluating the Academic Health Department.

Science.gov (United States)

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

2016-01-01

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

SISTEM PENGEMBANGAN KENDALI FUZZY LOGIC BERBASIS MIKROKONTROLER KELUARGA MCS51 (PetraFuz