Energy Technology Data Exchange (ETDEWEB)
1993-09-01
The Oak Ridge National Laboratory Technology Logic Diagram (TLD) was developed to provide a decision support tool that relates environmental restoration (ER) and waste management (WM) problems at Oak Ridge National Laboratory (ORNL) to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration, testing, and evaluation needed to develop these technologies to a state that allows technology transfer and application to decontamination and decommissioning (D&D), remedial action (RA), and WM activities. The TLD consists of three fundamentally separate volumes: Vol. 1 (Technology Evaluation), Vol. 2 (Technology Logic Diagram), and Vol. 3 (Technology Evaluation Data Sheets). Part A of Vols. 1. and 2 focuses on D&D. Part B of Vols. 1 and 2 focuses on the RA of contaminated facilities. Part C of Vols. 1 and 2 focuses on WM. Each part of Vol. 1 contains an overview of the TLD, an explanation of the program-specific responsibilities, a review of identified technologies, and the rankings of remedial technologies. Volume 2 (Pts. A, B, and C) contains the logic linkages among EM goals, environmental problems, and the various technologies that have the potential to solve these problems. Volume 3 (Pts. A, B, and C) contains the TLD data sheets. Remedial action is the focus of Vol. 2, Pt. B, which has been divided into the three necessary subelements of the RA: characterization, RA, and robotics and automation. Each of these sections address general ORNL problems, which are then broken down by problem area/constituents and linked to potential remedial technologies. The diagrams also contain summary information about a technology`s status, its science and technology needs, and its implementation needs.
Computer Aided Design Of Relay Ladder Logic Via State Transition Diagram
Devanathan, R.; Kuan, Foo Y.; Jun, Chang C.; Aun, Choo S.
1987-10-01
Programmable logic controllers (PLCs) are commonly programmed using relay ladder logic. There are many disadvantages to this approach. The state transition diagram affords a systematic means of providing precise and unambiguous specification while at the same time yielding a good system overview for ease of troubleshooting and maintenance. Computer aided logic design techniques help to automate the process of relay logic design for the state transition diagram. A software package which runs on an IBM PC/compatible machine has been developed to automatically transform the state diagram specification into relay ladder logic and the associated (PLC dependent) source code.
Oak Ridge K-25 Site Technology Logic Diagram. Volume 2, Technology Logic Diagrams
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 envirorunental 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. This volume, Volume 2, contains logic diagrams with an index. Volume 3 has been divided into two separate volumes to facilitate handling and use.
Inductive Temporal Logic Programming
Kolter, Robert
2009-01-01
We study the extension of techniques from Inductive Logic Programming (ILP) to temporal logic programming languages. Therefore we present two temporal logic programming languages and analyse the learnability of programs from these languages from finite sets of examples. In first order temporal logic the following topics are analysed: - How can we characterize the denotational semantics of programs? - Which proof techniques are best suited? - How complex is the learning task? In propositional ...
UML activity diagrams in requirements specification of logic controllers
Grobelna, Iwona; Grobelny, Michał
2015-12-01
Logic controller specification can be prepared using various techniques. One of them is the wide understandable and user-friendly UML language and its activity diagrams. Using formal methods during the design phase increases the assurance that implemented system meets the project requirements. In the approach we use the model checking technique to formally verify a specification against user-defined behavioral requirements. The properties are usually defined as temporal logic formulas. In the paper we propose to use UML activity diagrams in requirements definition and then to formalize them as temporal logic formulas. As a result, UML activity diagrams can be used both for logic controller specification and for requirements definition, what simplifies the specification and verification process.
Adding a Dimension to Logic Diagramming
Goldstein, Laurence
2011-01-01
A blind learner needs some method other than Venn diagrams to test syllogisms for validity. I present here a sketch of a three-dimensional apparatus, Sylloid, invented to fill this need and to inculcate deep learning rather than the mere ability to get answers right. What one learns in the design process is then used in designing a successor, Son of Sylloid, for sighted users that is pedagogically superior to Venn diagrams. This dog-legged approach to materials design is of wide application: ...
Program Synthesizes UML Sequence Diagrams
Barry, Matthew R.; Osborne, Richard N.
2006-01-01
A computer program called "Rational Sequence" generates Universal Modeling Language (UML) sequence diagrams of a target Java program running on a Java virtual machine (JVM). Rational Sequence thereby performs a reverse engineering function that aids in the design documentation of the target Java program. Whereas previously, the construction of sequence diagrams was a tedious manual process, Rational Sequence generates UML sequence diagrams automatically from the running Java code.
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.
UML activity diagram swimlanes in logic controller design
Grobelny, Michał; Grobelna, Iwona
2015-12-01
Logic controller behavior can be specified using various techniques, including UML activity diagrams and control Petri nets. Each technique has its advantages and disadvantages. Application of both specification types in one project allows to take benefits from both of them. Additional elements of UML models make it possible to divide a specification into some parts, considered from other point of view (logic controller, user or system). The paper introduces an idea to use UML activity diagrams with swimlanes to increase the understandability of design models.
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)
Oak Ridge K-25 Site Technology Logic Diagram
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 envirorunental 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. This volume, Volume 2, contains logic diagrams with an index. Volume 3 has been divided into two separate volumes to facilitate handling and use.
Oak Ridge K-25 Site Technology Logic Diagram
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.
Logic Programming for Linguistics
DEFF Research Database (Denmark)
Christiansen, Henning
2010-01-01
This article gives a short introduction on how to get started with logic pro- gramming in Prolog that does not require any previous programming expe- rience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what...... a computer is, can follow the text. I cannot, of course, cover all aspects of logic programming in this text, and so we give references to other sources with more details. Students of linguistics must have a very good motivation to spend time on programming, and I show here how logic programming can be used...... for modelling different linguistic phenomena. When modelling language in this way, as opposed to using only paper and pencil, your models go live: you can run and test your models and you can use them as automatic language analyzers. This way you will get a better understanding of the dynamics of languages...
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. 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. The TLD consists of three fundamentally separate volumes: Vol. 1 (Technology Evaluation), Vol. 2 (Technology Logic Diagram), and Vol. 3 (Technology Evaluation Data Sheets). 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 2 has been divided into five sections: Characterization, Decontamination, Dismantlement, Robotics/Automation, and Waste Management. Each section contains logical breakdowns of the Y-12 D and D problems by subject area and identifies technologies that can be reasonably applied to each D and D challenge.
Oak Ridge K-25 Site Technology Logic Diagram
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.
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
Oak Ridge K-25 Site Technology Logic Diagram
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.
Quantum probabilistic logic programming
Balu, Radhakrishnan
2015-05-01
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
Oak Ridge National Laboratory Technology Logic Diagram. Indexes
Energy Technology Data Exchange (ETDEWEB)
1993-09-01
The Decontamination and Decommissioning (D&D) Index provides a comprehensive list of site problems, problem area/constituents, remedial technologies, and regulatory terms discussed in the D&D sections of the Oak Ridge National Laboratory Technology Logic Diagram. All entries provide specific page numbers, or cross-reference entries that provide specific page numbers, in the D&D volumes (Vol. 1, Pt. A; Vol. 2, Pt. A; and appropriate parts of Vol. 3). The Oak Ridge National Laboratory Technology (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. 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 finding an optimum mix of technologies that will provide a socially acceptable balance between cost and risk.
Y-12 Plant Remedial Action technology logic diagram. Volume I: Technology evaluation
Energy Technology Data Exchange (ETDEWEB)
NONE
1994-09-01
The Y-12 Plant Remedial Action Program addresses remediation of the contaminated groundwater, surface water and soil in the following areas located on the Oak Ridge Reservation: Chestnut Ridge, Bear Creek Valley, the Upper and Lower East Fork Popular Creek Watersheds, CAPCA 1, which includes several areas in which remediation has been completed, and CAPCA 2, which includes dense nonaqueous phase liquid wells and a storage facility. There are many facilities within these areas that are contaminated by uranium, mercury, organics, and other materials. This Technology Logic Diagram identifies possible remediation technologies that can be applied to the soil, water, and contaminants for characterization, treatment, and waste management technology options are supplemented by identification of possible robotics or automation technologies. These would facilitate the cleanup effort by improving safety, of remediation, improving the final remediation product, or decreasing the remediation cost. The Technology Logic Diagram was prepared by a diverse group of more than 35 scientists and engineers from across the Oak Ridge Reservation. Most are specialists in the areas of their contributions. 22 refs., 25 tabs.
Energy Technology Data Exchange (ETDEWEB)
1993-09-01
The Oak Ridge National Laboratory Technology Logic Diagram (TLD) was developed to provide a decision-support tool that relates environmental restoration (ER) and waste management (WM) problems at Oak Ridge National Laboratory (ORNL) to potential technologies that can remediate these problems. The TLD identifies the research, development, demonstration, testing, and evaluation needed to develop these technologies to a state that allows technology transfer and application to decontamination and decommissioning (D&D), remedial action (RA), and WM activities. The TLD consists of three fundamentally separate volumes: Vol. 1 (Technology Evaluation), Vol. 2 (Technology Logic Diagram), and Vol. 3 (Technology Evaluation Data Sheets). Part A of Vols. 1 and 2 focuses on D&D. Part B of Vols. 1 and 2 focuses on RA of contaminated facilities. Part C of Vols. 1 and 2 focuses on WM. Each part of Vol. 1 contains an overview of the TLD, an explanation of the program-specific responsibilities, a review of identified technologies, and the ranking os remedial technologies. Volume 2 (Pts. A, B, and C) contains the logic linkages among EM goals, environmental problems, and the various technologies that have the potential to solve these problems. Volume 3 (Pts. A, B, and C) contains the TLD data sheets. The focus of Vol. 1, Pt. B, is RA, and it has been divided into six chapters. The first chapter is an introduction, which defines problems specific to the ER Program for ORNL. Chapter 2 provides a general overview of the TLD. Chapters 3 through 5 are organized into necessary subelement categories: RA, characterization, and robotics and automation. The final chapter contains regulatory compliance information concerning RA.
Combinational Logic-Level Verification using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1997-01-01
of BDDs. This paper demonstrates that BEDs are well suited for solving the combinational logic-level verification problem which is, given two combinational circuits, to determine whether they implement the same Boolean functions. Based on all combinational circuits in the ISCAS 85 and LGSynth 91...
Phonotactics in inductive logic programming
Nerbonne, J.; Konstantopoulos, S.; Klopotek, M.A.; Wierzchon, S.T.; Trojanowski, K.
2004-01-01
We examine the results of applying inductive logic programming (ILP) to a relatively simple linguistic task, that of recognizing monosyllables in one language. ILP is suited to linguistic problems given linguists' preference for formulating their theories in discrete rules, and because of ILP's
Induction of Linear Temporal Logic Programs
Kolter, Robert
2017-01-01
We propose a framework for the synthesis of temporal logic programs which are formulated in a simple temporal logic programming language from both positive and negative examples. First we will prove that results from the theory of first order inductive logic programming carry over to the domain of temporal logic. After this we will show how programs formulated in the presented language can be generalized or specialized in order to satisfy the specification induced by the sets of examples.
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 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 TLD, 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. The data sheets are arranged alphanumerically by the TEDS code number in the upper right comer of each sheet.
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.
Mort User's Manual: For use with the Management Oversight and Risk Tree analytical logic diagram
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 1500 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.
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.
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....
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.
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 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.
Role of logic programming in computer studies
Directory of Open Access Journals (Sweden)
Nicolae PELIN
2016-09-01
Full Text Available The paper contains the analysis of the opinions of a number of scholars and specialists on the importance and the role in logic programming methodology of studying computer science, philosophy about the logic programs and interpreter, concerning the burden of which is opposite to the programmer if there is logic interpreter. The presented material is meant, according to the author, to help the reader to understand more easily the analyzed multilateral problem.
Implicit and explicit negation in logic programming
Jonker, C.M.
The focus of the research is the semantics of logic programming. Concepts in the currently used semantics like negation as failure, the Closed World Assumption and multivalued interpretations need to be thoroughly understood in order to develop semantics for extensions of the logic programming
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.
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.
Discovering Classes of Strongly Equivalent Logic Programs
Chen, Y.; Lin, F.
2011-01-01
In this paper we apply computer-aided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules that preserve strong equivalence. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a rule and the empty set, between two rules, between t...
Mathematical aspects of logic programming semantics
Hitzler, Pascal
2010-01-01
Covering the authors' own state-of-the-art research results, Mathematical Aspects of Logic Programming Semantics presents a rigorous, modern account of the mathematical methods and tools required for the semantic analysis of logic programs. It significantly extends the tools and methods from traditional order theory to include nonconventional methods from mathematical analysis that depend on topology, domain theory, generalized distance functions, and associated fixed-point theory.The book covers topics spanning the period from the early days of logic programming to current times. It discusses
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.
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.
Abstract Interpretation of PIC programs through Logic Programming
DEFF Research Database (Denmark)
Henriksen, Kim Steen; Gallagher, John Patrick
2006-01-01
A logic based general approach to abstract interpretation of low-level machine programs is reported. It is based on modelling the behavior of the machine as a logic program. General purpose program analysis and transformation of logic programs, such as partial evaluation and convex hull analysis....... 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...
The lazy functional side of logic programming
Etalle, Sandro; Lau, K.K.; Mountjoy, Jon
In this paper we show, among other things, that logical structures such as di erence lists have a natural counterpart in lazy functional programs; i.e. that most programs using di erence-lists are functional in nature. This shows immediately that many common non-well-moded programs are functional in
Implementation issues in Inductive Logic Programming
Kolter, Robert
2017-01-01
We propose several algorithms for efficient Testing of logical Implication in the case of ground objects. Because the problem of Testing a set of propositional formulas for (un)satisfiability is \\(NP\\)-complete there's strong evidence that there exist examples for which every algorithm which solves the problem of testing for (un)satisfiability has a runtime that is exponential in the length of the input. So will have our algorithms. We will therefore point out classes of logic programs for wh...
Belief Logic Programming with Cyclic Dependencies
Wan, Hui
Our previous work [26] introduced Belief Logic Programming (BLP), a novel form of quantitative logic programming with correlation of evidence. Unlike other quantitative approaches to logic programming, this new theory is able to provide accurate conclusions in the presence of uncertainty when the sources of information are not independent. However, the semantics defined in [26] is not sufficiently general—it does not allow cyclic dependencies among beliefs, which is a serious limitation of expressive power. This paper extends the semantics of BLP to allow cyclic dependencies. We show that the new semantics is backward compatible with the semantics for acyclic BLP and has the expected properties. The results are illustrated with examples of inference in a simple diagnostic expert system.
Testing Automation of Context-Oriented Programs Using Separation Logic
National Research Council Canada - National Science Library
El-Zawawy, Mohamed A
2014-01-01
.... 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.
Programming Cognitive Agents in Defeasible Logic
M. Dastani; G. Governatori; A. Rotolo; L.W.N. van der Torre (Leon)
2005-01-01
htmlabstractDefeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference procedures. We discuss patterns of agent types in this setting. Finally,
Fierens, Daan
2009-01-01
A significant part of current research on (inductive) logic programming deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. There is currently a great need for insight into the relationships between all these languages. One kind of languages are those that extend probabilistic models with elements of logic, such as the language of Logical Bayesian Networks (LBNs). Some other languages follow the converse str...
A Program Transformation for Backwards Analysis of Logic Programs
DEFF Research Database (Denmark)
Gallagher, John Patrick
2003-01-01
programs presented here is based on a transformation of the input program, which makes explicit the dependencies of the given program points on the initial goals. The transformation is derived from the resultants semantics of logic programs. The transformed program is then analysed using a standard...... framework and no special properties of the abstract domain....
The Family of Concurrent Logic Programming Languages
1989-05-01
concurrent logic programming can be found in [162]. Procs pipes: linear press networks The following program is a parallel implementation of the Sieve of... Eratosthenes [163]. It consists of a process generating all integers in the desired range, and a set of filter proceses, one per prime number found...computation terminates or deadlocks. To improve upon this the guard sake~o(L) can be added to the other clauses of the meta-interpreter. This ensures that
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......, properties etc.). Syntax and semantic analysis is done in a framework of Definite Clause Grammars extended with Constraint Handling Rules, which generalizes previous approaches with a direct way to express domain knowledge utilized in the interpretation process as well as stating explicit rules for pronoun...
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.
AppLP: A Dialogue on Applications of Logic Programming
Warren, David S.; Liu, Yanhong A.
2017-01-01
This document describes the contributions of the 2016 Applications of Logic Programming Workshop (AppLP), which was held on October 17 and associated with the International Conference on Logic Programming (ICLP) in Flushing, New York City.
ALPES: an advanced logic programming environment
Directory of Open Access Journals (Sweden)
Cristina Ruggieri
1988-11-01
Full Text Available This paper introduces a software programming environment for an extended Prolog language, called ALPES. The purpose of ALPES is to enable a logic programming paradigm to become a software engineering tool to design, develop and prototype traditional software systems, as well as artificial intelligence applications. The key structuring concepts for programs, as well as for the system architecture as a whole are those of contexts, processes and communication. The software design and development methodologies induced by the use of the Alpes-Prolog language have been incrementally used to develop the environment itself. This research was conducted under the Esprit projects P973 (ALPES.
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.
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.
On Modular Termination Proofs of General Logic Programs
Bossi, Annalisa; Cocco, Nicoletta; Etalle, Sandro; Rossi, Sabina
2002-01-01
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider programs consisting of a hierarchy of modules and supply a
Improvements to the adaptive maneuvering logic program
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.
ALPprolog --- A New Logic Programming Method for Dynamic Domains
Drescher, Conrad; Thielscher, Michael
2011-01-01
Logic programming is a powerful paradigm for programming autonomous agents in dynamic domains, as witnessed by languages such as Golog and Flux. In this work we present ALPprolog, an expressive, yet efficient, logic programming language for the online control of agents that have to reason about incomplete information and sensing actions.
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.
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.
Three-valued completion for abductive logic programs
Teusink, F. (Frank)
1994-01-01
textabstractThere is a growing interest in ways to represent incomplete information in logic programs. It has been shown that limited forms abduction can be used quite elegantly for this purpose. In this paper, we propose a a three-valued completion semantics for abductive logic programs, which
The Haskell Road to Logic, Maths and Programming, Second Edition
H.C. Doets; D.J.N. van Eijck (Jan)
2012-01-01
textabstractThe purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. The programming language that will be our tool for this is Haskell, a member of the Lisp family. Haskell emerged in the last decade as a
Core TuLiP - Logic Programming for Trust Management
Czenko, M.R.; Etalle, Sandro; Dahl, V.; Niemelä, I.
2007-01-01
We propose CoreTuLiP - the core of a trust management language based on Logic Programming. CoreTuLiP is based on a subset of moded logic programming, but enjoys the features of TM languages such as RT; in particular clauses are issued by different authorities and stored in a distributed manner. We
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.
Research on teacher education programs: logic model approach.
Newton, Xiaoxia A; Poon, Rebecca C; Nunes, Nicole L; Stone, Elisa M
2013-02-01
Teacher education programs in the United States face increasing pressure to demonstrate their effectiveness through pupils' learning gains in classrooms where program graduates teach. The link between teacher candidates' learning in teacher education programs and pupils' learning in K-12 classrooms implicit in the policy discourse suggests a one-to-one correspondence. However, the logical steps leading from what teacher candidates have learned in their programs to what they are doing in classrooms that may contribute to their pupils' learning are anything but straightforward. In this paper, we argue that the logic model approach from scholarship on evaluation can enhance research on teacher education by making explicit the logical links between program processes and intended outcomes. We demonstrate the usefulness of the logic model approach through our own work on designing a longitudinal study that focuses on examining the process and impact of an undergraduate mathematics and science teacher education program. Copyright © 2012 Elsevier Ltd. All rights reserved.
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.
Evaluation Framework for Telemedicine Using the Logical Framework Approach and a Fishbone Diagram
2015-01-01
Objectives 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. Methods 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. Results 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. Conclusions 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. PMID:26618028
Evaluation Framework for Telemedicine Using the Logical Framework Approach and a Fishbone Diagram.
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.
Pengines: Web Logic Programming Made Easy
Lager, T.; Wielemaker, J.
2014-01-01
When developing a (web) interface for a deductive database, functionality required by the client is provided by means of HTTP handlers that wrap the logical data access predicates. These handlers are responsible for converting between client and server data representations and typically include
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...... probabilistic versions of abductive logic programming, the approach is characterized by higher generality and a flexible and adaptable architecture which incorporates integrity constraints and interaction with external constraint solvers. A PALP is transformed in a systematic way into a CHR program which serves...
Probabilistic Abductive Logic Programming in Constraint Handling Rules
DEFF Research Database (Denmark)
Christiansen, Henning
probabilistic versions of abductive logic programming, the approach is characterized by higher generality and a flexible and adaptable architecture which incorporates integrity constraints and interaction with external constraint solvers. % A PALP is translated in a systematic way into a CHR program which...
Minimal founded semantics for disjunctive logic programs and deductive databases
Furfaro, Filippo; Greco, Gianluigi; Greco, Sergio
2003-01-01
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which ...
Post optimization paradigm in maximum 3-satisfiability logic programming
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.
Using Logic Programming to Detect Activities in Pervasive Healthcare
DEFF Research Database (Denmark)
Christensen, Henrik Bærbak
2002-01-01
In this experience paper we present a case study in using logic programming in a pervasive computing project in the healthcare domain. An expert system is used to detect healthcare activities in a pervasive hospital environment where positions of people and things are tracked. Based on detected...... given to specific patients. We describe the role of logic programming in the infrastructure and discuss the benefits and problems of using logic programming in a pervasive context....... activities an activity-driven computing infrastructure provides computational assistance to healthcare staff on mobile-and pervasive computing equipment. Assistance range from simple activities like fast log-in into the electronic patient medical record system to complex activities like signing for medicine...
A Semantics for Modular General Logic Programs
Etalle, Sandro
1998-01-01
Modular programs are built as a combination of separate modules, which may be developed and verified separately. Therefore, in order to reason over such programs, compositionality plays a crucial role: the semantics of the whole program must be obtainable as a simple function from the semantics of
Proving program inclusion using Hoare's logic
Bergstra, J.A.; Klop, J.W.
1984-01-01
We explore conservative refinements of specifications. These form a quite appropriate framework for a proof theory for program inclusion based on a proof theory for program correctness. We propose two formalized proof methods for program inclusion and prove these to be sound. Both methods are
Contour tracking and corner detection in a logic programming environment
DEFF Research Database (Denmark)
Bell, Benjamin; Pau, L. F.
1990-01-01
The added functionality such as contour tracking and corner detection which logic programming lends to standard image operators is described. An environment for implementing low-level imaging operations with Prolog predicates is considered. Within this environment, higher-level image predicates...... (contour tracking and corner detection) are constructed. The emphasis is not on building better corner detectors, but on presenting ways of using the unification and backtracking features of logic programming for these tasks. The performance of this implementation of contour tracking and corner detection...
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.
Optical Neural Network Models Applied To Logic Program Execution
Stormon, Charles D.
1988-05-01
Logic programming is being used extensively by Artificial Intelligence researchers to solve problems including natural language processing and expert systems. These languages, of which Prolog is the most widely used, promise to revolutionize software engineering, but much greater performance is needed. Researchers have demonstrated the applicability of neural network models to the solution of certain NP-complete problems, but these methods are not obviously applicable to the execution of logic programs. This paper outlines the use of neural networks in four aspects of the logic program execution cycle, and discusses results of a simulation of three of these. Four neural network functional units are described, called the substitution agent, the clause filter, the structure processor, and the heuristics generator, respectively. Simulation results suggest that the system described may provide several orders of magnitude improvement in execution speed for large logic programs. However, practical implementation of the proposed architecture will require the application of optical computing techniques due to the large number of neurons required, and the need for massive, adaptive connectivity.
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...
Ordering Traces Logically to Identify Lateness in Message Passing Programs
Energy Technology Data Exchange (ETDEWEB)
Isaacs, Katherine E.; Gamblin, Todd; Bhatele, Abhinav; Schulz, Martin; Hamann, Bernd; Bremer, Peer-Timo
2016-03-01
Event traces are valuable for understanding the behavior of parallel programs. However, automatically analyzing a large parallel trace is difficult, especially without a specific objective. We aid this endeavor by extracting a trace's logical structure, an ordering of trace events derived from happened-before relationships, while taking into account developer intent. Using this structure, we can calculate an operation's delay relative to its peers on other processes. The logical structure also serves as a platform for comparing and clustering processes as well as highlighting communication patterns in a trace visualization. We present an algorithm for determining this idealized logical structure from traces of message passing programs, and we develop metrics to quantify delays and differences among processes. We implement our techniques in Ravel, a parallel trace visualization tool that displays both logical and physical timelines. Rather than showing the duration of each operation, we display where delays begin and end, and how they propagate. We apply our approach to the traces of several message passing applications, demonstrating the accuracy of our extracted structure and its utility in analyzing these codes.
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
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.
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
Hierarchically sorted inductive logic programming and its application to information extraction
Sasaki, Yutaka
2000-01-01
Titlepage,Contents,List of Figures,List of Tables -- Chapter1 Introduction -- Chapter2 Mathematical Preliminary -- Chapter3 Inductive Learning of Logic Programs -- Chapter4 RHB : ILP System that Learns Logic Programs with Sorts from Positive and Negative Examples -- Chapter5 RHB＋ : ILP System that Learns Logic Programs with Sorts from Positive Examples -- Chapter6 [ ]-RHB＋ : ILP System that Learns Logic Programs based on [ ]-terms -- Chapter7 Sample Trace of the Three Learners -- Chapter8 App...
Verification and Planning Based on Coinductive Logic Programming
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
DEFF Research Database (Denmark)
Moeller, Jesper; Lichtenberg, Jacob; Andersen, Henrik Reif
1999-01-01
This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form $x-y......This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form $x-y...
Genetic programs constructed from layered logic gates in single cells.
Moon, Tae Seok; Lou, Chunbo; Tamsir, Alvin; Stanton, Brynne C; Voigt, Christopher A
2012-11-08
Genetic programs function to integrate environmental sensors, implement signal processing algorithms and control expression dynamics. These programs consist of integrated genetic circuits that individually implement operations ranging from digital logic to dynamic circuits, and they have been used in various cellular engineering applications, including the implementation of process control in metabolic networks and the coordination of spatial differentiation in artificial tissues. A key limitation is that the circuits are based on biochemical interactions occurring in the confined volume of the cell, so the size of programs has been limited to a few circuits. Here we apply part mining and directed evolution to build a set of transcriptional AND gates in Escherichia coli. Each AND gate integrates two promoter inputs and controls one promoter output. This allows the gates to be layered by having the output promoter of an upstream circuit serve as the input promoter for a downstream circuit. Each gate consists of a transcription factor that requires a second chaperone protein to activate the output promoter. Multiple activator-chaperone pairs are identified from type III secretion pathways in different strains of bacteria. Directed evolution is applied to increase the dynamic range and orthogonality of the circuits. These gates are connected in different permutations to form programs, the largest of which is a 4-input AND gate that consists of 3 circuits that integrate 4 inducible systems, thus requiring 11 regulatory proteins. Measuring the performance of individual gates is sufficient to capture the behaviour of the complete program. Errors in the output due to delays (faults), a common problem for layered circuits, are not observed. This work demonstrates the successful layering of orthogonal logic gates, a design strategy that could enable the construction of large, integrated circuits in single cells.
Flores-Hernandez, Ricardo
1995-09-01
The Centro de Investigaciones en Optica is developing the AZTECA optical design program to exploit the full synthesis capabilities intrinsic to Delano's y-y method. Both the y- y diagram and its dual the (omega) -(omega) diagram, are manipulated in real time to introduce changes at any point or line in those diagrams. These changes result in altered new versions of the optical system by means of a specialized subroutine that incorporates the fundamental synthesis equations for those diagrams. To display results on the computer's screen as the optimization process progress, AZTECA makes wide use of the fact that the y-y and the (omega) -(omega) diagrams display graphically all the first order attributes of an optical system. This program adjoins to these features the calculation of Buchdahl's 3rd, 5th, and 7th order aberration coefficients to the output. This results in a real time display of the system's paraxial and aberrational behavior. Efficient graphic displays, the program's modular structure and an interactive mode of operation, also contribute to make the AZTECA a versatile platform. It will be further developed as a new tool for efficient optical system design.
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…
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.
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.
Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs
2011-04-01
adl`ag, and Markov time properties, and prove that the semantics of our logic is measurable. We present compositional proof rules, including rules for stochastic differential equations, and prove soundness.
Using concept mapping to develop a logic model for the Prevention Research Centers Program.
Anderson, Lynda A; Gwaltney, Margaret K; Sundra, Demia L; Brownson, Ross C; Kane, Mary; Cross, Alan W; Mack, Richard; Schwartz, Randy; Sims, Tom; Carol, White R
2006-01-01
Concept mapping is a structured conceptualization process that provides a visual representation of relationships among ideas. Concept mapping was used to develop a logic model for the Centers for Disease Control and Prevention's Prevention Research Centers Program, which has a large and diverse group of stakeholders throughout the United States. No published studies have used concept mapping to develop a logic model for a national program. Two logic models were constructed using the data from the concept mapping process and program documents: one for the national level and one for the local level. Concept mapping involved three phases: 1) developing questions to generate ideas about the program's purpose and function, 2) gathering input from 145 national stakeholders and 135 local stakeholders and sorting ideas into themes, and 3) using multivariate statistical analyses to generate concept maps. Logic models were refined using feedback received from stakeholders at regional meetings and conferences and from a structured feedback tool. The national concept map consisted of 9 clusters with 88 statements; the local concept map consisted of 11 clusters with 75 statements. Clusters were categorized into three logic model components: inputs, activities, and outcomes. Based on feedback, two draft logic models were combined and finalized into one for the Prevention Research Centers Program. Concept mapping provides a valuable data source, establishes a common view of a program, and identifies inputs, activities, and outcomes in a logic model. Our concept mapping process resulted in a logic model that is meaningful for stakeholders, incorporates input from the program's partners, and establishes important program expectations. Our methods may be beneficial for other programs that are developing logic models for evaluation planning.
Evaluating bacterial gene-finding HMM structures as probabilistic logic programs
DEFF Research Database (Denmark)
Mørk, Søren; Holmes, Ian
2012-01-01
Motivation: 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...... 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...
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
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.
A general schema for generating argumentation semantics from logic programming semantics
Nieves Sánchez, Juan Carlos; Osorio Galindo, Mauricio
2008-01-01
In this paper, by considering the idea that argumentation semantics can be viewed as a special form of logic programming semantics with negation as failure, we show that any logic programming semantics as the stable model semantics, the minimal models, etc., can define candidate argumentation semantics. These new argumentation semantics will overcome some of the problems of the Dung's argumentation semantics that have been discussed in the literature. The new argumentation semantics are based...
Ontology merging using belief revision and defeasible logic programming
Gómez, Sergio Alejandro; Simari, Guillermo Ricardo
2012-01-01
We combine argumentation, belief revision and description logic ontologies for extending the -ontologies framework to show how to merge two ontologies in which the union of the strict terminologies could lead to inconsistency. To solve this problem, we revisit a procedure presented by Falappa et al. in which part of the o ending terminologies are turned defeasible by using a kernel revision operator.
Modelling and Analysis of Real Time Systems with Logic Programming and Constraints
DEFF Research Database (Denmark)
Banda, Gourinath
Embedded systems are increasingly being deployed in a wide variety of applica- tions. Most, if not all, of these applications involve an electronic controller with discrete behaviour controlling a continuously evolving plant. Because of their hybrid behaviour (discrete and continuous) and reactive...... behaviour, the formal verification of embedded systems pose new challenges. Linear Hybrid Automata (LHA) is a language for specifying systems with linear hybrid behaviour. Abstract interpretation is a formal theory for approximating the semantics of programming languages. Model checking is a technique...... to verify the reactive behaviour of concur- rent systems. Computation Tree Logic (CTL) is a temporal property specification language. Logic programming is a general purpose programming language based on predicate logic. In this dissertation, the LHA models are verified by encoding them as con- straint logic...
A Fuzzy Logic Programming Environment for Managing Similarity and Truth Degrees
Directory of Open Access Journals (Sweden)
Pascual Julián-Iranzo
2015-01-01
Full Text Available FASILL (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language" is a fuzzy logic programming language with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. FASILL integrates and extends features coming from MALP (Multi-Adjoint Logic Programming, a fuzzy logic language with explicitly annotated rules and Bousi~Prolog (which uses a weak unification algorithm and is well suited for flexible query answering. Hence, it properly manages similarity and truth degrees in a single framework combining the expressive benefits of both languages. This paper presents the main features and implementations details of FASILL. Along the paper we describe its syntax and operational semantics and we give clues of the implementation of the lattice module and the similarity module, two of the main building blocks of the new programming environment which enriches the FLOPER system developed in our research group.
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....
Logical database design principles
Garmany, John; Clark, Terry
2005-01-01
INTRODUCTION TO LOGICAL DATABASE DESIGNUnderstanding a Database Database Architectures Relational Databases Creating the Database System Development Life Cycle (SDLC)Systems Planning: Assessment and Feasibility System Analysis: RequirementsSystem Analysis: Requirements Checklist Models Tracking and Schedules Design Modeling Functional Decomposition DiagramData Flow Diagrams Data Dictionary Logical Structures and Decision Trees System Design: LogicalSYSTEM DESIGN AND IMPLEMENTATION The ER ApproachEntities and Entity Types Attribute Domains AttributesSet-Valued AttributesWeak Entities Constraint
Constraint Logic Programming for Resolution of Relative Time Expressions
DEFF Research Database (Denmark)
Christiansen, Henning
2014-01-01
Translating time expression into absolute time points or durations is a challenge for natural languages processing such as text mining and text understanding in general. We present a constraint logic language CLP(Time) tailored to text usages concerned with time and calendar. It provides a simple...... and flexible formalism to express relationships between different time expressions in a text, thereby giving a recipe for resolving them into absolute time. A constraint solver is developed which, as opposed to some earlier approaches, is independent of the order in which temporal information is introduced...
Defeasible Deontic Robot Control Based on Extended Vector Annotated Logic Programming
Nakamatsu, Kazumi; Abe, Jair Minoro; Suzuki, Atsuyuki
2002-09-01
We have already proposed an annotated logic program called an EVALPSN (Extended Vector Annotated Logic Program with Strong Negation) to deal with defeasible deontic reasoning. In this paper, we propose a defeasible deontic action control system for a virtual robot based on EVALPSN. We suppose a beetle robot who is traveling a maze with three kinds of obstacles and has some different kinds of sensors to detect the obstacles. If some sensor values are input to the robot control, the next action that the robot should do is computed by the EVALPSN programming system.
IT0: Discrete Math and Programming Logic Topics as a Hybrid Alternative to CS0
Martin, Nancy L.
2015-01-01
This paper describes the development of a hybrid introductory course for students in their first or second year of an information systems technologies degree program at a large Midwestern university. The course combines topics from discrete mathematics and programming logic and design, a unique twist on most introductory courses. The objective of…
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…
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…
Reasoning about Java programs in higher order logic using PVS and Isabelle
Huisman, Marieke
2001-01-01
This thesis describes the first steps of a project aimed at formal verification of Java programs. The work presented here is part of a larger project called LOOP, for Logic of Object Oriented Programming. A semantics for Java is described in type theory and it is shown how this semantics forms the
Ratcliffe, Michelle M
2012-08-01
Farm to School programs hold promise to address childhood obesity. These programs may increase students’ access to healthier foods, increase students’ knowledge of and desire to eat these foods, and increase their consumption of them. Implementing Farm to School programs requires the involvement of multiple people, including nutrition services, educators, and food producers. Because these groups have not traditionally worked together and each has different goals, it is important to demonstrate how Farm to School programs that are designed to decrease childhood obesity may also address others’ objectives, such as academic achievement and economic development. A logic model is an effective tool to help articulate a shared vision for how Farm to School programs may work to accomplish multiple goals. Furthermore, there is evidence that programs based on theory are more likely to be effective at changing individuals’ behaviors. Logic models based on theory may help to explain how a program works, aid in efficient and sustained implementation, and support the development of a coherent evaluation plan. This article presents a sample theory-based logic model for Farm to School programs. The presented logic model is informed by the polytheoretical model for food and garden-based education in school settings (PMFGBE). The logic model has been applied to multiple settings, including Farm to School program development and evaluation in urban and rural school districts. This article also includes a brief discussion on the development of the PMFGBE, a detailed explanation of how Farm to School programs may enhance the curricular, physical, and social learning environments of schools, and suggestions for the applicability of the logic model for practitioners, researchers, and policy makers.
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.
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...
Equational binary decision diagrams
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
A Different Kind of Language: Prolog, Programming in Logic.
Cabrol, D.
1986-01-01
Prolog is one of the most successful "very high level languages." Describes this programming language (a product of artificial intelligence research) and attempts to show how it functions by using some short examples to illustrate its essential features. (JN)
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...
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…
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
DEFF Research Database (Denmark)
Albert, Elvira; Puebla, German; Gallagher, John Patrick
2006-01-01
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exceptions), and those whose truth value varies according to the degree of instantiation of arguments. In particular, non...
Genetic program based data mining to reverse engineer digital logic
Smith, James F., III; Nguyen, Thanh Vu H.
2006-04-01
A data mining based procedure for automated reverse engineering and defect discovery has been developed. The data mining algorithm for reverse engineering uses a genetic program (GP) as a data mining function. A genetic program is an algorithm based on the theory of evolution that automatically evolves populations of computer programs or mathematical expressions, eventually selecting one that is optimal in the sense it maximizes a measure of effectiveness, referred to as a fitness function. The system to be reverse engineered is typically a sensor. Design documents for the sensor are not available and conditions prevent the sensor from being taken apart. The sensor is used to create a database of input signals and output measurements. Rules about the likely design properties of the sensor are collected from experts. The rules are used to create a fitness function for the genetic program. Genetic program based data mining is then conducted. This procedure incorporates not only the experts' rules into the fitness function, but also the information in the database. The information extracted through this process is the internal design specifications of the sensor. Uncertainty related to the input-output database and the expert based rule set can significantly alter the reverse engineering results. Significant experimental and theoretical results related to GP based data mining for reverse engineering will be provided. Methods of quantifying uncertainty and its effects will be presented. Finally methods for reducing the uncertainty will be examined.
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 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.
Mo, Jin
1987-01-01
The goal of this research was to examine the commonality of abstract diagram use in landscape architectural design by meeting the objectives of: (1) developing a use-pattern profile of abstract diagrams for design communication in the programming process, i.e., determine which diagram type is used for the communication of which programmatic design issues by private-practice firms, and (2) determining the perceptions of landscape architects in regard to clarity of understanding, ease of prepar...
[Documenting a rehabilitation program using a logic model: an advantage to the assessment process].
Poncet, Frédérique; Swaine, Bonnie; Pradat-Diehl, Pascale
2017-03-06
The cognitive and behavioral disorders after brain injury can result in severe limitations of activities and restrictions of participation. An interdisciplinary rehabilitation program was developed in physical medicine and rehabilitation at the Pitié-Salpêtriere Hospital, Paris, France. Clinicians believe this program decreases activity limitations and improves participation in patients. However, the program’s effectiveness had never been assessed. To do this, we had to define/describe this program. However rehabilitation programs are holistic and thus complex making them difficult to describe. Therefore, to facilitate the evaluation of complex programs, including those for rehabilitation, we illustrate the use of a theoretical logic model, as proposed by Champagne, through the process of documentation of a specific complex and interdisciplinary rehabilitation program. Through participatory/collaborative research, the rehabilitation program was analyzed using three “submodels” of the logic model of intervention: causal model, intervention model and program theory model. This should facilitate the evaluation of programs, including those for rehabilitation.
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
different values within different control-flow paths, and a notion of witnesses that record such existential bindings for use in the subsequent program transformation process. We formalize CTL-VW and describe its use in the context of Coccinelle. We then assess the performance of the approach in practice......Reasoning about program control-flow paths is an important functionality of a number of recent program matching languages and associated searching and transformation tools. Temporal logic provides a well-defined means of expressing properties of control-flow paths in programs, and indeed......-VW (CTL with variables and witnesses) that is a suitable basis for the semantics and implementation of the Coccinelle’s program matching language. Our extension to CTL includes existential quantification over program fragments, which allows metavariables in the program matching language to range over...
Cooperative robot programming based on the parallel logic language KL1
Mizoguchi, Fumio; Iizuka, Keiichi; Nishiyama, Hiroyuki; Ohwada, Hayato
1996-10-01
Multi-agent root systems for the real world, must handle negotiations between agents. In this paper, we present a robot language which makes it easy to describe negotiation processes. This language provides concurrency and synchronization based on the logic programming language KL1. We incorporate the language into a look-ahead facility for handling emergent situations. Thus, reactive actions can be described in the language. We illustrate these facilities through cooperate tasks in pick-and-place problems.
Using Fuzzy Logic in Test Case Prioritization for Regression Testing Programs with Assertions
Directory of Open Access Journals (Sweden)
Ali M. Alakeel
2014-01-01
Full Text Available Program assertions have been recognized as a supporting tool during software development, testing, and maintenance. Therefore, software developers place assertions within their code in positions that are considered to be error prone or that have the potential to lead to a software crash or failure. Similar to any other software, programs with assertions must be maintained. Depending on the type of modification applied to the modified program, assertions also might have to undergo some modifications. New assertions may also be introduced in the new version of the program, while some assertions can be kept the same. This paper presents a novel approach for test case prioritization during regression testing of programs that have assertions using fuzzy logic. The main objective of this approach is to prioritize the test cases according to their estimated potential in violating a given program assertion. To develop the proposed approach, we utilize fuzzy logic techniques to estimate the effectiveness of a given test case in violating an assertion based on the history of the test cases in previous testing operations. We have conducted a case study in which the proposed approach is applied to various programs, and the results are promising compared to untreated and randomly ordered test cases.
Standardising the Lay: Logics of Change in Programs of Disease Self-management
Directory of Open Access Journals (Sweden)
Annegrete Juul Nielsen
2012-11-01
Full Text Available The health political discourse on self-care is dominated by the view that the selfmanaging patient represents a more democratic and patient-centric perspective, as he or she is believed to renegotiate the terms on which patient participation in health care has hitherto taken place. The self-managing patient is intended as a challenge to traditional medical authority by introducing lay methods of knowing disease. Rather than a meeting between authoritative professionals and vulnerable patients, the self-managing patient seeks to open up new spaces for a meeting between experts. The present paper questions these assumptions through an ethnographic exploration of a patient-led self-management program called the Chronic Disease Self-Management Program. The program is concerned with what its developers call the social and mental aspects of living with a chronic disease and uses trained patients as role models and program leaders. Drawing inspiration from Annemarie Mol’s term ‘logic’, we explore the rationale of ‘situations of selfmanagement’ and identify what we call a ‘logic of change’, which involves very specific ideas on how life with a chronic condition should be dealt with and directs attention towards particular manageable aspects of life with a chronic condition. This logic of change entails, we argue, a clash not between ‘medical’ and ‘lay’ forms of knowledge but between different logics or perceptions of how transformation can be achieved: through open-ended and ongoing reflection and experimentation in social settings or through standardised trajectories of change. Returning to the literature on lay forms of knowledge and illness perspectives, we question whether programs such as the Chronic Disease Self-Management Program – despite its apparent patient-centric perspective – reproduces classical hierarchical relations between lay and expert knowledge, albeit in new forms.
Control allocation of ASV based on linear programming and fuzzy logic
Chi, Pei; Chen, Zongji; Zhou, Rui
2006-11-01
Future Aero Space Vehicle flies through both the atmospheric and extra atmospheric fields, which implies the autonomy and adaptability to the uncertainties from the system faults and changing environments. Algorithms based on fuzzy logic and linear programming are presented, which can implement the autonomous control reconfigurations under uncertainties via the redundant actuators. The compensation branch minimizes the difference between the desired control objectives and the actual achievable control if the control power is deficient. Otherwise the optimization branch optimizes some sub-objectives by utilizing the excess control power. The fuzzy logic-based regulator tunes the weight vector of the objective functions by the expert rules to obtain the optimized allocation results under various environments with considerations of the control effectiveness. It is illustrated that the algorithms can satisfy the control performance, save the fuel and smooth the allocation output.
Guziolowski, Carito; Videla, Santiago; Eduati, Federica; Thiele, Sven; Cokelaer, Thomas; Siegel, Anne; Saez-Rodriguez, Julio
2013-09-15
Logic modeling is a useful tool to study signal transduction across multiple pathways. Logic models can be generated by training a network containing the prior knowledge to phospho-proteomics data. The training can be performed using stochastic optimization procedures, but these are unable to guarantee a global optima or to report the complete family of feasible models. This, however, is essential to provide precise insight in the mechanisms underlaying signal transduction and generate reliable predictions. We propose the use of Answer Set Programming to explore exhaustively the space of feasible logic models. Toward this end, we have developed caspo, an open-source Python package that provides a powerful platform to learn and characterize logic models by leveraging the rich modeling language and solving technologies of Answer Set Programming. We illustrate the usefulness of caspo by revisiting a model of pro-growth and inflammatory pathways in liver cells. We show that, if experimental error is taken into account, there are thousands (11 700) of models compatible with the data. Despite the large number, we can extract structural features from the models, such as links that are always (or never) present or modules that appear in a mutual exclusive fashion. To further characterize this family of models, we investigate the input-output behavior of the models. We find 91 behaviors across the 11 700 models and we suggest new experiments to discriminate among them. Our results underscore the importance of characterizing in a global and exhaustive manner the family of feasible models, with important implications for experimental design. caspo is freely available for download (license GPLv3) and as a web service at http://caspo.genouest.org/. Supplementary materials are available at Bioinformatics online. santiago.videla@irisa.fr.
Wilk, Szymon; Michalowski, Wojtek; Michalowski, Martin; Farion, Ken; Hing, Marisela Mainegra; Mohapatra, Subhra
2013-04-01
We propose a new method to mitigate (identify and address) adverse interactions (drug-drug or drug-disease) that occur when a patient with comorbid diseases is managed according to two concurrently applied clinical practice guidelines (CPGs). A lack of methods to facilitate the concurrent application of CPGs severely limits their use in clinical practice and the development of such methods is one of the grand challenges for clinical decision support. The proposed method responds to this challenge. We introduce and formally define logical models of CPGs and other related concepts, and develop the mitigation algorithm that operates on these concepts. In the algorithm we combine domain knowledge encoded as interaction and revision operators using the constraint logic programming (CLP) paradigm. The operators characterize adverse interactions and describe revisions to logical models required to address these interactions, while CLP allows us to efficiently solve the logical models - a solution represents a feasible therapy that may be safely applied to a patient. The mitigation algorithm accepts two CPGs and available (likely incomplete) patient information. It reports whether mitigation has been successful or not, and on success it gives a feasible therapy and points at identified interactions (if any) together with the revisions that address them. Thus, we consider the mitigation algorithm as an alerting tool to support a physician in the concurrent application of CPGs that can be implemented as a component of a clinical decision support system. We illustrate our method in the context of two clinical scenarios involving a patient with duodenal ulcer who experiences an episode of transient ischemic attack. Copyright © 2013 Elsevier Inc. All rights reserved.
Michels, S.; Hommersom, A.; Lucas, P.J.F.; Velikova, M.
2015-01-01
Abstract Probabilistic logics combine the expressive power of logic with the ability to reason with uncertainty. Several probabilistic logic languages have been proposed in the past, each of them with their own features. We focus on a class of probabilistic logic based on Sato's distribution
Calculation of the exchange ratio for the Adaptive Maneuvering Logic program
Neuman, F.; Erzberger, H.
1985-01-01
Improvements were made to the Adaptive Maneuvering Logic (AML) computer program, a computer-generated, air-to-air combat opponent. The primary improvement was incorporating a measure of performance, the exchange ratio, defined as the statistical measure of number of enemy kills divided by number of friendly losses. This measure was used to test a new modification of the AML's combat tactics. When the new version of the AML competed against the old version, the new version won with an exchange ratio of 1.4.
DEFF Research Database (Denmark)
Hermund, Anders
2010-01-01
This paper will introduce the PhD research into applied 3d modeling and parametric design outlining the idea of a parametric diagram linked to philosophical and applied examples.......This paper will introduce the PhD research into applied 3d modeling and parametric design outlining the idea of a parametric diagram linked to philosophical and applied examples....
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.
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...
Riezler, Stefan
2000-01-01
In this thesis, we present two approaches to a rigorous mathematical and algorithmic foundation of quantitative and statistical inference in constraint-based natural language processing. The first approach, called quantitative constraint logic programming, is conceptualized in a clear logical framework, and presents a sound and complete system of quantitative inference for definite clauses annotated with subjective weights. This approach combines a rigorous formal semantics for quantitative i...
Exploratory Analysis of the Social Network of Researchers in Inductive Logic Programming
Lavrač, Nada; Grčar, Miha; Fortuna, Blaž; Velardi, Paola
In this chapter, we present selected techniques for social network analysis and text mining and interpret the results of exploratory analysis of the social network of researchers in inductive logic programming (ILP), based on the ILP scientific publications database collected within the ILPnet2 project. Part of the analysis was performed with the Pajek software for large (social) network analyses, where the central entity of the analysis was the author, related to other authors by coauthorship links, weighted by the number of his or her publications registered in the ILPnet2 database. The chapter presents also a novel methodology for topic ontology learning from text documents. The proposed methodology, named OntoTermExtraction (Term Extraction for Ontology learning), is based on OntoGen, a semiautomated tool for topic ontology construction, upgraded by using an advanced terminology extraction tool in an iterative, semiautomated ontology construction process. The approach was successfully used for generating the ontology of topics in Inductive Logic Programming, learned semiautomatically from papers indexed in the ILPnet2 publications database.
DEFF Research Database (Denmark)
Gallagher, John Patrick; Puebla, G.
2002-01-01
constraint analysis of a particular program $P$ could be understood as an abstract interpretation over a finite domain of regular tree grammars, constructed from $P$. In this paper we define such an abstract interpretation for logic programs, formulated over a domain of non-deterministic finite tree automata...
2016-01-01
include reaching and meet- ing the nutritional needs of an eligible population. The logic model can also be used to identify program boundaries and... programs to gauge progress in meeting the corresponding goals and objectives. If the goal is to reach and meet the nutritional needs of an eligible...Model SOURCE: RAND staff analysis. RAND RR882/1-3.1 Develop benchmark logic model with program leadership and staffTime Test, validate , and rene logic
Rose, Matthew
2004-01-01
Matthew Rose worked at the Naval Postgraduate School as a graphic designer from February 2002-November 2011. His work for NPS included logos, brochures, business packs, movies/presentations, posters, the CyberSiege video game and many other projects. This material was organized and provided by the artist, for inclusion in the NPS Archive, Calhoun. Includes these files: Plan_ver.ai; powerline.jpg; SCADA diagram.ai; SCADA diagram.pdf; SCADA diagramsmall.pdf; SCADA2.pdf
Digital Repository Service at National Institute of Oceanography (India)
Ganesan, P.
II) Program for obtaining volume of sand / mineral along profiles from M.S.L. The listing of the software is given in Annexure: I and Annexure :2 of this report. LOGIC AND FLOW DIAGRAM The logic used in first program ?Program to obtain... data points from second set up = (HC1 ? successive staff readings observed from second set up) 5 The logical flow diagram is given below Fig.1 Flow chart for obtaining vertical heights with respect to mean sea...
Directory of Open Access Journals (Sweden)
Kody M. Powell
2016-03-01
Full Text Available This work presents a methodology to represent logical decisions in differential algebraic equation simulation and constrained optimization problems using a set of continuous algebraic equations. The formulations may be used when state variables trigger a change in process dynamics, and introduces a pseudo-binary decision variable, which is continuous, but should only have valid solutions at values of either zero or one within a finite time horizon. This formulation enables dynamic optimization problems with logical disjunctions to be solved by simultaneous solution methods without using methods such as mixed integer programming. Several case studies are given to illustrate the value of this methodology including nonlinear model predictive control of a chemical reactor using a surge tank with overflow to buffer disturbances in feed flow rate. Although this work contains novel methodologies for solving dynamic algebraic equation (DAE constrained problems where the system may experience an abrupt change in dynamics that may otherwise require a conditional statement, there remain substantial limitations to this methodology, including a limited domain where problems may converge and the possibility for ill-conditioning. Although the problems presented use only continuous algebraic equations, the formulation has inherent non-smoothness. Hence, these problems must be solved with care and only in select circumstances, such as in simulation or situations when the solution is expected to be near the solver’s initial point.
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.
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. PMID:22195153
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.
Burgin, G. H.; Owens, A. J.
1975-01-01
A detailed description is presented of the computer programs in order to provide an understanding of the mathematical and geometrical relationships as implemented in the programs. The individual sbbroutines and their underlying mathematical relationships are described, and the required input data and the output provided by the program are explained. The relationship of the adaptive maneuvering logic program with the program to drive the differential maneuvering simulator is discussed.
HP-67 calculator programs for thermodynamic data and phase diagram calculations
Energy Technology Data Exchange (ETDEWEB)
Brewer, L.
1978-05-25
This report is a supplement to a tabulation of the thermodynamic and phase data for the 100 binary systems of Mo with the elements from H to Lr. The calculations of thermodynamic data and phase equilibria were carried out from 5000/sup 0/K to low temperatures. This report presents the methods of calculation used. The thermodynamics involved is rather straightforward and the reader is referred to any advanced thermodynamic text. The calculations were largely carried out using an HP-65 programmable calculator. In this report, those programs are reformulated for use with the HP-67 calculator; great reduction in the number of programs required to carry out the calculation results.
PM 3655 PHILIPS Logic analyzer
A logic analyzer is an electronic instrument that captures and displays multiple signals from a digital system or digital circuit. A logic analyzer may convert the captured data into timing diagrams, protocol decodes, state machine traces, assembly language, or may correlate assembly with source-level software. Logic Analyzers have advanced triggering capabilities, and are useful when a user needs to see the timing relationships between many signals in a digital system.
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...
Mrinal Kanti Sarkar; Trijit Chatterjee; Dipta Mukherjee
2013-01-01
The Unified Modeling Language (UML) has been accepted as a standard for modeling object oriented system. It helps the designer to understand a problem well by focusing on one aspects of a problem at a time. In this paper we present a novel approach in which reverse engineering is performed and we have chosen UML as the modeling language to achieve a representation of the implemented system. In this work we have considered java programs. After a brief introduction to the subject, we present so...
Ryan, John; Heavey, Cathal
2003-01-01
This paper presents a technique, Simulation Activity Diagrams (SAD), developed to lessen the modelling burden during the initial requirements gathering phases of a simulation project. The technique also allows the capture and visual communication of detailed information, to manufacturing personnel, which may otherwise be lost in detailed programming code.
West, Joseph F
2014-02-01
Diabetes remains a growing epidemic with widening health inequity gaps in disease management, self-management knowledge, access to care and outcomes. Yet there is a paucity of evaluation tools for community engaged interventions aimed at closing the gaps and improving health. The Guide to Community Preventive Services (the Community Guide) developed by the Task Force on Community Preventive Services (the Task Force) at the Centers for Disease Control and Prevention (CDC) recommends two healthcare system level interventions, case management interventions and disease management programs, to improve glycemic control. However, as a public health resource guide for diabetes interventions a model for community engagement is a glaringly absent component of the Community Guide recommendations. In large part there are few evidence-based interventions featuring community engagement as a practice and system-level focus of chronic disease and Type 2 diabetes management. The central argument presented in this paper is that the absence of these types of interventions is due to the lack of tools for modeling and evaluating such interventions, especially among disparate and poor populations. A conceptual model emphasizing action-oriented micro-level community engagement is needed to complement the Community Guide and serve as the basis for testing and evaluation of these kinds of interventions. A unique logic model advancing the Community Guide diabetes recommendations toward measureable and sustainable community engagement for improved Type 2 diabetes outcomes is presented. Copyright © 2013 Elsevier Ltd. All rights reserved.
Logic programming to predict cell fate patterns and retrodict genotypes in organogenesis
Hall, Benjamin A.; Jackson, Ethan; Hajnal, Alex; Fisher, Jasmin
2014-01-01
Caenorhabditis elegans vulval development is a paradigm system for understanding cell differentiation in the process of organogenesis. Through temporal and spatial controls, the fate pattern of six cells is determined by the competition of the LET-23 and the Notch signalling pathways. Modelling cell fate determination in vulval development using state-based models, coupled with formal analysis techniques, has been established as a powerful approach in predicting the outcome of combinations of mutations. However, computing the outcomes of complex and highly concurrent models can become prohibitive. Here, we show how logic programs derived from state machines describing the differentiation of C. elegans vulval precursor cells can increase the speed of prediction by four orders of magnitude relative to previous approaches. Moreover, this increase in speed allows us to infer, or ‘retrodict’, compatible genomes from cell fate patterns. We exploit this technique to predict highly variable cell fate patterns resulting from dig-1 reduced-function mutations and let-23 mosaics. In addition to the new insights offered, we propose our technique as a platform for aiding the design and analysis of experimental data. PMID:24966232
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.
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%.
Howard, Ayanna
2005-01-01
The Fuzzy Logic Engine is a software package that enables users to embed fuzzy-logic modules into their application programs. Fuzzy logic is useful as a means of formulating human expert knowledge and translating it into software to solve problems. Fuzzy logic provides flexibility for modeling relationships between input and output information and is distinguished by its robustness with respect to noise and variations in system parameters. In addition, linguistic fuzzy sets and conditional statements allow systems to make decisions based on imprecise and incomplete information. The user of the Fuzzy Logic Engine need not be an expert in fuzzy logic: it suffices to have a basic understanding of how linguistic rules can be applied to the user's problem. The Fuzzy Logic Engine is divided into two modules: (1) a graphical-interface software tool for creating linguistic fuzzy sets and conditional statements and (2) a fuzzy-logic software library for embedding fuzzy processing capability into current application programs. The graphical- interface tool was developed using the Tcl/Tk programming language. The fuzzy-logic software library was written in the C programming language.
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.
TSAR User’s Manual. Volume I. Program Features, Logic, and Interactions.
1982-02-01
This Note is one of five documents that collectively describe the TSAR and TSARINA computer models developed to assess the effect of air attacks on...variety of airbase improvements may be tested. The present Note provides a full description of the logic used in the TSAR model, as well as an
Coping with Logical Fallacies: A Developmental Training Program for Learning to Reason
Christoforides, Michael; Spanoudis, George; Demetriou, Andreas
2016-01-01
This study trained children to master logical fallacies and examined how learning is related to processing efficiency and fluid intelligence (gf). A total of one hundred and eighty 8- and 11-year-old children living in Cyprus were allocated to a control, a limited (LI), and a full instruction (FI) group. The LI group learned the notion of logical…
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...
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 problems inhibiting separate checking and propose a class of logics that reconcile logic metaprogramming and separate checking. We have formalized the resulting module system and have proven the soundness of separate checking. We validate its feasibility by presenting the design and implementation...... of a specific logic that is able to express many metaprogramming examples from the literature....
DEFF Research Database (Denmark)
Poulsen, Kåre Harbo; Pop, Paul; Izosimov, Viacheslav
2007-01-01
We present a constraint logic programming (CLP) approach for synthesis of fault-tolerant hard real-time applications on distributed heterogeneous architectures. We address time-triggered systems, where processes and messages are statically scheduled based on schedule tables. We use process re......-execution for recovering from multiple transient faults. We propose three scheduling approaches, which each present a trade-off between schedule simplicity and performance, (i) full transparency, (ii) slack sharing and (iii) conditional, and provide various degrees of transparency. We have developed a CLP framework...
BDS-MAJ: A BDD-based logic synthesis tool exploiting majority logic decomposition
Luca Amar\\xf; Pierre-Emmanuel Gaillardon; Giovanni De Micheli
2013-01-01
Despite the impressive advance of logic synthesis during the past decades, a general methodology capable of efficiently synthesizing both control and datapath logic is still missing. Indeed, while synthe- sis techniques for random control logic (AND/OR-intensive) are well established, no dominant method for automated synthesis of datapath logic (XOR/MAJ-intensive) has yet emerged. Recently, Binary Decision Diagrams (BDDs) have been adopted to create an optimization system, named BDS, that sup...
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...
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
Logical Theories for Agent Introspection
DEFF Research Database (Denmark)
Bolander, Thomas
2004-01-01
several such logical theories which we prove to be consistent. These theories are all based on first-order predicate logic. To prove our consistency results, we develop a general mathematical framework, suitable for proving a large number of consistency results concerning logical theories involving...... by developments within semantics for logic programming within computational logic and formal theories of truth within philosophical logic. The thesis provides a number of examples showing how the developed theories can be used as reasoning frameworks for agents with introspective abilities. In Danish...... by self-reference. In the standard approach taken in artificial intelligence, the model that an agent has of its environment is represented as a set of beliefs. These beliefs are expressed as logical formulas within a formal, logical theory. When the logical theory is expressive enough to allow...
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.
Lengyel, Florian; St-Pierre, Benoit
2012-01-01
Denial Logic DL, a system of justification logic, is the logic of an agent whose justified beliefs are false, who cannot avow his own propositional attitudes or believe tautologies, but who can believe contradictions. Using Artemov's natural semantics for justification logic JL, in which justifications are interpreted as sets of formulas, we provide an inductive construction of models of DL, and show that DL is sound and complete. Some notions developed for JL, such as constant specifications...
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.
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.......Ontologies based on Description Logics (DLs) have proved to be effective in formally sharing knowledge across semantic technologies, e.g. Semantic Web, Natural Language Processing, Text Analytics, Business intelligence. Our main goal is analysing ontology construction considering vagueness. We have...
Logical Stochastic Optimization
Saad, Emad
2013-01-01
We present a logical framework to represent and reason about stochastic optimization problems based on probability answer set programming. This is established by allowing probability optimization aggregates, e.g., minimum and maximum in the language of probability answer set programming to allow minimization or maximization of some desired criteria under the probabilistic environments. We show the application of the proposed logical stochastic optimization framework under the probability answ...
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…
Sierpinski Gaskets for Logic Functions Representation
Popel, Denis V.; Dani, Anita
2002-01-01
This paper introduces a new approach to represent logic functions in the form of Sierpinski Gaskets. The structure of the gasket allows to manipulate with the corresponding logic expression using recursive essence of fractals. Thus, the Sierpinski gasket's pattern has myriad useful properties which can enhance practical features of other graphic representations like decision diagrams. We have covered possible applications of Sierpinski gaskets in logic design and justified our assumptions in ...
A universal structured-design diagramer
1981-01-01
Program (FLOWCHARTER) generates standardized flowcharts and concordances for development and debugging of programs in any language. User describes programming-language grammar, providing syntax rules in Backus-Naur form (BNF), list of semantic rules, and set of concordance rules. Once grammar is described, user supplies only source code of program to be diagrammed. FLOWCHARTER automatically produces flow diagram and concordance. Source code for program is written for PASCAL Release 2 compiler, as distributed by University of Minnesota.
Purposeful Program Theory: Effective Use of Theories of Change and Logic Models
Funnell, Sue C.; Rogers, Patricia J.
2011-01-01
Between good intentions and great results lies a program theory--not just a list of tasks but a vision of what needs to happen, and how. Now widely used in government and not-for-profit organizations, program theory provides a coherent picture of how change occurs and how to improve performance. "Purposeful Program Theory" shows how to develop,…
Energy Technology Data Exchange (ETDEWEB)
Zadeh, L.A.
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. 7 references.
Specification and Verification of GPGPU programs using Permission-based Separation logic
Huisman, Marieke; Mihelcic, M.
2013-01-01
Graphics Processing Units (GPUs) are increasingly used for general-purpose applications because of their low price, energy efficiency and enormous computing power. Considering the importance of GPU applications, it is vital that the behaviour of GPU programs can be specified and proven correct formally. This paper presents our ideas how to verify GPU programs written in OpenCL, a platform-independent low-level programming language. Our verification approach is modular, based on permission-bas...
Tugué, Tosiyuki; Slaman, Theodore
1989-01-01
These proceedings include the papers presented at the logic meeting held at the Research Institute for Mathematical Sciences, Kyoto University, in the summer of 1987. The meeting mainly covered the current research in various areas of mathematical logic and its applications in Japan. Several lectures were also presented by logicians from other countries, who visited Japan in the summer of 1987.
Zone Logic Applications for Submarine Overhauls (The National Shipbuilding Research Program)
1988-08-01
projects. Philadelphia Naval Shipyard has retained consultants from Ishikawajima - harima Heavy Industries to help apply zone outfitting methods to the...INNOVATION MARINE INDUSTRY STANDARDS WELDING INDUSTRIAL ENGINEERING EDUCATION AND TRAINING THE NATIONAL SHIPBUILDING RESEARCH PROGRAM August 1988 NSRP 0298...34Benefits of the National Shipbuild- ing Research Program to the Navy and the Industrial Base: Part 3 - Navy Perspective, " Journal of Ship Production
Architecture Diagrams: A Graphical Language for Architecture Style Specification
Directory of Open Access Journals (Sweden)
Anastasia Mavridou
2016-08-01
Full Text Available Architecture styles characterise families of architectures sharing common characteristics. We have recently proposed configuration logics for architecture style specification. In this paper, we study a graphical notation to enhance readability and easiness of expression. We study simple architecture diagrams and a more expressive extension, interval architecture diagrams. For each type of diagrams, we present its semantics, a set of necessary and sufficient consistency conditions and a method that allows to characterise compositionally the specified architectures. We provide several examples illustrating the application of the results. We also present a polynomial-time algorithm for checking that a given architecture conforms to the architecture style specified by a diagram.
Program Verification with Monadic Second-Order Logic & Languages for Web Service Development
DEFF Research Database (Denmark)
Møller, Anders
, such as maintaining session state and dynamically producing HTML or XML documents. By introducing explicit language-based mechanisms for those issues, we liberate the Web service programmer from the tedious and error-prone alternatives. Specialized program analyses aid the programmer by verifying at compile time......, and syntax-level macros for making additional language extensions. In its newest version, the programming language is designed as an extension of Java. To describe classes of XML documents, we introduce a novel XML schema language aiming to both simplify and generalize existing proposals. All parts...
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
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...
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.
Designing Class Methods from Dataflow Diagrams
Shoval, Peretz; Kabeli-Shani, Judith
A method for designing the class methods of an information system is described. The method is part of FOOM - Functional and Object-Oriented Methodology. In the analysis phase of FOOM, two models defining the users' requirements are created: a conceptual data model - an initial class diagram; and a functional model - hierarchical OO-DFDs (object-oriented dataflow diagrams). Based on these models, a well-defined process of methods design is applied. First, the OO-DFDs are converted into transactions, i.e., system processes that supports user task. The components and the process logic of each transaction are described in detail, using pseudocode. Then, each transaction is decomposed, according to well-defined rules, into class methods of various types: basic methods, application-specific methods and main transaction (control) methods. Each method is attached to a proper class; messages between methods express the process logic of each transaction. The methods are defined using pseudocode or message charts.
Standardising the lay: Logics of change in programs of disease self-management
DEFF Research Database (Denmark)
Juul, Annegrete; Grøn, Lone
2012-01-01
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......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...... questions these assumptions through an ethnographic exploration of a patient-led self-management program called the Chronic Disease Self-Management Program....
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.
PROBABILISTIC COST ANALYSIS OF LOGIC PROGRAMS ANÁLISIS DE COSTO PROBABILÍSTICO DE PROGRAMAS LÓGICOS
Directory of Open Access Journals (Sweden)
Héctor Juan Soza Pollman
2009-08-01
Full Text Available Cost analyses of logic programs have been developed which make it possible to obtain automatically lower and upper bounds of runtime cost of computations. This information is very useful for a variety of purposes, including granularity control, query optimization in databases, and program transformation and synthesis. However, current techniques suffer a loss of accuracy in some cases which are quite representative (i.e., some divide-and-conquer programs as QuickSort. This paper describes an alternative probabilistic approach which makes it possible to figure out an estimate of the execution cost. One of its advantages is that it needs only a few changes over previously proposed schemes.Se han desarrollado análisis de costos de programas lógicos para obtener automáticamente cotas superiores e inferiores del costo del tiempo de ejecución de dicho tipo de programas. Esta información es muy útil para una variedad de propósitos, incluyendo control de granularidad, optimización de consultas en bases de datos, y transformación de programas y síntesis. Sin embargo, las técnicas actuales carecen de exactitud en algunos casos que son bastante representativos (por ejemplo, algunos programas de dividir para reinar como Quicksort. Este artículo describe un enfoque probabilístico alternativo que hace posible obtener una estimación más precisa del costo de ejecución. Una de sus ventajas es que plantea sólo unos pocos cambios sobre los esquemas propuestos previamente.
Linear Logical Voting Protocols
DEFF Research Database (Denmark)
DeYoung, Henry; Schürmann, Carsten
2012-01-01
Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification....... In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW- FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise...
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....
Reachability modules for the description logic SRIQ
CSIR Research Space (South Africa)
Nortje, R
2013-12-01
Full Text Available -1 Logic for Programming, Artificial Intelligence, and Reasoning (LPAR) 19 Conference, 14-19 December 2013, Stellenbosch, South Africa Reachability modules for the Description Logic SRIQ Riku Nortje, Katarina Britz, and Thomas Meyer Center...
Advanced Platform Systems Technology study. Volume 4: Technology advancement program plan
1983-01-01
An overview study of the major technology definition tasks and subtasks along with their interfaces and interrelationships is presented. Although not specifically indicated in the diagram, iterations were required at many steps to finalize the results. The development of the integrated technology advancement plan was initiated by using the results of the previous two tasks, i.e., the trade studies and the preliminary cost and schedule estimates for the selected technologies. Descriptions for the development of each viable technology advancement was drawn from the trade studies. Additionally, a logic flow diagram depicting the steps in developing each technology element was developed along with descriptions for each of the major elements. Next, major elements of the logic flow diagrams were time phased, and that allowed the definition of a technology development schedule that was consistent with the space station program schedule when possible. Schedules show the major milestone including tests required as described in the logic flow diagrams.
The Inverse Method Application for Non-Classical Logics
Pavlov, V.; Paky, V.
2015-01-01
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer programs that prove theorems automatically (such programs are called theorem provers). The inverse method can be applied to a wide range of logical calculi: propositional logic, ﬁrst-order logic, intuitionistic logic, modal logics etc. We give a brief historical background of the inverse method, then discuss existing modiﬁcations and implementations of the inverse method for non-classical logics...
Algebraic Approach to Algorithmic Logic
Directory of Open Access Journals (Sweden)
Bancerek Grzegorz
2014-09-01
Full Text Available We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra structure which is an extension of language signature and program algebra. While-if algebra of generator set and algebraic signature is bialgebra with appropriate properties and is used as basic type of algebraic logic.
Mizraji, Eduardo; Lin, Juan
2011-02-01
The ability of the human brain to carry out logical reasoning can be interpreted, in general, as a by-product of adaptive capacities of complex neural networks. Thus, we seek to base abstract logical operations in the general properties of neural networks designed as learning modules. We show that logical operations executable by McCulloch-Pitts binary networks can also be programmed in analog neural networks built with associative memory modules that process inputs as logical gates. These modules can interact among themselves to generate dynamical systems that extend the repertoire of logical operations. We demonstrate how the operations of the exclusive-OR or the implication appear as outputs of these interacting modules. In particular, we provide a model of the exclusive-OR that succeeds in evaluating an odd number of options (the exclusive-OR of classical logic fails in his case), thus paving the way for a more reasonable biological model of this important logical operator. We propose that a brain trained to compute can associate a complex logical operation to an orderly structured but temporary contingent episode by establishing a codified association among memory modules. This explanation offers an interpretation of complex logical processes (eventually learned) as associations of contingent events in memorized episodes. We suggest, as an example, a cognitive model that describes these "logical episodes".
Directory of Open Access Journals (Sweden)
Otávio Bueno
2001-12-01
Full Text Available In this paper, I develop a new defense of logicism: one that combines logicism and nominalism. First, I defend the logicist approach from recent criticisms; in particular from the charge that a crucial principle in the logicist reconstruction of arithmetic, Hume's Principle, is not analytic. In order to do that, I argue, it is crucial to understand the overall logicist approach as a nominalist view. I then indicate a way of extending the nominalist logicist approach beyond arithmetic. Finally, I argue that nominalist can use the resulting approach to provide a nominalization strategy for mathematics. In this way, mathematical structures can be introduced without ontological costs. And so, if this proposal is correct, we can say that ultimately all the nominalist needs is logic (and, rather loosely, all the logicist needs is nominalism.
DEFF Research Database (Denmark)
Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker
2012-01-01
We present a logical relation for showing the correctness of program transformations based on a new type-and-eﬀect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number...
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
Macian-Sorribes, Hector; Pulido-Velazquez, Manuel
2016-04-01
This contribution presents a methodology for defining optimal seasonal operating rules in multireservoir systems coupling expert criteria and stochastic optimization. Both sources of information are combined using fuzzy logic. The structure of the operating rules is defined based on expert criteria, via a joint expert-technician framework consisting in a series of meetings, workshops and surveys carried out between reservoir managers and modelers. As a result, the decision-making process used by managers can be assessed and expressed using fuzzy logic: fuzzy rule-based systems are employed to represent the operating rules and fuzzy regression procedures are used for forecasting future inflows. Once done that, a stochastic optimization algorithm can be used to define optimal decisions and transform them into fuzzy rules. Finally, the optimal fuzzy rules and the inflow prediction scheme are combined into a Decision Support System for making seasonal forecasts and simulate the effect of different alternatives in response to the initial system state and the foreseen inflows. The approach presented has been applied to the Jucar River Basin (Spain). Reservoir managers explained how the system is operated, taking into account the reservoirs' states at the beginning of the irrigation season and the inflows previewed during that season. According to the information given by them, the Jucar River Basin operating policies were expressed via two fuzzy rule-based (FRB) systems that estimate the amount of water to be allocated to the users and how the reservoir storages should be balanced to guarantee those deliveries. A stochastic optimization model using Stochastic Dual Dynamic Programming (SDDP) was developed to define optimal decisions, which are transformed into optimal operating rules embedding them into the two FRBs previously created. As a benchmark, historical records are used to develop alternative operating rules. A fuzzy linear regression procedure was employed to
Feynman Diagrams for Beginners
Kumericki, Kresimir
2016-01-01
We give a short introduction to Feynman diagrams, with many exercises. Text is targeted at students who had little or no prior exposure to quantum field theory. We present condensed description of single-particle Dirac equation, free quantum fields and construction of Feynman amplitude using Feynman diagrams. As an example, we give a detailed calculation of cross-section for annihilation of electron and positron into a muon pair. We also show how such calculations are done with the aid of computer.
2014-01-01
congruence of bi-implication induced on the local word algebras by the local logics. The only operators not already covered in previous modal algebraic...above the local modal algebra carrier sets are necessary. Lemma 2.4.7 shows that the replacement property for the bi-implication congruence holds for...and J. Rosicky, “Locally Presentable and Accessible Categories,” London Mathe - matical Society, 1994, lecture Note Series 189. [2] Allwein, G. and J
Hu, Yidan; Yang, Yun; Katz, Evgeny; Song, Hao
2015-03-11
An AND logic gate based on a synthetic quorum-sensing (QS) module was constructed in a Shewanella oneidensis MR-1 mtrA knockout mutant. The presence of two input signals activated the expression of a periplasmic decaheme cytochrome MtrA to regenerate the extracellular electron transfer conduit, enabling the construction of AND-gated microbial fuel cells.
A simple circuit with dynamic logic architecture of basic logic gates
Campos-Canton, I.; Pecina-Sanchez, J. A.; Campos-Canton, E.; Rosu, H. C.
2010-01-01
We report experimental results obtained with a circuit possessing dynamic logic architecture based on one of the theoretical schemes proposed by H. Peng and collaborators in 2008. The schematic diagram of the electronic circuit and its implementation to get different basic logic gates are displayed and discussed. In particular, we show explicitly how to get the electronic NOR, NAND, and XOR gates. The proposed electronic circuit is easy to build because it employs only resistors, operational ...
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.
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...
Ten proposed rules of numerical diagrams
Court, Arnold
Diagrams have been used for 3 centuries to present numerical information succinctly. Yet no complete, specific rules are available for their preparation, similar to the rules of grammar, syntax, and spelling of language. Some guidance is offered in the dozen books on graphics published in the United States in the past 40 years, and fragments appear in textbooks and manuals. But none of these is complete or consistent, and each offers at least one glaring contravention of the basic tenets of mathematics and logic.
Phosphatidylcholine: cholesterol phase diagrams.
Thewalt, J L; Bloom, M
1992-10-01
Two mono-cis-unsaturated phosphatidylcholine (PC) lipid molecules, having very different gel-liquid crystalline phase transition temperatures as a consequence of the relative positions of the double bond, exhibit PC:cholesterol phase diagrams that are very similar to each other and to that obtained previously for a fully saturated PC:cholesterol mixture (Vist, M. R., and J. H. Davis. 1990. Biochemistry 29:451-464). This leads to the conjecture that PC:cholesterol membrane phase diagrams have a universal form which is relatively independent of the precise chemical structure of the PC molecule. One feature of this phase diagram is the observation over a wide temperature range of a fluid but highly conformationally ordered phase at bilayer concentrations of more than approximately 25 mol% cholesterol. This ;liquid ordered' phase is postulated to be the relevant physical state for many biological membranes, such as the plasma membrane of eukaryotic cells, that contain substantial amounts of cholesterol or equivalent sterols.
Flow Logics and Operational Semantics
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1998-01-01
Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analysis...... correct. Our main conclusion is that environment based semantics is more flexible than either substitution based semantics or semantics making use of structural congruences (like alpha-renaming)....
DEFF Research Database (Denmark)
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...
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.
Annotated Answer Set Programming
Straccia, Umberto
2005-01-01
We present Annotated Answer Set Programming, that extends the ex pressive power of disjunctive logic programming with annotation terms, taken from the generalized annotated logic programming framework.
Paraconsistent Computational Logic
DEFF Research Database (Denmark)
Jensen, Andreas Schmidt; Villadsen, Jørgen
2012-01-01
In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study.......In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....
Three-valued logics in modal logic
Kooi, Barteld; Tamminga, Allard
2013-01-01
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we
Introduction to fuzzy logic using Matlab
Sivanandam, SN; Deepa, S N
2006-01-01
Fuzzy Logic, at present is a hot topic, among academicians as well various programmers. This book is provided to give a broad, in-depth overview of the field of Fuzzy Logic. The basic principles of Fuzzy Logic are discussed in detail with various solved examples. The different approaches and solutions to the problems given in the book are well balanced and pertinent to the Fuzzy Logic research projects. The applications of Fuzzy Logic are also dealt to make the readers understand the concept of Fuzzy Logic. The solutions to the problems are programmed using MATLAB 6.0 and the simulated results are given. The MATLAB Fuzzy Logic toolbox is provided for easy reference.
Compressing Binary Decision Diagrams
DEFF Research Database (Denmark)
Rune Hansen, Esben; Srinivasa Rao, S.; Tiedemann, Peter
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1......-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances....
Compressing Binary Decision Diagrams
DEFF Research Database (Denmark)
Hansen, Esben Rune; Satti, Srinivasa Rao; Tiedemann, Peter
2008-01-01
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1......-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances...
DEFF Research Database (Denmark)
Carbone, Marco; Montesi, Fabrizio; Schürmann, Carsten
2014-01-01
In Choreographic Programming, a distributed system is programmed by giving a choreography, a global description of its interactions, instead of separately specifying the behaviour of each of its processes. Process implementations in terms of a distributed language can then be automatically projec...
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...
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...
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 and p...
DEFF Research Database (Denmark)
Hermund, Anders
2017-01-01
the outcome of a given artistic situation, with the intent to approach the essential needs in artistic creation. The specific diagrammatic methodology is fundamentally inspired by and further elaborated from C. S. Peirce’s semiotic system consisting of interrelated signs, wherein the diagram holds a very...... special position in the semiotic reasoning process. Viewing the creation of art pieces through the specific diagrammatic approach, indicates that, in the given case, it can be possible to organize the process of creation according to a diagrammatic system, and that this system is flexible enough to allow...
Metamathematics of fuzzy logic
Hájek, Petr
1998-01-01
This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. Some important systems of real-valued propositional and predicate calculus are defined and investigated. The aim is to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named `fuzzy inference' can be naturally understood as logical deduction.
Stephen Crain; Drew Khlentzos
2007-01-01
Arguments are presented supporting logical nativism: the conjecture that humans have an innate logic faculty. In making a case for logical nativism, this article concentrates on children’s acquisition of the logical concept of disjunction. Despite the widespread belief to the contrary, the interpretation of disjunction in human languages is arguably the same as it is in classical logic, namely inclusive–or. The argument proceeds with empirical support for the view that the inclusive–or is the...
Kats, L.C.; Visser, E.
Software platforms such as the Java Virtual Machine or the CLR .NET virtual machine have their own ecosystem of a core programming language or instruction set, libraries, and developer community. Programming languages can target multiple software platforms to increase interoperability or to boost
Kats, L.C.; Visser, E.
2010-01-01
Software platforms such as the Java Virtual Machine or the CLR .NET virtual machine have their own ecosystem of a core programming language or instruction set, libraries, and developer community. Programming languages can target multiple software platforms to increase interoperability or to boost
Improving the Accuracy and Scalability of Discriminative Learning Methods for Markov Logic Networks
2011-05-01
9 2.2 Inductive Logic Programming and Aleph . . . . . . . . . . . . 10 2.3 MLNs and Alchemy...0) 2.2 Inductive Logic Programming and Aleph Traditional Inductive Logic Programming (ILP) systems discrimina- tively learn logical Horn-clause rules...ILP, please see (Dzeroski, 2007). Aleph is a popular and effective ILP system primarily based on Pro- gol (Muggleton, 1995). The basic Aleph
Díez, Francisco J; Yebra, Mar; Bermejo, Iñigo; Palacios-Alonso, Miguel A; Calleja, Manuel Arias; Luque, Manuel; Pérez-Martín, Jorge
2017-02-01
Markov influence diagrams (MIDs) are a new type of probabilistic graphical model that extends influence diagrams in the same way that Markov decision trees extend decision trees. They have been designed to build state-transition models, mainly in medicine, and perform cost-effectiveness analyses. Using a causal graph that may contain several variables per cycle, MIDs can model various patient characteristics without multiplying the number of states; in particular, they can represent the history of the patient without using tunnel states. OpenMarkov, an open-source tool, allows the decision analyst to build and evaluate MIDs-including cost-effectiveness analysis and several types of deterministic and probabilistic sensitivity analysis-with a graphical user interface, without writing any code. This way, MIDs can be used to easily build and evaluate complex models whose implementation as spreadsheets or decision trees would be cumbersome or unfeasible in practice. Furthermore, many problems that previously required discrete event simulation can be solved with MIDs; i.e., within the paradigm of state-transition models, in which many health economists feel more comfortable.
A domain reasoner for propositional logic
Lodder, Josje; Heeren, Bastiaan|info:eu-repo/dai/nl/304840130; Jeuring, Johan|info:eu-repo/dai/nl/075189771
2015-01-01
Students learn propositional logic in programs such as mathematics, philosophy, computer science, law, etc. An important topic in courses in propositional logic is rewriting propositional formulae with standard equivalences, and the application of this technique in exercises on rewriting a formula
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy student...
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...
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.
Engineering Holographic Superconductor Phase Diagrams
Chen, Jiunn-Wei; Dai, Shou-Huang; Maity, Debaprasad; Zhang, Yun-Long
2016-01-01
We study how to engineer holographic models with features of a high temperature superconductor phase diagram. We introduce a field in the bulk which provides a tunable "doping" parameter in the boundary theory. By designing how this field changes the effective masses of other order parameter fields, desired phase diagrams can be engineered. We give examples of generating phase diagrams with phase boundaries similar to a superconducting dome and an anti-ferromagnetic phase by including two ord...
Many-valued Logic and Fuzzy Logic
Czech Academy of Sciences Publication Activity Database
Hájek, Petr
2011-01-01
Roč. 27, č. 2 (2011), s. 315-324 ISSN 0970-7794 R&D Projects: GA ČR GEICC/08/E018 Institutional research plan: CEZ:AV0Z10300504 Keywords : many valued logic * fuzzy logic Subject RIV: BA - General Mathematics
Quantum logic as a dynamic logic
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".
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.
Design of reconfigurable logic controllers
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...
Shalack, V.
2013-01-01
The article offers a look at the combinatorial logic as the logic of signs operating in the most general sense. For this it is proposed slightly reformulate it in terms of introducing and replacement of the definitions.
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...
Fuzzy logic controller optimization
Sepe, Jr., Raymond B; Miller, John Michael
2004-03-23
A method is provided for optimizing a rotating induction machine system fuzzy logic controller. The fuzzy logic controller has at least one input and at least one output. Each input accepts a machine system operating parameter. Each output produces at least one machine system control parameter. The fuzzy logic controller generates each output based on at least one input and on fuzzy logic decision parameters. Optimization begins by obtaining a set of data relating each control parameter to at least one operating parameter for each machine operating region. A model is constructed for each machine operating region based on the machine operating region data obtained. The fuzzy logic controller is simulated with at least one created model in a feedback loop from a fuzzy logic output to a fuzzy logic input. Fuzzy logic decision parameters are optimized based on the simulation.
Newton-Smith, WH
2003-01-01
A complete introduction to logic for first-year university students with no background in logic, philosophy or mathematics. In easily understood steps it shows the mechanics of the formal analysis of arguments.
James, A. P.; Francis, L. R. V. J.; Kumar, D.
2013-01-01
We report a resistance based threshold logic family useful for mimicking brain like large variable logic functions in VLSI. A universal Boolean logic cell based on an analog resistive divider and threshold logic circuit is presented. The resistive divider is implemented using memristors and provides output voltage as a summation of weighted product of input voltages. The output of resistive divider is converted into a binary value by a threshold operation implemented by CMOS inverter and/or O...
Institutional Logics in Action
DEFF Research Database (Denmark)
Lounsbury, Michael; Boxenbaum, Eva
2013-01-01
This double volume presents state-of-the-art research and thinking on the dynamics of actors and institutional logics. In the introduction, we briefly sketch the roots and branches of institutional logics scholarship before turning to the new buds of research on the topic of how actors engage ins...... prolific stream of research on institutional logics by deepening our insight into the active use of institutional logics in organizational action and interaction, including the institutional effects of such (inter)actions....
Indian Academy of Sciences (India)
andoh
input signals, consisting of random square waves. We find that, in an optimal band of noise, the output consistently is a logical combination of the input signals: Logical Stochastic Resonance. (LSR) with K. Murali, W.L. Ditto, A. Bulsara. Physical Review Letters, March 2009. Sudeshna Sinha. Logical Stochastic Resonance ...
Ciardelli, I.A.
2016-01-01
This dissertation pursues two tightly interwoven goals: to bring out the relevance of questions for the field of logic, and to establish a solid theory of the logic of questions within a classical logical setting. These enterprises feed into each other: on the one hand, the development of our formal
Magnetic Logic Circuits for Extreme Environments Project
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...
Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing
Luo, Zhaochu
2016-11-16
In the magnetic logic, four basic Boolean logic operations can be programmed by a magnetic bit at room temperature with a high output ratio (>103%). In the same clock cycle, benefiting from the built-in spin Hall effect, logic results can be directly written into magnetic bits using an all-electric method.
Transformations of triangle ladder diagrams
Kondrashuk, Igor; Vergara, Alvaro
2010-03-01
It is shown how dual space diagrammatic representation of momentum integrals corresponding to triangle ladder diagrams with an arbitrary number of rungs can be transformed to half-diamonds. In paper arXiv:0803.3420 [hep-th] the half-diamonds were related by conformal integral substitution to the diamonds which represent the dual space image of four-point ladder integrals in the four-dimensional momentum space. Acting in the way described in the present paper we do not need to use the known result for diamond (four-point) diagrams as an external input in deriving relations of arXiv:0803.3420 [hep-th], however, that result for the diamond diagram arises in the present proof as an intermediate consequence in a step-by-step diagrammatic transformation from the triangle ladder diagram to the half-diamond diagrams.
A Logical Analysis of Quantum Voting Protocols
Rad, Soroush Rafiee; Shirinkalam, Elahe; Smets, Sonja
2017-12-01
In this paper we provide a logical analysis of the Quantum Voting Protocol for Anonymous Surveying as developed by Horoshko and Kilin in (Phys. Lett. A 375, 1172-1175 2011). In particular we make use of the probabilistic logic of quantum programs as developed in (Int. J. Theor. Phys. 53, 3628-3647 2014) to provide a formal specification of the protocol and to derive its correctness. Our analysis is part of a wider program on the application of quantum logics to the formal verification of protocols in quantum communication and quantum computation.
A Logical Analysis of Quantum Voting Protocols
Rad, Soroush Rafiee; Shirinkalam, Elahe; Smets, Sonja
2017-07-01
In this paper we provide a logical analysis of the Quantum Voting Protocol for Anonymous Surveying as developed by Horoshko and Kilin in (Phys. Lett. A 375, 1172-1175 2011). In particular we make use of the probabilistic logic of quantum programs as developed in (Int. J. Theor. Phys. 53, 3628-3647 2014) to provide a formal specification of the protocol and to derive its correctness. Our analysis is part of a wider program on the application of quantum logics to the formal verification of protocols in quantum communication and quantum computation.
Symbolic logic and mechanical theorem proving
Chang, Chin-Liang
1969-01-01
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Dynamic Project Risk Analysis and Management Based on Influence Diagrams
Liu, Xiaohua; Yue, Chaoyuan
This paper presents a real-time process-oriented project risk analysis and management model which can be combined with the project general management, based on the hierarchical risk influence diagram which is constructed on the basis of network planning. Through network planning, it can solve the problems of the dynamic and overall identification of risk elements, and the showing and analysis of risk transfer along with the working procedure, and the timely and dynamic risk prevention and control as well. The influence diagram can effectively represent the risk combination and transfer in time and logic order. And it is good at the analysis of the sensitivity and control value of risk elements, as well as being convenient for communicating between experts, managers and owner. So the hierarchical risk influence diagram can make the decision of risk management timelier and more accurate. The problems of risk description, diagrams construction and risk evaluation are solved very well in applying the general influence diagram to dynamic project risk analysis. In the end, good result is attained in the example.
Graph-Based Logic and Sketches 1: The General Framework
Bagchi, Atish; Wells, Charles
1994-01-01
Traditional treatments of formal logic provide: 1. A syntax for formulas. 2. An inference relation between sets of formulas. 3. A rule for assigning meaning to formulas (semantics) that is sound with respect to the inference relation. First order logic, the logic and semantics of programming languages, and the languages that have been formulated for various kinds of categories are all commonly described in this way. The formulas in those logics are strings of symbols that are ultimately model...
Directory of Open Access Journals (Sweden)
Stephen Crain
2007-12-01
Full Text Available Arguments are presented supporting logical nativism: the conjecture that humans have an innate logic faculty. In making a case for logical nativism, this article concentrates on children’s acquisition of the logical concept of disjunction. Despite the widespread belief to the contrary, the interpretation of disjunction in human languages is arguably the same as it is in classical logic, namely inclusive–or. The argument proceeds with empirical support for the view that the inclusive–or is the meaning of disjunction in human languages, from studies of child language development and from cross-linguistic research. Evidence is presented showing that young children adhere to universal semantic principles that characterize adult linguistic competence across languages. Several a priori arguments are also offered in favour of logical nativism. These arguments show that logic, like Socratic virtue and like certain aspects of language, is not learned and cannot be taught — thus supporting a strong form of innateness.
Rectangular diagrams of surfaces: representability
Dynnikov, I. A.; Prasolov, M. V.
2017-06-01
Introduced here is a simple combinatorial way, which is called a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on S^3 and to rectangular diagrams of links. By using rectangular diagrams of surfaces it is intended, in particular, to develop a method to distinguish Legendrian knots. This requires a lot of technical work of which the present paper addresses only the first basic question: which isotopy classes of surfaces can be represented by a rectangular diagram? Roughly speaking, the answer is this: there is no restriction on the isotopy class of the surface, but there is a restriction on the rectangular diagram of the boundary link arising from the presentation of the surface. The result extends to Giroux's convex surfaces for which this restriction on the boundary has a natural meaning. In a subsequent paper, transformations of rectangular diagrams of surfaces will be considered and their properties will be studied. By using the formalism of rectangular diagrams of surfaces an annulus in S^3 is produced here that is expected to be a counterexample to the following conjecture: if two Legendrian knots cobound an annulus and have zero Thurston-Bennequin numbers relative to this annulus, then they are Legendrian isotopic. Bibliography: 30 titles.
The Genesis of Feynman Diagrams
Wuthrich, Adrian
2011-01-01
In a detailed reconstruction of the genesis of Feynman diagrams the author reveals that their development was constantly driven by the attempt to resolve fundamental problems concerning the uninterpretable infinities that arose in quantum as well as classical theories of electrodynamic phenomena. Accordingly, as a comparison with the graphical representations that were in use before Feynman diagrams shows, the resulting theory of quantum electrodynamics, featuring Feynman diagrams, differed significantly from earlier versions of the theory in the way in which the relevant phenomena were concep
Magnetic-field-controlled reconfigurable semiconductor logic.
Joo, Sungjung; Kim, Taeyueb; Shin, Sang Hoon; Lim, Ju Young; Hong, Jinki; Song, Jin Dong; Chang, Joonyeon; Lee, Hyun-Woo; Rhie, Kungwon; Han, Suk Hee; Shin, Kyung-Ho; Johnson, Mark
2013-02-07
Logic devices based on magnetism show promise for increasing computational efficiency while decreasing consumed power. They offer zero quiescent power and yet combine novel functions such as programmable logic operation and non-volatile built-in memory. However, practical efforts to adapt a magnetic device to logic suffer from a low signal-to-noise ratio and other performance attributes that are not adequate for logic gates. Rather than exploiting magnetoresistive effects that result from spin-dependent transport of carriers, we have approached the development of a magnetic logic device in a different way: we use the phenomenon of large magnetoresistance found in non-magnetic semiconductors in high electric fields. Here we report a device showing a strong diode characteristic that is highly sensitive to both the sign and the magnitude of an external magnetic field, offering a reversible change between two different characteristic states by the application of a magnetic field. This feature results from magnetic control of carrier generation and recombination in an InSb p-n bilayer channel. Simple circuits combining such elementary devices are fabricated and tested, and Boolean logic functions including AND, OR, NAND and NOR are performed. They are programmed dynamically by external electric or magnetic signals, demonstrating magnetic-field-controlled semiconductor reconfigurable logic at room temperature. This magnetic technology permits a new kind of spintronic device, characterized as a current switch rather than a voltage switch, and provides a simple and compact platform for non-volatile reconfigurable logic devices.
Extracting rules from neural networks as decision diagrams.
Chorowski, Jan; Zurada, Jacek M
2011-12-01
Rule extraction from neural networks (NNs) solves two fundamental problems: it gives insight into the logic behind the network and in many cases, it improves the network's ability to generalize the acquired knowledge. This paper presents a novel eclectic approach to rule extraction from NNs, named LOcal Rule Extraction (LORE), suited for multilayer perceptron networks with discrete (logical or categorical) inputs. The extracted rules mimic network behavior on the training set and relax this condition on the remaining input space. First, a multilayer perceptron network is trained under standard regime. It is then transformed into an equivalent form, returning the same numerical result as the original network, yet being able to produce rules generalizing the network output for cases similar to a given input. The partial rules extracted for every training set sample are then merged to form a decision diagram (DD) from which logic rules can be extracted. A rule format explicitly separating subsets of inputs for which an answer is known from those with an undetermined answer is presented. A special data structure, the decision diagram, allowing efficient partial rule merging is introduced. With regard to rules' complexity and generalization abilities, LORE gives results comparable to those reported previously. An algorithm transforming DDs into interpretable boolean expressions is described. Experimental running times of rule extraction are proportional to the network's training time.
Bayesian Networks and Influence Diagrams
DEFF Research Database (Denmark)
Kjærulff, Uffe Bro; Madsen, Anders Læsø
Probabilistic networks, also known as Bayesian networks and influence diagrams, have become one of the most promising technologies in the area of applied artificial intelligence, offering intuitive, efficient, and reliable methods for diagnosis, prediction, decision making, classification...
Second report on sintering diagrams
Energy Technology Data Exchange (ETDEWEB)
Swinkels, F.B.; Ashby, M.F.
1980-04-01
Sintering-mechanism diagrams are diagrams with axes of neck-size or density, and temperature, which identify the fields of dominance of each of the several mechanisms which contribute to sintering, and show the rate or extent of sintering that all the mechanisms, acting together, produce. The present paper incorporates certain new ideas about sintering into the diagrams: the coupling of boundary diffusion and surface diffusion; new criteria for the stages of sintering; and an approximate treatment of particle rearrangement. Diagrams showing how both the neck size and the density of compacts of wires and of spheres change with time and temperature are developed. Their use is illustrated by an analysis of a large body of sintering data for both wires and spheres of Ag, Cu, Ni, Fe, W, NaCl and Stainless Steel.
Wind Diagrams in Medieval Iceland
DEFF Research Database (Denmark)
Kedwards, Dale
2014-01-01
This article presents a study of the sole wind diagram that survives from medieval Iceland, preserved in the encyclopaedic miscellany in Copenhagen's Arnamagnæan Institute with the shelf mark AM 732b 4to (c. 1300-25). It examines the wind diagram and its accompanying text, an excerpt on the winds...... from Isidore of Seville's Etymologies. It also examines the perimeter of winds on two medieval Icelandic world maps, and the visual traditions from which they draw....
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...
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.
Session Types in Abelian Logic
Directory of Open Access Journals (Sweden)
Yoichi Hirai
2013-12-01
Full Text Available There was a PhD student who says "I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes." We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky's linear lambda calculus LF and characterizes Abelian logic.
Digital Microfluidic Logic Gates
Zhao, Yang; Xu, Tao; Chakrabarty, Krishnendu
Microfluidic computing is an emerging application for microfluidics technology. We propose microfluidic logic gates based on digital microfluidics. Using the principle of electrowetting-on-dielectric, AND, OR, NOT and XOR gates are implemented through basic droplet-handling operations such as transporting, merging and splitting. The same input-output interpretation enables the cascading of gates to create nontrivial computing systems. We present a potential application for microfluidic logic gates by implementing microfluidic logic operations for on-chip HIV test.
Du Fresne, E. R.; Dowler, W. L.
1985-01-01
Logic gates for light signals constructed from combinations of prisms, polarizing plates, and quarterwave plates. Optical logic gate performs elementary logic operation on light signals received along two optical fibers. Whether gate performs OR function or exclusive-OR function depends on orientation of analyzer. Nonbinary truth tables also obtained by rotating polarizer or analyzer to other positions or inserting other quarter-wave plates.
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2012-01-01
In this paper we explore the logic of now, yesterday, today and tomorrow by combining the semantic approach to indexicality pioneered by Hans Kamp [9] and refined by David Kaplan [10] with hybrid tense logic. We first introduce a special now nominal (our @now corresponds to Kamp’s original now...... operator N) and prove completeness results for both logical and contextual validity. We then add propositional constants to handle yesterday, today and tomorrow; our system correctly treats sentences like “Niels will die yesterday” as contextually unsatisfiable. Building on our completeness results for now......, we prove completeness for the richer language, again for both logical and contextual validity....
Introduction to mathematical logic
Mendelson, Elliott
2015-01-01
The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.The sixth edition incorporates recent work on Gödel's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition. It is offered in th
DEFF Research Database (Denmark)
Jensen, Jonas Buhrkal; Birkedal, Lars
2012-01-01
, separation means physical separation. In this paper, we introduce \\emph{fictional separation logic}, which includes more general forms of fictional separating conjunctions P * Q, where "*" does not require physical separation, but may also be used in situations where the memory resources described by P and Q...... overlap. We demonstrate, via a range of examples, how fictional separation logic can be used to reason locally and modularly about mutable abstract data types, possibly implemented using sophisticated sharing. Fictional separation logic is defined on top of standard separation logic, and both the meta...
Crossley, J N; Brickhill, CJ; Stillwell, JC
2010-01-01
Although mathematical logic can be a formidably abstruse topic, even for mathematicians, this concise book presents the subject in a lively and approachable fashion. It deals with the very important ideas in modern mathematical logic without the detailed mathematical work required of those with a professional interest in logic.The book begins with a historical survey of the development of mathematical logic from two parallel streams: formal deduction, which originated with Aristotle, Euclid, and others; and mathematical analysis, which dates back to Archimedes in the same era. The streams beg
DEFF Research Database (Denmark)
Lopez, Hugo Andres; Carbone, Marco; Hildebrandt, Thomas
2010-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for speciﬁcation and veriﬁcation of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL...... ), a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service speciﬁcations. Finally, we show that, despite GL is undecidable, there is a signiﬁcant decidable fragment which we provide with a sound and complete proof...
Philosophical, logical and scientific perspectives in engineering
Sen, Zekâi
2013-01-01
This book highlights and explains the significance of philosophical, logical, and scientific principles for engineering education/training and engineering works. In so doing, it aims to help to rectify the neglect of philosophy and logic in current education and training programs, which emphasize analytical and numerical methods at the expense of the innovative practical and creative abilities so important for engineering in the past. Individual chapters examine the relation of philosophy, logic, and science to engineering, drawing attention to, for example, the significance of ethics, the rel
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....
Towards a Formal Occurrence Logic based on Predicate Logic
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
2015-01-01
argumentation based on formal Occurrence Logic concerning events and occurrences, and illustrate the relations between Predicate Logic and Occurrence Logic. The relationships (and dependencies) is conducive to an approach that can analyse the occurrences of ”logical statements based on different logical...
Conceptual Modeling via Logic Programming
1990-01-01
Costs. Cost significant areas may fail to be identified for a and units of fiscal -year cost are the major particular analysis. Thus evaluation of the...subject to fiscal constraints. from all available sensors to reduce depend- This is of medium or low priority since there ence on sensor survivability...many caes it may not be possible or practica to sensors may be required to have reduced areas of coverage to prevent satunation atempt to increase the
Understanding Social Media Logic
Directory of Open Access Journals (Sweden)
José van Dijck
2013-08-01
Full Text Available Over the past decade, social media platforms have penetrated deeply into the mechanics of everyday life, affecting people's informal interactions, as well as institutional structures and professional routines. Far from being neutral platforms for everyone, social media have changed the conditions and rules of social interaction. In this article, we examine the intricate dynamic between social media platforms, mass media, users, and social institutions by calling attention to social media logic—the norms, strategies, mechanisms, and economies—underpinning its dynamics. This logic will be considered in light of what has been identified as mass media logic, which has helped spread the media's powerful discourse outside its institutional boundaries. Theorizing social media logic, we identify four grounding principles—programmability, popularity, connectivity, and datafication—and argue that these principles become increasingly entangled with mass media logic. The logic of social media, rooted in these grounding principles and strategies, is gradually invading all areas of public life. Besides print news and broadcasting, it also affects law and order, social activism, politics, and so forth. Therefore, its sustaining logic and widespread dissemination deserve to be scrutinized in detail in order to better understand its impact in various domains. Concentrating on the tactics and strategies at work in social media logic, we reassess the constellation of power relationships in which social practices unfold, raising questions such as: How does social media logic modify or enhance existing mass media logic? And how is this new media logic exported beyond the boundaries of (social or mass media proper? The underlying principles, tactics, and strategies may be relatively simple to identify, but it is much harder to map the complex connections between platforms that distribute this logic: users that employ them, technologies that
Formal verification of Simulink/Stateflow diagrams a deductive approach
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.
Uranium phase diagram from first principles
Yanilkin, Alexey; Kruglov, Ivan; Migdal, Kirill; Oganov, Artem; Pokatashkin, Pavel; Sergeev, Oleg
2017-06-01
The work is devoted to the investigation of uranium phase diagram up to pressure of 1 TPa and temperature of 15 kK based on density functional theory. First of all the comparison of pseudopotential and full potential calculations is carried out for different uranium phases. In the second step, phase diagram at zero temperature is investigated by means of program USPEX and pseudopotential calculations. Stable and metastable structures with close energies are selected. In order to obtain phase diagram at finite temperatures the preliminary selection of stable phases is made by free energy calculation based on small displacement method. For remaining candidates the accurate values of free energy are obtained by means of thermodynamic integration method (TIM). For this purpose quantum molecular dynamics are carried out at different volumes and temperatures. Interatomic potentials based machine learning are developed in order to consider large systems and long times for TIM. The potentials reproduce the free energy with the accuracy 1-5 meV/atom, which is sufficient for prediction of phase transitions. The equilibrium curves of different phases are obtained based on free energies. Melting curve is calculated by modified Z-method with developed potential.
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.
Learning fuzzy logic control system
Lung, Leung Kam
1994-01-01
The performance of the Learning Fuzzy Logic Control System (LFLCS), developed in this thesis, has been evaluated. The Learning Fuzzy Logic Controller (LFLC) learns to control the motor by learning the set of teaching values that are generated by a classical PI controller. It is assumed that the classical PI controller is tuned to minimize the error of a position control system of the D.C. motor. The Learning Fuzzy Logic Controller developed in this thesis is a multi-input single-output network. Training of the Learning Fuzzy Logic Controller is implemented off-line. Upon completion of the training process (using Supervised Learning, and Unsupervised Learning), the LFLC replaces the classical PI controller. In this thesis, a closed loop position control system of a D.C. motor using the LFLC is implemented. The primary focus is on the learning capabilities of the Learning Fuzzy Logic Controller. The learning includes symbolic representation of the Input Linguistic Nodes set and Output Linguistic Notes set. In addition, we investigate the knowledge-based representation for the network. As part of the design process, we implement a digital computer simulation of the LFLCS. The computer simulation program is written in 'C' computer language, and it is implemented in DOS platform. The LFLCS, designed in this thesis, has been developed on a IBM compatible 486-DX2 66 computer. First, the performance of the Learning Fuzzy Logic Controller is evaluated by comparing the angular shaft position of the D.C. motor controlled by a conventional PI controller and that controlled by the LFLC. Second, the symbolic representation of the LFLC and the knowledge-based representation for the network are investigated by observing the parameters of the Fuzzy Logic membership functions and the links at each layer of the LFLC. While there are some limitations of application with this approach, the result of the simulation shows that the LFLC is able to control the angular shaft position of the
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.
A. Ponse (Alban); M.B. van der Zwaag
2002-01-01
textabstractWe distinguish two interpretations for the truth value `undefined' in Kleene's three-valued logic. Combining these two interpretations leads to a four-valued propositional logic that characterizes two particular ingredients of process algebra: ``choice' and ``inaction'. We study two
Directory of Open Access Journals (Sweden)
Evandro Agazzi
2011-06-01
Full Text Available Humans have used arguments for defending or refuting statements long before the creation of logic as a specialized discipline. This can be interpreted as the fact that an intuitive notion of "logical consequence" or a psychic disposition to articulate reasoning according to this pattern is present in common sense, and logic simply aims at describing and codifying the features of this spontaneous capacity of human reason. It is well known, however, that several arguments easily accepted by common sense are actually "logical fallacies", and this indicates that logic is not just a descriptive, but also a prescriptive or normative enterprise, in which the notion of logical consequence is defined in a precise way and then certain rules are established in order to maintain the discourse in keeping with this notion. Yet in the justification of the correctness and adequacy of these rules commonsense reasoning must necessarily be used, and in such a way its foundational role is recognized. Moreover, it remains also true that several branches and forms of logic have been elaborated precisely in order to reflect the structural features of correct argument used in different fields of human reasoning and yet insufficiently mirrored by the most familiar logical formalisms.
DEFF Research Database (Denmark)
Monica, Dario Della; Goranko, Valentin; Montanari, Angelo
2011-01-01
We discuss a family of modal logics for reasoning about relational structures of intervals over (usually) linear orders, with modal operators associated with the various binary relations between such intervals, known as Allen’s interval relations. The formulae of these logics are evaluated at int...
NEVEN, Frank
2002-01-01
We survey some recent developments in the broad area of automata and logic which are motivated by the advent of XML. In particular, we consider unranked tree automata, tree-walking automata, and automata over infinite alphabets. We focus on their connection with logic and on questions imposed by XML.
CSIR Research Space (South Africa)
Klarman, S
2013-05-01
Full Text Available We introduce Description Logics of Context (DLCs) - an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy's tradition of treating contexts as formal objects over which one can quantify...
W. van der Hoek (Wiebe); J.O.M. Jaspars; E. Thijsse
1995-01-01
textabstractWe propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the
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...... the norm -- arbitrary (i.e., order-independent) derivations. We show that rich and accurate knowledge extraction from text can be achieved through the use of this new formalism......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...
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
The purpose of the article is to demonstrate that in order to understand competition as a socially organizing phenomenon, we should not examine competition in isolation, but as constellations of heterogeneous logics. More precisely, the article is based on two main theoretical points: (1) Logics...... of competition are only realized as particular forms of social organization by virtue of interplaying with other kinds of logics, like legal logics. (2) Competition logics enjoy a peculiar status in-between constructedness and givenness; although competition depends on laws and mechanisms of socialization, we...... still experience competition as an expression of spontaneous human activities. On the basis of these perspectives, a study of fundamental rights of EU law, springing from the principle of ‘free movement of people’, is conducted. The first part of the empirical analysis seeks to detect the presence...
Microelectromechanical reprogrammable logic device
Hafiz, Md Abdullah Al
2016-03-29
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
Improving modeling with layered UML diagrams
DEFF Research Database (Denmark)
Störrle, Harald
2013-01-01
Layered diagrams are diagrams whose elements are organized into sets of layers. Layered diagrams are routinely used in many branches of engineering, except Software Engineering. In this paper, we propose to add layered diagrams to UML modeling tools, and elaborate the concept by exploring usage...
Multi-currency Influence Diagrams
DEFF Research Database (Denmark)
Nielsen, Søren Holbech; Nielsen, Thomas Dyhre; Jensen, Finn V.
2007-01-01
When using the influence diagrams framework for solving a decision problem with several different quantitative utilities, the traditional approach has been to convert the utilities into one common currency. This conversion is carried out using a tacit transformation, under the assumption that the......When using the influence diagrams framework for solving a decision problem with several different quantitative utilities, the traditional approach has been to convert the utilities into one common currency. This conversion is carried out using a tacit transformation, under the assumption...... that the converted problem is equivalent to the original one. In this paper we present an extension of the influence diagram framework. The extension allows for these decision problems to be modelled in their original form. We present an algorithm that, given a linear conversion function between the currencies...
Phase diagrams and crystal growth
Venkrbec, Jan
1980-04-01
Phase diagrams are briefly treated as generalized property-composition relationships, with respect to crystal technology optimization. The treatment is based on mutual interaction of three systems related to semiconductors: (a) the semiconducting material systems, (b0 the data bank, (c) the system of crystallization methods. A model is proposed enabling optimatization on the path from application requirements to the desired material. Further, several examples of the selection as to the composition of LED and laser diode material are given. Some of molten-solution-zone methods are being successfully introduced for this purpose. Common features of these methods, the application of phase diagrams, and their pecularities compared with other crystallization methods are illustrated by schematic diagrams and by examples. LPE methods, particularly the steady-state LPE methods such as Woodall's ISM and Nishizawa's TDM-CVP, and the CAM-S (Crystallization Method Providing Composition Autocontrol in Situ) have been chosen as examples. Another approach of exploiting phase diagrams for optimal material selection and for determination of growth condition before experimentation through a simple calculation is presented on InP-GaP solid solutions. Ternary phase diagrams are visualized in space through calculation and constructions based on the corresponding thermodynamic models and anaglyphs. These make it easy to observe and qualitatively analyze the crystallization of every composition. Phase diagrams can be also used as a powerful tool for the deduction of new crystallization methods. Eutectic crystallization is an example of such an approach where a modified molten-solution-zone method can give a sandwich structure with an abrupt concentration change. The concentration of a component can range from 0 to 100% in the different solid phases.
Reconfigurable Skyrmion Logic Gates.
Luo, Shijiang; Song, Min; Li, Xin; Zhang, Yue; Hong, Jeongmin; Yang, Xiaofei; Zou, Xuecheng; Xu, Nuo; You, Long
2018-02-14
Magnetic skyrmion, a nanosized spin texture with topological property, has become an area of significant interest due to the scientific insight that it can provide and also its potential impact on applications such as ultra-low-energy and ultra-high-density logic gates. In the quest for the reconfiguration of single logic device and the implementation of the complete logic functions, a novel reconfigurable skyrmion logic (RSL) is proposed and verified by micromagnetic simulations. Logic functions including AND, OR, NOT, NAND, NOR, XOR, and XNOR are implemented in the ferromagnetic (FM) nanotrack by virtue of various effects including spin orbit torque, skyrmion Hall effect, skyrmion-edge repulsions, and skyrmion-skyrmion collision. Different logic functions can be selected in an RSL by applying voltage to specific region(s) of the device, changing the local anisotropy energy of FM film. Material properties and geometrical scaling studies suggest RSL gates fit for energy-efficient computing as well as provide the guidelines for the design and optimization of this new logic family.
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
Logic in elementary mathematics
Exner, Robert M
2011-01-01
This applications-related introductory treatment explores facets of modern symbolic logic useful in the exposition of elementary mathematics. The authors convey the material in a manner accessible to those trained in standard elementary mathematics but lacking any formal background in logic. Topics include the statement calculus, proof and demonstration, abstract mathematical systems, and the restricted predicate calculus. The final chapter draws upon the methods of logical reasoning covered in previous chapters to develop solutions of linear and quadratic equations, definitions of order and
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method.......Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...
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 ......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...
DEFF Research Database (Denmark)
Filipiuk, Piotr; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions...... are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping of analyses and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases...
Active structural control by fuzzy logic rules: An introduction
Energy Technology Data Exchange (ETDEWEB)
Tang, Y.
1995-07-01
An introduction to fuzzy logic control applied to the active structural control to reduce the dynamic response of structures subjected to earthquake excitations is presented. It is hoped that this presentation will increase the attractiveness of the methodology to structural engineers in research as well as in practice. The basic concept of the fuzzy logic control are explained by examples and by diagrams with a minimum of mathematics. The effectiveness and simplicity of the fuzzy logic control is demonstrated by a numerical example in which the response of a single-degree-of-freedom system subjected to earthquake excitations is controlled by making use of the fuzzy logic controller. In the example, the fuzzy rules are first learned from the results obtained from linear control theory; then they are fine tuned to improve their performance. It is shown that the performance of fuzzy logic control surpasses that of the linear control theory. The paper shows that linear control theory provides experience for fuzzy logic control, and fuzzy logic control can provide better performance; therefore, two controllers complement each other.
Active structural control by fuzzy logic rules: An introduction
Energy Technology Data Exchange (ETDEWEB)
Tang, Yu [Argonne National Lab., IL (United States). Reactor Engineering Div.; Wu, Kung C. [Texas Univ., El Paso, TX (United States). Dept. of Mechanical and Industrial Engineering
1996-12-31
A zeroth level introduction to fuzzy logic control applied to the active structural control to reduce the dynamic response of structures subjected to earthquake excitations is presented. It is hoped that this presentation will increase the attractiveness of the methodology to structural engineers in research as well as in practice. The basic concept of the fuzzy logic control are explained by examples and by diagrams with a minimum of mathematics. The effectiveness and simplicity of the fuzzy logic control is demonstrated by a numerical example in which the response of a single- degree-of-freedom system subjected to earthquake excitations is controlled by making use of the fuzzy logic controller. In the example, the fuzzy rules are first learned from the results obtained from linear control theory; then they are fine tuned to improve their performance. It is shown that the performance of fuzzy logic control surpasses that of the linear control theory. The paper shows that linear control theory provides experience for fuzzy logic control, and fuzzy logic control can provide better performance; therefore, two controllers complement each other.
The diagram for phyllotactic series
Directory of Open Access Journals (Sweden)
Joanna Szymanowska-Pułka
2014-01-01
Full Text Available Many authors studying phyllotaxis in various plant species have reported the occurrence of many different numbers of contact parastichy pairs that are members of different Fibonacci-like series. On the basis of these reports a diagram was constructed in which any theoretically possible series was represented by the two first members of a given series.
Phase diagram of Hertzian spheres
Pàmies, J.C.; Cacciuto, A.; Frenkel, D.
2009-01-01
We report the phase diagram of interpenetrating Hertzian spheres. The Hertz potential is purely repulsive, bounded at zero separation, and decreases monotonically as a power law with exponent 5/2, vanishing at the overlapping threshold. This simple functional describes the elastic interaction of
Phase diagrams for sonoluminescing bubbles
Hilgenfeldt, Sascha; Lohse, Detlef; Brenner, Michael P.
1996-01-01
Sound driven gas bubbles in water can emit light pulses. This phenomenon is called sonoluminescence (SL). Two different phases of single bubble SL have been proposed: diffusively stable and diffusively unstable SL. We present phase diagrams in the gas concentration versus forcing pressure state
Bayesian Networks and Influence Diagrams
DEFF Research Database (Denmark)
Kjærulff, Uffe Bro; Madsen, Anders Læsø
Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis, Second Edition, provides a comprehensive guide for practitioners who wish to understand, construct, and analyze intelligent systems for decision support based on probabilistic networks. This new edition contains six new...
Henson, C Ward; Kechris, Alexander S; Odell, Edward; Finet, Catherine; Michaux, Christian; Cassels, J W S
2003-01-01
This volume comprises articles from four outstanding researchers who work at the cusp of analysis and logic. The emphasis is on active research topics; many results are presented that have not been published before and open problems are formulated.
Czech Academy of Sciences Publication Activity Database
Klev, Ansten
2017-01-01
Roč. 25, č. 3 (2017), s. 341-368 ISSN 0031-8019 Institutional support: RVO:67985955 Keywords : Philosophy of mathematics * logicism * Richard Dedekind Subject RIV: AA - Philosophy ; Religion Impact factor: 0.419, year: 2016
Levine, Shellie-helane; And Others
1986-01-01
Introduces questions and activities involving soap bubbles which provide students with experiences in prediction and logic. Examines commonly held false conceptions related to the shapes that bubbles take and provides correct explanations for the phenomenon. (ML)
DEFF Research Database (Denmark)
Friche, Nanna; Normann Andersen, Vibeke
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...... combined with state funding through a taximeter scheme (pay per student). Secondly, party governance system involving labor market partners at both national and local level formalized through a national Council for Vocational Training and 50 local trade committees as well as local education committees...... at each college. The third governance logic is based on a decentralized quality management system at each college. Each college has set up its own system of quality developments and quality assurances. The fourth governance logic is performance management conducted by the national level towards...
Design of a Ferroelectric Programmable Logic Gate Array
MacLeod, Todd C.; Ho, Fat Duen
2003-01-01
A programmable logic gate array has been designed utilizing ferroelectric field effect transistors. The design has only a small number of gates, but this could be scaled up to a more useful size. Using FFET's in a logic array gives several advantages. First, it allows real-time programmability to the array to give high speed reconfiguration. It also allows the array to be configured nearly an unlimited number of times, unlike a FLASH FPGA. Finally, the Ferroelectric Programmable Logic Gate Array (FPLGA) can be implemented using a smaller number of transistors because of the inherent logic characteristics of an FFET. The device was only designed and modeled using Spice models of the circuit, including the FFET. The actual device was not produced. The design consists of a small array of NAND and NOR logic gates. Other gates could easily be produced. They are linked by FFET's that control the logic flow. Timing and logic tables have been produced showing the array can produce a variety of logic combinations at a real time usable speed. This device could be a prototype for a device that could be put into imbedded systems that need the high speed of hardware implementation of logic and the complexity to need to change the logic algorithm. Because of the non-volatile nature of the FFET, it would also be useful in situations that needed to program a logic array once and use it repeatedly after the power has been shut off.
Yanushkevich, Svetlana N
2008-01-01
Preface Design Process and Technology Theory of logic design Analysis and synthesis Implementation technologies Predictable technologies Contemporary CAD of logic networks Number Systems Positional numbers Counting in a positional number system Basic arithmetic operations in various number systems Binary arithmetic Radix-complement representations Techniques for conversion of numbers in various radices Overflow Residue arithmetic Other binary codes Redundancy and reliability Graphical Data Structures Graphs in discrete devices and systems design Basic definitions T
Logic and declarative language
Downward, M
2004-01-01
Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
1999-01-01
Conceptual spaces have been proposed as topological or geometric means for establishing conceptual structures and models. This paper, after briey reviewing conceptual spaces, focusses on the relationship between conceptual spaces and logical concept languages with operations for combining concepts...... to form concepts. Speci cally is introduced an algebraic concept logic, for which conceptual spaces are installed as semantic domain as replacement for, or enrichment of, the traditional....
Directory of Open Access Journals (Sweden)
Ostapenko Y.O.
2014-03-01
Full Text Available Purpose: to improve vocational and applied physical training of students of economics. Material: the pedagogical study involved 72 male students (aged 19-20 years. Results: job study was conducted. Defined professionally significant neurobehavioral performance of students of information logical group. Matched professionally applied exercises for their development. The results showed that in the process of purposeful muscle activity improved mechanisms of regulation of neural processes, adaptive changes occur that affect the temporal parameters of sensorimotor motor responses. A comparative analysis of the psychophysiological indicators of students of the control and experimental groups was done. Conclusions: it was found that matched professionally applied exercises positively affect the development of psycho-physiological qualities of students information and logical group of specialties.
Strong Completeness for Markovian Logics
DEFF Research Database (Denmark)
Kozen, Dexter; Mardare, Radu Iulian; Panangaden, Prakash
2013-01-01
In this paper we present Hilbert-style axiomatizations for three logics for reasoning about continuous-space Markov processes (MPs): (i) a logic for MPs defined for probability distributions on measurable state spaces, (ii) a logic for MPs defined for sub-probability distributions and (iii) a logic...
Philosophical Foundations of Intuitionistic Logic
Directory of Open Access Journals (Sweden)
L Nabavi
2013-02-01
Full Text Available Intuitionistic logic, as a non-classical logic, encompasses the principles of logical reasoning which were used by L. E. J. Brouwer in developing his intuitionistic mathematics. Brouwer rejected the principle of the excluded middle on the basis of his philosophy. In his philosophical view, logic is the application of mathematics to the language of mathematics. In other words, logic studies the patterns that characterize valid inference. The resulting linguistic system of logic may be studied mathematically, even independently of the mathematical activities that it was originally abstracted from. In this paper, the philosophical basis of Brouwerâs view about Logic and Mathematics is explained.
Philosophical Foundations of Intuitionistic Logic
Directory of Open Access Journals (Sweden)
L Nabavi
2013-03-01
Full Text Available Intuitionistic logic, as a non-classical logic, encompasses the principles of logical reasoning which were used by L. E. J. Brouwer in developing his intuitionistic mathematics. Brouwer rejected the principle of the excluded middle on the basis of his philosophy. In his philosophical view, logic is the application of mathematics to the language of mathematics. In other words, logic studies the patterns that characterize valid inference. The resulting linguistic system of logic may be studied mathematically, even independently of the mathematical activities that it was originally abstracted from. In this paper, the philosophical basis of Brouwer’s view about Logic and Mathematics is explained.
Bayesian Networks and Influence Diagrams
DEFF Research Database (Denmark)
Kjærulff, Uffe Bro; Madsen, Anders Læsø
Probabilistic networks, also known as Bayesian networks and influence diagrams, have become one of the most promising technologies in the area of applied artificial intelligence, offering intuitive, efficient, and reliable methods for diagnosis, prediction, decision making, classification......, and exercises are included for the reader to check his/her level of understanding. The techniques and methods presented for knowledge elicitation, model construction and verification, modeling techniques and tricks, learning models from data, and analyses of models have all been developed and refined......, troubleshooting, and data mining under uncertainty. Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis provides a comprehensive guide for practitioners who wish to understand, construct, and analyze intelligent systems for decision support based on probabilistic networks. Intended...
Bayesian Networks and Influence Diagrams
DEFF Research Database (Denmark)
Kjærulff, Uffe Bro; Madsen, Anders Læsø
, troubleshooting, and data mining under uncertainty. Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis provides a comprehensive guide for practitioners who wish to understand, construct, and analyze intelligent systems for decision support based on probabilistic networks. Intended...... Probabilistic networks, also known as Bayesian networks and influence diagrams, have become one of the most promising technologies in the area of applied artificial intelligence, offering intuitive, efficient, and reliable methods for diagnosis, prediction, decision making, classification......, and exercises are included for the reader to check his/her level of understanding. The techniques and methods presented for knowledge elicitation, model construction and verification, modeling techniques and tricks, learning models from data, and analyses of models have all been developed and refined...
Directory of Open Access Journals (Sweden)
Susanna Bisogni
2018-01-01
Full Text Available The cosmological model is at present not tested between the redshift of the farthest observed supernovae (z ~ 1.4 and that of the Cosmic Microwave Background (z ~ 1,100. Here we introduce a new method to measure the cosmological parameters: we show that quasars can be used as “standard candles” by employing the non-linear relation between their intrinsic UV and X-ray emission as an absolute distance indicator. We built a sample of ~1,900 quasars with available UV and X-ray observations, and produced a Hubble Diagram up to z ~ 5. The analysis of the quasar Hubble Diagram, when used in combination with supernovae, provides robust constraints on the matter and energy content in the cosmos. The application of this method to forthcoming, larger quasar samples, will also provide tight constraints on the dark energy equation of state and its possible evolution with time.
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.
Phase diagram of boron crystals
Shirai, Koun
2017-05-01
The current status of study on the phase diagram of boron is given from the theoretical viewpoint. Boron is the last elemental crystal whose phase diagram is missing. In the last decade, several new structures of boron allotropes were found, while some were disproven. Presently, even the number of allotropes of boron is uncertain. A simple reason for this is that there are many and complicated structures, and some are minimally different from the others. A theoretical study thus requires very high accuracy. The difficulty, however, is not merely a technical difficulty of computational scale. The physics involved is quite different from what is obtained by band theory, which is the most successful theory of solids. It is only recent that a fundamental problem of metal/insulator has been solved. We come to know that the interrelationships between nonstoichiometry, partially occupied sites, and the balance of intra/inter-icosahedral bonding, which were considered to be uncorrelated properties, inevitably determine the relative stability of various structures. The configuration of the defects in boron crystals is not capricious but there is some correlation among the defects. Many problems were solved on this ground, and contributed to the creation of the phase diagram. However, there are still many unsolved problems and some newly arose. In particular, for the tetragonal phase, sharp discrepancies are present in both experiment and theory. Thus, the problem of tetragonal phase is described in more detail. From the viewpoint of material research, the phase diagram provides the basis for searching new materials. State-of-the-art methods of structural prediction have stimulated researchers’ interest.
Fuzzy logic and neural network technologies
Villarreal, James A.; Lea, Robert N.; Savely, Robert T.
1992-01-01
Applications of fuzzy logic technologies in NASA projects are reviewed to examine their advantages in the development of neural networks for aerospace and commercial expert systems and control. Examples of fuzzy-logic applications include a 6-DOF spacecraft controller, collision-avoidance systems, and reinforcement-learning techniques. The commercial applications examined include a fuzzy autofocusing system, an air conditioning system, and an automobile transmission application. The practical use of fuzzy logic is set in the theoretical context of artificial neural systems (ANSs) to give the background for an overview of ANS research programs at NASA. The research and application programs include the Network Execution and Training Simulator and faster training algorithms such as the Difference Optimized Training Scheme. The networks are well suited for pattern-recognition applications such as predicting sunspots, controlling posture maintenance, and conducting adaptive diagnoses.
Mapping Modular SOS to Rewriting Logic
DEFF Research Database (Denmark)
Braga, Christiano de Oliveira; Haeusler, Edward Hermann; Meseguer, José
2003-01-01
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 and verif......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...... 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...
Non-logic devices in logic processes
Ma, Yanjun
2017-01-01
This book shows readers how to design semiconductor devices using the most common and lowest cost logic CMOS processes. Readers will benefit from the author’s extensive, industrial experience and the practical approach he describes for designing efficiently semiconductor devices that typically have to be implemented using specialized processes that are expensive, time-consuming, and low-yield. The author presents an integrated picture of semiconductor device physics and manufacturing techniques, as well as numerous practical examples of device designs that are tried and true.
Logic and truth: Some logics without theorems
Directory of Open Access Journals (Sweden)
Jayanta Sen
2008-08-01
Full Text Available Two types of logical consequence are compared: one, with respect to matrix and designated elements and the other with respect to ordering in a suitable algebraic structure. Particular emphasis is laid on algebraic structures in which there is no top-element relative to the ordering. The significance of this special condition is discussed. Sequent calculi for a number of such structures are developed. As a consequence it is re-established that the notion of truth as such, not to speak of tautologies, is inessential in order to define validity of an argument.
Using Affinity Diagrams to Evaluate Interactive Prototypes
Lucero, Andrés
2015-01-01
International audience; Affinity diagramming is a technique used to externalize, make sense of, and organize large amounts of unstructured, far-ranging, and seemingly dissimilar qualitative data. HCI and interaction design practitioners have adopted and used affinity diagrams for different purposes. This paper discusses our particular use of affinity diagramming in prototype evaluations. We reflect on a decade’s experience using affinity diagramming across a number of projects, both in indust...
Operations space diagram for ECRH and ECCD
DEFF Research Database (Denmark)
Bindslev, H.
2004-01-01
A Clemmov-Mullaly-Allis (CMA) type diagram, the ECW-CMA diagram, for representing the operational possibilities of electron cyclotron heating and current drive (ECRH/ECCD) systems for fusion plasmas is presented. In this diagram, with normalized density and normalized magnetic field coordinates...
Carlsson, Christer; Fullér, Robert
2004-01-01
Fuzzy Logic in Management demonstrates that difficult problems and changes in the management environment can be more easily handled by bringing fuzzy logic into the practice of management. This explicit theme is developed through the book as follows: Chapter 1, "Management and Intelligent Support Technologies", is a short survey of management leadership and what can be gained from support technologies. Chapter 2, "Fuzzy Sets and Fuzzy Logic", provides a short introduction to fuzzy sets, fuzzy relations, the extension principle, fuzzy implications and linguistic variables. Chapter 3, "Group Decision Support Systems", deals with group decision making, and discusses methods for supporting the consensus reaching processes. Chapter 4, "Fuzzy Real Options for Strategic Planning", summarizes research where the fuzzy real options theory was implemented as a series of models. These models were thoroughly tested on a number of real life investments, and validated in 2001. Chapter 5, "Soft Computing Methods for Reducing...
Directory of Open Access Journals (Sweden)
Zoltan Erdei
2011-12-01
Full Text Available In this paper the authors present the usefulness of fuzzy logic in controlling engineering processes or applications. Although fuzzy logic does not represent a novelty for the scientific and engineering field, it enjoys a great appreciation from those involved in the two domains. The fact that fuzzy logic uses sentences kindred with the natural language make it easier to comprehend that a complex mathematical model required by the classic control theory. In MatLab software there are dedicated toolboxes to this subject that make the design of a fuzzy controller a facile one. In the paper design methods of a fuzzy controller are being presented both in Simulink and MatLab.
Krasowski, Michael J. (Inventor); Prokop, Norman F. (Inventor)
2017-01-01
A current source logic gate with depletion mode field effect transistor ("FET") transistors and resistors may include a current source, a current steering switch input stage, and a resistor divider level shifting output stage. The current source may include a transistor and a current source resistor. The current steering switch input stage may include a transistor to steer current to set an output stage bias point depending on an input logic signal state. The resistor divider level shifting output stage may include a first resistor and a second resistor to set the output stage point and produce valid output logic signal states. The transistor of the current steering switch input stage may function as a switch to provide at least two operating points.
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...... case studies and it has been extended in several directions. The aim of this paper is to provide a thorough presentation of the logic.......The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Rushton, Andrew
2011-01-01
Many engineers encountering VHDL (very high speed integrated circuits hardware description language) for the first time can feel overwhelmed by it. This book bridges the gap between the VHDL language and the hardware that results from logic synthesis with clear organisation, progressing from the basics of combinational logic, types, and operators; through special structures such as tristate buses, register banks and memories, to advanced themes such as developing your own packages, writing test benches and using the full range of synthesis types. This third edition has been substantially rewritten to include the new VHDL-2008 features that enable synthesis of fixed-point and floating-point hardware. Extensively updated throughout to reflect modern logic synthesis usage, it also contains a complete case study to demonstrate the updated features. Features to this edition include: * a common VHDL subset which will work across a range of different synthesis systems, targeting a very wide range of technologies...
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...... depths. An evaluation of the system based on a total of 1671 experiments has shown that unfavourable snarled chips can be detected with 98% certainty which indeed makes the system a valuable tool in chip breakability tests. Using the system, chip breaking diagrams can be elaborated with a previously...
Diagram, a Learning Environment for Initiation to Object-Oriented Modeling with UML Class Diagrams
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…
Caicedo, Xavier; Rodriguez, Ricardo Oscar
2009-01-01
In this paper we consider an approach where both propositions and the accessibility relation are infinitely many-valued over G\\"{o}del algebras. In particular, we consider separately the $\\Box $-fragment and the $\\Diamond $-fragment of our G\\"{o}del modal logic and prove that both logics are complete with respect to the class of models with values in the linear Hetying algebra [0,1]. In addition, we show that the first fragment is uniquely determined by the class of models having crisp access...
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artifacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D-algebra....
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artefacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D -algebra....
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates...... of the exponentially distributed random variables that characterize the duration of the labeled transitions of a CMP. In this paper we present weak and strong complete axiomatizations for CML and prove a series of metaproperties, including the finite model property and the construction of canonical models. CML...
Introduction to mathematical logic
Mendelson, Elliott
2009-01-01
The Propositional CalculusPropositional Connectives. Truth TablesTautologies Adequate Sets of Connectives An Axiom System for the Propositional Calculus Independence. Many-Valued LogicsOther AxiomatizationsFirst-Order Logic and Model TheoryQuantifiersFirst-Order Languages and Their Interpretations. Satisfiability and Truth. ModelsFirst-Order TheoriesProperties of First-Order Theories Additional Metatheorems and Derived Rules Rule C Completeness Theorems First-Order Theories with EqualityDefinitions of New Function Letters and Individual Constants Prenex Normal Forms Isomorphism of Interpretati
Stoll, Robert R
1979-01-01
Set Theory and Logic is the result of a course of lectures for advanced undergraduates, developed at Oberlin College for the purpose of introducing students to the conceptual foundations of mathematics. Mathematics, specifically the real number system, is approached as a unity whose operations can be logically ordered through axioms. One of the most complex and essential of modern mathematical innovations, the theory of sets (crucial to quantum mechanics and other sciences), is introduced in a most careful concept manner, aiming for the maximum in clarity and stimulation for further study in
Evens, Aden
2015-01-01
Building a foundational understanding of the digital, Logic of the Digital reveals a unique digital ontology. Beginning from formal and technical characteristics, especially the binary code at the core of all digital technologies, Aden Evens traces the pathways along which the digital domain of abstract logic encounters the material, human world. How does a code using only 0s and 1s give rise to the vast range of applications and information that constitutes a great and growing portion of our world? Evens' analysis shows how any encounter between the actual and the digital must cross an ontolo
Preferences of Agents in Defeasible Logic
M. Dastani; G. Governatori; A. Rotolo; L.W.N. van der Torre (Leon)
2005-01-01
htmlabstractDefeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference procedures. We discuss patterns of agent types in this setting. Finally,
Using Affinity Diagrams to Evaluate Interactive Prototypes
DEFF Research Database (Denmark)
Lucero, Andrés
2015-01-01
our particular use of affinity diagramming in prototype evaluations. We reflect on a decade’s experience using affinity diagramming across a number of projects, both in industry and academia. Our affinity diagramming process in interaction design has been tailored and consists of four stages: creating......Affinity diagramming is a technique used to externalize, make sense of, and organize large amounts of unstructured, far-ranging, and seemingly dissimilar qualitative data. HCI and interaction design practitioners have adopted and used affinity diagrams for different purposes. This paper discusses...
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......, 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......Context: Previously, we have defined the notion of diagram size and studied its impact on the understanding of UML diagrams. Subsequently, questions have been raised regarding the reliability and generality of our findings. Also, new questions arose regarding how the quality of diagrams could...
Querying Natural Logic Knowledge Bases
DEFF Research Database (Denmark)
Andreasen, Troels; Bulskov, Henrik; Jensen, Per Anker
2017-01-01
This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes...... in ontologies and class-relationships such as are common in life-science descriptions. The paper adopts a version of natural logic with recursive restrictive clauses such as relative clauses and adnominal prepositional phrases. It includes passive as well as active voice sentences. We outline a prototype...... for partial translation of natural language into natural logic, featuring further querying and conceptual path finding in natural logic knowledge bases....
Functions and generality of logic reflections on Dedekind's and Frege's logicisms
Benis-Sinaceur, Hourya; Sandu, Gabriel
2015-01-01
This book examines three connected aspects of Frege's logicism: the differences between Dedekind's and Frege's interpretation of the term 'logic' and related terms and reflects on Frege's notion of function, comparing its understanding and the role it played in Frege's and Lagrange's foundational programs. It concludes with an examination of the notion of arbitrary function, taking into account Frege's, Ramsey's and Russell's view on the subject. Composed of three chapters, this book sheds light on important aspects of Dedekind's and Frege's logicisms. The first chapter explains how, although he shares Frege's aim at substituting logical standards of rigor to intuitive imports from spatio-temporal experience into the deductive presentation of arithmetic, Dedekind had a different goal and used or invented different tools. The chapter highlights basic dissimilarities between Dedekind's and Frege's actual ways of doing and thinking. The second chapter reflects on Frege's notion of a function, in comparison with ...
Generation of Finite Life Distributional Goodman Diagrams for Reliability Prediction
Kececioglu, D.; Guerrieri, W. N.
1971-01-01
The methodology of developing finite life distributional Goodman diagrams and surfaces is described for presenting allowable combinations of alternating stress and mean stress to the design engineer. The combined stress condition is that of an alternating bending stress and a constant shear stress. The finite life Goodman diagrams and surfaces are created from strength distributions developed at various ratios of alternating to mean stress at particular cycle life values. The conclusions indicate that the Von Mises-Hencky ellipse, for cycle life values above 1000 cycles, is an adequate model of the finite life Goodman diagram. In addition, suggestions are made which reduce the number of experimental data points required in a fatigue data acquisition program.
Grid diagrams and Khovanov homology
DEFF Research Database (Denmark)
Droz, Jean-Marie; Wagner, Emmanuel
2009-01-01
We explain how to compute the Jones polynomial of a link from one of its grid diagrams and we observe a connection between Bigelow’s homological definition of the Jones polynomial and Kauffman’s definition of the Jones polynomial. Consequently, we prove that the Maslov grading on the Seidel–Smith...... symplectic link invariant coincides with the difference between the homological grading on Khovanov homology and the Jones grading on Khovanov homology. We give some evidence for the truth of the Seidel–Smith conjecture....
Transformations of triangle ladder diagrams
Kondrashuk, Igor; Vergara, Alvaro
2009-01-01
It is shown how dual space diagrammatic representation of momentum integrals corresponding to triangle ladder diagrams with an arbitrary number of rungs can be transformed to half-diamonds. In paper arXiv:0803.3420 [hep-th] the half-diamonds were related by conformal integral substitution to the diamonds which represent the dual space image of four-point ladder integrals in the four-dimensional momentum space. Acting in the way described in the present paper we do not need to use the known re...
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2014-01-01
We study the international standard XACML 3.0 for describing security access control policies in a compositional way. Our main contributions are (i) to derive a logic that precisely captures the intentions of the standard, (ii) to formally define a semantics for the XACML 3.0 component evaluation...
Logicism, intuitionism, and formalism
Symons, John
2008-01-01
Aims to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. This work is suitable for researchers and graduate students of philosophy, logic, mathematics and theoretical computer science.
Foundations of mathematical logic
Curry, Haskell B
2010-01-01
Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods, including algorithms and epitheory, and offers a brief treatment of Markov's approach to algorithms, explains elementary facts about lattices and similar algebraic systems, and more. 1963 edition.
Benthem, Johan van; Bergstra, J.A.
1995-01-01
Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several
Literacy, Logic, and Intuition
Jaeger, Elizabeth
2007-01-01
The author calls into question whether learning to read and write is an exclusively logical and systematic process in which the child moves step-by-step from part to whole, as it is frequently presented in "scientific" reading research. She examines research on different types of intuitive behavior and suggests parallels in the development of…
Logical consequence for nominalists
Rossberg, Marcus; Cohnitz, Daniel|info:eu-repo/dai/nl/297859099
2009-01-01
It has repeatedly been argued that nominalistic programmes in the philosophy of mathematics fail, since they will at some point or other involve the notion of logical consequence which is unavailable to the nominalist. In this paper we will argue that this is not the case. Using an idea of Nelson
Expressivist Perspective on Logicality
Czech Academy of Sciences Publication Activity Database
Arazim, Pavel
2017-01-01
Roč. 11, č. 4 (2017), s. 409-419 ISSN 1661-8297 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : logical constant * expressivism * topic-neutrality * proof-theory * conservativity Subject RIV: AA - Philosophy ; Religion
Bezhanishvili, G.; Bezhanishvili, N.; Ilin, J.
2016-01-01
We generalize the (∧,∨)-canonical formulas to (∧,∨)-canonical rules, and prove that each intuitionistic multi-conclusion consequence relation is axiomatizable by (∧,∨)-canonical rules. This yields a convenient characterization of stable superintuitionistic logics. The (∧,∨)-canonical formulas are
DEFF Research Database (Denmark)
Bentzen, Martin Mose
2014-01-01
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...
Greek, Indian and Arabic logic
Gabbay, Dov M
2004-01-01
Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and Renaissance Logic and Logic: A History of its Central. In designing the Handbook of the History of Logic, the Editors have taken the view that the history of logic holds more than an antiquarian interest, and that a knowledge of logic's rich and sophisticated development is, in various respects, relevant to the research programmes of the present day. Ancient logic is no exception. The present volume attests to the distant origins of some of modern logic's most important features, such as can be found in the claim by the authors of t...
Extending Value Logic Thinking to Value Logic Portfolios
DEFF Research Database (Denmark)
Ritter, Thomas; Andersen, Poul Houman
or transaction, an understanding of firms and transactions as a portfolio of value logics (i.e. an interconnected coexistence of different value creation logics) is proposed. These additions to the original value creation logic theory imply interesting avenues for both, strategic decision making in firms...
Logical analysis of biological systems
DEFF Research Database (Denmark)
Mardare, Radu Iulian
2005-01-01
R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005.......R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005....
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Hybrid logic is an extension of modal logic which allows us to refer explicitly to points of the model in the syntax of formulas. It is easy to justify interest in hybrid logic on applied grounds, with the usefulness of the additional expressive power. For example, when reasoning about time one...... often wants to build up a series of assertions about what happens at a particular instant, and standard modal formalisms do not allow this. What is less obvious is that the route hybrid logic takes to overcome this problem often actually improves the behaviour of the underlying modal formalism....... For example, it becomes far simpler to formulate proof-systems for hybrid logic, and completeness results can be proved of a generality that is simply not available in modal logic. That is, hybridization is a systematic way of remedying a number of known deficiencies of modal logic. First-order hybrid logic...
Wansing, Heinrich; Willkommen, Caroline; Recent Trends in Philosophical Logic
2014-01-01
This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism, and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University ...
Nguyen, Hung T
2005-01-01
THE CONCEPT OF FUZZINESS Examples Mathematical modeling Some operations on fuzzy sets Fuzziness as uncertainty Exercises SOME ALGEBRA OF FUZZY SETS Boolean algebras and lattices Equivalence relations and partitions Composing mappings Isomorphisms and homomorphisms Alpha-cuts Images of alpha-level sets Exercises FUZZY QUANTITIES Fuzzy quantities Fuzzy numbers Fuzzy intervals Exercises LOGICAL ASPECTS OF FUZZY SETS Classical two-valued logic A three-valued logic Fuzzy logic Fuzzy and Lukasiewi
Luo, Maokang; He, Wei
2015-01-01
Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking truth value semantics and randomicity by taking probabilistic semantics or possibility semantics. As the first step for purpose of establishing a logic system which completely reflect the uncertainty of the objective world, this logic will lead to a set of logi...
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
This article shows how individual Petri nets form models of Girard's intuitionistic linear logic. It explores questions of expressiveness and completeness of linear logic with respect to this interpretation. An aim is to use Petri nets to give an understanding of linear logic and give some apprai...
A Paraconsistent Higher Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen
2004-01-01
Abstract. Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications...
Flat coalgebraic fixed point logics
Schröder, L.; Venema, Y.
2010-01-01
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact
Disconnected Diagrams in Lattice QCD
Energy Technology Data Exchange (ETDEWEB)
Gambhir, Arjun [College of William and Mary, Williamsburg, VA (United States)
2017-08-01
In this work, we present state-of-the-art numerical methods and their applications for computing a particular class of observables using lattice quantum chromodynamics (Lattice QCD), a discretized version of the fundamental theory of quarks and gluons. These observables require calculating so called \\disconnected diagrams" and are important for understanding many aspects of hadron structure, such as the strange content of the proton. We begin by introducing the reader to the key concepts of Lattice QCD and rigorously define the meaning of disconnected diagrams through an example of the Wick contractions of the nucleon. Subsequently, the calculation of observables requiring disconnected diagrams is posed as the computationally challenging problem of finding the trace of the inverse of an incredibly large, sparse matrix. This is followed by a brief primer of numerical sparse matrix techniques that overviews broadly used methods in Lattice QCD and builds the background for the novel algorithm presented in this work. We then introduce singular value deflation as a method to improve convergence of trace estimation and analyze its effects on matrices from a variety of fields, including chemical transport modeling, magnetohydrodynamics, and QCD. Finally, we apply this method to compute observables such as the strange axial charge of the proton and strange sigma terms in light nuclei. The work in this thesis is innovative for four reasons. First, we analyze the effects of deflation with a model that makes qualitative predictions about its effectiveness, taking only the singular value spectrum as input, and compare deflated variance with different types of trace estimator noise. Second, the synergy between probing methods and deflation is investigated both experimentally and theoretically. Third, we use the synergistic combination of deflation and a graph coloring algorithm known as hierarchical probing to conduct a lattice calculation of light disconnected matrix elements
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.
Bayesian Networks and Influence Diagrams
DEFF Research Database (Denmark)
Kjærulff, Uffe Bro; Madsen, Anders Læsø
, and exercises are included for the reader to check his/her level of understanding. The techniques and methods presented for knowledge elicitation, model construction and verification, modeling techniques and tricks, learning models from data, and analyses of models have all been developed and refined......, troubleshooting, and data mining under uncertainty. Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis provides a comprehensive guide for practitioners who wish to understand, construct, and analyze intelligent systems for decision support based on probabilistic networks. Intended...... primarily for practitioners, this book does not require sophisticated mathematical skills or deep understanding of the underlying theory and methods nor does it discuss alternative technologies for reasoning under uncertainty. The theory and methods presented are illustrated through more than 140 examples...
Phase diagrams for surface alloys
DEFF Research Database (Denmark)
Christensen, Asbjørn; Ruban, Andrei; Stoltze, Per
1997-01-01
of the heat of segregation from the bulk and the sign of the excess interactions between the atoms in the surface (the surface mixing energy). We also consider the more complicated cases a with ordered surface phases, nonpseudomorphic overlayers, second layer segregation, and multilayers. The discussion......We discuss surface alloy phases and their stability based on surface phase diagrams constructed from the surface energy as a function of the surface composition. We show that in the simplest cases of pseudomorphic overlayers there are four generic classes of systems, characterized by the sign...... is based on density-functional calculations using the coherent-potential approximation and on effective-medium theory. We give self-consistent density-functional results for the segregation energy and surface mixing energy for all combinations of the transition and noble metals. Finally we discuss...
Pascal, Robert; Pross, Addy
2016-11-01
In this paper we propose a logical connection between the physical and biological worlds, one resting on a broader understanding of the stability concept. We propose that stability manifests two facets - time and energy, and that stability's time facet, expressed as persistence, is more general than its energy facet. That insight leads to the logical formulation of the Persistence Principle, which describes the general direction of material change in the universe, and which can be stated most simply as: nature seeks persistent forms. Significantly, the principle is found to express itself in two mathematically distinct ways: in the replicative world through Malthusian exponential growth, and in the 'regular' physical/chemical world through Boltzmann's probabilistic considerations. By encompassing both 'regular' and replicative worlds, the principle appears to be able to help reconcile two of the major scientific theories of the 19th century - the Second Law of Thermodynamics and Darwin's theory of evolution - within a single conceptual framework.
Influence Diagram Use With Respect to Technology Planning and Investment
Levack, Daniel J. H.; DeHoff, Bryan; Rhodes, Russel E.
2009-01-01
Influence diagrams are relatively simple, but powerful, tools for assessing the impact of choices or resource allocations on goals or requirements. They are very general and can be used on a wide range of problems. They can be used for any problem that has defined goals, a set of factors that influence the goals or the other factors, and a set of inputs. Influence diagrams show the relationship among a set of results and the attributes that influence them and the inputs that influence the attributes. If the results are goals or requirements of a program, then the influence diagram can be used to examine how the requirements are affected by changes to technology investment. This paper uses an example to show how to construct and interpret influence diagrams, how to assign weights to the inputs and attributes, how to assign weights to the transfer functions (influences), and how to calculate the resulting influences of the inputs on the results. A study is also presented as an example of how using influence diagrams can help in technology planning and investment. The Space Propulsion Synergy Team (SPST) used this technique to examine the impact of R&D spending on the Life Cycle Cost (LCC) of a space transportation system. The question addressed was the effect on the recurring and the non-recurring portions of LCC of the proportion of R&D resources spent to impact technology objectives versus the proportion spent to impact operational dependability objectives. The goals, attributes, and the inputs were established. All of the linkages (influences) were determined. The weighting of each of the attributes and each of the linkages was determined. Finally the inputs were varied and the impacts on the LCC determined and are presented. The paper discusses how each of these was accomplished both for credibility and as an example for future studies using influence diagrams for technology planning and investment planning.
UTP and Temporal Logic Model Checking
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
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.
A catalogue of Irish pollen diagrams
Mitchell, Fraser
2013-01-01
PUBLISHED The first Irish pollen diagram was published by Gunnar Erdtman in the Irish Naturalists? Journal in 1927. Since then over 471 pollen diagrams have been produced from locations throughout Ireland from a range of sites and time spans. The data from these pollen diagrams can be used to reconstruct vegetation dynamics over long time scales and so facilitate the investigation of climate change impacts, plant migration and the scale of human induced landscape change. In this paper we ...
Collaborating on Affinity Diagrams Using Large Displays
Judge, Tejinder K.; McCrickard, D. Scott
2008-01-01
Gathering and understanding user requirements is an essential part of design. Techniques like affinity diagramming are useful for gathering and understanding user data but have shortcomings such as the difficulty to preserve the diagram after its creation, problems during the process such as searching for notes, and loss of shared awareness. We propose an early prototype that solves problems in the process of creating an affinity diagram and enhances it using a...
Probabilistic Logical Characterization
DEFF Research Database (Denmark)
Hermanns, Holger; Parma, Augusto; Segala, Roberto
2011-01-01
Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance...... modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata....
Marketing Logics, Ambidexterity and Influence
DEFF Research Database (Denmark)
Tollin, Karin; Schmidt, Marcus
2012-01-01
in four CMOs have taken on this challenge, or adopted a marketing logic which could be referred to as ambidextrous. Furthermore, the study shows that this logic exerts a stronger impact on marketing's influence, compared to logics related to assuring brand consistency and measuring the performance...... of marketing processes. Three other ways to enact marketing management were also revealed, namely: an innovation; a communication; and a supporting marketing logic. This leads us to conclude that the influence of companies' marketing functions show up a heterogeneous picture within which the marketing logics...
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...... to the lambda-calculus. The key transformation here is Reynoldss defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink (their article...... at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations....
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...... to the lambda-calculus. The key transformation here is Reynoldss defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink (their article...... at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations....
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...... to the lambda-calculus. The key transformation here is Reynoldss defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink (their article...... at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations....
C code generation from Petri-net-based logic controller specification
Grobelny, Michał; Grobelna, Iwona; Karatkevich, Andrei
2017-08-01
The article focuses on programming of logic controllers. It is important that a programming code of a logic controller is executed flawlessly according to the primary specification. In the presented approach we generate C code for an AVR microcontroller from a rule-based logical model of a control process derived from a control interpreted Petri net. The same logical model is also used for formal verification of the specification by means of the model checking technique. The proposed rule-based logical model and formal rules of transformation ensure that the obtained implementation is consistent with the already verified specification. The approach is validated by practical experiments.
Concrete Quantum Logics and Δ -Logics, States and Δ -States
Hroch, Michal; Pták, Pavel
2017-12-01
By a concrete quantum logic (in short, by a logic) we mean the orthomodular poset that is set-representable. If L=({Ω },L) is a logic and L is closed under the formation of symmetric difference, Δ , we call L a Δ -logic. In the first part we situate the known results on logics and states to the context of Δ -logics and Δ -states (the Δ -states are the states that are subadditive with respect to the symmetric difference). Moreover, we observe that the rather prominent logic E^{ {even}}_{Ω } of all even-coeven subsets of the countable set Ω possesses only Δ -states. Then we show when a state on the logics given by the divisibility relation allows for an extension as a state. In the next paragraph we consider the so called density logic and its Δ -closure. We find that the Δ -closure coincides with the power set. Then we investigate other properties of the density logic and its factor.
Stage line diagram: An age-conditional reference diagram for tracking development
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
Directory of Open Access Journals (Sweden)
Lic. Iván D. Tutillo-Arcentales
2015-10-01
Full Text Available The development of the ability of programming for computers, begins in the ability to transform the algorithms of the daily activities in programming algorithms and he/she responds to the student's necessity in designing solutions based on previously learned topics, combining the solutions that give result in other contexts with topics that they are analyzed like parts of an everything and that they are programmed in that way. From this perspective to deepen in the Sciences of the Education and inside her, in the Didactics, as well as the analysis of their category: teaching learning, which has full relationship inside the process of didactic in the class and where it is necessary us a methodology that achieves a learning starting from a conversion mechanism that then you can connect with the process of learning of the programming foundations and of the subjects of programming of more complexity. Keywords: technological formation, technological knowledge, formation of the technological knowledge
A noise-assisted reprogrammable nanomechanical logic gate.
Guerra, Diego N; Bulsara, Adi R; Ditto, William L; Sinha, Sudeshna; Murali, K; Mohanty, P
2010-04-14
We present a nanomechanical device, operating as a reprogrammable logic gate, and performing fundamental logic functions such as AND/OR and NAND/NOR. The logic function can be programmed (e.g., from AND to OR) dynamically, by adjusting the resonator's operating parameters. The device can access one of two stable steady states, according to a specific logic function; this operation is mediated by the noise floor which can be directly adjusted, or dynamically "tuned" via an adjustment of the underlying nonlinearity of the resonator, i.e., it is not necessary to have direct control over the noise floor. The demonstration of this reprogrammable nanomechanical logic gate affords a path to the practical realization of a new generation of mechanical computers.
Software Tool Integrating Data Flow Diagrams and Petri Nets
Thronesbery, Carroll; Tavana, Madjid
2010-01-01
Data Flow Diagram - Petri Net (DFPN) is a software tool for analyzing other software to be developed. The full name of this program reflects its design, which combines the benefit of data-flow diagrams (which are typically favored by software analysts) with the power and precision of Petri-net models, without requiring specialized Petri-net training. (A Petri net is a particular type of directed graph, a description of which would exceed the scope of this article.) DFPN assists a software analyst in drawing and specifying a data-flow diagram, then translates the diagram into a Petri net, then enables graphical tracing of execution paths through the Petri net for verification, by the end user, of the properties of the software to be developed. In comparison with prior means of verifying the properties of software to be developed, DFPN makes verification by the end user more nearly certain, thereby making it easier to identify and correct misconceptions earlier in the development process, when correction is less expensive. After the verification by the end user, DFPN generates a printable system specification in the form of descriptions of processes and data.
Diagrams Benefit Symbolic Problem-Solving
Chu, Junyi; Rittle-Johnson, Bethany; Fyfe, Emily R.
2017-01-01
Background: 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…
Ferroelectric phase diagram of PVDF:PMMA
Li, M.; Stingelin, N.; Michels, J.J.; Spijkman, M.-J.; Asadi, K.; Feldman, K.; Blom, P.W.M.; Leeuw, D.M. de
2012-01-01
We have investigated the ferroelectric phase diagram of poly(vinylidene fluoride) (PVDF) and poly(methyl methacrylate) (PMMA). The binary nonequilibrium temperature composition diagram was determined and melting of α- and β-phase PVDF was identified. Ferroelectric β-PVDF:PMMA blend films were made
Ferroelectric Phase Diagram of PVDF : PMMA
Li, Mengyuan; Stingelin, Natalie; Michels, Jasper J.; Spijkman, Mark-Jan; Asadi, Kamal; Feldman, Kirill; Blom, Paul W. M.; de Leeuw, Dago M.
2012-01-01
We have investigated the ferroelectric phase diagram of poly(vinylidene fluoride) (PVDF) and poly(methyl methacrylate) (PMMA). The binary nonequilibrium temperature composition diagram was determined and melting of alpha- and beta-phase PVDF was identified. Ferroelectric beta-PVDF:PMMA blend films
Comprehending process diagrams in biology education
Kragten, M.
2015-01-01
Students in secondary Science education seem to have difficulties with comprehending diagrams. Process diagrams are an important type of representation in Biology for explaining processes like protein synthesis, compound cycles, etc. In this thesis, we aimed at getting deeper insight into students’
DEFF Research Database (Denmark)
Pilegaard, Henrik
2003-01-01
We perform a direct comparison of the {Succinct Solver v2.0} and {XSB Prolog v2.6} based on experiments with {Control Flow Analyses} of scalable {Discretionary Ambient programs} and {Carmel programs}. To facilitate this comparison we expand ALFP clauses accepted by the Succinct Solver into more...... of the Succinct Solver is at worst a small constant factor worse than XSB Prolog. In optimum cases the Succinct Solver outperforms XSB Prolog by having a substantially lower asymptotic complexity....
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.
Classical Mathematical Logic The Semantic Foundations of Logic
Epstein, Richard L
2011-01-01
In Classical Mathematical Logic, Richard L. Epstein relates the systems of mathematical logic to their original motivations to formalize reasoning in mathematics. The book also shows how mathematical logic can be used to formalize particular systems of mathematics. It sets out the formalization not only of arithmetic, but also of group theory, field theory, and linear orderings. These lead to the formalization of the real numbers and Euclidean plane geometry. The scope and limitations of modern logic are made clear in these formalizations. The book provides detailed explanations of all proo
Phase diagram of ammonium nitrate
Energy Technology Data Exchange (ETDEWEB)
Dunuwille, Mihindra; Yoo, Choong-Shik, E-mail: csyoo@wsu.edu [Department of Chemistry and Institute for Shock Physics, Washington State University, Pullman, Washington 99164 (United States)
2013-12-07
Ammonium Nitrate (AN) is a fertilizer, yet becomes an explosive upon a small addition of chemical impurities. The origin of enhanced chemical sensitivity in impure AN (or AN mixtures) is not well understood, posing significant safety issues in using AN even today. To remedy the situation, we have carried out an extensive study to investigate the phase stability of AN and its mixtures with hexane (ANFO–AN mixed with fuel oil) and Aluminum (Ammonal) at high pressures and temperatures, using diamond anvil cells (DAC) and micro-Raman spectroscopy. The results indicate that pure AN decomposes to N{sub 2}, N{sub 2}O, and H{sub 2}O at the onset of the melt, whereas the mixtures, ANFO and Ammonal, decompose at substantially lower temperatures. The present results also confirm the recently proposed phase IV-IV{sup ′} transition above 17 GPa and provide new constraints for the melting and phase diagram of AN to 40 GPa and 400°C.
Magnetic logic based on diode-assisted magnetoresistance
Directory of Open Access Journals (Sweden)
Zhaochu Luo
2017-05-01
Full Text Available Conventional computer suffers from the von Neumann performance bottleneck due to its hardware architecture that non-volatile memory and logic are separated. The new emerging magnetic logic coupling the extra dimension of spin, shows the potential to overcome this performance bottleneck. Here, we propose a novel category of magnetic logic based on diode-assisted magnetoresistance. By coupling Hall effect and nonlinear transport property in silicon, all four basic Boolean logic operations including AND, NAND, OR and NOR, can be programmed at room temperature with high output ratio in one silicon-based device. Further introducing anomalous Hall effect of magnetic material into magnetic logic, we achieve perpendicular magnetic anisotropy-based magnetic logic which combines the advantages of both high output ratio (>103 % and low work magnetic field (∼1 mT. Integrated with non-volatile magnetic memory, our logic device with unique magnetoelectric properties has the advantages of current-controlled reconfiguration, zero refresh consumption, instant-on performance and would bridge the processor-memory gap. Our findings would pave the way in magnetic logic and offer a feasible platform to build a new kind of magnetic microprocessor with potential of high performance.
Magnetic logic based on diode-assisted magnetoresistance
Luo, Zhaochu; Zhang, Xiaozhong
2017-05-01
Conventional computer suffers from the von Neumann performance bottleneck due to its hardware architecture that non-volatile memory and logic are separated. The new emerging magnetic logic coupling the extra dimension of spin, shows the potential to overcome this performance bottleneck. Here, we propose a novel category of magnetic logic based on diode-assisted magnetoresistance. By coupling Hall effect and nonlinear transport property in silicon, all four basic Boolean logic operations including AND, NAND, OR and NOR, can be programmed at room temperature with high output ratio in one silicon-based device. Further introducing anomalous Hall effect of magnetic material into magnetic logic, we achieve perpendicular magnetic anisotropy-based magnetic logic which combines the advantages of both high output ratio (>103 %) and low work magnetic field (˜1 mT). Integrated with non-volatile magnetic memory, our logic device with unique magnetoelectric properties has the advantages of current-controlled reconfiguration, zero refresh consumption, instant-on performance and would bridge the processor-memory gap. Our findings would pave the way in magnetic logic and offer a feasible platform to build a new kind of magnetic microprocessor with potential of high performance.
Computability, complexity, logic
Börger, Egon
1989-01-01
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes an
Krötzsch, M
2010-01-01
Ontological modelling today is applied in many areas of science and technology,including the Semantic Web. The W3C standard OWL defines one of the most important ontology languages based on the semantics of description logics. An alternative is to use rule languages in knowledge modelling, as proposed in the W3C's RIF standard. So far, it has often been unclear how to combine both technologies without sacrificing essential computational properties. This book explains this problem and presents new solutions that have recently been proposed. Extensive introductory chapters provide the necessary
Adaptive parallel logic networks
Martinez, Tony R.; Vidal, Jacques J.
1988-01-01
Adaptive, self-organizing concurrent systems (ASOCS) that combine self-organization with massive parallelism for such applications as adaptive logic devices, robotics, process control, and system malfunction management, are presently discussed. In ASOCS, an adaptive network composed of many simple computing elements operating in combinational and asynchronous fashion is used and problems are specified by presenting if-then rules to the system in the form of Boolean conjunctions. During data processing, which is a different operational phase from adaptation, the network acts as a parallel hardware circuit.
T Atanassov, Krassimir
2017-01-01
The book offers a comprehensive survey of intuitionistic fuzzy logics. By reporting on both the author’s research and others’ findings, it provides readers with a complete overview of the field and highlights key issues and open problems, thus suggesting new research directions. Starting with an introduction to the basic elements of intuitionistic fuzzy propositional calculus, it then provides a guide to the use of intuitionistic fuzzy operators and quantifiers, and lastly presents state-of-the-art applications of intuitionistic fuzzy sets. The book is a valuable reference resource for graduate students and researchers alike.
Modern Logical Frameworks Design
DEFF Research Database (Denmark)
Murawska, Agata Anna
2017-01-01
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...... 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...
DEFF Research Database (Denmark)
Øhrstrøm, Peter
2009-01-01
This paper deals with A.N. Prior's analysis of the concepts of dynamic and static time, i.e. McTaggart's so-called A- and B-concepts. The relations and mutual dependencies between these temporal concepts are investigated, and Prior's response to McTaggart's views is discussed. Futhermore, Prior......'s notion of branching time is analysed. It is argued that Prior can be criticized for identifying 'plain future'. Finally, Prior's four grades of tense-logical involvement are introduced and discussed. It is argued that the third grade is the most attractive form a philosophical point of view....
Learning logic through interactive computer game
Koželj, Ksenija
2011-01-01
In this final thesis we presented interactivity in education and some online interactive games. Furthermore we created interactive computer game with program tool Adobe Flash, through which students can learn logic. CD with this game is attached to this final thesis. We wanted to know if there are any differences in knowledge between the students that learn frontal and students that learn through game. In first chapter we presented interactivity in education and different ways for teachers...
Logical Framework for Normative Systems
Nakayama, Yasuo
2010-01-01
In this paper, I propose a new logical framework that can be used to analyze normative phenomena in general. I call this framework a Logic for Normative Systems (LNS). I also demonstrate how to solve some paradoxes of Standard Deontic Logic (SDL). A characteristic of LNS is its dynamic behavior. LNS is flexible, hence it can be applied to describe complex normative problems including ethical problems.
Algebraic Approach to Algorithmic Logic
Bancerek Grzegorz
2014-01-01
We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra st...
Single molecule logical devices.
Renaud, Nicolas; Hliwa, Mohamed; Joachim, Christian
2012-01-01
After almost 40 years of development, molecular electronics has given birth to many exciting ideas that range from molecular wires to molecular qubit-based quantum computers. This chapter reviews our efforts to answer a simple question: how smart can a single molecule be? In our case a molecule able to perform a simple Boolean function is a child prodigy. Following the Aviram and Ratner approach, these molecules are inserted between several conducting electrodes. The electronic conduction of the resulting molecular junction is extremely sensitive to the chemical nature of the molecule. Therefore designing this latter correctly allows the implementation of a given function inside the molecular junction. Throughout the chapter different approaches are reviewed, from hybrid devices to quantum molecular logic gates. We particularly stress that one can implement an entire logic circuit in a single molecule, using either classical-like intramolecular connections, or a deformation of the molecular orbitals induced by a conformational change of the molecule. These approaches are radically different from the hybrid-device approach, where several molecules are connected together to build the circuit.
Optimization methods for logical inference
Chandru, Vijay
2011-01-01
Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in
Admissibility of logical inference rules
Rybakov, VV
1997-01-01
The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and
DEFF Research Database (Denmark)
By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s).......By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s)....
Popular lectures on mathematical logic
Wang, Hao
2014-01-01
A noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. Author Hao Wang surveys the central concepts and theories of the discipline in a historical and developmental context, and then focuses on the four principal domains of contemporary mathematical logic: set theory, model theory, recursion theory and constructivism, and proof theory.Topics include the place of problems in the development of theories of logic and logic's relation to computer science. Specific attention is given to Gödel's incomplete
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
Logical Form as a Determinant of Cognitive Processes
van Lambalgen, Michiel
We discuss a research program on reasoning patterns in subjects with autism, showing that they fail to engage in certain forms of non-monotonic reasoning that come naturally to neurotypical subjects. The striking reasoning patterns of autists occur both in verbal and in non-verbal tasks. Upon formalising the relevant non-verbal tasks, one sees that their logical form is the same as that of the verbal tasks. This suggests that logical form can play a causal role in cognitive processes, and we suggest that this logical form is actually embodied in the cognitive capacity called 'executive function'.
Faceting diagram for sticky steps
Directory of Open Access Journals (Sweden)
Noriko Akutsu
2016-03-01
Full Text Available Faceting diagrams for the step-faceting zone, the step droplet zone, and the Gruber-Mullins-Pokrovsky-Talapov (GMPT zone for a crystal surface are obtained by using the density matrix renormalization group method to calculate the surface tension. The model based on these calculations is the restricted solid-on-solid (RSOS model with a point-contact-type step-step attraction (p-RSOS model on a square lattice. The point-contact-type step-step attraction represents the energy gain obtained by forming a bonding state with orbital overlap at the meeting point of the neighboring steps. In the step-faceting zone, disconnectedness in the surface tension leads to the formation of a faceted macrostep on a vicinal surface at equilibrium. The disconnectedness in the surface tension also causes the first-order shape transition for the equilibrium shape of a crystal droplet. The lower zone boundary line (ZBL, which separates the step-faceting zone and the step droplet zone, is obtained by the condition γ 1 = lim n → ∞ γ n / n , where γn is the step tension of the n-th merged step. The upper ZBL, which separates the GMPT zone and the step droplet zone, is obtained by the condition Aq,eff = 0 and Bq,eff = 0, where Aq,eff and Bq,eff represent the coefficients for the | q → | 2 term and the | q → | 3 term, respectively, in the | q → | -expanded form of the surface free energy f eff ( q → . Here, q → is the surface gradient relative to the (111 surface. The reason why the vicinal surface inclined in the 〈101〉 direction does not exhibit step-faceting is explained in terms of the one-dimensional spinless quasi-impenetrable attractive bosons at absolute zero.
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...
Diagram of Cell to Cell Communication
2002-01-01
Diagram depicts the importance of cell-cell communication as central to the understanding of cancer growth and progression, the focus of the NASA bioreactor demonstration system (BDS-05) investigation. Microgravity studies will allow us to unravel the signaling and communication between these cells with the host and potential development of therapies for the treatment of cancer metastasis. The NASA Bioreactor provides a low turbulence culture environment which promotes the formation of large, three-dimensional cell clusters. Due to their high level of cellular organization and specialization, samples constructed in the bioreactor more closely resemble the original tumor or tissue found in the body. The Bioreactor is rotated to provide gentle mixing of fresh and spent nutrient without inducing shear forces that would damage the cells. The work is sponsored by NASA's Office of Biological and Physical Research. The bioreactor is managed by the Biotechnology Cell Science Program at NASA's Johnson Space Center (JSC). NASA-sponsored bioreactor research has been instrumental in helping scientists to better understand normal and cancerous tissue development. In cooperation with the medical community, the bioreactor design is being used to prepare better models of human colon, prostate, breast and ovarian tumors. Cartilage, bone marrow, heart muscle, skeletal muscle, pancreatic islet cells, liver and kidney are just a few of the normal tissues being cultured in rotating bioreactors by investigators. Credit: Emory University.
Categorical Abstract Algebraic Logic: Meet-Combination of Logical Systems
Directory of Open Access Journals (Sweden)
George Voutsadakis
2013-01-01
properties inherited by the resulting combinations. One of the oldest such methods is fibring. In fibring the shared connectives of the combined logics inherit properties from both component logical systems, and this leads often to inconsistencies. To deal with such undesired effects, Sernadas et al. (2011, 2012 have recently introduced a novel way of combining logics, called meet-combination, in which the combined connectives share only the common logical properties they enjoy in the component systems. In their investigations they provide a sound and concretely complete calculus for the meet-combination based on available sound and complete calculi for the component systems. In this work, an effort is made to abstract those results to a categorical level amenable to categorical abstract algebraic logic techniques.
Towards an arithmetical logic the arithmetical foundations of logic
Gauthier, Yvon
2015-01-01
This book offers an original contribution to the foundations of logic and mathematics, and focuses on the internal logic of mathematical theories, from arithmetic or number theory to algebraic geometry. Arithmetical logic is the term used to refer to the internal logic of classical arithmetic, here called Fermat-Kronecker arithmetic, and combines Fermat’s method of infinite descent with Kronecker’s general arithmetic of homogeneous polynomials. The book also includes a treatment of theories in physics and mathematical physics to underscore the role of arithmetic from a constructivist viewpoint. The scope of the work intertwines historical, mathematical, logical and philosophical dimensions in a unified critical perspective; as such, it will appeal to a broad readership from mathematicians to logicians, to philosophers interested in foundational questions. Researchers and graduate students in the fields of philosophy and mathematics will benefit from the author’s critical approach to the foundations of l...
Finite state machine logic synthesis for complex programmable logic devices
Czerwinski, Robert
2013-01-01
This book is a monograph devoted to logic synthesis and optimization for CPLDs. CPLDs' macrocell can also be interpreted as programmable AND-fixed OR structure, well known as PAL-based structure. The question is: what should be done when the number of implicants representing function exceeds the number of product terms available in a logic block. The answer is ... in the book. Logic synthesis and optimization methods dedicated for PAL-based structures are proposed. The methods strive to find the optimum fit for the combinational logic and finite state machines to the structure of the logic device and aim at area and speed optimization. The theoretical background and complete strategies are richly illustrated with examples and figures.
2005-01-01
A new all-electronic Particle Image Velocimetry technique that can efficiently map high speed gas flows has been developed in-house at the NASA Lewis Research Center. Particle Image Velocimetry is an optical technique for measuring the instantaneous two component velocity field across a planar region of a seeded flow field. A pulsed laser light sheet is used to illuminate the seed particles entrained in the flow field at two instances in time. One or more charged coupled device (CCD) cameras can be used to record the instantaneous positions of particles. Using the time between light sheet pulses and determining either the individual particle displacements or the average displacement of particles over a small subregion of the recorded image enables the calculation of the fluid velocity. Fuzzy logic minimizes the required operator intervention in identifying particles and computing velocity. Using two cameras that have the same view of the illumination plane yields two single exposure image frames. Two competing techniques that yield unambiguous velocity vector direction information have been widely used for reducing the single-exposure, multiple image frame data: (1) cross-correlation and (2) particle tracking. Correlation techniques yield averaged velocity estimates over subregions of the flow, whereas particle tracking techniques give individual particle velocity estimates. For the correlation technique, the correlation peak corresponding to the average displacement of particles across the subregion must be identified. Noise on the images and particle dropout result in misidentification of the true correlation peak. The subsequent velocity vector maps contain spurious vectors where the displacement peaks have been improperly identified. Typically these spurious vectors are replaced by a weighted average of the neighboring vectors, thereby decreasing the independence of the measurements. In this work, fuzzy logic techniques are used to determine the true
Modeling Genetic Regulatory Networks Using First-Order Probabilistic Logic
2013-03-01
that model GRNs from real data. PRISM, a probabilistic learning framework based on B- prolog , was used to program the Bayesian networks. Instead of...intelligence, prolog , gene regulation, “Raf” pathway 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18. NUMBER OF PAGES 28 19a...probabilistic logic paradigm. PRISM is a probabilistic logical framework based on B- prolog the language extends the Horn clauses to include random variables
Logical entropy of quantum dynamical systems
Directory of Open Access Journals (Sweden)
Ebrahimzadeh Abolfazl
2016-01-01
Full Text Available This paper introduces the concepts of logical entropy and conditional logical entropy of hnite partitions on a quantum logic. Some of their ergodic properties are presented. Also logical entropy of a quantum dynamical system is dehned and ergodic properties of dynamical systems on a quantum logic are investigated. Finally, the version of Kolmogorov-Sinai theorem is proved.
Questions and dependency in intuitionistic logic
Ciardelli, Ivano; Iemhoff, Rosalie; Yang, Fan
2017-01-01
In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and
A beginner's guide to mathematical logic
Smullyan, Raymond M
2014-01-01
Combining stories of great philosophers, quotations, and riddles with the fundamentals of mathematical logic, this new textbook for first courses in mathematical logic was written by the subject's creative master. Raymond Smullyan offers clear, incremental presentations of difficult logic concepts with creative explanations and unique problems related to proofs, propositional logic and first-order logic, undecidability, recursion theory, and other topics.
Reversible logic gates on Physarum Polycephalum
Energy Technology Data Exchange (ETDEWEB)
Schumann, Andrew [University of Information Technology and Management, Sucharskiego 2, Rzeszow, 35-225 (Poland)
2015-03-10
In this paper, we consider possibilities how to implement asynchronous sequential logic gates and quantum-style reversible logic gates on Physarum polycephalum motions. We show that in asynchronous sequential logic gates we can erase information because of uncertainty in the direction of plasmodium propagation. Therefore quantum-style reversible logic gates are more preferable for designing logic circuits on Physarum polycephalum.
Conventions and Institutional Logics
DEFF Research Database (Denmark)
Westenholz, Ann
Two theoretical approaches – Conventions and Institutional Logics – are brought together and the similarities and differences between the two are explored. It is not the intention to combine the approaches, but I would like to open both ‘boxes’ and make them available to each other with the purpose...... of creating a space for dialog. Both approaches were developed in the mid-1980s as a reaction to rational-choice economic theory and collectivistic sociological theory. These two theories were oversimplifying social life as being founded either in actor-micro level analyses or in structure-macro level...... by overcoming traditional micro-macro and actor-structure dimensions. However, they have also achieved this in different ways and I ask if there is a benefit to ‘importing’ some of these differences into the other approach....
Bisimulations, games, and logic
DEFF Research Database (Denmark)
Nielsen, Mogens; Clausen, Christian
1994-01-01
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically a......In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game......-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extensions of corresponding characterizations of interleaving bisimulation....
DEFF Research Database (Denmark)
Jensen, Lars Bang
The problematic this thesis investigates, through a specific kind of structuralism derived from a reading of Michel Foucault, Pierre Bourdieu and Gilles Deleuze, concerns how the subject becomes a science subject and potentially a scientist, with interest and literacy in science. The Logic...... of Science – a vivisection of monsters is thus an exploration of Being and Becoming in relation to Science and its Education. The investigation has been derived from, in, and connected to the Youth-to-Youth Project, a regional bridge building project in Northern Jutland in Denmark. The Youth-to-Youth Project...... (2011-2015) attempts to facilitate contact and provide a different kind of counselling and guidance between youths and youths who are ‘one step ahead’ in their educational trajectory. The meetings between the youths are both social and science subject oriented, and the intention is to establish...
Cleaveland, Rance; Luettgen, Gerald; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, LPC extends Milner's Calculus of Communicating Systems with operators from the alternation-free linear-time mu-calculus (LT(mu)). Semantically, LPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must-testing preorder as well as LT(mu's) satisfaction relation, while being compositional for all LPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of: (1) both minimal and maximal fixed-point operators and (2) an unimple-mentability predicate on process terms, which tags inconsistent specifications. The utility of LPC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification.
Between Analogue and Digital Diagrams
Directory of Open Access Journals (Sweden)
Zoltan Bun
2012-10-01
Full Text Available This essay is about the interstitial. About how the diagram, as a method of design, has lead fromthe analogue deconstruction of the eighties to the digital processes of the turn of the millennium.Specifically, the main topic of the text is the interpretation and the critique of folding (as a diagramin the beginning of the nineties. It is necessary then to unfold its relationship with immediatelypreceding and following architectural trends, that is to say we have to look both backwards andforwards by about a decade. The question is the context of folding, the exchange of the analogueworld for the digital. To understand the process it is easier to investigate from the fields of artand culture, rather than from the intentionally perplicated1 thoughts of Gilles Deleuze. Both fieldsare relevant here because they can similarly be used as the yardstick against which the era itselfit measured. The cultural scene of the eighties and nineties, including performing arts, movies,literature and philosophy, is a wide milieu of architecture. Architecture responds parallel to itsera; it reacts to it, and changes with it and within it. Architecture is a medium, it has always beena medium, yet the relations are transformed. That’s not to say that technical progress, for exampleusing CAD-software and CNC-s, has led to the digital thinking of certain movements ofarchitecture, (it is at most an indirect tool. But the ‘up-to-dateness’ of the discipline, however,a kind of non-servile reading of an ‘applied culture’ or ‘used philosophy’2 could be the key.(We might recall here, parenthetically, the fortunes of the artistic in contemporary mass society.The proliferation of museums, the magnification of the figure of the artist, the existence of amassive consumption of printed and televised artistic images, the widespread appetite for informationabout the arts, all reflect, of course, an increasingly leisured society, but also relateprecisely to the fact
Japanese Logic Puzzles and Proof
Wanko, Jeffrey J.
2009-01-01
An understanding of proof does not start in a high school geometry course. Rather, attention to logical reasoning throughout a student's school experience can help the development of proof readiness. In the spirit of problem solving, the author has begun to use some Japanese logic puzzles other than sudoku to help students develop additional…
DEFF Research Database (Denmark)
By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s)....
Propositional inquisitive logic: a survey
Directory of Open Access Journals (Sweden)
Ivano Ciardelli
2016-12-01
Full Text Available This paper provides a concise survey of a body of recent work on propositional inquisitive logic. We review the conceptual foundations of inquisitive semantics, introduce the propositional system, discuss its relations with classical, intuitionistic, and dependence logic, and describe an important feature of inquisitive proofs.
Contextual Validity in Hybrid Logic
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2013-01-01
Hybrid tense logic is an extension of Priorean tense logic in which it is possible to refer to times using special propositional sym- bols called nominals. Temporal indexicals are expressions such as now, yesterday, today, tomorrow and four days ago that have highly context- dependent interpretat...
Public communication in justification logic
Renne, Bryan
2011-01-01
Justification Logic is a framework for reasoning about evidence and justification in multi-agent systems. Most accounts of Justification Logic are essentially static, in that the (justified) beliefs of agents are immutable. In this article, we add public communication, a dynamic operation of belief
Methods in Logic Based Control
DEFF Research Database (Denmark)
Christensen, Georg Kronborg
1999-01-01
Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...
Dynamic Logics of Belief Change
van Benthem, J.; Smets, S.; van Ditmarsch, H.; Halpern, J.; van der Hoek, W.; Kooi, B.
2015-01-01
This chapter gives an overview of current dynamic logics that describe belief update and revision, both for single agents and in multi-agent settings. We employ a mixture of ideas from AGM belief revision theory and dynamic-epistemic logics of information-driven agency. After describing the basic
Gao, Shiming; Wang, Xiaoyan; Xie, Yanqiao; Hu, Peiran; Yan, Qiang
2015-04-01
A reconfigurable dual-channel all-optical logic gate is proposed and experimentally demonstrated using four-wave mixing in a silicon waveguide for polarization encoding signals. Six logic functions, XNOR, AND, NOR, XOR, AB¯, and A¯B are implemented at two different wavelength channels by adjusting the polarization states of two 10 Gb/s non-return-to-zero polarization-shift keying (NRZ-PolSK) signals modulated by 10-bit on-off keying (OOK) sequences. The eye diagrams of the logic signals are clearly observed, and the logic functions are well demonstrated as the two incident NRZ-PolSK signals are both modulated by the OOK sequences, which originate from 2(31)-1 pseudo-random binary sequences.
Xoán C Pardo; José C Díaz; Ramón Ferreiro
2006-01-01
En este artículo se describen las principales funcionalidades y aspectos destacados del diseño y desarrollo de un entorno para la emulación de autómatas programables. El objetivo de este trabajo ha sido disponer de un emulador que, siendo compatible con las especificaciones del estándar IEC 61131-3, proporcionase características adicionales como el acceso remoto, la definición de conjuntos diferentes de instrucciones mediante el uso de catálogos, y la configuración de diferentes arquitecturas...
Covariant diagrams for one-loop matching
Energy Technology Data Exchange (ETDEWEB)
Zhang, Zhengkang [Michigan Univ., Ann Arbor, MI (United States). Michigan Center for Theoretical Physics; Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)
2016-10-15
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve gaugecovariant quantities and are thus dubbed ''covariant diagrams.'' The use of covariant diagrams helps organize and simplify one-loop matching calculations, which we illustrate with examples. Of particular interest is the derivation of UV model-independent universal results, which reduce matching calculations of specific UV models to applications of master formulas. We show how such derivation can be done in a more concise manner than the previous literature, and discuss how additional structures that are not directly captured by existing universal results, including mixed heavy-light loops, open covariant derivatives, and mixed statistics, can be easily accounted for.
On divisorial filtrations associated with Newton diagrams
Ebeling, Wolfgang; Gusein-Zade, Sabir M.
2010-01-01
We consider divisorial filtration on the rings of functions on hypersurface singularities associated with Newton diagrams and their analogues for plane curve singularities. We compute the multi-variable Poincar\\'e series for the latter ones.
Architecture flow diagrams under teamwork reg sign
Energy Technology Data Exchange (ETDEWEB)
Nicinski, T.
1992-02-01
The Teamwork CASE tool allows Data Flow Diagrams (DFDs) to be maintained for structured analysis. Fermilab has extended teamwork under UNIX{trademark} to permit Hatley and Pirbhai Architecture Flow Diagrams (AFDs) to be associated with DFDs and subsequently maintained. This extension, called TWKAFD, allows a user to open an AFD, graphically edit it, and replace it into a TWKAFD maintained library. Other aspects of Hatley and Pirbhai's methodology are supported. This paper presents a quick tutorial on Architecture Diagrams. It then describes the user's view of TWKAFD, the experience incorporating it into teamwork, and the successes with using the Architecture Diagram methodology along with the shortcomings of using the teamwork/TWKAFD tool. 8 refs.
Lectures on Logic and Computation
DEFF Research Database (Denmark)
The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers...... foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. During two weeks, around 50 courses and 10 workshops are offered to the attendants, each of 1...... and selected. The papers are organized in topical sections on computational complexity, multi-agant systems, natural language processing, strategies in games and formal semantics....
Logical independence and quantum randomness
Energy Technology Data Exchange (ETDEWEB)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C [Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna (Austria); Prevedel, R; Klimek, P [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)], E-mail: tomasz.paterek@univie.ac.at
2010-01-15
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Impossible Worlds and Logical Omniscience
DEFF Research Database (Denmark)
Bjerring, Jens Christian Krarup
2013-01-01
, and considerably less investigated challenge is to ensure that the resulting modal space can also be used to model moderately ideal agents that are not logically omniscient but nevertheless logically competent. Intuitively, while such agents may fail to rule out subtly impossible worlds that verify complex logical...... falsehoods, they are nevertheless able to rule out blatantly impossible worlds that verify obvious logical falsehoods. To model moderately ideal agents, I argue, the job is to construct a modal space that contains only possible and non-trivially impossible worlds where it is not the case that “anything goes......”. But I prove that it is impossible to develop an impossible-world framework that can do this job and that satisfies certain standard conditions. Effectively, I show that attempts to model moderately ideal agents in a world-involving framework collapse to modeling either logical omniscient agents...
Zalta on Unnecessary Logical Truths
Directory of Open Access Journals (Sweden)
MA Hojati
2013-09-01
Full Text Available According to a traditional view all logical truths are necessary however, this thesis recently has been faced with various critiques from different points of view. Introducing some logical operators, David Kaplan and Edward Zalta claim that there are logical truths regarding common definition ‒ that are not necessary. William Hanson objects Zalta's examples believing that they rely on unjustified presuppositions especially he does not accept real world validity as a proper notion for presenting logical truth. Nelson and Zalta reply to his objections claiming that they have unacceptable grounds. In this paper, we introduce logical truths, then present Kaplan's and Zalta's examples and explore Hanson's objections together with their replies. At last we try to show the metaphysical roots of the debates.
Energy Technology Data Exchange (ETDEWEB)
1993-09-01
This report documents activities at ORNL including waste management and remedial action at the site; also waste processing and disposal; robotics and automation of the laboratory; and regulatory compliance
ISS EPS Orbital Replacement Unit Block Diagrams
Schmitz, Gregory V.
2001-01-01
The attached documents are being provided to Switching Power Magazine for information purposes. This magazine is writing a feature article on the International Space Station Electrical Power System, focusing on the switching power processors. These units include the DC-DC Converter Unit (DDCU), the Bi-directional Charge/Discharge Unit (BCDU), and the Sequential Shunt Unit (SSU). These diagrams are high-level schematics/block diagrams depicting the overall functionality of each unit.
An Introduction to Binary Decision Diagrams
DEFF Research Database (Denmark)
Andersen, Henrik Reif
1996-01-01
This note is a short introduction to Binary Decision Diagrams (BDDs). It provides some background knowledge and describes the core algorithms. It is used in the course "C4340 Advanced Algorithms" at the Technical University of Denmark, autumn 1996.......This note is a short introduction to Binary Decision Diagrams (BDDs). It provides some background knowledge and describes the core algorithms. It is used in the course "C4340 Advanced Algorithms" at the Technical University of Denmark, autumn 1996....
Characterizing Communication Channel Deadlocks in Sequence Diagrams
Mitchell, Bill
2008-01-01
UML sequence diagrams (SDs) are a mainstay of requirements specifications for communication protocols. Mauw and Reniers' algebraic (MRA) semantics formally specifies a behaviour for these SDs that guarantees deadlock free processes. Practitioners commonly use communication semantics that differ from MRA, which may result in deadlocks. For example FIFO, token ring, etc. We define a process algebra that is an extension of the MRA semantics for regular sequence diagrams. Our algebra can describe...
Random Young diagrams in a Rectangular Box
DEFF Research Database (Denmark)
Beltoft, Dan; Boutillier, Cédric; Enriquez, Nathanaël
We exhibit the limit shape of random Young diagrams having a distribution proportional to the exponential of their area, and confined in a rectangular box. The Ornstein-Uhlenbeck bridge arises from the fluctuations around the limit shape.......We exhibit the limit shape of random Young diagrams having a distribution proportional to the exponential of their area, and confined in a rectangular box. The Ornstein-Uhlenbeck bridge arises from the fluctuations around the limit shape....
The application of diagrams in architectural design
Directory of Open Access Journals (Sweden)
Dulić Olivera
2014-01-01
Full Text Available Diagrams in architecture represent the visualization of the thinking process, or selective abstraction of concepts or ideas translated into the form of drawings. In addition, they provide insight into the way of thinking about and in architecture, thus creating a balance between the visual and the conceptual. The subject of research presented in this paper are diagrams as a specific kind of architectural representation, and possibilities and importance of their application in the design process. Diagrams are almost old as architecture itself, and they are an element of some of the most important studies of architecture during all periods of history - which results in a large number of different definitions of diagrams, but also very different conceptualizations of their features, functions and applications. The diagrams become part of contemporary architectural discourse during the eighties and nineties of the twentieth century, especially through the work of architects like Bernard Tschumi, Peter Eisenman, Rem Koolhaas, SANAA and others. The use of diagrams in the design process allows unification of some of the essential aspects of the profession: architectural representation and design process, as well as the question of the concept of architectural and urban design at a time of rapid changes at all levels of contemporary society. The aim of the research is the analysis of the diagram as a specific medium for processing large amounts of information that the architect should consider and incorporate into the architectural work. On that basis, it is assumed that an architectural diagram allows the creator the identification and analysis of specific elements or ideas of physical form, thereby constantly maintaining concept of the integrity of the architectural work.
Atomic energy levels and Grotrian diagrams
Bashkin, Stanley
1975-01-01
Atomic Energy Levels and Grotrian Diagrams, Volume I: Hydrogen I - Phosphorus XV presents diagrams of various elements that show their energy level and electronic transitions. The book covers the first 15 elements according to their atomic number. The text will be of great use to researchers and practitioners of fields such as astrophysics that requires pictorial representation of the energy levels and electronic transitions of elements.
Theoretical flow regime diagrams for the AGCE
Fowlis, W. W.; Miller, T. L.; Roberts, G. O.; Kopecky, K. J.
1984-01-01
The major criterion for the design of the Atmospheric General Circulation Experiment is that it be possible to realize strong baroclinic instability in the apparatus. A spherical annulus configuration which allows only steady basic state flows was chosen for the first set of stability analyses. Baroclinic instability was found for this configuration and few results suggest a regime diagram very different from the cylindrical annulus regime diagram.
CERN. Geneva
2013-01-01
For decades the central theoretical tool for computing scattering amplitudes has been the Feynman diagram. However, Feynman diagrams are just too slow, even on fast computers, to be able to go beyond the leading order in QCD, for complicated events with many jets of hadrons in the final state. Such events are produced copiously at the LHC, and constitute formidable backgrounds to many searches for new physics. Over the past few years, alternative methods that go beyond ...
Reversible logic gate using adiabatic superconducting devices
National Research Council Canada - National Science Library
Takeuchi, N; Yamanashi, Y; Yoshikawa, N
2014-01-01
.... However, until now, no practical reversible logic gates have been demonstrated. One of the problems is that reversible logic gates must be built by using extremely energy-efficient logic devices...
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…
Fan, Daoqing; Shang, Changshuai; Gu, Wenling; Wang, Erkang; Dong, Shaojun
2017-08-09
Glutathione (GSH) plays crucial roles in various biological functions, the level alterations of which have been linked to varieties of diseases. Herein, we for the first time expanded the application of oxidase-like property of MnO2 nanosheet (MnO2 NS) to fluorescent substrates of peroxidase. Different from previously reported fluorescent quenching phenomena, we found that MnO2 NS could not only largely quench the fluorescence of highly fluorescent Scopoletin (SC) but also surprisingly enhance that of nonfluorescent Amplex Red (AR) via oxidation reaction. If MnO2 NS is premixed with GSH, it will be reduced to Mn2+ and lose the oxidase-like property, accompanied by subsequent increase in SC's fluorescence and decrease in AR's. On the basis of the above mechanism, we construct the first MnO2 NS-based ratiometric fluorescent sensor for ultrasensitive and selective detection of GSH. Notably, this ratiometric sensor is programmed by the cascade logic circuit (an INHIBIT gate cascade with a 1 to 2 decoder). And a linear relationship between ratiometric fluorescent intensities of the two substrates and logarithmic values of GSH's concentrations is obtained. The detection limit of GSH is as low as 6.7 nM, which is much lower than previous ratiometric fluorescent sensors, and the lowest MnO2 NS-based fluorescent GSH sensor reported so far. Furthermore, this sensor is simple, label-free, and low-cost; it also presents excellent applicability in human serum samples.
Implicational (semilinear) logics III: completeness properties
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Noguera, Carles
First Online: 31 July 2017 (2018) ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * protoalgebraic logics * implicational logics * disjunctional logics * semilinear logics * non-classical logics * completeness theorems * rational completeness Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) Impact factor: 0.394, year: 2016
Logic regression and its extensions.
Schwender, Holger; Ruczinski, Ingo
2010-01-01
Logic regression is an adaptive classification and regression procedure, initially developed to reveal interacting single nucleotide polymorphisms (SNPs) in genetic association studies. In general, this approach can be used in any setting with binary predictors, when the interaction of these covariates is of primary interest. Logic regression searches for Boolean (logic) combinations of binary variables that best explain the variability in the outcome variable, and thus, reveals variables and interactions that are associated with the response and/or have predictive capabilities. The logic expressions are embedded in a generalized linear regression framework, and thus, logic regression can handle a variety of outcome types, such as binary responses in case-control studies, numeric responses, and time-to-event data. In this chapter, we provide an introduction to the logic regression methodology, list some applications in public health and medicine, and summarize some of the direct extensions and modifications of logic regression that have been proposed in the literature. Copyright © 2010 Elsevier Inc. All rights reserved.
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.
Yanin, AF; Kompaniets, KG; Amel'chakov, MB; Gorbacheva, EA; Dzaparova, IM; Kindin, VV; Novosel'tsev, YF; Striganov, PS
2004-01-01
A schematic diagram of a hodoscope with 3200 amplitude channels is described. The hodoscope is based on state-of-the-art programmable logic integral circuits (PLICs). Thanks to the use of PLICs, it is capable of measuring the lengths of input signals in each channel and monitoring their shape. In
Kral, M J
1994-01-01
Although suicide is not viewed as a mental disorder per se, it is viewed by many if not most clinicians, researchers, and lay people as a real or natural symptom of depression. It is at least most typically seen as the unfortunate, severe, yet logical end result of a chain of negative self-appraisals, negative events, and hopelessness. Extending an approach articulated by the early French sociologist Gabriel Tarde, in this paper I argue that suicide is merely an idea, albeit a very bad one, having more in common with societal beliefs and norms regarding such things as divorce, abortion, sex, politics, consumer behavior, and fashion. I make a sharp contrast between perturbation and lethality, concepts central to Edwin S. Shneidman's theory of suicide. Evidence supportive of suicide as an idea is discussed based on what we are learning from the study of history and culture, and about contagion/cluster phenomena, media/communication, and choice of method. It is suggested that certain individuals are more vulnerable to incorporate the idea and act of suicide into their concepts of self, based on the same principles by which ideas are spread throughout society. Just as suicide impacts on society, so does society impact on suicide.
Remmel, Jeffrey; Shore, Richard; Sweedler, Moss; Progress in Computer Science and Applied Logic
1993-01-01
The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematica...
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 input...... 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....
Handling Pressures of Community Logic
DEFF Research Database (Denmark)
Minbaeva, Dana; Hotho, Jasper; Muratbekova-Touron, Maral
2013-01-01
The paper aims at investigating how in pluralistic societies, such as emerging economies and countries in transition, organizational decision-makers respond to pressures of community logics in non-community settings, such as the work place. We theorize that in non-community settings, social...... relations and interactions with community members can act as social cues that induce and expose individuals to community logics. We subsequently propose that properties of these relations – immediacy and relatedness - will affect individual response strategies towards community logics. We test these ideas...
Nanoelectromechanical resonator for logic operations
Kazmi, Syed N. R.
2017-08-29
We report an electro-thermally tunable in-plane doubly-clamped nanoelectromechanical resonator capable of dynamically performing NOR, NOT, XNOR, XOR, and AND logic operations. Toward this, a silicon based resonator is fabricated using standard e-beam lithography and surface nanomachining of a highly conductive device layer of a silicon-on-insulator (SOI) wafer. The performance of this logic device is examined at elevated temperatures, ranging from 25 °C to 85 °C, demonstrating its resilience for most of the logic operations; thereby paving the way towards nano-elements-based mechanical computing.
A Simple Model of Separation Logic for Higher-order Store
DEFF Research Database (Denmark)
Birkedal, Lars; Reus, Bernhard; Schwinghammer, Jan
2008-01-01
Separation logic is a Hoare-style logic for reasoning about pointer-manipulating programs. Its core ideas have recently been extended from low-level to richer, high-level languages. In this paper we develop a new semantics of the logic for a programming language where code can be stored (i.......e., with higher-order store). The main improvement on previous work is the simplicity of the model. As a consequence, several restrictions imposed by the semantics are removed, leading to a considerably more natural assertion language with a powerful specification logic....
Directory of Open Access Journals (Sweden)
Ana Cláudia Figueiró
2010-11-01
Full Text Available OBJETIVOS: avaliar a coerência lógica do Programa Nacional de Controle da Dengue no Brasil (PNCD quanto aos objetivos e meios definidos para o alcance dos resultados. MÉTODOS: pesquisa avaliativa, análise lógica da intervenção, utilizando-se revisão documental de três fontes de informação sobre o PNCD: relatório de painel de especialistas reunidos em seminário internacional para avaliação do programa; documentos técnicos e opinião de especialistas; e estudos científicos. Comparou-se a análise do programa ao modelo da Organização Panamericana da Saúde para prevenção e controle da dengue - Estratégia de Gestão Integrada-Dengue (EGI. RESULTADOS: encontrou-se convergência entre as estratégias quanto aos pressupostos, objetivos, metas gerais e dos componentes, e conteúdos das intervenções. Verificou-se fragilidade na implementação do PNCD no âmbito municipal em sua integralidade, especialmente de estrutura e gestão, bem como para os componentes analisados, com maior comprometimento no componente de controle vetorial. CONCLUSÕES: baixa coerência e necessidade de atualização do modelo teórico-lógico nos diferentes níveis de gestão do PNCD frente ao pequeno alcance dos objetivos gerais e específicos dos componentes.OBJECTIVES: to evaluate the logical coherence of the Brazilian National Dengue Fever Control Program (PNCD with regard to its objectives and the measures taken to achieve results. METHODS: an evaluative study, an intervention logic analysis, using a review of documentation from three information sources on the PNCD: the report produced by a panel of specialists meeting at an international seminar to evaluate the program; technical documents and the opinions of specialists; and scientific studies. The analysis of the program was compared to the Pan-American Health Organization model for the prevention and control of dengue fever -the Integrated Management Strategy-Dengue Fever. RESULTS: convergence
Directory of Open Access Journals (Sweden)
Yaritza Tardo Fernández
2013-02-01
Full Text Available The cultural, technological and eminently social character of the computer programming problems solving process, joined with the complexity and difficulties detected in their teaching, has contributed to increase the concern about the study of the processes of communication, transmission and understanding of computer programming and to attract the attention of a wide scientific community in correspondence with the growing development that this reaches at the present time. That is the reason why this paper has the objective of discover, from the didactic point of view, the integrators axes of an algorithmic logic that solves the contradiction that is revealed in the formative process between the mathematic modeling and their algorithmic systematization to empower an efficient performance of the professionals of Computer Science and Computer Engineering. In this sense a new didactic proposal is based, that consist in an algorithmic logic, in which are specified and explained those essentials processes that should be carry out to solve computer programming problems. Based on the theoretical fundaments, we concluded that these processes constitute didactics moments, required in order to solve the contradiction mentioned before.RESUMENEl carácter eminentemente social, cultural y tecnológico del proceso de resolución de problemas de programación computacional, junto a la complejidad y dificultades detectadas en su enseñanza, han contribuido a despertar la preocupación por el estudio de los procesos de comunicación, transmisión y comprensión de la Programación y a interesar a una amplia comunidad científica en correspondencia con el creciente desarrollo que ésta alcanza en la actualidad. Razón por la cual este trabajo tiene como objetivo que se develen, desde el punto de vista didáctico, los ejes integradores de una lógica algorítmica que sea contentiva de la solución a la contradicción que se revela en el proceso formativo entre la
Pathway collages: personalized multi-pathway diagrams.
Paley, Suzanne; O'Maille, Paul E; Weaver, Daniel; Karp, Peter D
2016-12-13
Metabolic pathway diagrams are a classical way of visualizing a linked cascade of biochemical reactions. However, to understand some biochemical situations, viewing a single pathway is insufficient, whereas viewing the entire metabolic network results in information overload. How do we enable scientists to rapidly construct personalized multi-pathway diagrams that depict a desired collection of interacting pathways that emphasize particular pathway interactions? We define software for constructing personalized multi-pathway diagrams called pathway-collages using a combination of manual and automatic layouts. The user specifies a set of pathways of interest for the collage from a Pathway/Genome Database. Layouts for the individual pathways are generated by the Pathway Tools software, and are sent to a Javascript Pathway Collage application implemented using Cytoscape.js. That application allows the user to re-position pathways; define connections between pathways; change visual style parameters; and paint metabolomics, gene expression, and reaction flux data onto the collage to obtain a desired multi-pathway diagram. We demonstrate the use of pathway collages in two application areas: a metabolomics study of pathogen drug response, and an Escherichia coli metabolic model. Pathway collages enable facile construction of personalized multi-pathway diagrams.
Slime mould processors, logic gates and sensors.
Adamatzky, A
2015-07-28
A heterotic, or hybrid, computation implies that two or more substrates of different physical nature are merged into a single device with indistinguishable parts. These hybrid devices then undertake coherent acts on programmable and sensible processing of information. We study the potential of heterotic computers using slime mould acting under the guidance of chemical, mechanical and optical stimuli. Plasmodium of acellular slime mould Physarum polycephalum is a gigantic single cell visible to the unaided eye. The cell shows a rich spectrum of behavioural morphological patterns in response to changing environmental conditions. Given data represented by chemical or physical stimuli, we can employ and modify the behaviour of the slime mould to make it solve a range of computing and sensing tasks. We overview results of laboratory experimental studies on prototyping of the slime mould morphological processors for approximation of Voronoi diagrams, planar shapes and solving mazes, and discuss logic gates implemented via collision of active growing zones and tactile responses of P. polycephalum. We also overview a range of electronic components--memristor, chemical, tactile and colour sensors-made of the slime mould. © 2015 The Author(s) Published by the Royal Society. All rights reserved.
Classical Limit and Quantum Logic
Losada, Marcelo; Fortin, Sebastian; Holik, Federico
2018-02-01
The analysis of the classical limit of quantum mechanics usually focuses on the state of the system. The general idea is to explain the disappearance of the interference terms of quantum states appealing to the decoherence process induced by the environment. However, in these approaches it is not explained how the structure of quantum properties becomes classical. In this paper, we consider the classical limit from a different perspective. We consider the set of properties of a quantum system and we study the quantum-to-classical transition of its logical structure. The aim is to open the door to a new study based on dynamical logics, that is, logics that change over time. In particular, we appeal to the notion of hybrid logics to describe semiclassical systems. Moreover, we consider systems with many characteristic decoherence times, whose sublattices of properties become distributive at different times.
Classical Limit and Quantum Logic
Losada, Marcelo; Fortin, Sebastian; Holik, Federico
2017-10-01
The analysis of the classical limit of quantum mechanics usually focuses on the state of the system. The general idea is to explain the disappearance of the interference terms of quantum states appealing to the decoherence process induced by the environment. However, in these approaches it is not explained how the structure of quantum properties becomes classical. In this paper, we consider the classical limit from a different perspective. We consider the set of properties of a quantum system and we study the quantum-to-classical transition of its logical structure. The aim is to open the door to a new study based on dynamical logics, that is, logics that change over time. In particular, we appeal to the notion of hybrid logics to describe semiclassical systems. Moreover, we consider systems with many characteristic decoherence times, whose sublattices of properties become distributive at different times.
Logic gates with ion transistors
Grebel, H.
2017-09-01
Electronic logic gates are the basic building blocks of every computing and micro controlling system. Logic gates are made of switches, such as diodes and transistors. Ion-selective, ionic switches may emulate electronic switches [1-8]. If we ever want to create artificial bio-chemical circuitry, then we need to move a step further towards ion-logic circuitry. Here we demonstrate ion XOR and OR gates with electrochemical cells, and specifically, with two wet-cell batteries. In parallel to vacuum tubes, the batteries were modified to include a third, permeable and conductive mid electrode (the gate), which was placed between the anode and cathode in order to affect the ion flow through it. The key is to control the cell output with a much smaller biasing power, as demonstrated here. A successful demonstration points to self-powered ion logic gates.
Dependence logic theory and applications
Kontinen, Juha; Väänänen, Jouko; Vollmer, Heribert
2016-01-01
In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning ...
Logic Gates with Ion Transistors
Grebel, Haim
2016-01-01
Electronic logic gates are the basic building blocks of every computing and micro controlling system. Logic gates are made of switches, such as diodes and transistors. Ion-selective, ionic switches may emulate electronic switches [1-8]. If we ever want to create artificial bio-chemical circuitry, then we need to move a step further towards ion-logic circuitry. Here we demonstrate ion XOR and OR gates with electrochemical cells, and specifically, with two wet-cell batteries. In parallel to vacuum tubes, the batteries were modified to include a third, permeable and conductive mid electrode (the gate), which was placed between the anode and cathode in order to affect the ion flow through it. The key is to control the cell output with a much smaller biasing power, as demonstrated here. A successful demonstration points to self-powered ion logic gates.
On the Impact of Layout Quality to Understanding UML Diagrams: Diagram Type and Expertise
DEFF Research Database (Denmark)
Störrle, Harald
2012-01-01
. In the current paper, we expand on our earlier experiments by varying both diagram types and populations studied. We find no difference in the beneficial evidence of good layout wrt. diagram types. We also find support for the hypothesis that experts benefit less than novices. While still lacking independent...
The Semiotic Structure of Geometry Diagrams: How Textbook Diagrams Convey Meaning
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,…
Logical operations using phenyl ring
Patra, Moumita; Maiti, Santanu K.
2018-02-01
Exploiting the effects of quantum interference we put forward an idea of designing three primary logic gates, OR, AND and NOT, using a benzene molecule. Under a specific molecule-lead interface geometry, anti-resonant states appear which play the crucial role for AND and NOT operations, while for OR gate no such states are required. Our analysis leads to a possibility of designing logic gates using simple molecular structure which might be significant in the area of molecular electronics.
Observation Predicates in Flow Logic
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis; Sun, Hongyan
2003-01-01
in such a way that the hard constraints are satisfi ed exactly when the observation predicates report no violations. The development is carried out in a large fragment of a first order logic with negation and also takes care of the transformations necessary in order to adhere to the stratification restrictions...... inherent in Alternation-free Least Fixed Point Logic and similar formalisms such as Datalog....
Brünnler, Kai; Flumini, Dandolo; Studer, Thomas
2017-01-01
Blockchains are distributed data structures that are used to achieve consensus in systems for cryptocurrencies (like Bitcoin) or smart contracts (like Ethereum). Although blockchains gained a lot of popularity recently, there is no logic-based model for blockchains available. We introduce BCL, a dynamic logic to reason about blockchain updates, and show that BCL is sound and complete with respect to a simple blockchain model.
Simulation of mixed bond graphs and block diagrams on personal computers using TUTSIM
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)
Optically controllable molecular logic circuits
Energy Technology Data Exchange (ETDEWEB)
Nishimura, Takahiro, E-mail: t-nishimura@ist.osaka-u.ac.jp; Fujii, Ryo; Ogura, Yusuke; Tanida, Jun [Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka 565-0871 (Japan)
2015-07-06
Molecular logic circuits represent a promising technology for observation and manipulation of biological systems at the molecular level. However, the implementation of molecular logic circuits for temporal and programmable operation remains challenging. In this paper, we demonstrate an optically controllable logic circuit that uses fluorescence resonance energy transfer (FRET) for signaling. The FRET-based signaling process is modulated by both molecular and optical inputs. Based on the distance dependence of FRET, the FRET pathways required to execute molecular logic operations are formed on a DNA nanostructure as a circuit based on its molecular inputs. In addition, the FRET pathways on the DNA nanostructure are controlled optically, using photoswitching fluorescent molecules to instruct the execution of the desired operation and the related timings. The behavior of the circuit can thus be controlled using external optical signals. As an example, a molecular logic circuit capable of executing two different logic operations was studied. The circuit contains functional DNAs and a DNA scaffold to construct two FRET routes for executing Input 1 AND Input 2 and Input 1 AND NOT Input 3 operations on molecular inputs. The circuit produced the correct outputs with all possible combinations of the inputs by following the light signals. Moreover, the operation execution timings were controlled based on light irradiation and the circuit responded to time-dependent inputs. The experimental results demonstrate that the circuit changes the output for the required operations following the input of temporal light signals.
Model FORC diagrams for hybrid magnetic elastomers
Energy Technology Data Exchange (ETDEWEB)
Vaganov, M.V., E-mail: mikhail.vaganov.sci@gmail.com.ru [Institute of Continuous Media Mechanics, Russian Academy of Sciences, Ural Branch, Perm, 614013 (Russian Federation); Linke, J.; Odenbach, S. [Technische Universität Dresden, Dresden, 01062 Germany (Germany); Raikher, Yu.L. [Institute of Continuous Media Mechanics, Russian Academy of Sciences, Ural Branch, Perm, 614013 (Russian Federation); Ural Federal University, Ekaterinburg, 620083 (Russian Federation)
2017-06-01
We propose a model of hybrid magnetic elastomers filled with a mixture of magnetically soft and magnetically hard microparticles. The magnetically hard particles are described by the Stoner–Wohlfarth model, the magnetically soft phase obeys the Fröhlich–Kennelly equation. The interaction between the two types of particles is described by the mean-field approach. First-order reversal curve (FORC) diagrams were calculated for different values of the elastomer matrix elasticity. We demonstrate that the diagrams display specific new features, which identify the presence of both a deformable matrix and the two types of magnetic particles. - Highlights: • A model of hybrid magnetic elastomers is proposed. • The magnetically hard particles are described by the Stoner–Wohlfarth model. • The magnetically soft phase obeys the Fröhlich–Kennelly equation. The interaction between the phases is described by the mean-field approach. • FORC diagrams are calculated for different values of the elastomer matrix elasticity.
Using Sequence Diagrams to Detect Communication Problems Between Systems
Lindvall, Mikael; Ackermann, Chris; Stratton, William C.; Sibol, Deane E.; Ray, Arnab; Yonkwa, Lyly; Kresser, Jan; Godfrey, Sally H.; Knodel, Jens
2008-01-01
Many software systems are evolving complex system of systems (SoS) for which inter-system communication is both mission-critical and error-prone. Such communication problems ideally would be detected before deployment. In a NASA-supported Software Assurance Research Program (SARP) project, we are researching a new approach addressing such problems. In this paper, we show that problems in the communication between two systems can be detected by using sequence diagrams to model the planned communication and by comparing the planned sequence to the actual sequence. We identify different kinds of problems that can be addressed by modeling the planned sequence using different level of abstractions.
Partial chord diagrams and matrix models
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Fuji, Hiroyuki; Manabe, Masahide
spectrum. Furthermore, we consider the boundary length and point spectrum that unifies the last two types of spectra. We introduce matrix models that encode generating functions of partial chord diagrams filtered by each of these spectra. Using these matrix models, we derive partial differential equations......In this article, the enumeration of partial chord diagrams is discussed via matrix model techniques. In addition to the basic data such as the number of backbones and chords, we also consider the Euler characteristic, the backbone spectrum, the boundary point spectrum, and the boundary length...
Fusion Diagrams in the - and - Systems
Asadov, M. M.; Akhmedova, N. A.
2014-10-01
A calculation model of the Gibbs energy of ternary oxide compounds from the binary components was used. Thermodynamic properties of -- ternary systems in the condensed state were calculated. Thermodynamic data of binary and ternary compounds were used to determine the stable sections. The probability of reactions between the corresponding components in the -- system was estimated. Fusibility diagrams of systems - and - were studied by physical-chemical analysis. The isothermal section of the phase diagram of -- at 298 K is built, as well as the projection of the liquid surface of --.
BDL: A Semantics Backbone for UML Dynamic Diagrams
Caillaud, Benoit; Talpin, Jean-Pierre; Jézéquel, Jean-Marc; Benveniste, Albert; Jard, Claude
2000-01-01
The UML (Unified Modelling Language) comprises various types of notations, to model the functional architecture, the behaviour of its components, and its deployment. Dynamic diagrams provide descriptions of the components and system behaviour. Examples of dynamic diagrams are collaboration and sequence diagrams to specify high level abstractions for sequences of actions involving several components of the system. Activity diagrams, state diagrams, and statecharts are used to specify the detai...
A Logical Framework for Reputation Systems
DEFF Research Database (Denmark)
Nielsen, Mogens; Krukow, Karl Kristian; Sassone, Vladimiro
2008-01-01
, the two types of systems are fundamentally making decisions based on information about the past behaviour of an entity. A logical policy-centric framework for such behaviour-based decision-making is presented. In the framework, principals specify policies which state precise requirements on the past......Reputation systems are meta systems that record, aggregate and distribute information about principals' behaviour in distributed applications. Similarly, history-based access control systems make decisions based on programs' past security-sensitive actions. While the applications are distinct...
Proposal for the Formalization of Dialectical Logic
Directory of Open Access Journals (Sweden)
José Luis Usó-Doménech
2016-12-01
Full Text Available Classical logic is typically concerned with abstract analysis. The problem for a synthetic logic is to transcend and unify available data to reconstruct the object as a totality. Three rules are proposed to pass from classic logic to synthetic logic. We present the category logic of qualitative opposition using examples from various sciences. This logic has been defined to include the neuter as part of qualitative opposition. The application of these rules to qualitative opposition, and, in particular, its neuter, demonstrated that a synthetic logic allows the truth of some contradictions. This synthetic logic is dialectical with a multi-valued logic, which gives every proposition a truth value in the interval [0,1] that is the square of the modulus of a complex number. In this dialectical logic, contradictions of the neuter of an opposition may be true.
Deciding KAT and Hoare Logic with Derivatives
Directory of Open Access Journals (Sweden)
Ricardo Almeida
2012-10-01
Full Text Available Kleene algebra with tests (KAT is an equational system for program verification, which is the combination of Boolean algebra (BA and Kleene algebra (KA, the algebra of regular expressions. In particular, KAT subsumes the propositional fragment of Hoare logic (PHL which is a formal system for the specification and verification of programs, and that is currently the base of most tools for checking program correctness. Both the equational theory of KAT and the encoding of PHL in KAT are known to be decidable. In this paper we present a new decision procedure for the equivalence of two KAT expressions based on the notion of partial derivatives. We also introduce the notion of derivative modulo particular sets of equations. With this we extend the previous procedure for deciding PHL. Some experimental results are also presented.
Set Constraints and Logic Programming (Preprint)
2016-02-24
combina torial method of involving hypergraphs It is also strongly related to the automata theoretic approach of and to the...corresponds to an innite run of a tree set automaton in the automata theoretic approach of The following theorem was proved in Theorem...original One can still reduce the size of the system by annihilating atoms u that are inaccessible in the automata theoretic sense since they will
tactusLogic: programming using physical objects
CSIR Research Space (South Africa)
Smith, Andrew C
2011-05-01
Full Text Available contribution lies in the description of the language and the design of the physical representation of the language. The paper is structured as follows. We first discuss related work done by others, followed by the methodology used in this research. A... to convey intent and representation in this system. One marking system is intended for interpretation by the user, and the other for the underlying computing system. To the user, both colours and semiotics [6] are used to indicate the function of a...
Logic and Lattices for Distributed Programming
2012-06-22
exploring how to add support for escrow operations to BloomL. To support concurrent editing of shared documents, the 12 groupware community has studied a...store. In SOSP, 2007. [11] C. A. Ellis and S. J. Gibbs. Concurrency control in groupware systems. In SIGMOD, 1989. [12] A. A. Farrag and M. T. Özsu
Scheduling sport tournaments using constraint logic programming
A. Schaerf
1997-01-01
textabstractWe tackle the problem of scheduling the matches of a round robin tournament for a sport league. We formally define the problem, state its computational complexity, and present a solution algorithm using a two-step approach. The first step is the creation of a tournament pattern and is
Drawing conformal diagrams for a fractal landscape
Winitzki, Sergei
2005-06-01
Generic models of cosmological inflation and the recently proposed scenarios of a recycling universe and the string theory landscape predict spacetimes whose global geometry is a stochastic, self-similar fractal. To visualize the complicated causal structure of such a universe, one usually draws a conformal (Carter-Penrose) diagram. I develop a new method for drawing conformal diagrams, applicable to arbitrary 1+1-dimensional spacetimes. This method is based on a qualitative analysis of intersecting lightrays and thus avoids the need for explicit transformations of the spacetime metric. To demonstrate the power and simplicity of this method, I present derivations of diagrams for spacetimes of varying complication. I then apply the lightray method to three different models of an eternally inflating universe (scalar-field inflation, recycling universe, and string theory landscape) involving the nucleation of nested asymptotically flat, de Sitter and/or anti-de Sitter bubbles. I show that the resulting diagrams contain a characteristic fractal arrangement of lines.
Spin wave Feynman diagram vertex computation package
Price, Alexander; Javernick, Philip; Datta, Trinanjan
Spin wave theory is a well-established theoretical technique that can correctly predict the physical behavior of ordered magnetic states. However, computing the effects of an interacting spin wave theory incorporating magnons involve a laborious by hand derivation of Feynman diagram vertices. The process is tedious and time consuming. Hence, to improve productivity and have another means to check the analytical calculations, we have devised a Feynman Diagram Vertex Computation package. In this talk, we will describe our research group's effort to implement a Mathematica based symbolic Feynman diagram vertex computation package that computes spin wave vertices. Utilizing the non-commutative algebra package NCAlgebra as an add-on to Mathematica, symbolic expressions for the Feynman diagram vertices of a Heisenberg quantum antiferromagnet are obtained. Our existing code reproduces the well-known expressions of a nearest neighbor square lattice Heisenberg model. We also discuss the case of a triangular lattice Heisenberg model where non collinear terms contribute to the vertex interactions.
Solution space diagram in conflict detection scenarios
Rahman, S.M.A.; Borst, C.; Mulder, M.; Van Paassen, M.M.
2015-01-01
This research investigates the use of Solution Space Diagram (SSD) as a measure of sector complexity and also as a predictor of performance and workload, focusing on the scenarios regarding Air Traffic Controller (ATCO)’s ability to detect future conflicts. A human-in-the-loop experiment with
Diagram of a LEP superconducting cavity
1991-01-01
This diagram gives a schematic representation of the superconducting radio-frequency cavities at LEP. Liquid helium is used to cool the cavity to 4.5 degrees above absolute zero so that very high electric fields can be produced, increasing the operating energy of the accelerator. Superconducting cavities were used only in the LEP-2 phase of the accelerator, from 1996 to 2000.
Phase diagram of spiking neural networks.
Seyed-Allaei, Hamed
2015-01-01
In computer simulations of spiking neural networks, often it is assumed that every two neurons of the network are connected by a probability of 2%, 20% of neurons are inhibitory and 80% are excitatory. These common values are based on experiments, observations, and trials and errors, but here, I take a different perspective, inspired by evolution, I systematically simulate many networks, each with a different set of parameters, and then I try to figure out what makes the common values desirable. I stimulate networks with pulses and then measure their: dynamic range, dominant frequency of population activities, total duration of activities, maximum rate of population and the occurrence time of maximum rate. The results are organized in phase diagram. This phase diagram gives an insight into the space of parameters - excitatory to inhibitory ratio, sparseness of connections and synaptic weights. This phase diagram can be used to decide the parameters of a model. The phase diagrams show that networks which are configured according to the common values, have a good dynamic range in response to an impulse and their dynamic range is robust in respect to synaptic weights, and for some synaptic weights they oscillates in α or β frequencies, independent of external stimuli.
Phase Diagrams of Strongly Interacting Theories
DEFF Research Database (Denmark)
Sannino, Francesco
2010-01-01
We summarize the phase diagrams of SU, SO and Sp gauge theories as function of the number of flavors, colors, and matter representation as well as the ones of phenomenologically relevant chiral gauge theories such as the Bars-Yankielowicz and the generalized Georgi-Glashow models. We finally report...