Data Logic

DEFF Research Database (Denmark)

Nilsson, Jørgen Fischer

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

Classical Mathematical Logic The Semantic Foundations of Logic

CERN Document Server

Epstein, Richard L

2011-01-01

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

Preliminary Proceedings First International Workshop on Formal Methods for WirelessSystems

DEFF Research Database (Denmark)

The FMWS workshops aim at bringing together researchers interested in formal methods for wireless systems, more specifically in theories for semantics, logics, and verification techniques for wireless systems. Wireless systems are rapidly increasing their success in real-world applications while...

Structural Logical Relations

DEFF Research Database (Denmark)

Schürmann, Carsten; Sarnat, Jeffrey

2008-01-01

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

Proposal for the Formalization of Dialectical Logic

Directory of Open Access Journals (Sweden)

José Luis Usó-Doménech

2016-12-01

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

A Temporal Fuzzy Logic Formalism for Knowledge Based Systems

Directory of Open Access Journals (Sweden)

Vasile MAZILESCU

2012-11-01

Full Text Available This paper shows that the influence of knowledge on new forms of work organisation can be described as mutual relationships. Different changes in work organisation also have a strong influence on the increasing importance of knowledge of different individual and collective actors in working situations. After that, we characterize a piece of basic formal system, an Extended Fuzzy Logic System (EFLS with temporal attributes, to conceptualize future DKMSs based on human imprecise for distributed just in time decisions. The approximate reasoning is perceived as a derivation of new formulas with the corresponding temporal attributes, within a fuzzy theory defined by the fuzzy set of special axioms. In a management application, the reasoning is evolutionary because of unexpected events which may change the state of the DKMS. In this kind of situations it is necessary to elaborate certain mechanisms in order to maintain the coherence of the obtained conclusions, to figure out their degree of reliability and the time domain for which these are true. These last aspects stand as possible further directions of development at a basic logic level for future technologies that must automate knowledge organizational processes.

CellNOptR: a flexible toolkit to train protein signaling networks to data using multiple logic formalisms.

Science.gov (United States)

Terfve, Camille; Cokelaer, Thomas; Henriques, David; MacNamara, Aidan; Goncalves, Emanuel; Morris, Melody K; van Iersel, Martijn; Lauffenburger, Douglas A; Saez-Rodriguez, Julio

2012-10-18

Cells process signals using complex and dynamic networks. Studying how this is performed in a context and cell type specific way is essential to understand signaling both in physiological and diseased situations. Context-specific medium/high throughput proteomic data measured upon perturbation is now relatively easy to obtain but formalisms that can take advantage of these features to build models of signaling are still comparatively scarce. Here we present CellNOptR, an open-source R software package for building predictive logic models of signaling networks by training networks derived from prior knowledge to signaling (typically phosphoproteomic) data. CellNOptR features different logic formalisms, from Boolean models to differential equations, in a common framework. These different logic model representations accommodate state and time values with increasing levels of detail. We provide in addition an interface via Cytoscape (CytoCopteR) to facilitate use and integration with Cytoscape network-based capabilities. Models generated with this pipeline have two key features. First, they are constrained by prior knowledge about the network but trained to data. They are therefore context and cell line specific, which results in enhanced predictive and mechanistic insights. Second, they can be built using different logic formalisms depending on the richness of the available data. Models built with CellNOptR are useful tools to understand how signals are processed by cells and how this is altered in disease. They can be used to predict the effect of perturbations (individual or in combinations), and potentially to engineer therapies that have differential effects/side effects depending on the cell type or context.

Mathematical logic foundations for information science

CERN Document Server

Li, Wei

2014-01-01

Mathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of classical mathematical logic, particularly the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds...

SYNTHESIS METHODS OF ALGEBRAIC NORMAL FORM OF MANY-VALUED LOGIC FUNCTIONS

Directory of Open Access Journals (Sweden)

A. V. Sokolov

2016-01-01

Full Text Available The rapid development of methods of error-correcting coding, cryptography, and signal synthesis theory based on the principles of many-valued logic determines the need for a more detailed study of the forms of representation of functions of many-valued logic. In particular the algebraic normal form of Boolean functions, also known as Zhegalkin polynomial, that well describe many of the cryptographic properties of Boolean functions is widely used. In this article, we formalized the notion of algebraic normal form for many-valued logic functions. We developed a fast method of synthesis of algebraic normal form of 3-functions and 5-functions that work similarly to the Reed-Muller transform for Boolean functions: on the basis of recurrently synthesized transform matrices. We propose the hypothesis, which determines the rules of the synthesis of these matrices for the transformation from the truth table to the coefficients of the algebraic normal form and the inverse transform for any given number of variables of 3-functions or 5-functions. The article also introduces the definition of algebraic degree of nonlinearity of the functions of many-valued logic and the S-box, based on the principles of many-valued logic. Thus, the methods of synthesis of algebraic normal form of 3-functions applied to the known construction of recurrent synthesis of S-boxes of length N = 3k, whereby their algebraic degrees of nonlinearity are computed. The results could be the basis for further theoretical research and practical applications such as: the development of new cryptographic primitives, error-correcting codes, algorithms of data compression, signal structures, and algorithms of block and stream encryption, all based on the perspective principles of many-valued logic. In addition, the fast method of synthesis of algebraic normal form of many-valued logic functions is the basis for their software and hardware implementation.

Formalization of software requirements for information systems using fuzzy logic

Science.gov (United States)

Yegorov, Y. S.; Milov, V. R.; Kvasov, A. S.; Sorokoumova, S. N.; Suvorova, O. V.

2018-05-01

The paper considers an approach to the design of information systems based on flexible software development methodologies. The possibility of improving the management of the life cycle of information systems by assessing the functional relationship between requirements and business objectives is described. An approach is proposed to establish the relationship between the degree of achievement of business objectives and the fulfillment of requirements for the projected information system. It describes solutions that allow one to formalize the process of formation of functional and non-functional requirements with the help of fuzzy logic apparatus. The form of the objective function is formed on the basis of expert knowledge and is specified via learning from very small data set.

A Linguistic Truth-Valued Temporal Reasoning Formalism and Its Implementation

Science.gov (United States)

Lu, Zhirui; Liu, Jun; Augusto, Juan C.; Wang, Hui

Temporality and uncertainty are important features of many real world systems. Solving problems in such systems requires the use of formal mechanism such as logic systems, statistical methods or other reasoning and decision-making methods. In this paper, we propose a linguistic truth-valued temporal reasoning formalism to enable the management of both features concurrently using a linguistic truth valued logic and a temporal logic. We also provide a backward reasoning algorithm which allows the answering of user queries. A simple but realistic scenario in a smart home application is used to illustrate our work.

Logicism, intuitionism, and formalism

CERN Document Server

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.

Description logic-based methods for auditing frame-based medical terminological systems.

Science.gov (United States)

Cornet, Ronald; Abu-Hanna, Ameen

2005-07-01

Medical terminological systems (TSs) play an increasingly important role in health care by supporting recording, retrieval and analysis of patient information. As the size and complexity of TSs are growing, the need arises for means to audit them, i.e. verify and maintain (logical) consistency and (semantic) correctness of their contents. This is not only important for the management of TSs but also for providing their users with confidence about the reliability of their contents. Formal methods have the potential to play an important role in the audit of TSs, although there are few empirical studies to assess the benefits of using these methods. In this paper we propose a method based on description logics (DLs) for the audit of TSs. This method is based on the migration of the medical TS from a frame-based representation to a DL-based one. Our method is characterized by a process in which initially stringent assumptions are made about concept definitions. The assumptions allow the detection of concepts and relations that might comprise a source of logical inconsistency. If the assumptions hold then definitions are to be altered to eliminate the inconsistency, otherwise the assumptions are revised. In order to demonstrate the utility of the approach in a real-world case study we audit a TS in the intensive care domain and discuss decisions pertaining to building DL-based representations. This case study demonstrates that certain types of inconsistencies can indeed be detected by applying the method to a medical terminological system. The added value of the method described in this paper is that it provides a means to evaluate the compliance to a number of common modeling principles in a formal manner. The proposed method reveals potential modeling inconsistencies, helping to audit and (if possible) improve the medical TS. In this way, it contributes to providing confidence in the contents of the terminological system.

Optimization methods for logical inference

CERN Document Server

Chandru, Vijay

2011-01-01

Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in

Action Type Deontic Logic

DEFF Research Database (Denmark)

Bentzen, Martin Mose

2014-01-01

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

Many-valued logics

CERN Document Server

Bolc, Leonard

1992-01-01

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

BDI Logics

NARCIS (Netherlands)

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

2015-01-01

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

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

Relativistic quantum logic

International Nuclear Information System (INIS)

Mittelstaedt, P.

1983-01-01

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

A formal safety analysis for PLC software-based safety critical system using Z

International Nuclear Information System (INIS)

Koh, Jung Soo; Seong, Poong Hyun

1997-01-01

This paper describes a formal safety analysis technique which is demonstrated by performing empirical formal safety analysis with the case study of beamline hutch door Interlock system that is developed by using PLC (Programmable Logic Controller) systems at the Pohang Accelerator Laboratory. In order to perform formed safety analysis, we have built the Z formal specifications representation from user requirement written in ambiguous natural language and target PLC ladder logic, respectively. We have also studied the effective method to express typical PLC timer component by using specific Z formal notation which is supported by temporal history. We present a formal proof technique specifying and verifying that the hazardous states are not introduced into ladder logic in the PLC-based safety critical system

On the Formal-Logical Analysis of the Foundations of Mathematics Applied to Problems in Physics

Science.gov (United States)

Kalanov, Temur Z.

2016-03-01

Analysis of the foundations of mathematics applied to problems in physics was proposed. The unity of formal logic and of rational dialectics is methodological basis of the analysis. It is shown that critical analysis of the concept of mathematical quantity - central concept of mathematics - leads to the following conclusion: (1) The concept of ``mathematical quantity'' is the result of the following mental operations: (a) abstraction of the ``quantitative determinacy of physical quantity'' from the ``physical quantity'' at that the ``quantitative determinacy of physical quantity'' is an independent object of thought; (b) abstraction of the ``amount (i.e., abstract number)'' from the ``quantitative determinacy of physical quantity'' at that the ``amount (i.e., abstract number)'' is an independent object of thought. In this case, unnamed, abstract numbers are the only sign of the ``mathematical quantity''. This sign is not an essential sign of the material objects. (2) The concept of mathematical quantity is meaningless, erroneous, and inadmissible concept in science because it represents the following formal-logical and dialectical-materialistic error: negation of the existence of the essential sign of the concept (i.e., negation of the existence of the essence of the concept) and negation of the existence of measure of material object.

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

First-Order Hybrid Logic

DEFF Research Database (Denmark)

Braüner, Torben

2011-01-01

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

Scalable Techniques for Formal Verification

CERN Document Server

Ray, Sandip

2010-01-01

This book presents state-of-the-art approaches to formal verification techniques to seamlessly integrate different formal verification methods within a single logical foundation. It should benefit researchers and practitioners looking to get a broad overview of the spectrum of formal verification techniques, as well as approaches to combining such techniques within a single framework. Coverage includes a range of case studies showing how such combination is fruitful in developing a scalable verification methodology for industrial designs. This book outlines both theoretical and practical issue

Mathematical logic foundations for information science

CERN Document Server

Li, Wei

2010-01-01

This book presents the basic principles and formal calculus of mathematical logic. It covers core contents, extensions and developments of classical mathematical logic, and it offers formal proofs and concrete examples for all theoretical results.

Logical labyrinths

CERN Document Server

Smullyan, Raymond

2008-01-01

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

Structural logical relations with case analysis and equality reasoning

DEFF Research Database (Denmark)

Rasmussen, Ulrik Terp; Filinski, Andrzej

2013-01-01

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

A Formal Methods Approach to the Analysis of Mode Confusion

Science.gov (United States)

Butler, Ricky W.; Miller, Steven P.; Potts, James N.; Carreno, Victor A.

2004-01-01

The goal of the new NASA Aviation Safety Program (AvSP) is to reduce the civil aviation fatal accident rate by 80% in ten years and 90% in twenty years. This program is being driven by the accident data with a focus on the most recent history. Pilot error is the most commonly cited cause for fatal accidents (up to 70%) and obviously must be given major consideration in this program. While the greatest source of pilot error is the loss of situation awareness , mode confusion is increasingly becoming a major contributor as well. The January 30, 1995 issue of Aviation Week lists 184 incidents and accidents involving mode awareness including the Bangalore A320 crash 2/14/90, the Strasbourg A320 crash 1/20/92, the Mulhouse-Habsheim A320 crash 6/26/88, and the Toulouse A330 crash 6/30/94. These incidents and accidents reveal that pilots sometimes become confused about what the cockpit automation is doing. Consequently, human factors research is an obvious investment area. However, even a cursory look at the accident data reveals that the mode confusion problem is much deeper than just training deficiencies and a lack of human-oriented design. This is readily acknowledged by human factors experts. It seems that further progress in human factors must come through a deeper scrutiny of the internals of the automation. It is in this arena that formal methods can contribute. Formal methods refers to the use of techniques from logic and discrete mathematics in the specification, design, and verification of computer systems, both hardware and software. The fundamental goal of formal methods is to capture requirements, designs and implementations in a mathematically based model that can be analyzed in a rigorous manner. Research in formal methods is aimed at automating this analysis as much as possible. By capturing the internal behavior of a flight deck in a rigorous and detailed formal model, the dark corners of a design can be analyzed. This paper will explore how formal

A formal safety analysis for PLC software-based safety critical system using Z

International Nuclear Information System (INIS)

Koh, Jung Soo

1997-02-01

This paper describes a formal safety analysis technique which is demonstrated by performing empirical formal safety analysis with the case study of beamline hutch door Interlock system that is developed by using PLC (Programmable Logic Controller) systems at the Pohang Accelerator Laboratory. In order to perform formal safety analysis, we have built the Z formal specifications representation from user requirement written in ambiguous natural language and target PLC ladder logic, respectively. We have also studied the effective method to express typical PLC timer component by using specific Z formal notation which is supported by temporal history. We present a formal proof technique specifying and verifying that the hazardous states are not introduced into ladder logic in the PLC-based safety critical system. And also, we have found that some errors or mismatches in user requirement and final implemented PLC ladder logic while analyzing the process of the consistency and completeness of Z translated formal specifications. In the case of relatively small systems like Beamline hutch door interlock system, a formal safety analysis including explicit proof is highly recommended so that the safety of PLC-based critical system may be enhanced and guaranteed. It also provides a helpful benefits enough to comprehend user requirement expressed by ambiguous natural language

The Logic of XACML

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

40 years of formal methods

DEFF Research Database (Denmark)

Bjørner, Dines; Havelund, Klaus

2014-01-01

In this "40 years of formal methods" essay we shall first delineate, Sect. 1, what we mean by method, formal method, computer science, computing science, software engineering, and model-oriented and algebraic methods. Based on this, we shall characterize a spectrum from specification-oriented met...

A Mathematical Formalization Proposal for Business Growth

Directory of Open Access Journals (Sweden)

Gheorghe BAILESTEANU

2013-01-01

Full Text Available Economic sciences have known a spectacular evolution in the last century; beginning to use axiomatic methods, applying mathematical instruments as a decision-making tool. The quest to formalization needs to be addressed from various different angles, reducing entry and operating formal costs, increasing the incentives for firms to operate formally, reducing obstacles to their growth, and searching for inexpensive approaches through which to enforce compliancy with government regulations. This paper proposes a formalized approach to business growth, based on mathematics and logics, taking into consideration the particularities of the economic sector.

Computational logic: its origins and applications.

Science.gov (United States)

Paulson, Lawrence C

2018-02-01

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

Metamathematics of fuzzy logic

CERN Document Server

Hájek, Petr

1998-01-01

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

Expert evaluation of innovation projects of mining enterprises on the basis of methods of system analysis and fuzzy logics

Directory of Open Access Journals (Sweden)

Pimonov Alexander

2017-01-01

Full Text Available This paper presents the multipurpose approach to evaluation of research and innovation projects based on the method of analysis of hierarchies and fuzzy logics for the mining industry. The approach, implemented as part of a decision support system, can reduce the degree of subjectivity during examinations by taking into account both quantitative and qualitative characteristics of the compared innovative alternatives; it does not depend on specific conditions of examination and allows engagement of experts of various fields of knowledge. The system includes the mechanism of coordination of several experts’ views. Using of fuzzy logics allows evaluating the qualitative characteristics of innovations in the form of formalized logical conclusions.

Foundations of mathematical logic

CERN Document Server

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.

A system for deduction-based formal verification of workflow-oriented software models

Directory of Open Access Journals (Sweden)

Klimek Radosław

2014-12-01

Full Text Available The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model’s behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is based on the semantic tableaux method, which has some advantages when compared with traditional deduction strategies. The algorithm for automatic generation of logical specifications is proposed. The generation procedure is based on predefined workflow patterns for BPMN, which is a standard and dominant notation for the modeling of business processes. The main idea behind the approach is to consider patterns, defined in terms of temporal logic, as a kind of (logical primitives which enable the transformation of models to temporal logic formulas constituting a logical specification. Automation of the generation process is crucial for bridging the gap between the intuitiveness of deductive reasoning and the difficulty of its practical application when logical specifications are built manually. This approach has gone some way towards supporting, hopefully enhancing, our understanding of deduction-based formal verification of workflow-oriented models.

On the Formal Modeling of Games of Language and Adversarial Argumentation : A Logic-Based Artificial Intelligence Approach

OpenAIRE

Eriksson Lundström, Jenny S. Z.

2009-01-01

Argumentation is a highly dynamical and dialectical process drawing on human cognition. Successful argumentation is ubiquitous to human interaction. Comprehensive formal modeling and analysis of argumentation presupposes a dynamical approach to the following phenomena: the deductive logic notion, the dialectical notion and the cognitive notion of justified belief. For each step of an argumentation these phenomena form networks of rules which determine the propositions to be allowed to make se...

Methodological imperfection and formalizations in scientific activity

International Nuclear Information System (INIS)

Svetlichny, G.

1987-01-01

Any mathematical formalization of scientific activity allows for imperfections in the methodology that is formalized. These can be of three types, dirty, rotten, and dammed. Restricting mathematical attention to those methods that cannot be construed to be imperfect drastically reduces the class of objects that must be analyzed, and related all other objects to these more regular ones. Examples are drawn from empirical logic

Logic an introductory course

CERN Document Server

Newton-Smith, WH

2003-01-01

A complete introduction to logic for first-year university students with no background in logic, philosophy or mathematics. In easily understood steps it shows the mechanics of the formal analysis of arguments.

Logical foundation of quantum mechanics

International Nuclear Information System (INIS)

Stachow, E.W.

1980-01-01

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

Abductive Logic Grammars

DEFF Research Database (Denmark)

Christiansen, Henning; Dahl, Veronica

2009-01-01

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

FORMAL METHOD TO IMPLEMENT FUZZY REQUIREMENTS

Directory of Open Access Journals (Sweden)

MARLENE GONCALVES

2012-01-01

Full Text Available RESUMEN: Muchos requerimientos de usuario pueden involucrar criterios de preferencia expresados en el lenguaje natural por medio de términos difusos; éstos son llamados requerimientos difusos. Por otro lado, los lenguajes de consulta a bases de datos han sido extendidos incorporando la lógica difusa para manejar las preferencias de usuarios. Pocas de las metodologías conocidas para el desarrollo de aplicaciones sobre base de datos consideran las consultas difusas. En este trabajo, se propone un método para aplicaciones a bases de datos cuyo objetivo es desarrollar sistemas de software con soporte de consultas difusas. Lo novedoso de éste es la extensión al cálculo de tuplas para la especificación formal de consultas difusas. Además, el método incluye reglas de traducción de una especificación formal a una consulta en SQLf (structured query language + fuzzy logic, un lenguaje de consultas difusas sobre bases de datos precisas. Se ilustra su utilidad con la aplicación a un caso de estudio real.

A Formal Verification Method of Function Block Diagram

International Nuclear Information System (INIS)

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

2007-01-01

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

Towards practical defeasible reasoning for description logics

CSIR Research Space (South Africa)

Casini, G

2013-07-01

Full Text Available The formalisation of defeasible reasoning in automated systems is becoming increasingly important. Description Logics (DLs) are nowadays the main logical formalism in the field of formal ontologies. Our focus in this paper is to devise a practical...

Formal Methods for Life-Critical Software

Science.gov (United States)

Butler, Ricky W.; Johnson, Sally C.

1993-01-01

The use of computer software in life-critical applications, such as for civil air transports, demands the use of rigorous formal mathematical verification procedures. This paper demonstrates how to apply formal methods to the development and verification of software by leading the reader step-by-step through requirements analysis, design, implementation, and verification of an electronic phone book application. The current maturity and limitations of formal methods tools and techniques are then discussed, and a number of examples of the successful use of formal methods by industry are cited.

Formal Analysis Of Use Case Diagrams

Directory of Open Access Journals (Sweden)

Radosław Klimek

2010-01-01

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

The HACMS program: using formal methods to eliminate exploitable bugs.

Science.gov (United States)

Fisher, Kathleen; Launchbury, John; Richards, Raymond

2017-10-13

For decades, formal methods have offered the promise of verified software that does not have exploitable bugs. Until recently, however, it has not been possible to verify software of sufficient complexity to be useful. Recently, that situation has changed. SeL4 is an open-source operating system microkernel efficient enough to be used in a wide range of practical applications. Its designers proved it to be fully functionally correct, ensuring the absence of buffer overflows, null pointer exceptions, use-after-free errors, etc., and guaranteeing integrity and confidentiality. The CompCert Verifying C Compiler maps source C programs to provably equivalent assembly language, ensuring the absence of exploitable bugs in the compiler. A number of factors have enabled this revolution, including faster processors, increased automation, more extensive infrastructure, specialized logics and the decision to co-develop code and correctness proofs rather than verify existing artefacts. In this paper, we explore the promise and limitations of current formal-methods techniques. We discuss these issues in the context of DARPA's HACMS program, which had as its goal the creation of high-assurance software for vehicles, including quadcopters, helicopters and automobiles.This article is part of the themed issue 'Verified trustworthy software systems'. © 2017 The Authors.

The HACMS program: using formal methods to eliminate exploitable bugs

Science.gov (United States)

Launchbury, John; Richards, Raymond

2017-01-01

For decades, formal methods have offered the promise of verified software that does not have exploitable bugs. Until recently, however, it has not been possible to verify software of sufficient complexity to be useful. Recently, that situation has changed. SeL4 is an open-source operating system microkernel efficient enough to be used in a wide range of practical applications. Its designers proved it to be fully functionally correct, ensuring the absence of buffer overflows, null pointer exceptions, use-after-free errors, etc., and guaranteeing integrity and confidentiality. The CompCert Verifying C Compiler maps source C programs to provably equivalent assembly language, ensuring the absence of exploitable bugs in the compiler. A number of factors have enabled this revolution, including faster processors, increased automation, more extensive infrastructure, specialized logics and the decision to co-develop code and correctness proofs rather than verify existing artefacts. In this paper, we explore the promise and limitations of current formal-methods techniques. We discuss these issues in the context of DARPA’s HACMS program, which had as its goal the creation of high-assurance software for vehicles, including quadcopters, helicopters and automobiles. This article is part of the themed issue ‘Verified trustworthy software systems’. PMID:28871050

Transforming PLC Programs into Formal Models for Verification Purposes

CERN Document Server

Darvas, D; Blanco, E

2013-01-01

Most of CERN’s industrial installations rely on PLC-based (Programmable Logic Controller) control systems developed using the UNICOS framework. This framework contains common, reusable program modules and their correctness is a high priority. Testing is already applied to find errors, but this method has limitations. In this work an approach is proposed to transform automatically PLC programs into formal models, with the goal of applying formal verification to ensure their correctness. We target model checking which is a precise, mathematical-based method to check formalized requirements automatically against the system.

Description logics of context

CSIR Research Space (South Africa)

Klarman, S

2013-05-01

Full Text Available We introduce Description Logics of Context (DLCs) - an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy's tradition of treating contexts as formal objects over which one can quantify...

Topical Roots of Formal Dialectic

NARCIS (Netherlands)

Krabbe, Erik C. W.

Formal dialectic has its roots in ancient dialectic. We can trace this influence in Charles Hamblin's book on fallacies, in which he introduced his first formal dialectical systems. Earlier, Paul Lorenzen proposed systems of dialogical logic, which were in fact formal dialectical systems avant la

Relational Parametricity and Separation Logic

DEFF Research Database (Denmark)

Birkedal, Lars; Yang, Hongseok

2008-01-01

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

Formal verification of Simulink/Stateflow diagrams a deductive approach

CERN Document Server

Zhan, Naijun; Zhao, Hengjun

2017-01-01

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

Mapping Modular SOS to Rewriting Logic

DEFF Research Database (Denmark)

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

2003-01-01

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

The formal and the formalized: the cases of syllogistic and supposition theory

NARCIS (Netherlands)

Dutilh Novaes, Catarina

2015-01-01

As a discipline, logic is arguably constituted of two main sub-projects: formal theories of argument validity on the basis of a small number of patterns, and theories of how to reduce the multiplicity of arguments in non-logical, informal contexts to the small number of patterns whose validity is

A Formal Framework for Workflow Analysis

Science.gov (United States)

Cravo, Glória

2010-09-01

In this paper we provide a new formal framework to model and analyse workflows. A workflow is the formal definition of a business process that consists in the execution of tasks in order to achieve a certain objective. In our work we describe a workflow as a graph whose vertices represent tasks and the arcs are associated to workflow transitions. Each task has associated an input/output logic operator. This logic operator can be the logical AND (•), the OR (⊗), or the XOR -exclusive-or—(⊕). Moreover, we introduce algebraic concepts in order to completely describe completely the structure of workflows. We also introduce the concept of logical termination. Finally, we provide a necessary and sufficient condition for this property to hold.

GOAL Agents Instantiate Intention Logic

OpenAIRE

Hindriks, Koen; van der Hoek, Wiebe

2008-01-01

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

Symbolic logic syntax, semantics, and proof

CERN Document Server

Agler, David

2012-01-01

Brimming with visual examples of concepts, derivation rules, and proof strategies, this introductory text is ideal for students with no previous experience in logic. Students will learn translation both from formal language into English and from English into formal language; how to use truth trees and truth tables to test propositions for logical properties; and how to construct and strategically use derivation rules in proofs.

Industrial Practice in Formal Methods : A Review

DEFF Research Database (Denmark)

Bicarregui, Juan C.; Fitzgerald, John; Larsen, Peter Gorm

2009-01-01

We examine the the industrial application of formal methods using data gathered in a review of 62 projects taking place over the last 25 years. The review suggests that formal methods are being applied in a wide range of application domains, with increasingly strong tool support. Significant chal...... challenges remain in providing usable tools that can be integrated into established development processes; in education and training; in taking formal methods from first use to second use, and in gathering and evidence to support informed selection of methods and tools.......We examine the the industrial application of formal methods using data gathered in a review of 62 projects taking place over the last 25 years. The review suggests that formal methods are being applied in a wide range of application domains, with increasingly strong tool support. Significant...

Preferential reasoning for modal logics

CSIR Research Space (South Africa)

Britz, K

2011-11-01

Full Text Available Modal logic is the foundation for a versatile and well-established class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with non-monotonic reasoning capabilities such as preferential reasoning as developed...

Temporalized Epistemic Default Logic

NARCIS (Netherlands)

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

2001-01-01

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

Stepping Theories of Active Logic with Two Kinds of Negation

Directory of Open Access Journals (Sweden)

Mikhail M. Vinkov

2017-01-01

Full Text Available This paper formulates a stepping theory formalism with two kinds of negation dealing with one of the areas of Active Logic, a new kind of logic aimed at performing practical tasks in real time knowledge-based AI systems. In addition to the standard logical negation, the proposed formalism uses the so-called subjective negation interpreted as inability to arrive at some conclusion through reasoning by a current time. The semantics of the proposed formalism is defined as an~argumentation structure.

Automated logic conversion method for plant controller systems

International Nuclear Information System (INIS)

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

1990-01-01

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

The Dynamic Turn in Quantum Logic

NARCIS (Netherlands)

Baltag, A.; Smets, S.

2012-01-01

In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the

The dynamic turn in quantum logic

NARCIS (Netherlands)

Baltag, Alexandru; Smets, Sonja

In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the

Anselm's logic of agency

NARCIS (Netherlands)

Uckelman, S.L.

2009-01-01

The origins of treating agency as a modal concept go back at least to the 11th century when Anselm, Archbishop of Canterbury, provided a modal explication of the Latin facere ‘to do’, which can be formalized within the context of modern modal logic and neighborhood semantics. The agentive logic

Semantic foundation for preferential description logics

CSIR Research Space (South Africa)

Britz, K

2011-12-01

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

NASA Langley's Formal Methods Research in Support of the Next Generation Air Transportation System

Science.gov (United States)

Butler, Ricky W.; Munoz, Cesar A.

2008-01-01

This talk will provide a brief introduction to the formal methods developed at NASA Langley and the National Institute for Aerospace (NIA) for air traffic management applications. NASA Langley's formal methods research supports the Interagency Joint Planning and Development Office (JPDO) effort to define and develop the 2025 Next Generation Air Transportation System (NGATS). The JPDO was created by the passage of the Vision 100 Century of Aviation Reauthorization Act in Dec 2003. The NGATS vision calls for a major transformation of the nation s air transportation system that will enable growth to 3 times the traffic of the current system. The transformation will require an unprecedented level of safety-critical automation used in complex procedural operations based on 4-dimensional (4D) trajectories that enable dynamic reconfiguration of airspace scalable to geographic and temporal demand. The goal of our formal methods research is to provide verification methods that can be used to insure the safety of the NGATS system. Our work has focused on the safety assessment of concepts of operation and fundamental algorithms for conflict detection and resolution (CD&R) and self- spacing in the terminal area. Formal analysis of a concept of operations is a novel area of application of formal methods. Here one must establish that a system concept involving aircraft, pilots, and ground resources is safe. The formal analysis of algorithms is a more traditional endeavor. However, the formal analysis of ATM algorithms involves reasoning about the interaction of algorithmic logic and aircraft trajectories defined over an airspace. These trajectories are described using 2D and 3D vectors and are often constrained by trigonometric relations. Thus, in many cases it has been necessary to unload the full power of an advanced theorem prover. The verification challenge is to establish that the safety-critical algorithms produce valid solutions that are guaranteed to maintain separation

A Logical Analysis of Quantum Voting Protocols

Science.gov (United States)

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

2017-12-01

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

Formalized Verification of Snapshotable Trees: Separation and Sharing

DEFF Research Database (Denmark)

Mehnert, Hannes; Sieczkowski, Filip; Birkedal, Lars

2012-01-01

We use separation logic to specify and verify a Java program that implements snapshotable search trees, fully formalizing the speci- cation and verication in the Coq proof assistant. We achieve local and modular reasoning about a tree and its snapshots and their iterators, al- though...... for full functional specication and verication, whether by separation logic or by other formalisms....

What is mathematical logic?

CERN Document Server

Crossley, J N; Brickhill, CJ; Stillwell, JC

2010-01-01

Although mathematical logic can be a formidably abstruse topic, even for mathematicians, this concise book presents the subject in a lively and approachable fashion. It deals with the very important ideas in modern mathematical logic without the detailed mathematical work required of those with a professional interest in logic.The book begins with a historical survey of the development of mathematical logic from two parallel streams: formal deduction, which originated with Aristotle, Euclid, and others; and mathematical analysis, which dates back to Archimedes in the same era. The streams beg

Improving Object-Oriented Methods by using Fuzzy Logic

NARCIS (Netherlands)

Marcelloni, Francesco; Aksit, Mehmet

2000-01-01

Object-oriented methods create software artifacts through the application of a large number or rules. Rules are typically formulated in two-valued logic. There are a number of problems on how rules are defined and applied in current methods. First, two-valued logic can capture completely neither

Interpreting Quantum Logic as a Pragmatic Structure

Science.gov (United States)

Garola, Claudio

2017-12-01

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

HDL to verification logic translator

Science.gov (United States)

Gambles, J. W.; Windley, P. J.

1992-01-01

The increasingly higher number of transistors possible in VLSI circuits compounds the difficulty in insuring correct designs. As the number of possible test cases required to exhaustively simulate a circuit design explodes, a better method is required to confirm the absence of design faults. Formal verification methods provide a way to prove, using logic, that a circuit structure correctly implements its specification. Before verification is accepted by VLSI design engineers, the stand alone verification tools that are in use in the research community must be integrated with the CAD tools used by the designers. One problem facing the acceptance of formal verification into circuit design methodology is that the structural circuit descriptions used by the designers are not appropriate for verification work and those required for verification lack some of the features needed for design. We offer a solution to this dilemma: an automatic translation from the designers' HDL models into definitions for the higher-ordered logic (HOL) verification system. The translated definitions become the low level basis of circuit verification which in turn increases the designer's confidence in the correctness of higher level behavioral models.

Freedom and enforcement in action a study in formal action theory

CERN Document Server

Czelakowski, Janusz

2015-01-01

Action theory is the object of growing attention in a variety of scientific disciplines, and this is the first volume to offer a synthetic view of the range of approaches possible in the topic. The volume focuses on the nexus of formal action theory with a startlingly diverse set of subjects, which range from logic, linguistics, artificial intelligence, and automata theory to jurisprudence, deontology, and economics. It covers semantic, mathematical and logical aspects of action, showing how the problem of action breaks the boundaries of traditional branches of logic located in syntactics and semantics and now lies on lies on the borderline between logical pragmatics and praxeology.   The chapters here focus on specialized tasks in formal action theory, beginning with a thorough description and formalization of the language of action, and moving through material on the differing models of action theory to focus on probabilistic models, the relations of formal action theory to deontic logic, and its key appl...

New data structures and algorithms for logic synthesis and verification

CERN Document Server

Amaru, Luca Gaetano

2017-01-01

This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, in order to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The author discusses techniques that improve the efficiency of logic representation, manipulation and optimization tasks by taking advantage of majority and biconditional logic primitives. Readers will be enabled to accelerate formal methods by studying core properties of logic circuits and developing new frameworks for logic reasoning engines. · Provides a comprehensive, theoretical study on majority and biconditional logic for logic synthesis; · Updates the current scenario in synthesis and verification – especially in light of emerging technologies; · Demonstrates applications to CMOS technology and emerging technologies.

State–time spectrum of signal transduction logic models

International Nuclear Information System (INIS)

MacNamara, Aidan; Terfve, Camille; Henriques, David; Bernabé, Beatriz Peñalver; Saez-Rodriguez, Julio

2012-01-01

Despite the current wealth of high-throughput data, our understanding of signal transduction is still incomplete. Mathematical modeling can be a tool to gain an insight into such processes. Detailed biochemical modeling provides deep understanding, but does not scale well above relatively a few proteins. In contrast, logic modeling can be used where the biochemical knowledge of the system is sparse and, because it is parameter free (or, at most, uses relatively a few parameters), it scales well to large networks that can be derived by manual curation or retrieved from public databases. Here, we present an overview of logic modeling formalisms in the context of training logic models to data, and specifically the different approaches to modeling qualitative to quantitative data (state) and dynamics (time) of signal transduction. We use a toy model of signal transduction to illustrate how different logic formalisms (Boolean, fuzzy logic and differential equations) treat state and time. Different formalisms allow for different features of the data to be captured, at the cost of extra requirements in terms of computational power and data quality and quantity. Through this demonstration, the assumptions behind each formalism are discussed, as well as their advantages and disadvantages and possible future developments. (paper)

Multi-Valued Modal Fixed Point Logics for Model Checking

Science.gov (United States)

Nishizawa, Koki

In this paper, I will show how multi-valued logics are used for model checking. Model checking is an automatic technique to analyze correctness of hardware and software systems. A model checker is based on a temporal logic or a modal fixed point logic. That is to say, a system to be checked is formalized as a Kripke model, a property to be satisfied by the system is formalized as a temporal formula or a modal formula, and the model checker checks that the Kripke model satisfies the formula. Although most existing model checkers are based on 2-valued logics, recently new attempts have been made to extend the underlying logics of model checkers to multi-valued logics. I will summarize these new results.

Rewriting Logic Semantics of a Plan Execution Language

Science.gov (United States)

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

2009-01-01

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

Paraconsistency properties in degree-preserving fuzzy logics

Czech Academy of Sciences Publication Activity Database

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

2015-01-01

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

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

CERN Document Server

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

1999-01-01

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

Formalization of the Resolution Calculus for First-Order Logic

DEFF Research Database (Denmark)

Schlichtkrull, Anders

2018-01-01

between unsatisfiable sets of clauses and finite semantic trees is formalized in Herbrand’s theorem. I discuss the difficulties that I had formalizing proofs of the lifting lemma found in the literature, and I formalize a correct proof. The completeness proof is by induction on the size of a finite...

Application of Formal Methods in Software Engineering

Directory of Open Access Journals (Sweden)

Adriana Morales

2011-12-01

Full Text Available The purpose of this research work is to examine: (1 why are necessary the formal methods for software systems today, (2 high integrity systems through the methodology C-by-C –Correctness-by-Construction–, and (3 an affordable methodology to apply formal methods in software engineering. The research process included reviews of the literature through Internet, in publications and presentations in events. Among the Research results found that: (1 there is increasing the dependence that the nations have, the companies and people of software systems, (2 there is growing demand for software Engineering to increase social trust in the software systems, (3 exist methodologies, as C-by-C, that can provide that level of trust, (4 Formal Methods constitute a principle of computer science that can be applied software engineering to perform reliable process in software development, (5 software users have the responsibility to demand reliable software products, and (6 software engineers have the responsibility to develop reliable software products. Furthermore, it is concluded that: (1 it takes more research to identify and analyze other methodologies and tools that provide process to apply the Formal Software Engineering methods, (2 Formal Methods provide an unprecedented ability to increase the trust in the exactitude of the software products and (3 by development of new methodologies and tools is being achieved costs are not more a disadvantage for application of formal methods.

Logic for computer science foundations of automatic theorem proving

CERN Document Server

Gallier, Jean H

2015-01-01

This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in fir

Breaking the fault tree circular logic

International Nuclear Information System (INIS)

Lankin, M.

2000-01-01

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

Bicycle Frame Prediction Techniques with Fuzzy Logic Method

Directory of Open Access Journals (Sweden)

Rafiuddin Syam

2015-03-01

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

Bicycle Frame Prediction Techniques with Fuzzy Logic Method

Directory of Open Access Journals (Sweden)

Rafiuddin Syam

2017-03-01

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

Hybrid-Logical Reasoning in False-Belief Tasks

OpenAIRE

Brauner, Torben

2013-01-01

The main aim of the present paper is to use a proof system for hybrid modal logic to formalize what are called falsebelief tasks in cognitive psychology, thereby investigating the interplay between cognition and logical reasoning about belief. We consider two different versions of the Smarties task, involving respectively a shift of perspective to another person and to another time. Our formalizations disclose that despite this difference, the two versions of the Smarties task have exactly th...

Co-constructive Logics for Proofs and Refutations

Directory of Open Access Journals (Sweden)

Trafford James

2015-01-01

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

Towards a Wide-coverage Tableau Method for Natural Logic

NARCIS (Netherlands)

Abzianidze, Lasha; Murata, Tsuyoshi; Mineshima, Koji; Bekki, Daisuke

2015-01-01

The rst step towards a wide-coverage tableau prover for natural logic is presented. We describe an automatized method for obtaining Lambda Logical Forms from surface forms and use this method with an implemented prover to hunt for new tableau rules in textual entailment data sets. The collected

Logic-based aggregation methods for ranking student applicants

Directory of Open Access Journals (Sweden)

Milošević Pavle

2017-01-01

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

The Logic Process Formalism of the Informational Domain

Directory of Open Access Journals (Sweden)

2007-01-01

Full Text Available The performance of present-day informational technologies has two main properties: the universality of the structures used and the flexibility of the final user's interfaces. The first determines the potential cover area of the informational domain. The second determines the diversity and efficiency of processing methods of the proceedings being automated. The mentioned aspects are of great importance in agriculture and ecology because there are complex processes and considerable volumes of used information. For example, the meteoro-logical processes are a part of the ecological one like habitats' existential conditions and are known as a complex prognostic problem. The latter needs considerable computational resources to solve the appropriate equations. Likewise, agriculture as a controlled activity under strong impact from natural conditions has the same high requirements for diverse structures and flexibility of information processing.

THE RATIONALE OF LAW. THE ROLE AND IMPORTANCE OF THE LOGICAL METHOD OF INTERPRETATION OF LEGAL NORMS

Directory of Open Access Journals (Sweden)

Mihai BĂDESCU

2017-05-01

Full Text Available The interpretation of law was and remains an indispensable postulation, inherent and the most significant in the application of the law. Through interpretation the aim is to clarify the obscure text, to rectify the imperfection of the text of the legal norm, to remedy its shortcomings, and in consequence, to specify the exact meaning of the legal norm. Interpretation concerns itself with emphasizing the authentic meaning of the normative texts, finding the spirit of the lawmaker-author, the authentic legal sense of the actions that occurred, of the conduct of the perpetrator, and the significant legal connection of these meanings. The necessity of interpreting legal norms is justified by several considerations, out of which the most important remains the one regarding the act that the lawmaker cannot and need not provide everything in the normative text. The unity between the spirit and the letter of the law, the continuity of interpretation, the useful effect of the legal norm are just a few of the principles that need to be taken into account in interpretation. Be it official (obligatory, or unofficial (doctrinary, interpretation remains an extremely important stage in the application of the law: the literature of specialty consecrates five important methods of interpretation (grammatical, historical, systematical, teleological, and logical. The latter method allows for the formulation by the interpreter of certain rational assessments, done through operations of generalization, of logical analysis of the text, of analogy, through applying formal logic. The present study will mainly deal with this method, analyzing the main logical arguments used in interpretation.

Reasoning by cases in Default Logic

NARCIS (Netherlands)

Roos, N.; Roos, Nico

1998-01-01

Reiter's Default Logic is one of the most popular formalisms for describing default reasoning. One important defect of Default Logic is, however, the inability to reason by cases. Over the years, several solutions for this problem have been proposed. All these proposals deal with deriving new

Many-dimensional modal logics theory and applications

CERN Document Server

Gabbay, D M; Wolter, F; Zakharyaschev, M

2003-01-01

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects.

Formal methods applied to industrial complex systems implementation of the B method

CERN Document Server

Boulanger, Jean-Louis

2014-01-01

This book presents real-world examples of formal techniques in an industrial context. It covers formal methods such as SCADE and/or the B Method, in various fields such as railways, aeronautics, and the automotive industry. The purpose of this book is to present a summary of experience on the use of "formal methods" (based on formal techniques such as proof, abstract interpretation and model-checking) in industrial examples of complex systems, based on the experience of people currently involved in the creation and assessment of safety critical system software. The involvement of people from

Computability, complexity, logic

CERN Document Server

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

Plausible inference: A multi-valued logic for problem solving

Science.gov (United States)

Friedman, L.

1979-01-01

A new logic is developed which permits continuously variable strength of belief in the truth of assertions. Four inference rules result, with formal logic as a limiting case. Quantification of belief is defined. Propagation of belief to linked assertions results from dependency-based techniques of truth maintenance so that local consistency is achieved or contradiction discovered in problem solving. Rules for combining, confirming, or disconfirming beliefs are given, and several heuristics are suggested that apply to revising already formed beliefs in the light of new evidence. The strength of belief that results in such revisions based on conflicting evidence are a highly subjective phenomenon. Certain quantification rules appear to reflect an orderliness in the subjectivity. Several examples of reasoning by plausible inference are given, including a legal example and one from robot learning. Propagation of belief takes place in directions forbidden in formal logic and this results in conclusions becoming possible for a given set of assertions that are not reachable by formal logic.

Formalization and Implementation of Algebraic Methods in Geometry

Directory of Open Access Journals (Sweden)

Filip Marić

2012-02-01

Full Text Available We describe our ongoing project of formalization of algebraic methods for geometry theorem proving (Wu's method and the Groebner bases method, their implementation and integration in educational tools. The project includes formal verification of the algebraic methods within Isabelle/HOL proof assistant and development of a new, open-source Java implementation of the algebraic methods. The project should fill-in some gaps still existing in this area (e.g., the lack of formal links between algebraic methods and synthetic geometry and the lack of self-contained implementations of algebraic methods suitable for integration with dynamic geometry tools and should enable new applications of theorem proving in education.

An Adequate First Order Logic of Intervals

DEFF Research Database (Denmark)

Chaochen, Zhou; Hansen, Michael Reichhardt

1998-01-01

This paper introduces left and right neighbourhoods as primitive interval modalities to define other unary and binary modalities of intervals in a first order logic with interval length. A complete first order logic for the neighbourhood modalities is presented. It is demonstrated how the logic can...... support formal specification and verification of liveness and fairness, and also of various notions of real analysis....

Comparing Two Tests of Formal Reasoning in a College Chemistry Context

Science.gov (United States)

Jiang, Bo; Xu, Xiaoying; Garcia, Alicia; Lewis, Jennifer E.

2010-01-01

The Test of Logical Thinking (TOLT) and the Group Assessment of Logical Thinking (GALT) are two of the instruments most widely used by science educators and researchers to measure students' formal reasoning abilities. Based on Piaget's cognitive development theory, formal thinking ability has been shown to be essential for student achievement in…

Machine Learning-based Intelligent Formal Reasoning and Proving System

Science.gov (United States)

Chen, Shengqing; Huang, Xiaojian; Fang, Jiaze; Liang, Jia

2018-03-01

The reasoning system can be used in many fields. How to improve reasoning efficiency is the core of the design of system. Through the formal description of formal proof and the regular matching algorithm, after introducing the machine learning algorithm, the system of intelligent formal reasoning and verification has high efficiency. The experimental results show that the system can verify the correctness of propositional logic reasoning and reuse the propositional logical reasoning results, so as to obtain the implicit knowledge in the knowledge base and provide the basic reasoning model for the construction of intelligent system.

FORMALIZATION OF THE ACCOUNTING VALUABLE MEMES METHOD FOR THE PORTFOLIO OF ORGANIZATION DEVELOPMENT AND INFORMATION COMPUTER TOOLS FOR ITS IMPLEMENTATION

Directory of Open Access Journals (Sweden)

Serhii D. Bushuiev

2017-12-01

Full Text Available The current state of project management has been steadily demonstrating a trend toward increasing the role of flexible "soft" management practices. A method for preparing solutions for the formation of a value-oriented portfolio based on a comparison of the level of internal organizational values is proposed. The method formalizes the methodological foundations of value-oriented portfolio management in the development of organizations in the form of approaches, basic terms and technological methods with ICT using, which makes it possible to use them as an integral knowledge system for creating an automated system for managing portfolios of organizations. The result of the study is the deepening of the theoretical provisions for managing the development of organizations through the implementation of a value-oriented portfolio of projects, which allowed formalize the method of recording value memes in the development portfolios of organizations, to disclose its logic, essence, objective basis and rules.

Formal methods for industrial critical systems a survey of applications

CERN Document Server

Margaria-Steffen, Tiziana

2012-01-01

"Today, formal methods are widely recognized as an essential step in the design process of industrial safety-critical systems. In its more general definition, the term formal methods encompasses all notations having a precise mathematical semantics, together with their associated analysis methods, that allow description and reasoning about the behavior of a system in a formal manner.Growing out of more than a decade of award-winning collaborative work within the European Research Consortium for Informatics and Mathematics, Formal Methods for Industrial Critical Systems: A Survey of Applications presents a number of mainstream formal methods currently used for designing industrial critical systems, with a focus on model checking. The purpose of the book is threefold: to reduce the effort required to learn formal methods, which has been a major drawback for their industrial dissemination; to help designers to adopt the formal methods which are most appropriate for their systems; and to offer a panel of state-of...

Formal model-based development for safety-critical embedded software

International Nuclear Information System (INIS)

Kim, Jin Hyun; Choi, Jin Young

2005-01-01

Safety-critical embedded software for nuclear I and C system is developed under the safety and reliability regulation. Programmable logic controller(PLC) is a computer system for instrumentation and control (I and C) system of nuclear power plants. PLC consists of various I and C logics in software, including real-time operating system (RTOS). Hence, errors related with RTOS should be detected and eliminated in development processes. Practically, the verification and validation for errors in RTOS is performed in test procedure, in which a lot of tasks for testing are embedded in RTOS and are running under a test environments. But the test process can not be enough to guarantee the safety and reliability of RTOS. Therefore, in this paper, we introduce to applying formal methods with the development of software for the PLC. We particularity apply formal methods to a development of RTOS for PLC, which is a safety critical level. In this development, we use the state charts of I-Logix to specify and verification and model checking to verify the specification

Formal model-based development for safety-critical embedded software

Energy Technology Data Exchange (ETDEWEB)

Kim, Jin Hyun; Choi, Jin Young [Korea University, seoul (Korea, Republic of)

2005-11-15

Safety-critical embedded software for nuclear I and C system is developed under the safety and reliability regulation. Programmable logic controller(PLC) is a computer system for instrumentation and control (I and C) system of nuclear power plants. PLC consists of various I and C logics in software, including real-time operating system (RTOS). Hence, errors related with RTOS should be detected and eliminated in development processes. Practically, the verification and validation for errors in RTOS is performed in test procedure, in which a lot of tasks for testing are embedded in RTOS and are running under a test environments. But the test process can not be enough to guarantee the safety and reliability of RTOS. Therefore, in this paper, we introduce to applying formal methods with the development of software for the PLC. We particularity apply formal methods to a development of RTOS for PLC, which is a safety critical level. In this development, we use the state charts of I-Logix to specify and verification and model checking to verify the specification.

Applications of Mathematical Logic in Philosophy and Linguistics, Papers of a Conference

CERN Document Server

Malzkom, Wolfgang; Räsch, Thoralf

2003-01-01

"Foundations of the Formal Sciences" (FotFS) is a series of interdisciplinary conferences in mathematics, philosophy, computer science and linguistics. The main goal is to reestablish the traditionally strong links between these areas of research that have been lost in the past decades. The second conference in the series had the subtitle "Applications of Mathematical Logic in Philosophy and Linguistics" and brought speakers from all parts of the Formal Sciences together to give a holistic view of how mathematical methods can improve our philosophical and technical understanding of language and scientific discourse, ranging from the theoretical level up to applications in language recognition software. Audience: This volume is of interest to all formal philosophers and theoretical linguists. In addition to that, logicians interested in the applications of their field and logic students in mathematics, computer science, philosophy and linguistics can use the volume to broaden their knowledge of applications of...

A Dynamic Logic for Learning Theory

DEFF Research Database (Denmark)

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

2017-01-01

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

What is the method in applying formal methods to PLC applications?

NARCIS (Netherlands)

Mader, Angelika H.; Engel, S.; Wupper, Hanno; Kowalewski, S.; Zaytoon, J.

2000-01-01

The question we investigate is how to obtain PLC applications with confidence in their proper functioning. Especially, we are interested in the contribution that formal methods can provide for their development. Our maxim is that the place of a particular formal method in the total picture of system

An exact method for solving logical loops in reliability analysis

International Nuclear Information System (INIS)

Matsuoka, Takeshi

2009-01-01

This paper presents an exact method for solving logical loops in reliability analysis. The systems that include logical loops are usually described by simultaneous Boolean equations. First, present a basic rule of solving simultaneous Boolean equations. Next, show the analysis procedures for three-component system with external supports. Third, more detailed discussions are given for the establishment of logical loop relation. Finally, take up two typical structures which include more than one logical loop. Their analysis results and corresponding GO-FLOW charts are given. The proposed analytical method is applicable to loop structures that can be described by simultaneous Boolean equations, and it is very useful in evaluating the reliability of complex engineering systems.

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

Access control, security, and trust a logical approach

CERN Document Server

Chin, Shiu-Kai

2010-01-01

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

Proceedings of the First NASA Formal Methods Symposium

Science.gov (United States)

Denney, Ewen (Editor); Giannakopoulou, Dimitra (Editor); Pasareanu, Corina S. (Editor)

2009-01-01

Topics covered include: Model Checking - My 27-Year Quest to Overcome the State Explosion Problem; Applying Formal Methods to NASA Projects: Transition from Research to Practice; TLA+: Whence, Wherefore, and Whither; Formal Methods Applications in Air Transportation; Theorem Proving in Intel Hardware Design; Building a Formal Model of a Human-Interactive System: Insights into the Integration of Formal Methods and Human Factors Engineering; Model Checking for Autonomic Systems Specified with ASSL; A Game-Theoretic Approach to Branching Time Abstract-Check-Refine Process; Software Model Checking Without Source Code; Generalized Abstract Symbolic Summaries; A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing; Component-Oriented Behavior Extraction for Autonomic System Design; Automated Verification of Design Patterns with LePUS3; A Module Language for Typing by Contracts; From Goal-Oriented Requirements to Event-B Specifications; Introduction of Virtualization Technology to Multi-Process Model Checking; Comparing Techniques for Certified Static Analysis; Towards a Framework for Generating Tests to Satisfy Complex Code Coverage in Java Pathfinder; jFuzz: A Concolic Whitebox Fuzzer for Java; Machine-Checkable Timed CSP; Stochastic Formal Correctness of Numerical Algorithms; Deductive Verification of Cryptographic Software; Coloured Petri Net Refinement Specification and Correctness Proof with Coq; Modeling Guidelines for Code Generation in the Railway Signaling Context; Tactical Synthesis Of Efficient Global Search Algorithms; Towards Co-Engineering Communicating Autonomous Cyber-Physical Systems; and Formal Methods for Automated Diagnosis of Autosub 6000.

Quantum supports and modal logic

International Nuclear Information System (INIS)

Svetlichny, G.

1986-01-01

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

Educational Software for First Order Logic Semantics in Introductory Logic Courses

Science.gov (United States)

Mauco, María Virginia; Ferrante, Enzo; Felice, Laura

2014-01-01

Basic courses on logic are common in most computer science curricula. Students often have difficulties in handling formalisms and getting familiar with them. Educational software helps to motivate and improve the teaching-learning processes. Therefore, incorporating these kinds of tools becomes important, because they contribute to gaining…

Formal methods in software development: A road less travelled

Directory of Open Access Journals (Sweden)

John A van der Poll

2010-08-01

Full Text Available An integration of traditional verification techniques and formal specifications in software engineering is presented. Advocates of such techniques claim that mathematical formalisms allow them to produce quality, verifiably correct, or at least highly dependable software and that the testing and maintenance phases are shortened. Critics on the other hand maintain that software formalisms are hard to master, tedious to use and not well suited for the fast turnaround times demanded by industry. In this paper some popular formalisms and the advantages of using these during the early phases of the software development life cycle are presented. Employing the Floyd-Hoare verification principles during the formal specification phase facilitates reasoning about the properties of a specification. Some observations that may help to alleviate the formal-methods controversy are established and a number of formal methods successes is presented. Possible conditions for an increased acceptance of formalisms in oftware development are discussed.

Formal methods in design and verification of functional specifications

International Nuclear Information System (INIS)

Vaelisuo, H.

1995-01-01

It is claimed that formal methods should be applied already when specifying the functioning of the control/monitoring system, i.e. when planning how to implement the desired operation of the plant. Formal methods are seen as a way to mechanize and thus automate part of the planning. All mathematical methods which can be applied on related problem solving should be considered as formal methods. Because formal methods can only support the designer, not replace him/her, they must be integrated into a design support tool. Such a tool must also aid the designer in getting the correct conception of the plant and its behaviour. The use of a hypothetic design support tool is illustrated to clarify the requirements such a tool should fulfill. (author). 3 refs, 5 figs

Logic-based methods for optimization combining optimization and constraint satisfaction

CERN Document Server

Hooker, John

2011-01-01

A pioneering look at the fundamental role of logic in optimization and constraint satisfaction While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible

Quantum Enhanced Inference in Markov Logic Networks.

Science.gov (United States)

Wittek, Peter; Gogolin, Christian

2017-04-19

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.

Quantum Enhanced Inference in Markov Logic Networks

Science.gov (United States)

Wittek, Peter; Gogolin, Christian

2017-04-01

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.

On the Equivalence of Formal Grammars and Machines.

Science.gov (United States)

Lund, Bruce

1991-01-01

Explores concepts of formal language and automata theory underlying computational linguistics. A computational formalism is described known as a "logic grammar," with which computational systems process linguistic data, with examples in declarative and procedural semantics and definite clause grammars. (13 references) (CB)

Quantum logic: is it necessarily orthocomplemented

International Nuclear Information System (INIS)

Mielnik, B.

1976-01-01

There exist conservative arguments supporting the necessity of the present day form of quantum theory, which are found in the axiomatics of quantum logic. In this paper the axioms of quantum logic are critically reexamined. The lattice macroscopic measurements, the motivation of the Hilbert space formalism and the convex scheme of quantum mechanics are among the topics discussed. (B.R.H.)

Data Mining and Knowledge Discovery via Logic-Based Methods

CERN Document Server

Triantaphyllou, Evangelos

2010-01-01

There are many approaches to data mining and knowledge discovery (DM&KD), including neural networks, closest neighbor methods, and various statistical methods. This monograph, however, focuses on the development and use of a novel approach, based on mathematical logic, that the author and his research associates have worked on over the last 20 years. The methods presented in the book deal with key DM&KD issues in an intuitive manner and in a natural sequence. Compared to other DM&KD methods, those based on mathematical logic offer a direct and often intuitive approach for extracting easily int

Automatic control logics to eliminate xenon oscillation based on Axial Offsets Trajectory Method

International Nuclear Information System (INIS)

Shimazu, Yoichiro

1996-01-01

We have proposed Axial Offsets (AO) Trajectory Method for xenon oscillation control in pressurized water reactors. The features of this method are described as such that it can clearly give necessary control operations to eliminate xenon oscillations. It is expected that using the features automatic control logics for xenon oscillations can be simple and be realized easily. We investigated automatic control logics. The AO Trajectory Method could realize a very simple logic only for eliminating xenon oscillations. However it was necessary to give another considerations to eliminate the xenon oscillation with a given axial power distribution. The other control logic based on the modern control theory was also studied for comparison of the control performance of the new control logic. As the results, it is presented that the automatic control logics based on the AO Trajectory Method are very simple and effective. (author)

First-Order Hybrid Logic: Introduction and Survey

DEFF Research Database (Denmark)

Braüner, Torben

2014-01-01

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

Logical thinking in the pyramidal schema of concepts the logical and mathematical elements

CERN Document Server

Geldsetzer, Lutz

2014-01-01

This book proposes a new way of formalizing in logic and mathematics - a "pyramidal graph system," devised by the author and based on Porphyrian trees and modern concepts of classification, in both of which pyramids act as the organizing schema.

Empirical logic and quantum mechanics

International Nuclear Information System (INIS)

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

1976-01-01

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

Formal Verification of Computerized Procedure with Colored Petri Nets

International Nuclear Information System (INIS)

Kim, Yun Goo; Shin, Yeong Cheol

2008-01-01

Computerized Procedure System (CPS) supports nuclear power plant operators in performing operating procedures which are instructions to guide in monitoring, decision making and controlling nuclear power plants. Computerized Procedure (CP) should be loaded to CPS. Due to its execution characteristic, computerized procedure acts like a software in CPS. For example, procedure flows are determined by operator evaluation and computerized procedure logic which are pre-defined. So the verification of Computerized Procedure logic and execution flow is needed before computerized procedures are installed in the system. Formal verification methods are proposed and the modeling of operating procedures with Coloured Petri Nets(CP-nets) is presented

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

Science.gov (United States)

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

2017-12-01

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

One reason, several logics

Directory of Open Access Journals (Sweden)

Evandro Agazzi

2011-06-01

Full Text Available Humans have used arguments for defending or refuting statements long before the creation of logic as a specialized discipline. This can be interpreted as the fact that an intuitive notion of "logical consequence" or a psychic disposition to articulate reasoning according to this pattern is present in common sense, and logic simply aims at describing and codifying the features of this spontaneous capacity of human reason. It is well known, however, that several arguments easily accepted by common sense are actually "logical fallacies", and this indicates that logic is not just a descriptive, but also a prescriptive or normative enterprise, in which the notion of logical consequence is defined in a precise way and then certain rules are established in order to maintain the discourse in keeping with this notion. Yet in the justification of the correctness and adequacy of these rules commonsense reasoning must necessarily be used, and in such a way its foundational role is recognized. Moreover, it remains also true that several branches and forms of logic have been elaborated precisely in order to reflect the structural features of correct argument used in different fields of human reasoning and yet insufficiently mirrored by the most familiar logical formalisms.

Temporal logics and real time expert systems.

Science.gov (United States)

Blom, J A

1996-10-01

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

Historical analysis of the logic and rhetoric: problems on the procedural using of entimems

Directory of Open Access Journals (Sweden)

Alexandre Freire Pimentel

2017-06-01

Full Text Available Through the historical and bibliographical method, this article aims to present a critical appraisal of the logic and rhetoric evolution, specifically how the enthymemes are currently used to support judicial decisions. The paper intends to prove that the decision-making precedes the writing process and it is not necessarily guided by a formal logic reasoning but, especially, through an ideological motivation, and also that the wording can be done based on enthymemes.

Automated Formal Verification for PLC Control Systems

CERN Multimedia

Fernández Adiego, Borja

2014-01-01

Programmable Logic Controllers (PLCs) are widely used devices used in industrial control systems. Ensuring that the PLC software is compliant with its specification is a challenging task. Formal verification has become a recommended practice to ensure the correctness of the safety-critical software. However, these techniques are still not widely applied in industry due to the complexity of building formal models, which represent the system and the formalization of requirement specifications. We propose a general methodology to perform automated model checking of complex properties expressed in temporal logics (e.g. CTL, LTL) on PLC programs. This methodology is based on an Intermediate Model (IM), meant to transform PLC programs written in any of the languages described in the IEC 61131-3 standard (ST, IL, etc.) to different modeling languages of verification tools. This approach has been applied to CERN PLC programs validating the methodology.

Formal representation of complex SNOMED CT expressions

Directory of Open Access Journals (Sweden)

Markó Kornél

2008-10-01

Full Text Available Abstract Background Definitory expressions about clinical procedures, findings and diseases constitute a major benefit of a formally founded clinical reference terminology which is ontologically sound and suited for formal reasoning. SNOMED CT claims to support formal reasoning by description-logic based concept definitions. Methods On the basis of formal ontology criteria we analyze complex SNOMED CT concepts, such as "Concussion of Brain with(out Loss of Consciousness", using alternatively full first order logics and the description logic ℰℒ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8hmHuKae8NeHWeaaa@37B1@. Results Typical complex SNOMED CT concepts, including negations or not, can be expressed in full first-order logics. Negations cannot be properly expressed in the description logic ℰℒ MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8hmHuKae8NeHWeaaa@37B1@ underlying SNOMED CT. All concepts concepts the meaning of which implies a temporal scope may be subject to diverging interpretations, which are often unclear in SNOMED CT as their contextual determinants are not made explicit. Conclusion The description of complex medical occurrents is ambiguous, as the same situations can be described as (i a complex occurrent C that has A and B as temporal parts, (ii a simple occurrent A' defined as a kind of A followed by some B, or (iii a simple occurrent B' defined as a kind of B preceded by some A. As negative statements in SNOMED CT cannot be exactly represented without

Multi-objective decision-making under uncertainty: Fuzzy logic methods

Science.gov (United States)

Hardy, Terry L.

1995-01-01

Fuzzy logic allows for quantitative representation of vague or fuzzy objectives, and therefore is well-suited for multi-objective decision-making. This paper presents methods employing fuzzy logic concepts to assist in the decision-making process. In addition, this paper describes software developed at NASA Lewis Research Center for assisting in the decision-making process. Two diverse examples are used to illustrate the use of fuzzy logic in choosing an alternative among many options and objectives. One example is the selection of a lunar lander ascent propulsion system, and the other example is the selection of an aeration system for improving the water quality of the Cuyahoga River in Cleveland, Ohio. The fuzzy logic techniques provided here are powerful tools which complement existing approaches, and therefore should be considered in future decision-making activities.

Formal methods for dependable real-time systems

Science.gov (United States)

Rushby, John

1993-01-01

The motivation for using formal methods to specify and reason about real time properties is outlined and approaches that were proposed and used are sketched. The formal verifications of clock synchronization algorithms are concluded as showing that mechanically supported reasoning about complex real time behavior is feasible. However, there was significant increase in the effectiveness of verification systems since those verifications were performed, at it is to be expected that verifications of comparable difficulty will become fairly routine. The current challenge lies in developing perspicuous and economical approaches to the formalization and specification of real time properties.

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

OpenAIRE

Nuno David; Jaime Simão Sichman; Helder Coelho

2005-01-01

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

Logical Theories for Agent Introspection

DEFF Research Database (Denmark)

Bolander, Thomas

2004-01-01

Artificial intelligence systems (agents) generally have models of the environments they inhabit which they use for representing facts, for reasoning about these facts and for planning actions. Much intelligent behaviour seems to involve an ability to model not only one's external environment...... by self-reference. In the standard approach taken in artificial intelligence, the model that an agent has of its environment is represented as a set of beliefs. These beliefs are expressed as logical formulas within a formal, logical theory. When the logical theory is expressive enough to allow...... introspective reasoning, the presence of self-reference causes the theory to be prone to inconsistency. The challenge therefore becomes to construct logical theories supporting introspective reasoning while at the same time ensuring that consistency is retained. In the thesis, we meet this challenge by devising...

Structures for Epistemic Logic

NARCIS (Netherlands)

Bezhanishvili, N.; Hoek, W. van der

2013-01-01

Epistemic modal logic in a narrow sense studies and formalises reasoning about knowledge. In a wider sense, it gives a formal account of the informational attitude that agents may have, and covers notions like knowledge, belief, uncertainty, and hence incomplete or partial information. As is so

The Logic of XACML

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

Temporalizing Epistemic Default Logic

NARCIS (Netherlands)

van der Hoek, Wiebe; Meyer, John Jules; Treur, Jan

1998-01-01

We present an epistemic default logic, based on the metaphore of a meta-level architecture. Upward reflection is formalized by a nonmonotonic entailment relation, based on the objective facts that are either known or unknown at the object level. Then, the meta (monotonic) reasoning process generates

Formal verification of complex properties on PLC programs

CERN Document Server

Darvas, D; Voros, A; Bartha, T; Blanco Vinuela, E; Gonzalez Suarez, V M

2014-01-01

Formal verification has become a recommended practice in the safety-critical application areas. However, due to the complexity of practical control and safety systems, the state space explosion often prevents the use of formal analysis. In this paper we extend our former verification methodology with effective property preserving reduction techniques. For this purpose we developed general rule-based reductions and a customized version of the Cone of Influence (COI) reduction. Using these methods, the verification of complex requirements formalised with temporal logics (e.g. CTL, LTL) can be orders of magnitude faster. We use the NuSMV model checker on a real-life PLC program from CERN to demonstrate the performance of our reduction techniques.

FORMED: Bringing Formal Methods to the Engineering Desktop

Science.gov (United States)

2016-02-01

FORMED: BRINGING FORMAL METHODS TO THE ENGINEERING DESKTOP BAE SYSTEMS FEBRUARY 2016 FINAL TECHNICAL REPORT APPROVED FOR PUBLIC RELEASE...This report is published in the interest of scientific and technical information exchange, and its publication does not constitute the Government’s...BRINGING FORMAL METHODS TO THE ENGINEERING DESKTOP 5a. CONTRACT NUMBER FA8750-14-C-0024 5b. GRANT NUMBER N/A 5c. PROGRAM ELEMENT NUMBER 63781D

Classification of Children Intelligence with Fuzzy Logic Method

Science.gov (United States)

Syahminan; ika Hidayati, Permata

2018-04-01

Intelligence of children s An Important Thing To Know The Parents Early on. Typing Can be done With a Child’s intelligence Grouping Dominant Characteristics Of each Type of Intelligence. To Make it easier for Parents in Determining The type of Children’s intelligence And How to Overcome them, for It Created A Classification System Intelligence Grouping Children By Using Fuzzy logic method For determination Of a Child’s degree of intelligence type. From the analysis We concluded that The presence of Intelligence Classification systems Pendulum Children With Fuzzy Logic Method Of determining The type of The Child’s intelligence Can be Done in a way That is easier And The results More accurate Conclusions Than Manual tests.

The logic of XACML

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

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

CERN Document Server

Ferguson, Thomas Macaulay

2017-01-01

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

Fuzzy Logic Controller Stability Analysis Using a Satisfiability Modulo Theories Approach

Science.gov (United States)

Arnett, Timothy; Cook, Brandon; Clark, Matthew A.; Rattan, Kuldip

2017-01-01

While many widely accepted methods and techniques exist for validation and verification of traditional controllers, at this time no solutions have been accepted for Fuzzy Logic Controllers (FLCs). Due to the highly nonlinear nature of such systems, and the fact that developing a valid FLC does not require a mathematical model of the system, it is quite difficult to use conventional techniques to prove controller stability. Since safety-critical systems must be tested and verified to work as expected for all possible circumstances, the fact that FLC controllers cannot be tested to achieve such requirements poses limitations on the applications for such technology. Therefore, alternative methods for verification and validation of FLCs needs to be explored. In this study, a novel approach using formal verification methods to ensure the stability of a FLC is proposed. Main research challenges include specification of requirements for a complex system, conversion of a traditional FLC to a piecewise polynomial representation, and using a formal verification tool in a nonlinear solution space. Using the proposed architecture, the Fuzzy Logic Controller was found to always generate negative feedback, but inconclusive for Lyapunov stability.

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

Institute of Scientific and Technical Information of China (English)

陈文彬; 王驹

2003-01-01

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

Logic of the digital

CERN Document Server

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

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

Logical Entity Level Sentiment Analysis

DEFF Research Database (Denmark)

Petersen, Niklas Christoffer; Villadsen, Jørgen

2017-01-01

We present a formal logical approach using a combinatory categorial grammar for entity level sentiment analysis that utilizes machine learning techniques for efficient syntactical tagging and performs a deep structural analysis of the syntactical properties of texts in order to yield precise resu...

Logical operations realized on the Ising chain of N qubits

International Nuclear Information System (INIS)

Asano, Masanari; Tateda, Norihiro; Ishii, Chikara

2004-01-01

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

Enzyme-Based Logic Gates and Networks with Output Signals Analyzed by Various Methods.

Science.gov (United States)

Katz, Evgeny

2017-07-05

The paper overviews various methods that are used for the analysis of output signals generated by enzyme-based logic systems. The considered methods include optical techniques (optical absorbance, fluorescence spectroscopy, surface plasmon resonance), electrochemical techniques (cyclic voltammetry, potentiometry, impedance spectroscopy, conductivity measurements, use of field effect transistor devices, pH measurements), and various mechanoelectronic methods (using atomic force microscope, quartz crystal microbalance). Although each of the methods is well known for various bioanalytical applications, their use in combination with the biomolecular logic systems is rather new and sometimes not trivial. Many of the discussed methods have been combined with the use of signal-responsive materials to transduce and amplify biomolecular signals generated by the logic operations. Interfacing of biocomputing logic systems with electronics and "smart" signal-responsive materials allows logic operations be extended to actuation functions; for example, stimulating molecular release and switchable features of bioelectronic devices, such as biofuel cells. The purpose of this review article is to emphasize the broad variability of the bioanalytical systems applied for signal transduction in biocomputing processes. All bioanalytical systems discussed in the article are exemplified with specific logic gates and multi-gate networks realized with enzyme-based biocatalytic cascades. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Critical Analysis of the Mathematical Formalism of Theoretical Physics. II. Foundations of Vector Calculus

Science.gov (United States)

Kalanov, Temur Z.

2014-03-01

A critical analysis of the foundations of standard vector calculus is proposed. The methodological basis of the analysis is the unity of formal logic and of rational dialectics. It is proved that the vector calculus is incorrect theory because: (a) it is not based on a correct methodological basis - the unity of formal logic and of rational dialectics; (b) it does not contain the correct definitions of ``movement,'' ``direction'' and ``vector'' (c) it does not take into consideration the dimensions of physical quantities (i.e., number names, denominate numbers, concrete numbers), characterizing the concept of ''physical vector,'' and, therefore, it has no natural-scientific meaning; (d) operations on ``physical vectors'' and the vector calculus propositions relating to the ''physical vectors'' are contrary to formal logic.

Formal Methods: Practice and Experience

DEFF Research Database (Denmark)

Woodcock, Jim; Larsen, Peter Gorm; Bicarregui, Juan

2009-01-01

. Based on this, we discuss the issues surrounding the industrial adoption of formal methods. Finally, we look to the future and describe the development of a Verified Software Repository, part of the worldwide Verified Software Initiative. We introduce the initial projects being used to populate...... the repository, and describe the challenges they address. © 2009 ACM. (146 refs.)...

Formalizing the Process of Constructing Chains of Lexical Units

Directory of Open Access Journals (Sweden)

Grigorij Chetverikov

2015-06-01

Full Text Available Formalizing the Process of Constructing Chains of Lexical Units The paper investigates mathematical aspects of describing the construction of chains of lexical units on the basis of finite-predicate algebra. Analyzing the construction peculiarities is carried out and application of the method of finding the power of linear logical transformation for removing characteristic words of a dictionary entry is given. Analysis and perspectives of the results of the study are provided.

Formal Semantics: Origins, Issues, Early Impact

Directory of Open Access Journals (Sweden)

Barbara H. Partee

2010-12-01

Psychology’, 183–216. Cambridge: Cambridge University Press.Chomsky, N. 1975. ‘Questions of form and interpretation’. In R. Austerlitz (ed. ‘The Scope of American Linguistics’, 159–196. Lisse: Peter de Ridder Press.Church, A. 1940. ‘A formulation of the simple theory of types’. Journal of Symbolic Logic 5: 56–68.http://dx.doi.org/10.2307/2266170Church, A. 1951. ‘A formulation of the logic of sense and denotation’. In P. Henle, H. Kallen & S. Langer (eds. ‘Structure, Method, and Meaning: Essays in Honor of H.M. Sheffer’, 3–24. New York: Liberal Arts Press.Cocchiarella, N. 1997. ‘Formally-oriented work in the philosophy of language’. In J.V. Canfield (ed. ‘Philosophy of Meaning, Knowledge and Value in the 20th Century’, 39–75. London; New York: Routledge.Cresswell, M. J. 1978. ‘Semantic competence’. In F. Guenthner & M. Guenthner-Reutter (eds. ‘Meaning and Translation: Philosophical and Linguistic Approaches’, 9–43. London: Duckworth.Davidson, D. 1964. ‘Theories of meaning and learnable languages’. In ‘Proceedings of the 1964 International Congress for Logic, Methodology, and Philosophy of Science’, Jerusalem: North-Holland.Davidson, D. 1967. ‘The logical form of action sentences’. In N. Rescher (ed. ‘The Logic of Decision and Action’, 81–95. Pittsburgh: Pittsburgh University Press.Davidson, D. 1970. ‘Semantics for natural languages’. In B. Visentini (ed. ‘Linguaggi nella Societa e nella Tecnica’, Milan: Edizioni di Comunita.Dowty, D. 1978a. A Guide to Montague’s PTQ. Bloomington, IN: Indiana University Linguistics Club.Dowty, D. 1978b. ‘Governed transformations as lexical rules in a Montague Grammar’. Linguistic Inquiry 9: 393–426.Dowty, D., Wall, R. E. & Peters, S. Jr. 1981. Introduction to Montague Semantics. Dordrecht: Reidel.Feferman, A. Burdman & Feferman, S. 2004. Alfred Tarski: Life and Logic. Cambridge: Cambridge University Press.Fodor, J. 1961. ‘Projection and paraphrase in

EMBO Course “Formal Analysis of Genetic Regulation”

CERN Document Server

1979-01-01

The E M B 0 course on "Formal Analysis of Genetic Regulation" A course entitled "Formal analysis of Genetic Regulation" was held at the University of Brussels from 6 to 16 September 1977 under the auspices of EMBO (European Molecular Biology Organization). As indicated by the title of the book (but not explicitly enough by the title of the course), the main emphasis was put on a dynamic analysis of systems using logical methods, that is, methods in which functions and variables take only a limited number of values - typically two. In this respect, this course was complementary to an EMBO course using continuous methods which was held some months later in Israel by Prof. Segel. People from four very different laboratories took an active part in teaching our course in Brussels : Drs Anne LEUSSLER and Philippe VAN HAM, from the Laboratory of Prof. Jean FLORINE (Laboratoire des Systemes logiques et numeriques, Faculte des Sciences appliquees, Universite Libre de Bruxelles). Dr Stuart KAUFFMAN (Dept. of Biochemist...

Hybrid-Logical Reasoning in the Smarties and Sally-Anne Tasks

DEFF Research Database (Denmark)

Braüner, Torben

2014-01-01

The main aim of the present paper is to use a proof system for hybrid modal logic to formalize what are called false-belief tasks in cognitive psychology, thereby investigating the interplay between cognition and logical reasoning about belief. We consider two different versions of the Smarties...

Logic as a Key to Interdisciplinary Integration for Students in the Mathematical Sciences

Directory of Open Access Journals (Sweden)

Thomas Marlowe

2017-08-01

Full Text Available We describe the creation and development of a course on mathematical logic and its extensions and limitations, in which coverage of technical material is interleaved with and related to discussion of relevant historical, linguistic, philosophical, and theological issues and of individuals of note. The new course, Logic, Limitations to Knowledge, and Christianity, presents an overview of topics in and related to logic, including development of formal logic and an axiomatic first-order logic. It explores the history of mathematics and logic in the Catholic Intellectual and wider Western Traditions, as well as the mutual interactions of mathematics, philosophy, language, and religion. It then considers extensions of first-order logic, and provable limits to knowledge: the three unsolvable problems of Euclidean geometry, and examples from Gödel, Turing, Arrow, quantum physics, and others. Epistemological issues will be emphasized throughout the course. The translation between natural language and expression in logical and reasoning formalisms is emphasized throughout. As a Core Curriculum course at Seton Hall University, fundamental questions such as "What is logic?" and "What are its limits?" will be considered within the framework of Christianity's broader view of the human person and human intelligence.

Recent trends related to the use of formal methods in software engineering

Science.gov (United States)

Prehn, Soren

1986-01-01

An account is given of some recent developments and trends related to the development and use of formal methods in software engineering. Ongoing activities in Europe are focussed on, since there seems to be a notable difference in attitude towards industrial usage of formal methods in Europe and in the U.S. A more detailed account is given of the currently most widespread formal method in Europe: the Vienna Development Method. Finally, the use of Ada is discussed in relation to the application of formal methods, and the potential for constructing Ada-specific tools based on that method is considered.

The logical foundations of scientific theories languages, structures, and models

CERN Document Server

Krause, Decio

2016-01-01

This book addresses the logical aspects of the foundations of scientific theories. Even though the relevance of formal methods in the study of scientific theories is now widely recognized and regaining prominence, the issues covered here are still not generally discussed in philosophy of science. The authors focus mainly on the role played by the underlying formal apparatuses employed in the construction of the models of scientific theories, relating the discussion with the so-called semantic approach to scientific theories. The book describes the role played by this metamathematical framework in three main aspects: considerations of formal languages employed to axiomatize scientific theories, the role of the axiomatic method itself, and the way set-theoretical structures, which play the role of the models of theories, are developed. The authors also discuss the differences and philosophical relevance of the two basic ways of aximoatizing a scientific theory, namely Patrick Suppes’ set theoretical predicate...

Problems Encountered in Teaching Logic in Faculties of Theology

Directory of Open Access Journals (Sweden)

Hülya ALTUNYA

2014-04-01

Full Text Available From the past until today logic has always been affiliated with religious education in institutes of higher learning. In the history of Islamic thought, education in logic has at times held an important place in the curriculum, while at other times it has only been represented symbolically. Throughout the history of thought, religious sciences have not only possessed a hierarchical structure based on classification, but have also been institutionalized in order to protect the accumulation of the knowledge that has been attained. As a result, in order to function as a vehicle in the structuring of this knowledge, logic has become what is known as an introductory science. Over time, as a vehicle of religious sciences and an introductory science, logic has become a productive method by which different academic disciplines can attain information. Thus, until today in religious sciences education, logic has been used as a method both in the higher religious education provided in faculties of theology and in the madrasas which continue this education. In this paper, the education of logic that is given in faculties of theology, including how much of the curriculum is devoted to this subject, the quality of instruction, the integration of this subject with other lessons, the interest of students in this subject and whether or not the necessary productivity in logic instruction is being attained will be examined. In addition, to what extent logic can make new contributions to new thought and comprehension techniques for solving the theological problems of today will be investigated. An additional research question asked here is the extent to which students enrolled in theology faculties in formal and informal education, the very people who will later act as instructors in religious sciences, are aware of the importance of being familiar and skilled in “correct reasoning techniques”.

Back to inertia : Theoretical implications of alternative styles of logical formalization

NARCIS (Netherlands)

Péli, Gabor; Pólos, L.; Hannan, M.T.

This article applies two new criteria, desirability and faithfulness, to evaluate Péli et al.'s (1994) formalization of Hannan and Freeman's structural inertia argument (1984, 1989). We conclude that this formalization fails to meet these criteria. We argue that part of the rational reconstruction

What makes industries believe in formal methods

NARCIS (Netherlands)

Vissers, C.A.; van Sinderen, Marten J.; Ferreira Pires, Luis; Pires, L.F.; Danthine, A.S.; Leduc, G.; Wolper, P.

1993-01-01

The introduction of formal methods in the design and development departments of an industrial company has far reaching and long lasting consequences. In fact it changes the whole environment of methods, tools and skills that determine the design culture of that company. A decision to replace current

Protocol design and implementation using formal methods

NARCIS (Netherlands)

van Sinderen, Marten J.; Ferreira Pires, Luis; Pires, L.F.; Vissers, C.A.

1992-01-01

This paper reports on a number of formal methods that support correct protocol design and implementation. These methods are placed in the framework of a design methodology for distributed systems that was studied and developed within the ESPRIT II Lotosphere project (2304). The paper focuses on

Industrial use of formal methods formal verification

CERN Document Server

Boulanger, Jean-Louis

2012-01-01

At present the literature gives students and researchers of the very general books on the formal technics. The purpose of this book is to present in a single book, a return of experience on the used of the "formal technics" (such proof and model-checking) on industrial examples for the transportation domain. This book is based on the experience of people which are completely involved in the realization and the evaluation of safety critical system software based.  The implication of the industrialists allows to raise the problems of confidentiality which could appear and so allow

The role of formal specifications

International Nuclear Information System (INIS)

McHugh, J.

1994-01-01

The role of formal requirements specification is discussed under the premise that the primary purpose of such specifications is to facilitate clear and unambiguous communications among the communities of interest for a given project. An example is presented in which the failure to reach such an understanding resulted in an accident at a chemical plant. Following the example, specification languages based on logical formalisms and notations are considered. These are rejected as failing to serve the communications needs of diverse communities. The notion of a specification as a surrogate for a program is also considered and rejected. The paper ends with a discussion of the type of formal notation that will serve the communications role and several encouraging developments are noted

Developing corpus-based translation methods between informal and formal mathematics : project description

NARCIS (Netherlands)

Kaliszyk, C.; Urban, J.; Vyskocil, J.; Geuvers, J.H.; Watt, S.M.; Davenport, J.H.; Sexton, A.P.; Sojka, P.; Urban, J.

2014-01-01

The goal of this project is to (i) accumulate annotated informal/formal mathematical corpora suitable for training semi-automated translation between informal and formal mathematics by statistical machine-translation methods, (ii) to develop such methods oriented at the formalization task, and in

Dual deep modeling: multi-level modeling with dual potencies and its formalization in F-Logic.

Science.gov (United States)

Neumayr, Bernd; Schuetz, Christoph G; Jeusfeld, Manfred A; Schrefl, Michael

2018-01-01

An enterprise database contains a global, integrated, and consistent representation of a company's data. Multi-level modeling facilitates the definition and maintenance of such an integrated conceptual data model in a dynamic environment of changing data requirements of diverse applications. Multi-level models transcend the traditional separation of class and object with clabjects as the central modeling primitive, which allows for a more flexible and natural representation of many real-world use cases. In deep instantiation, the number of instantiation levels of a clabject or property is indicated by a single potency. Dual deep modeling (DDM) differentiates between source potency and target potency of a property or association and supports the flexible instantiation and refinement of the property by statements connecting clabjects at different modeling levels. DDM comes with multiple generalization of clabjects, subsetting/specialization of properties, and multi-level cardinality constraints. Examples are presented using a UML-style notation for DDM together with UML class and object diagrams for the representation of two-level user views derived from the multi-level model. Syntax and semantics of DDM are formalized and implemented in F-Logic, supporting the modeler with integrity checks and rich query facilities.

Taming Living Logic using Formal Methods

DEFF Research Database (Denmark)

Baig, Hasan; Madsen, Jan

2017-01-01

One of the goals of synthetic biology is to build genetic circuits to control the behavior of a cell for different application domains, such as medical, environmental, and biotech. During the design process of genetic circuits, biologists are often interested in the probability of a system to work...

[How to write an article: formal aspects].

Science.gov (United States)

Corral de la Calle, M A; Encinas de la Iglesia, J

2013-06-01

Scientific research and the publication of the results of the studies go hand in hand. Exquisite research methods can only be adequately reflected in formal publication with the optimum structure. To ensure the success of this process, it is necessary to follow orderly steps, including selecting the journal in which to publish and following the instructions to authors strictly as well as the guidelines elaborated by diverse societies of editors and other institutions. It is also necessary to structure the contents of the article in a logical and attractive way and to use an accurate, clear, and concise style of language. Although not all the authors are directly involved in the actual writing, elaborating a scientific article is a collective undertaking that does not finish until the article is published. This article provides practical advice about formal and not-so-formal details to take into account when writing a scientific article as well as references that will help readers find more information in greater detail. Copyright © 2012 SERAM. Published by Elsevier Espana. All rights reserved.

Formal modeling of a system of chemical reactions under uncertainty.

Science.gov (United States)

Ghosh, Krishnendu; Schlipf, John

2014-10-01

We describe a novel formalism representing a system of chemical reactions, with imprecise rates of reactions and concentrations of chemicals, and describe a model reduction method, pruning, based on the chemical properties. We present two algorithms, midpoint approximation and interval approximation, for construction of efficient model abstractions with uncertainty in data. We evaluate computational feasibility by posing queries in computation tree logic (CTL) on a prototype of extracellular-signal-regulated kinase (ERK) pathway.

Dominant partition method. [based on a wave function formalism

Science.gov (United States)

Dixon, R. M.; Redish, E. F.

1979-01-01

By use of the L'Huillier, Redish, and Tandy (LRT) wave function formalism, a partially connected method, the dominant partition method (DPM) is developed for obtaining few body reductions of the many body problem in the LRT and Bencze, Redish, and Sloan (BRS) formalisms. The DPM maps the many body problem to a fewer body one by using the criterion that the truncated formalism must be such that consistency with the full Schroedinger equation is preserved. The DPM is based on a class of new forms for the irreducible cluster potential, which is introduced in the LRT formalism. Connectivity is maintained with respect to all partitions containing a given partition, which is referred to as the dominant partition. Degrees of freedom corresponding to the breakup of one or more of the clusters of the dominant partition are treated in a disconnected manner. This approach for simplifying the complicated BRS equations is appropriate for physical problems where a few body reaction mechanism prevails.

Is there a relationship between logic and psychology? The question for human reasoning

Directory of Open Access Journals (Sweden)

Jaime Castro Martínez

2013-11-01

Full Text Available This paper presents a debate between the relations of logic and psychology. It starts with the presentation of Keysser’s logicism. It describes some background to the debate on Mill’s psychologism and Husserl´s criticism of the laws of logic, in contrast to the laws of the nature of human thought. It continues with the contributions to the discussion by Gestalt theory. Then, the Piagetian bet for a mental logic is presented. The essay concludes with the need to consider psychological logic as distinct from formal logic: a dynamic logic of facts or logic of experience

Formal Methods and Safety Certification: Challenges in the Railways Domain

DEFF Research Database (Denmark)

Fantechi, Alessandro; Ferrari, Alessio; Gnesi, Stefania

2016-01-01

The railway signalling sector has historically been a source of success stories about the adoption of formal methods in the certification of software safety of computer-based control equipment.......The railway signalling sector has historically been a source of success stories about the adoption of formal methods in the certification of software safety of computer-based control equipment....

Describing the What and Why of Students' Difficulties in Boolean Logic

Science.gov (United States)

Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig

2012-01-01

The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…

The importance of training in formal methods in Software Engineering

Directory of Open Access Journals (Sweden)

John Polansky

2014-12-01

Full Text Available The paradigm of formal methods provides systematic techniques and rigorous to software develop and, due the crescent complexity and quality requirements of current products, is necessary introduce them in curriculum of software engineer. In this article is analyzed the importance of train in formal methods and described specific techniques to achieved it efficiently. This techniques are the result of an experimental process in the class room of more than fifteen years in undergraduate and graduate programs, the same as company training. Also are presented a proposal a curriculum to systematic introduction of this paradigm and description of a program in training methods that has been success to industry. Results shows that students gain confidence in formal methods just when found out of the benefits of this in the context of software engineer.

Specification and Verification of Web Applications in Rewriting Logic

Science.gov (United States)

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

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

Dual Logic and Cerebral Coordinates for Reciprocal Interaction in Eye Contact

Science.gov (United States)

Lee, Ray F.

2015-01-01

In order to scientifically study the human brain’s response to face-to-face social interaction, the scientific method itself needs to be reconsidered so that both quantitative observation and symbolic reasoning can be adapted to the situation where the observer is also observed. In light of the recent development of dyadic fMRI which can directly observe dyadic brain interacting in one MRI scanner, this paper aims to establish a new form of logic, dual logic, which provides a theoretical platform for deductive reasoning in a complementary dual system with emergence mechanism. Applying the dual logic in the dfMRI experimental design and data analysis, the exogenous and endogenous dual systems in the BOLD responses can be identified; the non-reciprocal responses in the dual system can be suppressed; a cerebral coordinate for reciprocal interaction can be generated. Elucidated by dual logic deductions, the cerebral coordinate for reciprocal interaction suggests: the exogenous and endogenous systems consist of the empathy network and the mentalization network respectively; the default-mode network emerges from the resting state to activation in the endogenous system during reciprocal interaction; the cingulate plays an essential role in the emergence from the exogenous system to the endogenous system. Overall, the dual logic deductions are supported by the dfMRI experimental results and are consistent with current literature. Both the theoretical framework and experimental method set the stage to formally apply the scientific method in studying complex social interaction. PMID:25885446

Dual logic and cerebral coordinates for reciprocal interaction in eye contact.

Directory of Open Access Journals (Sweden)

Ray F Lee

Full Text Available In order to scientifically study the human brain's response to face-to-face social interaction, the scientific method itself needs to be reconsidered so that both quantitative observation and symbolic reasoning can be adapted to the situation where the observer is also observed. In light of the recent development of dyadic fMRI which can directly observe dyadic brain interacting in one MRI scanner, this paper aims to establish a new form of logic, dual logic, which provides a theoretical platform for deductive reasoning in a complementary dual system with emergence mechanism. Applying the dual logic in the dfMRI experimental design and data analysis, the exogenous and endogenous dual systems in the BOLD responses can be identified; the non-reciprocal responses in the dual system can be suppressed; a cerebral coordinate for reciprocal interaction can be generated. Elucidated by dual logic deductions, the cerebral coordinate for reciprocal interaction suggests: the exogenous and endogenous systems consist of the empathy network and the mentalization network respectively; the default-mode network emerges from the resting state to activation in the endogenous system during reciprocal interaction; the cingulate plays an essential role in the emergence from the exogenous system to the endogenous system. Overall, the dual logic deductions are supported by the dfMRI experimental results and are consistent with current literature. Both the theoretical framework and experimental method set the stage to formally apply the scientific method in studying complex social interaction.

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

Directory of Open Access Journals (Sweden)

V. I. Freyman

2015-11-01

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

Formal specifications for Java’s synchronisation classes

NARCIS (Netherlands)

Amighi, A.; Blom, Stefan; Huisman, Marieke; Mostowski, Wojciech; Zaharieva, M.

2013-01-01

This paper discusses formal specification and verification of the synchronisation classes of the Java API. In many verification systems for concurrent programs, synchronisation is treated as a primitive operation. As a result, verification rules for synchronisation are hard-coded in the logic, and

The formal operations: Piaget’s concept, researches and main critics

Directory of Open Access Journals (Sweden)

Stepanović Ivana Ž.

2004-01-01

Full Text Available This paper deals with Piaget's concept of formal operations, formal operations researches and critics related to the concept. The first part of the work is dedicated to the formal operations concept. The main characteristics of formal operational thought and formal operations structure, as well as structure logical model are presented in that part of the work. The second part is a review of formal operational researches and it is divided in three parts: (1 problems of researches (2 characteristics of applied methodology and (3 author approaches as a specific research context. In the last part of the work the main critics of formal operations concept are presented and discussed.

Analysis of Formal Methods for Specification of E-Commerce Applications

Directory of Open Access Journals (Sweden)

Sadiq Ali Khan

2016-01-01

Full Text Available E-commerce based application characteristics portray elevated dynamics while incorporating decentralized nature. Extreme emphasis influencing structural design plus implementation, positions such applications highly appreciated. Significant research articles reveal that, applying formal methods addressing challenges incumbent with E-commerce based applications, contribute towards reliability and robustness obliging the system. Anticipating and designing sturdy e-process and concurrent implementation, allows application behavior extra strength against errors, frauds and hacking, minimizing program faults during application operations. Programmers find extreme difficulty guaranteeing correct processing under all circumstances, however, not impossible. Concealed flaws and errors, triggered only under unexpected and unanticipated scenarios, pilot subtle mistakes and appalling failures. Code authors utilize various formal methods for reducing these flaws. Mentioning prominent methods would include, ASM (Abstract State Machines, B-Method, z-Language, UML (Unified Modelling Language etc. This paper primarily focuses different formal methods applied while deliberating specification and verification techniques for cost effective.

Time-space modal logic for verification of bit-slice circuits

Science.gov (United States)

Hiraishi, Hiromi

1996-03-01

The major goal of this paper is to propose a new modal logic aiming at formal verification of bit-slice circuits. The new logic is called as time-space modal logic and its major feature is that it can handle two transition relations: one for time transition and the other for space transition. As for a verification algorithm, a symbolic model checking algorithm of the new logic is shown. This could be applicable to verification of bit-slice microprocessor of infinite bit width and 1D systolic array of infinite length. A simple benchmark result shows the effectiveness of the proposed approach.

An automatic tuning method of a fuzzy logic controller for nuclear reactors

International Nuclear Information System (INIS)

Ramaswamy, P.; Lee, K.Y.; Edwards, R.M.

1993-01-01

The design and evaluation by simulation of an automatically tuned fuzzy logic controller is presented. Typically, fuzzy logic controllers are designed based on an expert's knowledge of the process. However, this approach has its limitations in the fact that the controller is hard to optimize or tune to get the desired control action. A method to automate the tuning process using a simplified Kalman filter approach is presented for the fuzzy logic controller to track a suitable reference trajectory. Here, for purposes of illustration an optimal controller's response is used as a reference trajectory to determine automatically the rules for the fuzzy logic controller. To demonstrate the robustness of this design approach, a nonlinear six-delayed neutron group plant is controlled using a fuzzy logic controller that utilizes estimated reactor temperatures from a one-delayed neutron group observer. The fuzzy logic controller displayed good stability and performance robustness characteristics for a wide range of operation

Formal analysis of physical theories

International Nuclear Information System (INIS)

Dalla Chiara, M.L.; Toraldo di Francia, G.

1979-01-01

The rules of inference that are made use of in formalization are considered. It is maintained that a physical law represents the universal assertion of a probability, and not the assessment of the probability of a universal assertion. The precision of the apparatus used to collect the experimental evidence is introduced as an essential part of the theoretical structure of physics. This approach allows the author to define the concept of truth in a satisfactory way, abandoning the unacceptable notion of approximate truth. It is shown that a considerable amount of light can be shed on a number of much debated problems arising in the logic of quantum mechanics. It is stressed that the deductive structure of quantum theory seems to be essentially founded on a kind of mixture of different logics. Two different concepts of truth are distinguished within quantum theory, an empirical truth and quantum-logical truth. (Auth.)

A logic circuit for solving linear function by digital method

International Nuclear Information System (INIS)

Ma Yonghe

1986-01-01

A mathematical method for determining the linear relation of physical quantity with rediation intensity is described. A logic circuit has been designed for solving linear function by digital method. Some applications and the circuit function are discussed

Stereotypical Reasoning: Logical Properties

OpenAIRE

Lehmann, Daniel

2002-01-01

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

Towards Formal Verification of a Separation Microkernel

Science.gov (United States)

Butterfield, Andrew; Sanan, David; Hinchey, Mike

2013-08-01

The best approach to verifying an IMA separation kernel is to use a (fixed) time-space partitioning kernel with a multiple independent levels of separation (MILS) architecture. We describe an activity that explores the cost and feasibility of doing a formal verification of such a kernel to the Common Criteria (CC) levels mandated by the Separation Kernel Protection Profile (SKPP). We are developing a Reference Specification of such a kernel, and are using higher-order logic (HOL) to construct formal models of this specification and key separation properties. We then plan to do a dry run of part of a formal proof of those properties using the Isabelle/HOL theorem prover.

Theorem Proving In Higher Order Logics

Science.gov (United States)

Carreno, Victor A. (Editor); Munoz, Cesar A.; Tahar, Sofiene

2002-01-01

The TPHOLs International Conference serves as a venue for the presentation of work in theorem proving in higher-order logics and related areas in deduction, formal specification, software and hardware verification, and other applications. Fourteen papers were submitted to Track B (Work in Progress), which are included in this volume. Authors of Track B papers gave short introductory talks that were followed by an open poster session. The FCM 2002 Workshop aimed to bring together researchers working on the formalisation of continuous mathematics in theorem proving systems with those needing such libraries for their applications. Many of the major higher order theorem proving systems now have a formalisation of the real numbers and various levels of real analysis support. This work is of interest in a number of application areas, such as formal methods development for hardware and software application and computer supported mathematics. The FCM 2002 consisted of three papers, presented by their authors at the workshop venue, and one invited talk.

A Survey of Formal Methods for Intelligent Swarms

Science.gov (United States)

Truszkowski, Walt; Rash, James; Hinchey, Mike; Rouff, Chrustopher A.

2004-01-01

cutting edge in system correctness, and requires higher levels of assurance than other (traditional) missions that use a single or small number of spacecraft that are deterministic in nature and have near continuous communication access. One of the highest possible levels of assurance comes from the application of formal methods. Formal methods are mathematics-based tools and techniques for specifying and verifying (software and hardware) systems. They are particularly useful for specifying complex parallel systems, such as exemplified by the ANTS mission, where the entire system is difficult for a single person to fully understand, a problem that is multiplied with multiple developers. Once written, a formal specification can be used to prove properties of a system (e.g., the underlying system will go from one state to another or not into a specific state) and check for particular types of errors (e.g., race or livelock conditions). A formal specification can also be used as input to a model checker for further validation. This report gives the results of a survey of formal methods techniques for verification and validation of space missions that use swarm technology. Multiple formal methods were evaluated to determine their effectiveness in modeling and assuring the behavior of swarms of spacecraft using the ANTS mission as an example system. This report is the first result of the project to determine formal approaches that are promising for formally specifying swarm-based systems. From this survey, the most promising approaches were selected and are discussed relative to their possible application to the ANTS mission. Future work will include the application of an integrated approach, based on the selected approaches identified in this report, to the formal specification of the ANTS mission.

Moderation instead of modelling: some arguments against formal engineering methods

NARCIS (Netherlands)

Rauterberg, G.W.M.; Sikorski, M.; Rauterberg, G.W.M.

1998-01-01

The more formal the used engineering techniques are, the less non-technical facts can be captured. Several business process reengineering and software development projects fail, because the project management concentrates to much on formal methods and modelling approaches. A successful change of

The nature of Formal Reasoning among Ghanaian Basic School ...

African Journals Online (AJOL)

cce

theories of cognitive development separated the organization of knowledge from practice. ..... Formal operators must be able to distinguish between false and logical arguments. ... Poole, B. (1997) Education for an Information age. Boston: ...

A Description Logic Based Knowledge Representation Model for Concept Understanding

DEFF Research Database (Denmark)

Badie, Farshad

2017-01-01

This research employs Description Logics in order to focus on logical description and analysis of the phenomenon of ‘concept understanding’. The article will deal with a formal-semantic model for figuring out the underlying logical assumptions of ‘concept understanding’ in knowledge representation...... systems. In other words, it attempts to describe a theoretical model for concept understanding and to reflect the phenomenon of ‘concept understanding’ in terminological knowledge representation systems. Finally, it will design an ontology that schemes the structure of concept understanding based...

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

International Nuclear Information System (INIS)

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

1981-01-01

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

Fuzzy Versions of Epistemic and Deontic Logic

Science.gov (United States)

Gounder, Ramasamy S.; Esterline, Albert C.

1998-01-01

Epistemic and deontic logics are modal logics, respectively, of knowledge and of the normative concepts of obligation, permission, and prohibition. Epistemic logic is useful in formalizing systems of communicating processes and knowledge and belief in AI (Artificial Intelligence). Deontic logic is useful in computer science wherever we must distinguish between actual and ideal behavior, as in fault tolerance and database integrity constraints. We here discuss fuzzy versions of these logics. In the crisp versions, various axioms correspond to various properties of the structures used in defining the semantics of the logics. Thus, any axiomatic theory will be characterized not only by its axioms but also by the set of properties holding of the corresponding semantic structures. Fuzzy logic does not proceed with axiomatic systems, but fuzzy versions of the semantic properties exist and can be shown to correspond to some of the axioms for the crisp systems in special ways that support dependency networks among assertions in a modal domain. This in turn allows one to implement truth maintenance systems. For the technical development of epistemic logic, and for that of deontic logic. To our knowledge, we are the first to address fuzzy epistemic and fuzzy deontic logic explicitly and to consider the different systems and semantic properties available. We give the syntax and semantics of epistemic logic and discuss the correspondence between axioms of epistemic logic and properties of semantic structures. The same topics are covered for deontic logic. Fuzzy epistemic and fuzzy deontic logic discusses the relationship between axioms and semantic properties for these logics. Our results can be exploited in truth maintenance systems.

NaDeA: A Natural Deduction Assistant with a Formalization in Isabelle

DEFF Research Database (Denmark)

Villadsen, Jørgen; Jensen, Alexander Birch; Schlichtkrull, Anders

2017-01-01

We present a new software tool for teaching logic based on natural deduction. Its proof system is formalized in the proof assistant Isabelle such that its definition is very precise. Soundness of the formalization has been proved in Isabelle. The tool is open source software developed in TypeScript...

NaDeA: A Natural Deduction Assistant with a Formalization in Isabelle

DEFF Research Database (Denmark)

Villadsen, Jørgen; Jensen, Alexander Birch; Schlichtkrull, Anders

2015-01-01

We present a new software tool for teaching logic based on natural deduction. Its proof system is formalized in the proof assistant Isabelle such that its definition is very precise. Soundness of the formalization has been proved in Isabelle. The tool is open source software developed in TypeScript...

Formal Verification of Annotated Textual Use-Cases

Czech Academy of Sciences Publication Activity Database

Šimko, V.; Hauzar, D.; Hnětynka, P.; Bureš, Tomáš; Plášil, F.

2015-01-01

Roč. 58, č. 7 (2015), s. 1495-1529 ISSN 0010-4620 Grant - others:GA AV ČR(CZ) GAP103/11/1489 Institutional support: RVO:67985807 Keywords : specification * use-cases * behavior modeling * verification * temporal logic * formalization Subject RIV: JC - Computer Hardware ; Software Impact factor: 1.000, year: 2015

On Logic and Standards for Structuring Documents

Science.gov (United States)

Eyers, David M.; Jones, Andrew J. I.; Kimbrough, Steven O.

The advent of XML has been widely seized upon as an opportunity to develop document representation standards that lend themselves to automated processing. This is a welcome development and much good has come of it. That said, present standardization efforts may be criticized on a number of counts. We explore two issues associated with document XML standardization efforts. We label them (i) the dynamic point and (ii) the logical point. Our dynamic point is that in many cases experience has shown that the search for a final, or even reasonably permanent, document representation standard is futile. The case is especially strong for electronic data interchange (EDI). Our logical point is that formalization into symbolic logic is materially helpful for understanding and designing dynamic document standards.

Analysis and synthesis of a logic control circuit by binary analysis methods

International Nuclear Information System (INIS)

Chicheportiche, Armand

1974-06-01

The analytical study of the logic circuits described in this report clearly shows the fruitful efficiency of the methods proposed by Binary Analysis. This study is a very new approach in logic and these mathematical methods are systematically precise in their applications. The detailed operations of an automatic system are to be studied in a way which cannot be reached by other methods. The definition and utilization of transition equations allow the determination of the different commutations in the auxiliary switch functions of a sequential system. This new way of analysis digital circuits will certainly develop in a very near future [fr

On BAN logics for industrial security protocols

NARCIS (Netherlands)

Agray, N.; Hoek, van der W.; Vink, de E.P.; Dunin-Keplicz, B.; Nawarecki, E.

2002-01-01

This paper reports on two case-studies of applying BAN logic to industrial strength security protocols. These studies demonstrate the flexibility of the BAN language, as it caters for the addition of appropriate constructs and rules. We argue that, although a semantical foundation of the formalism

The Resolution Calculus for First-Order Logic

DEFF Research Database (Denmark)

Schlichtkrull, Anders

2016-01-01

This theory is a formalization of the resolution calculus for first-order logic. It is proven sound and complete. The soundness proof uses the substitution lemma, which shows a correspondence between substitutions and updates to an environment. The completeness proof uses semantic trees, i.e. trees...

Software Components and Formal Methods from a Computational Viewpoint

OpenAIRE

Lambertz, Christian

2012-01-01

Software components and the methodology of component-based development offer a promising approach to master the design complexity of huge software products because they separate the concerns of software architecture from individual component behavior and allow for reusability of components. In combination with formal methods, the specification of a formal component model of the later software product or system allows for establishing and verifying important system properties in an automatic a...

Towards Safe Navigation by Formalizing Navigation Rules

Directory of Open Access Journals (Sweden)

Arne Kreutzmann

2013-06-01

Full Text Available One crucial aspect of safe navigation is to obey all navigation regulations applicable, in particular the collision regulations issued by the International Maritime Organization (IMO Colregs. Therefore, decision support systems for navigation need to respect Colregs and this feature should be verifiably correct. We tackle compliancy of navigation regulations from a perspective of software verification. One common approach is to use formal logic, but it requires to bridge a wide gap between navigation concepts and simple logic. We introduce a novel domain specification language based on a spatio-temporal logic that allows us to overcome this gap. We are able to capture complex navigation concepts in an easily comprehensible representation that can direcly be utilized by various bridge systems and that allows for software verification.

Logical Specification and Analysis of Fault Tolerant Systems through Partial Model Checking

NARCIS (Netherlands)

Gnesi, S.; Etalle, Sandro; Mukhopadhyay, S.; Lenzini, Gabriele; Lenzini, G.; Martinelli, F.; Roychoudhury, A.

2003-01-01

This paper presents a framework for a logical characterisation of fault tolerance and its formal analysis based on partial model checking techniques. The framework requires a fault tolerant system to be modelled using a formal calculus, here the CCS process algebra. To this aim we propose a uniform

Fuzzy Logic vs. Neutrosophic Logic: Operations Logic

Directory of Open Access Journals (Sweden)

Salah Bouzina

2016-12-01

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

Logic as Marr's Computational Level: Four Case Studies.

Science.gov (United States)

Baggio, Giosuè; van Lambalgen, Michiel; Hagoort, Peter

2015-04-01

We sketch four applications of Marr's levels-of-analysis methodology to the relations between logic and experimental data in the cognitive neuroscience of language and reasoning. The first part of the paper illustrates the explanatory power of computational level theories based on logic. We show that a Bayesian treatment of the suppression task in reasoning with conditionals is ruled out by EEG data, supporting instead an analysis based on defeasible logic. Further, we describe how results from an EEG study on temporal prepositions can be reanalyzed using formal semantics, addressing a potential confound. The second part of the article demonstrates the predictive power of logical theories drawing on EEG data on processing progressive constructions and on behavioral data on conditional reasoning in people with autism. Logical theories can constrain processing hypotheses all the way down to neurophysiology, and conversely neuroscience data can guide the selection of alternative computational level models of cognition. Copyright © 2014 Cognitive Science Society, Inc.

An Introduction to Formal Methods for the Development of Safety-critical Applications

DEFF Research Database (Denmark)

Haxthausen, Anne Elisabeth

2010-01-01

This report is a delivery to The Danish Government’s railway authority, Trafikstyrelsen, as a part of the Public Sector Consultancy service offered by the Technical University of Denmark. The purpose of the report is to give the reader an insight into the stateof-the-art of formal methods. The reader...... is assumed to have some knowledge about software development, but not on formal methods. The background for the railway authorities’ interest in formal methods is the fact that during the next decade a total renewal of the Danish signalling infrastructure is going to take place. Central parts of the new...... systems will be software components that must fulfill strong safety requirements: in order to get the software certified at the highest Safety Integrity Levels of the European CENELEC standards for railway applications, the software providers are expected to use formal methods....

On the Need for Practical Formal Methods

Science.gov (United States)

1998-01-01

additional research and engineering that is needed to make the current set of formal methods more practical. To illustrate the ideas, I present several exam ...either a good violin or a highly talented violinist. Light-weight techniques o er software developers good violins . A user need not be a talented

Higher-Order Separation Logic in Isabelle/HOLCF

DEFF Research Database (Denmark)

Varming, Carsten; Birkedal, Lars

2008-01-01

We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a way that one may use any theory defined in Isabelle/HOLCF to construct assertions, e.g., primitive recursion, least o...

Building a Formal Model of a Human-Interactive System: Insights into the Integration of Formal Methods and Human Factors Engineering

Science.gov (United States)

Bolton, Matthew L.; Bass, Ellen J.

2009-01-01

Both the human factors engineering (HFE) and formal methods communities are concerned with finding and eliminating problems with safety-critical systems. This work discusses a modeling effort that leveraged methods from both fields to use model checking with HFE practices to perform formal verification of a human-interactive system. Despite the use of a seemingly simple target system, a patient controlled analgesia pump, the initial model proved to be difficult for the model checker to verify in a reasonable amount of time. This resulted in a number of model revisions that affected the HFE architectural, representativeness, and understandability goals of the effort. If formal methods are to meet the needs of the HFE community, additional modeling tools and technological developments are necessary.

Formalization of the Integral Calculus in the PVS Theorem Prover

Science.gov (United States)

Butler, Ricky W.

2004-01-01

The PVS Theorem prover is a widely used formal verification tool used for the analysis of safety-critical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and Computer Science that is used in a verification. This is a formidable task, ultimately requiring the contributions of researchers and developers all over the world. This paper reports on the formalization of the integral calculus in the PVS theorem prover. All of the basic definitions and theorems covered in a first course on integral calculus have been completed.The theory and proofs were based on Rosenlicht's classic text on real analysis and follow the traditional epsilon-delta method. The goal of this work was to provide a practical set of PVS theories that could be used for verification of hybrid systems that arise in air traffic management systems and other aerospace applications. All of the basic linearity, integrability, boundedness, and continuity properties of the integral calculus were proved. The work culminated in the proof of the Fundamental Theorem Of Calculus. There is a brief discussion about why mechanically checked proofs are so much longer than standard mathematics textbook proofs.

Logic, mathematics, and computer science modern foundations with practical applications

CERN Document Server

Nievergelt, Yves

2015-01-01

This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkhӓuser, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory.  The focus is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and  provides complete details and derivations of formal proofs. Copious references to literature that document historical development is also provided. Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so uni...

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

Science.gov (United States)

Singh, Karamdeep; Kaur, Gurmeet

2015-06-01

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

A comparative study of formal methods for safety critical software in nuclear power plant

International Nuclear Information System (INIS)

Sohn, Se Do; Seong Poong Hyun

2000-01-01

The requirement of ultra high reliability of the safety critical software can not be demonstrated by testing alone. The specification based on formal method is recommended for safety system software. But there exist various kinds of formal methods, and this variety of formal method is recognized as an obstacle to the wide use of formal method. In this paper six different formal method have been applied to the same part of the functional requirements that is calculation algorithm intensive. The specification results were compared against the criteria that is derived from the characteristics that good software requirements specifications should have and regulatory body recommends to have. The application experience shows that the critical characteristics should be defined first, then appropriate method has to e selected. In our case, the Software Cost Reduction method was recommended for internal condition or calculation algorithm checking, and state chart method is recommended for the external behavioral description. (author)

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

Science.gov (United States)

Guarini, G

1994-06-01

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

Formal Methods for Abstract Specifications – A Comparison of Concepts

DEFF Research Database (Denmark)

Instenberg, Martin; Schneider, Axel; Schnetter, Sabine

2006-01-01

In industry formal methods are becoming increasingly important for the verification of hardware and software designs. However current practice for specification of system and protocol functionality on high level of abstraction is textual description. For verification of the system behavior manual...... inspections and tests are usual means. To facilitate the introduction of formal methods in the development process of complex systems and protocols, two different tools evolved from research activities – UPPAAL and SpecEdit – have been investigated and compared regarding their concepts and functionality...

An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework

DEFF Research Database (Denmark)

Schürmann, Carsten; Stehr, Mark-Oliver

2006-01-01

that complements Howe’s semantics-based justification and furthermore goes beyond the original HOL/Nuprl connection by providing the foundation for a proof translator. Using the Twelf logical framework, the present paper goes one step further. It presents the first rigorous formalization of this treatment...... in a logical framework, and hence provides a safe alternative to the translation of proofs....

RTL2RTL Formal Equivalence: Boosting the Design Confidence

Directory of Open Access Journals (Sweden)

M V Achutha Kiran Kumar

2014-07-01

Full Text Available Increasing design complexity driven by feature and performance requirements and the Time to Market (TTM constraints force a faster design and validation closure. This in turn enforces novel ways of identifying and debugging behavioral inconsistencies early in the design cycle. Addition of incremental features and timing fixes may alter the legacy design behavior and would inadvertently result in undesirable bugs. The most common method of verifying the correctness of the changed design is to run a dynamic regression test suite before and after the intended changes and compare the results, a method which is not exhaustive. Modern Formal Verification (FV techniques involving new methods of proving Sequential Hardware Equivalence enabled a new set of solutions for the given problem, with complete coverage guarantee. Formal Equivalence can be applied for proving functional integrity after design changes resulting from a wide variety of reasons, ranging from simple pipeline optimizations to complex logic redistributions. We present here our experience of successfully applying the RTL to RTL (RTL2RTL Formal Verification across a wide spectrum of problems on a Graphics design. The RTL2RTL FV enabled checking the design sanity in a very short time, thus enabling faster and safer design churn. The techniques presented in this paper are applicable to any complex hardware design.

Moral Particularism and Deontic Logic

Science.gov (United States)

Parent, Xavier

The aim of this paper is to strengthen the point made by Horty about the relationship between reason holism and moral particularism. In the literature prima facie obligations have been considered as the only source of reason holism. I strengthen Horty's point in two ways. First, I show that contrary-to-duties provide another independent support for reason holism. Next I outline a formal theory that is able to capture these two sources of holism. While in simple settings the proposed account coincides with Horty's one, this is not true in more complicated or "realistic" settings in which more than two norms collide. My chosen formalism is so-called input/output logic.

Formal specification and implementation of operations in information management systems

International Nuclear Information System (INIS)

Sandewall, E.

1983-02-01

Among information management systems we include general purpose systems, such as text editors and data editors (forms management systems), as well as special purpose systems such as mail systems and computer based calendars. Based on a method for formal specification of some aspects of IMS, namely the structure of the data base, the update operations, and the user dialogue, the paper shows how reasonable procedures for executing IMS operations can be written in the notation of a first-order theory, in such a way that the procedure is a logical consequence of the specification. (Author)

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

CERN Document Server

Cellucci, Carlo

2014-01-01

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

Formal Method of Description Supporting Portfolio Assessment

Science.gov (United States)

Morimoto, Yasuhiko; Ueno, Maomi; Kikukawa, Isao; Yokoyama, Setsuo; Miyadera, Youzou

2006-01-01

Teachers need to assess learner portfolios in the field of education. However, they need support in the process of designing and practicing what kind of portfolios are to be assessed. To solve the problem, a formal method of describing the relations between the lesson forms and portfolios that need to be collected and the relations between…

A Formal Calculus for Categories

DEFF Research Database (Denmark)

Cáccamo, Mario José

This dissertation studies the logic underlying category theory. In particular we present a formal calculus for reasoning about universal properties. The aim is to systematise judgements about functoriality and naturality central to categorical reasoning. The calculus is based on a language which...... extends the typed lambda calculus with new binders to represent universal constructions. The types of the languages are interpreted as locally small categories and the expressions represent functors. The logic supports a syntactic treatment of universality and duality. Contravariance requires a definition...... of universality generous enough to deal with functors of mixed variance. Ends generalise limits to cover these kinds of functors and moreover provide the basis for a very convenient algebraic manipulation of expressions. The equational theory of the lambda calculus is extended with new rules for the definitions...

Industrial applications of formal methods to model, design and analyze computer systems

CERN Document Server

Craigen, Dan

1995-01-01

Formal methods are mathematically-based techniques, often supported by reasoning tools, that can offer a rigorous and effective way to model, design and analyze computer systems. The purpose of this study is to evaluate international industrial experience in using formal methods. The cases selected are representative of industrial-grade projects and span a variety of application domains. The study had three main objectives: · To better inform deliberations within industry and government on standards and regulations; · To provide an authoritative record on the practical experience of formal m

Interval logic. Proof theory and theorem proving

DEFF Research Database (Denmark)

Rasmussen, Thomas Marthedal

2002-01-01

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

Using CASE-tools based on formal methods in real-life system development of distributed systems

International Nuclear Information System (INIS)

Stoelen, Ketil; Karlsen, Tore Willy; Mohn, Peter; Sandmark, Haaakon

1998-03-01

Within the OECD Halden Reactor Project (HRP) the development and application of formal methods to enhance system quality have been prioritised tasks for the last three years per periods. The three year programme 1997-1999 identifies the need to gain experience from applying formal methods in larger real-life system developments. This motivated the initiation of the HRP research activity Integration of Formal Specification in the Development of HAMMLAB 2000 (INT-FS). The principal objective of INT-FS is to experiment with formal methods in system developments connected to HAMMLAB 2000 and thereby gain a better understanding of their suitability to support practical software engineering. In particular, INT-FS will try to measure the effect of formal methods and gain experience in combining formal methods with traditional development techniques. INT-FS was started up in January 1997. This report describes the status of INT-FS by February 1998. The report identifies objectives and plans; it motivates the choice of formal methods, CASE-tool and software process; it motivates and defines metrics for measuring achievement and the effect of formalization. The report also provides preliminary results from an experimental development of a communication manager; it describes the component to be developed and the background of the participants; it offers some provisional statistics and summarises the experiences with methods and tools. The development of the communication manager is the first attempt ever to exploit state-of-the-art CASE-tools for formal methods in practical software engineering at the HRP. (author)

UTP and Temporal Logic Model Checking

Science.gov (United States)

Anderson, Hugh; Ciobanu, Gabriel; Freitas, Leo

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

Controlling Smart Green House Using Fuzzy Logic Method

Directory of Open Access Journals (Sweden)

Rafiuddin Syam

2017-03-01

Full Text Available To increase agricultural output it is needed a system that can help the environmental conditions for optimum plant growth. Smart greenhouse allows for plants to grow optimally, because the temperature and humidity can be controlled so that no drastic changes. It is necessary for optimal smart greenhouse needed a system to manipulate the environment in accordance with the needs of the plant. In this case the setting temperature and humidity in the greenhouse according to the needs of the plant. So using an automated system for keeping such environmental condition is important. In this study, the authors use fuzzy logic to make the duration of watering the plants more dynamic in accordance with the input temperature and humidity so that the temperature and humidity in the green house plants maintained in accordance to the reference condition. Based on the experimental results using fuzzy logic method is effective to control the duration of watering and to maintain the optimum temperature and humidity inside the greenhouse

Controlling Smart Green House Using Fuzzy Logic Method

Directory of Open Access Journals (Sweden)

Rafiuddin Syam

2015-10-01

Full Text Available To increase agricultural output it is needed a system that can help the environmental conditions for optimum plant growth. Smart greenhouse allows for plants to grow optimally, because the temperature and humidity can be controlled so that no drastic changes. It is necessary for optimal smart greenhouse needed a system to manipulate the environment in accordance with the needs of the plant. In this case the setting temperature and humidity in the greenhouse according to the needs of the plant. So using an automated system for keeping such environmental condition is important. In this study, the authors use fuzzy logic to make the duration of watering the plants more dynamic in accordance with the input temperature and humidity so that the temperature and humidity in the green house plants maintained in accordance to the reference condition. Based on the experimental results using fuzzy logic method is effective to control the duration of watering and to maintain the optimum temperature and humidity inside the greenhouse

Software Engineering with Formal Methods: The Development of a Storm Surge Barrier Control System - Revisiting Seven Myths of Formal Methods

NARCIS (Netherlands)

Tretmans, G.J.; Wijbrans, K.C.J.; Chaudron, M.

2001-01-01

This paper discusses the use of formal methods in the development of the control system for the Maeslant Kering. The Maeslant Kering is the movable dam which has to protect Rotterdam from floodings while, at (almost) the same time, not restricting ship traffic to the port of Rotterdam. The control

Practice-Oriented Formal Methods to Support the Software Development of Industrial Control Systems

CERN Document Server

AUTHOR|(CDS)2088632; Blanco Viñuela, Enrique

Formal specification and verification methods provide ways to describe requirements precisely and to check whether the requirements are satisfied by the design or the implementation. In other words, they can prevent development faults and therefore improve the quality of the developed systems. These methods are part of the state-of-the-practice in application domains with high criticality, such as avionics, railway or nuclear industry. The situation is different in the industrial control systems domain. As the criticality of the systems is much lower, formal methods are rarely used. The two main obstacles to using formal methods in systems with low- or medium-criticality are performance and usability. Overcoming these obstacles often needs deep knowledge and high effort. Model checking, one of the main formal verification techniques, is computationally difficult, therefore the analysis of non-trivial systems requires special considerations. Furthermore, the mainly academic tools implementing different model c...

A note on the translation of conceptual data models into description logics: disjointness and covering assumptions

CSIR Research Space (South Africa)

Casini, G

2012-10-01

Full Text Available possibilities for conceptual data modeling. It also raises the question of how existing conceptual models using ER, UML or ORM could be translated into Description Logics (DLs), a family of logics that have proved to be particularly appropriate for formalizing...

Conference on Logical Methods

CERN Document Server

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

Modern Logical Frameworks Design

DEFF Research Database (Denmark)

Murawska, Agata Anna

2017-01-01

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

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

DEFF Research Database (Denmark)

Bolander, Thomas

2003-01-01

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

The Leibniz principle in quantum logic

International Nuclear Information System (INIS)

Giuntini, R.; Mittelstaedt, P.

1989-01-01

The principle of the identity of indiscernibles (Leibniz Principle) is investigated within the framework of the formal language of quantum physics, which is given by an orthomodular lattice. The authors show that the validity of this principle is based on very strong preconditions (concerning the existence of convenient predicates) which are given in the language of classical physics but which cannot be fulfilled in orthomodular quantum logic

Formalization of the Integral Calculus in the PVS Theorem Prover

Directory of Open Access Journals (Sweden)

Ricky Wayne Butler

2009-04-01

Full Text Available The PVS Theorem prover is a widely used formal verification tool used for the analysis of safetycritical systems. The PVS prover, though fully equipped to support deduction in a very general logic framework, namely higher-order logic, it must nevertheless, be augmented with the definitions and associated theorems for every branch of mathematics and Computer Science that is used in a verification. This is a formidable task, ultimately requiring the contributions of researchers and developers all over the world. This paper reports on the formalization of the integral calculus in the PVS theorem prover. All of the basic definitions and theorems covered in a first course on integral calculus have been completed.The theory and proofs were based on Rosenlicht’s classic text on real analysis and follow the traditional epsilon-delta method. The goal of this work was to provide a practical set of PVS theories that could be used for verification of hybrid systems that arise in air traffic management systems and other aerospace applications. All of the basic linearity, integrability, boundedness, and continuity properties of the integral calculus were proved. The work culminated in the proof of the Fundamental Theorem Of Calculus. There is a brief discussion about why mechanically checked proofs are so much longer than standard mathematics textbook proofs.

Logical foundations of the Jauch-Piron approach to quantum physics

International Nuclear Information System (INIS)

Cattaneo, G.; Pozza, C.D.; Garola, C.; Nistico, G.

1988-01-01

We make a critical analysis of the basic concepts of the Jauch-Piron (JP) approach to quantum physics. Then, we exhibit a formalized presentation of the mathematical structure of the JP theory by introducing it as a completely formalized syntactic system, i.e., we construct a formalized language L/sub e/ and formally state the logical-deductive structure of the JP theory by means of L/sub e/. Finally, we show that the JP syntactic system can be endowed with an intended interpretation, which yields a physical model of the system. A mathematical model endowed with a physical interpretation is given which establishes (in the usual sense of the model theory) the coherence of the JP syntactic system

Towards a Formal Model of Privacy-Sensitive Dynamic Coalitions

Directory of Open Access Journals (Sweden)

Sebastian Bab

2012-04-01

Full Text Available The concept of dynamic coalitions (also virtual organizations describes the temporary interconnection of autonomous agents, who share information or resources in order to achieve a common goal. Through modern technologies these coalitions may form across company, organization and system borders. Therefor questions of access control and security are of vital significance for the architectures supporting these coalitions. In this paper, we present our first steps to reach a formal framework for modeling and verifying the design of privacy-sensitive dynamic coalition infrastructures and their processes. In order to do so we extend existing dynamic coalition modeling approaches with an access-control-concept, which manages access to information through policies. Furthermore we regard the processes underlying these coalitions and present first works in formalizing these processes. As a result of the present paper we illustrate the usefulness of the Abstract State Machine (ASM method for this task. We demonstrate a formal treatment of privacy-sensitive dynamic coalitions by two example ASMs which model certain access control situations. A logical consideration of these ASMs can lead to a better understanding and a verification of the ASMs according to the aspired specification.

Logic of artistic development. The case of Mondrian

NARCIS (Netherlands)

Haaften, A.W. van

2004-01-01

In this article I show how we can give a formal representation and analysis of evolutions in artistic style, using the work of the painter Mondrian as an example. Capitalising on the idea that radical change in thought implies related changes in judgement criteria, we can in a ''logic of

Logic of artistic development. The case of Mondrian

NARCIS (Netherlands)

Haaften, A.W. van

2003-01-01

In this article I show how we can give a formal representation and analysis of evolutions in artistic style, using the work of the painter Mondrian as an example. Capitalising on the idea that radical change in thought implies related changes in judgement criteria, we can in a ''logic of

Bio-Inspired Genetic Algorithms with Formalized Crossover Operators for Robotic Applications.

Science.gov (United States)

Zhang, Jie; Kang, Man; Li, Xiaojuan; Liu, Geng-Yang

2017-01-01

Genetic algorithms are widely adopted to solve optimization problems in robotic applications. In such safety-critical systems, it is vitally important to formally prove the correctness when genetic algorithms are applied. This paper focuses on formal modeling of crossover operations that are one of most important operations in genetic algorithms. Specially, we for the first time formalize crossover operations with higher-order logic based on HOL4 that is easy to be deployed with its user-friendly programing environment. With correctness-guaranteed formalized crossover operations, we can safely apply them in robotic applications. We implement our technique to solve a path planning problem using a genetic algorithm with our formalized crossover operations, and the results show the effectiveness of our technique.

Specifying and Verifying Organizational Security Properties in First-Order Logic

Science.gov (United States)

Brandt, Christoph; Otten, Jens; Kreitz, Christoph; Bibel, Wolfgang

In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell-La Padula. We show that these policies can be represented by formal requirements and constraints in first-order logic. By additionally providing a formal model for the flow of data between business departments we demonstrate how security policies can be applied to a concrete organizational setting and checked with a first-order theorem prover. Our approach can be applied without requiring a deep formal expertise and it therefore promises a high potential of usability in the business.

Logical frameworks for truth and abstraction an axiomatic study

CERN Document Server

Cantini, A

1996-01-01

This English translation of the author's original work has been thoroughly revised, expanded and updated. The book covers logical systems known as type-free or self-referential. These traditionally arise from any discussion on logical and semantical paradoxes. This particular volume, however, is not concerned with paradoxes but with the investigation of type-free sytems to show that: (i) there are rich theories of self-application, involving both operations and truth which can serve as foundations for property theory and formal semantics; (ii) these theories provide a new outlook on classical

Formal verification of reactor process control software using assertion checking environment

International Nuclear Information System (INIS)

Sharma, Babita; Balaji, Sowmya; John, Ajith K.; Bhattacharjee, A.K.; Dhodapkar, S.D.

2005-01-01

Assertion Checking Environment (ACE) was developed in-house for carrying out formal (rigorous/ mathematical) functional verification of embedded software written in MISRA C. MISRA C is an industrially sponsored safe sub-set of C programming language and is well accepted in the automotive and aerospace industries. ACE uses static assertion checking technique for verification of MISRA C programs. First the functional specifications of the program are derived from the specifications in the form of pre- and post-conditions for each C function. These pre- and post-conditions are then introduced as assertions (formal comments) in the program code. The annotated C code is then formally verified using ACE. In this paper we present our experience of using ACE for the formal verification of process control software of a nuclear reactor. The Software Requirements Document (SRD) contained textual specifications of the process control software. The SRD was used by the designers to draw logic diagrams which were given as input to a code generator. The verification of the generated C code was done at 2 levels viz. (i) verification against specifications derived from logic diagrams, and (ii) verification against specifications derived from SRD. In this work we checked approximately 600 functional specifications of the software having roughly 15000 lines of code. (author)

How Do Higher-Education Students Use Their Initial Understanding to Deal with Contextual Logic-Based Problems in Discrete Mathematics?

Science.gov (United States)

Lubis, Asrin; Nasution, Andrea Arifsyah

2017-01-01

Mathematical reasoning in logical context has now received much attention in the mathematics curriculum documents of many countries, including Indonesia. In Indonesia, students start formally learning about logic when they pursue to senior-high school. Before, they previously have many experiences to deal with logic, but the earlier assignments do…

Logic in the curricula of Computer Science

Directory of Open Access Journals (Sweden)

Margareth Quindeless

2014-12-01

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

Nonmonotonic reasoning in description logics. Rational closure for the ABox

CSIR Research Space (South Africa)

Casini, G

2013-07-01

Full Text Available The introduction of defeasible reasoning in Description Logics has been a main research topic in the field in the last years. Despite the fact that various interesting formalizations of nonmonotonic reasoning for the TBox have been proposed...

Formal methods for dynamical systems : 13th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2013, Bertinoro, Italy, June 17-22, 2013 : advanced lectures

NARCIS (Netherlands)

Bernardo, M.; Vink, de E.P.; Di Pierro, A.; Wiklicky, H.

2013-01-01

Preface. This volume presents a set of papers accompanying the lectures of the 13th International School on Formal Methods for the Design of Computer, Communication, and Software Systems (SFM). This series of schools addresses the use of formal methods in computer science as a prominent approach to

Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis

Directory of Open Access Journals (Sweden)

José Meseguer

2010-09-01

Full Text Available Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc, including a rewriting logic semantics developed by the authors. Orc also has a fully fledged implementation in Java with functional programming features. However, as with descriptions of most distributed languages, there exists a fairly substantial gap between Orc's formal semantics and its implementation, in that: (i programs in Orc are not easily deployable in a distributed implementation just by using Orc's formal semantics, and (ii they are not readily formally analyzable at the level of a distributed Orc implementation. In this work, we overcome problems (i and (ii for Orc. Specifically, we describe an implementation technique based on rewriting logic and Maude that narrows this gap considerably. The enabling feature of this technique is Maude's support for external objects through TCP sockets. We describe how sockets are used to implement Orc site calls and returns, and to provide real-time timing information to Orc expressions and sites. We then show how Orc programs in the resulting distributed implementation can be formally analyzed at a reasonable level of abstraction by defining an abstract model of time and the socket communication infrastructure, and discuss the assumptions under which the analysis can be deemed correct. Finally, the distributed implementation and the formal analysis methodology are illustrated with a case study.

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

International Nuclear Information System (INIS)

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

2003-01-01

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

Design and verification of distributed logic controllers with application of Petri nets

Energy Technology Data Exchange (ETDEWEB)

Wiśniewski, Remigiusz; Grobelna, Iwona; Grobelny, Michał; Wiśniewska, Monika [University of Zielona Góra, Licealna 9, 65-417 Zielona Góra (Poland)

2015-12-31

The paper deals with the designing and verification of distributed logic controllers. The control system is initially modelled with Petri nets and formally verified against structural and behavioral properties with the application of the temporal logic and model checking technique. After that it is decomposed into separate sequential automata that are working concurrently. Each of them is re-verified and if the validation is successful, the system can be finally implemented.

Formal Solutions for Polarized Radiative Transfer. II. High-order Methods

Energy Technology Data Exchange (ETDEWEB)

Janett, Gioele; Steiner, Oskar; Belluzzi, Luca, E-mail: gioele.janett@irsol.ch [Istituto Ricerche Solari Locarno (IRSOL), 6605 Locarno-Monti (Switzerland)

2017-08-20

When integrating the radiative transfer equation for polarized light, the necessity of high-order numerical methods is well known. In fact, well-performing high-order formal solvers enable higher accuracy and the use of coarser spatial grids. Aiming to provide a clear comparison between formal solvers, this work presents different high-order numerical schemes and applies the systematic analysis proposed by Janett et al., emphasizing their advantages and drawbacks in terms of order of accuracy, stability, and computational cost.

Regaining the Square of Opposition in Formal Ontology Development

DEFF Research Database (Denmark)

Nilsson, Jørgen Fischer

2014-01-01

be held simply in the case that "all P are Q" does not hold. These default rules are routinely adopted in ontology development without mentioning. Appealing to these conventions, the 4 sentence forms in the square are effectively made at disposal. We discuss a first order metalogical formalization...... of the 4 sentence forms with classes reified as individual constants elucidating the logical relationships between the sentence forms. Our formalization appeals to non-provability. Non-provability incurs non-monotonicity, implying that extension of an ontology with additional subclass relationships may...

Modular Logic Programming for Web Data, Inheritance and Agents

Science.gov (United States)

Karali, Isambo

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

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

Science.gov (United States)

Yasin, Saad Yaser

2002-09-01

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

Syntax, Concepts, and Logic in the Temporal Dynamics of Language Comprehension: Evidence from Event-Related Potentials

Science.gov (United States)

Steinhauer, Karsten; Drury, John E.; Portner, Paul; Walenski, Matthew; Ullman, Michael T.

2010-01-01

Logic has been intertwined with the study of language and meaning since antiquity, and such connections persist in present day research in linguistic theory (formal semantics) and cognitive psychology (e.g., studies of human reasoning). However, few studies in cognitive neuroscience have addressed logical dimensions of sentence-level language…

Method of Automatic Ontology Mapping through Machine Learning and Logic Mining

Institute of Scientific and Technical Information of China (English)

王英林

2004-01-01

Ontology mapping is the bottleneck of handling conflicts among heterogeneous ontologies and of implementing reconfiguration or interoperability of legacy systems. We proposed an ontology mapping method by using machine learning, type constraints and logic mining techniques. This method is able to find concept correspondences through instances and the result is optimized by using an error function; it is able to find attribute correspondence between two equivalent concepts and the mapping accuracy is enhanced by combining together instances learning, type constraints and the logic relations that are imbedded in instances; moreover, it solves the most common kind of categorization conflicts. We then proposed a merging algorithm to generate the shared ontology and proposed a reconfigurable architecture for interoperation based on multi agents. The legacy systems are encapsulated as information agents to participate in the integration system. Finally we give a simplified case study.

Nonmonotonic Skeptical Consequence Relation in Constrained Default Logic

Directory of Open Access Journals (Sweden)

Mihaiela Lupea

2010-12-01

Full Text Available This paper presents a study of the nonmonotonic consequence relation which models the skeptical reasoning formalised by constrained default logic. The nonmonotonic skeptical consequence relation is defined using the sequent calculus axiomatic system. We study the formal properties desirable for a good nonmonotonic relation: supraclassicality, cut, cautious monotony, cumulativity, absorption, distribution. 

Formal modelling and analysis of socio-technical systems

DEFF Research Database (Denmark)

Probst, Christian W.; Kammüller, Florian; Hansen, Rene Rydhof

2016-01-01

systems are still mostly identified through brainstorming of experts. In this work we discuss several approaches to formalising socio-technical systems and their analysis. Starting from a flow logic-based analysis of the insider threat, we discuss how to include the socio aspects explicitly, and show......Attacks on systems and organisations increasingly exploit human actors, for example through social engineering. This non-technical aspect of attacks complicates their formal treatment and automatic identification. Formalisation of human behaviour is difficult at best, and attacks on socio-technical...... a formalisation that proves properties of this formalisation. On the formal side, our work closes the gap between formal and informal approaches to socio-technical systems. On the informal side, we show how to steal a birthday cake from a bakery by social engineering....

Applying formal method to design of nuclear power plant embedded protection system

International Nuclear Information System (INIS)

Kim, Jin Hyun; Kim, Il Gon; Sung, Chang Hoon; Choi, Jin Young; Lee, Na Young

2001-01-01

Nuclear power embedded protection systems is a typical safety-critical system, which detects its failure and shutdowns its operation of nuclear reactor. These systems are very dangerous so that it absolutely requires safety and reliability. Therefore nuclear power embedded protection system should fulfill verification and validation completely from the design stage. To develop embedded system, various V and V method have been provided and especially its design using Formal Method is studied in other advanced country. In this paper, we introduce design method of nuclear power embedded protection systems using various Formal-Method in various respect following nuclear power plant software development guideline

Dependable Design Flow for Protection Systems using Programmable Logic Devices

CERN Document Server

Kwiatkowski, M

2011-01-01

Programmable Logic Devices (PLD) such as Field Programmable Gate Arrays (FPGA) are becoming more prevalent in protection and safety-related electronic systems. When employing such programmable logic devices, extra care and attention needs to be taken. The final synthesis result, used to generate the bit-stream to program the device, must be shown to meet the design’s requirements. This paper describes how to maximize confidence using techniques such as Formal Methods, exhaustive Hardware Description Language (HDL) code simulation and hardware testing. An example is given for one of the critical functions of the Safe Machine Parameters (SMP) system, used in the protection of the Large Hadron Collider (LHC) at CERN. CERN is also working towards an adaptation of the IEC- 61508 lifecycle designed for Machine Protection Systems (MPS), and the High Energy Physics environment, implementation of a protection function in FPGA code is only one small step of this lifecycle. The ultimate aim of this project is to cre...

A Fuzzy Logic Based Method for Analysing Test Results

Directory of Open Access Journals (Sweden)

Le Xuan Vinh

2017-11-01

Full Text Available Network operators must perform many tasks to ensure smooth operation of the network, such as planning, monitoring, etc. Among those tasks, regular testing of network performance, network errors and troubleshooting is very important. Meaningful test results will allow the operators to evaluate network performanceof any shortcomings and to better plan for network upgrade. Due to the diverse and mainly unquantifiable nature of network testing results, there is a needs to develop a method for systematically and rigorously analysing these results. In this paper, we present STAM (System Test-result Analysis Method which employs a bottom-up hierarchical processing approach using Fuzzy logic. STAM is capable of combining all test results into a quantitative description of the network performance in terms of network stability, the significance of various network erros, performance of each function blocks within the network. The validity of this method has been successfully demonstrated in assisting the testing of a VoIP system at the Research Instiute of Post and Telecoms in Vietnam. The paper is organized as follows. The first section gives an overview of fuzzy logic theory the concepts of which will be used in the development of STAM. The next section describes STAM. The last section, demonstrating STAM’s capability, presents a success story in which STAM is successfully applied.

LOGICAL REASONING ABILITY AND STUDENT PERFORMANCE IN GENERAL CHEMISTRY.

Science.gov (United States)

Bird, Lillian

2010-03-01

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

Towards an arithmetical logic the arithmetical foundations of logic

CERN Document Server

Gauthier, Yvon

2015-01-01

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

Project Management Plan for the INEL technology logic diagrams

International Nuclear Information System (INIS)

Rudin, M.J.

1992-10-01

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

Quantum logical states and operators for Josephson-like systems

International Nuclear Information System (INIS)

Faoro, Lara; Raffa, Francesco A; Rasetti, Mario

2006-01-01

We give a formal algebraic description of Josephson-type quantum dynamical systems, i.e., Hamiltonian systems with a cos θ-like potential term. The two-boson Heisenberg algebra plays for such systems the role that the h(1) algebra does for the harmonic oscillator. A single Josephson junction is selected as a representative of Josephson systems. We construct both logical states (codewords) and logical (gate) operators in the superconductive regime. The codewords are the even and odd coherent states of the two-boson algebra: they are shift-resistant and robust, due to squeezing. The logical operators acting on the qubit codewords are expressed in terms of operators in the enveloping of the two-boson algebra. Such a scheme appears to be relevant for quantum information applications. (letter to the editor)

Confluence of an extension of combinatory logic by Boolean constants

DEFF Research Database (Denmark)

Czajka, Łukasz

2017-01-01

We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....

Development of Smart Sensors System Based on Formal Concept Analysis and Ontology Model

Directory of Open Access Journals (Sweden)

Hongsheng Xu

2013-06-01

Full Text Available The smart sensor is the product of the combination of one or more sensitive components, precision analog circuits, digital circuits, microprocessor, communication interface, intelligent software systems and hardware integration in a packaging component. Formal concept analysis is from the given data to automatically extract the classification relationship between the entire hidden concept and concept, formation of concept model. Ontology is a set of relations between concepts of the specific domain and concept, and it can effectively express the general knowledge of specific field. The paper proposes development of smart sensors system based on formal concept analysis and ontology model. Smart sensor is a micro processor, sensor with information detection, information processing, information memory, logical thinking and judging function. The methods can improve the effect of the smart sensors.

Formal Specification and Verification of Real-Time Multi-Agent Systems using Timed-Arc Petri Nets

Directory of Open Access Journals (Sweden)

QASIM, A.

2015-08-01

Full Text Available In this study we have formally specified and verified the actions of communicating real-time software agents (RTAgents. Software agents are expected to work autonomously and deal with unfamiliar situations astutely. Achieving cent percent test cases coverage for these agents has always been a problem due to limited resources. Also a high degree of dependability and predictability is expected from real-time software agents. In this research we have used Timed-Arc Petri Net's for formal specification and verification. Formal specification of e-agents has been done in the past using Linear Temporal Logic (LTL but we believe that Timed-Arc Petri Net's being more visually expressive provides a richer framework for such formalism. A case study of Stock Market System (SMS based on Real Time Multi Agent System framework (RTMAS using Timed-Arc Petri Net's is taken to illustrate the proposed modeling approach. The model was verified used AF, AG, EG, and EF fragments of Timed Computational Tree Logic (TCTL via translations to timed automata.

Universal programmable logic gate and routing method

Science.gov (United States)

Fijany, Amir (Inventor); Vatan, Farrokh (Inventor); Akarvardar, Kerem (Inventor); Blalock, Benjamin (Inventor); Chen, Suheng (Inventor); Cristoloveanu, Sorin (Inventor); Kolawa, Elzbieta (Inventor); Mojarradi, Mohammad M. (Inventor); Toomarian, Nikzad (Inventor)

2009-01-01

An universal and programmable logic gate based on G.sup.4-FET technology is disclosed, leading to the design of more efficient logic circuits. A new full adder design based on the G.sup.4-FET is also presented. The G.sup.4-FET can also function as a unique router device offering coplanar crossing of signal paths that are isolated and perpendicular to one another. This has the potential of overcoming major limitations in VLSI design where complex interconnection schemes have become increasingly problematic.

Proposition for a logical formalism of expression and of temporal properties verification on repetitive events devoted to the analysis of execution traces; Proposition pour un formalisme logique d`expression et de verification de proprietes temporelles sur des evenements repetitifs destine a l`analyse de traces d`execution

Energy Technology Data Exchange (ETDEWEB)

Le Campion, J.M.

1996-01-30

To provide safety analysis of complex real time systems which have been developed for the protection of French nuclear Plants, the CEA is interested in software testing validation techniques. These series of tests are made by a purely software simulation of the system. The purpose is to establish the truth of some critical properties of the programs either at the simulation run time or after its execution. The operator is able to describe the variation of some inputs parameters of the programs and shows the results with graphics facilities. An important need was to describe formally some categories of properties expressed in terms of academic examples. We thought that a logical textual language was appropriate to achieve this formal expression. This thesis describe a new data-flow language called EFRI extending the semantic of interval temporal logics. Then we describe a calculus using regular languages on arrays which associates to each formula of the EFRI language a regular expression. With this method, the verification of a property described by a formula of EFRI can be viewed as a classical problem of languages theory: does a word belongs to a regular language. We can then build a finite automaton to recognize complex temporal diagrams. (author). 38 refs., 7 tabs., 4 appends.

The Limits of Logic-Based Inherent Safety of Social Robots

DEFF Research Database (Denmark)

Bentzen, Martin Mose

2017-01-01

Social robots can reason and act while taking into accountsocial and cultural structures, for instance by complying withsocial or ethical norms or values. As social robots are likely to becomemore common and advanced and thus likely to interact withhuman beings in increasingly complex situations......-based safety for ethical robots is shown. Afterwards,an empirical study is used to show that there is a clash betweendeontic reasoning and most formal deontic logics. I give anexample as to how this clash can cause problems in human-robot interaction.I conclude that deontic logics closer to natural...... languagereasoning are needed and that logic only should play a limited partin the overall safety architecture of a social robot, which should alsobe based on other principles of safe design....

Methods for identifying SNP interactions: a review on variations of Logic Regression, Random Forest and Bayesian logistic regression.

Science.gov (United States)

Chen, Carla Chia-Ming; Schwender, Holger; Keith, Jonathan; Nunkesser, Robin; Mengersen, Kerrie; Macrossan, Paula

2011-01-01

Due to advancements in computational ability, enhanced technology and a reduction in the price of genotyping, more data are being generated for understanding genetic associations with diseases and disorders. However, with the availability of large data sets comes the inherent challenges of new methods of statistical analysis and modeling. Considering a complex phenotype may be the effect of a combination of multiple loci, various statistical methods have been developed for identifying genetic epistasis effects. Among these methods, logic regression (LR) is an intriguing approach incorporating tree-like structures. Various methods have built on the original LR to improve different aspects of the model. In this study, we review four variations of LR, namely Logic Feature Selection, Monte Carlo Logic Regression, Genetic Programming for Association Studies, and Modified Logic Regression-Gene Expression Programming, and investigate the performance of each method using simulated and real genotype data. We contrast these with another tree-like approach, namely Random Forests, and a Bayesian logistic regression with stochastic search variable selection.

Induction and Confirmation Theory: An Approach based on a Paraconsistent Nonmonotonic Logic

Directory of Open Access Journals (Sweden)

Ricardo Sousa Silvestre

2010-12-01

Full Text Available This paper is an effort to realize and explore the connections that exist between nonmonotonic logic and confirmation theory. We pick up one of the most wide-spread nonmonotonic formalisms – default logic – and analyze to what extent and under what adjustments it could work as a logic of induction in the philosophical sense. By making use of this analysis, we extend default logic so as to make it able to minimally perform the task of a logic of induction, having as a result a system which we believe has interesting properties from the standpoint of theory of confirmation. It is for instance able to represent chains of inductive rules as well as to reason paraconsistently on the conclusions obtained from them. We then use this logic to represent some traditional ideas concerning confirmation theory, in particular the ones proposed by Carl Hempel in his classical paper “Studies in the Logic of Confirmation” of 1945 and the ones incorporated in the so-called abductive and hy-pothetico-deductive models.

Induction and Confirmation Theory: An Approach based on a Paraconsistent Nonmonotonic Logic

Directory of Open Access Journals (Sweden)

Ricardo Sousa Silvestre

2011-05-01

Full Text Available This paper is an effort to realize and explore the connections that exist between nonmonotonic logic and confirmation theory. We pick up one of the most wide-spread nonmonotonic formalisms – default logic – and analyze to what extent and under what adjustments it could work as a logic of induction in the philosophical sense. By making use of this analysis, we extend default logic so as to make it able to minimally perform the task of a logic of induction, having as a result a system which we believe has interesting properties from the standpoint of theory of confirmation. It is for instance able to represent chains of inductive rules as well as to reason paraconsistently on the conclusions obtained from them. We then use this logic to represent some traditional ideas concerning confirmation theory, in particular the ones proposed by Carl Hempel in his classical paper "Studies in the Logic of Confirmation" of 1945 and the ones incorporated in the so-called abductive and hy-pothetico-deductive models.

Logic and structure

CERN Document Server

Dalen, Dirk

1983-01-01

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

An Entry Point for Formal Methods: Specification and Analysis of Event Logs

Directory of Open Access Journals (Sweden)

Howard Barringer

2010-03-01

Full Text Available Formal specification languages have long languished, due to the grave scalability problems faced by complete verification methods. Runtime verification promises to use formal specifications to automate part of the more scalable art of testing, but has not been widely applied to real systems, and often falters due to the cost and complexity of instrumentation for online monitoring. In this paper we discuss work in progress to apply an event-based specification system to the logging mechanism of the Mars Science Laboratory mission at JPL. By focusing on log analysis, we exploit the "instrumentation" already implemented and required for communicating with the spacecraft. We argue that this work both shows a practical method for using formal specifications in testing and opens interesting research avenues, including a challenging specification learning problem.

Empirical logic and tensor products

International Nuclear Information System (INIS)

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

1981-01-01

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

Formal Methods in Air Traffic Management: The Case of Unmanned Aircraft Systems

Science.gov (United States)

Munoz, Cesar A.

2015-01-01

As the technological and operational capabilities of unmanned aircraft systems (UAS) continue to grow, so too does the need to introduce these systems into civil airspace. Unmanned Aircraft Systems Integration in the National Airspace System is a NASA research project that addresses the integration of civil UAS into non-segregated airspace operations. One of the major challenges of this integration is the lack of an onboard pilot to comply with the legal requirement that pilots see and avoid other aircraft. The need to provide an equivalent to this requirement for UAS has motivated the development of a detect and avoid (DAA) capability to provide the appropriate situational awareness and maneuver guidance in avoiding and remaining well clear of traffic aircraft. Formal methods has played a fundamental role in the development of this capability. This talk reports on the formal methods work conducted under NASA's Safe Autonomous System Operations project in support of the development of DAA for UAS. This work includes specification of low-level and high-level functional requirements, formal verification of algorithms, and rigorous validation of software implementations. The talk also discusses technical challenges in formal methods research in the context of the development and safety analysis of advanced air traffic management concepts.

The effectiveness of module based on guided inquiry method to improve students’ logical thinking ability

Science.gov (United States)

Ash-Shiddieqy, M. H.; Suparmi, A.; Sunarno, W.

2018-04-01

The purpose of this research is to understand the effectiveness of module based on guided inquiry method to improve students’ logical thinking ability. This research only evaluate the students’ logical ability after follows the learning activities that used developed physics module based on guided inquiry method. After the learning activities, students This research method uses a test instrument that adapts TOLT instrument. There are samples of 68 students of grade XI taken from SMA Negeri 4 Surakarta.Based on the results of the research can be seen that in the experimental class and control class, the posttest value aspect of probabilistic reasoning has the highest value than other aspects, whereas the posttest value of the proportional reasoning aspect has the lowest value. The average value of N-gain in the experimental class is 0.39, while in the control class is 0.30. Nevertheless, the N-gain values obtained in the experimental class are larger than the control class, so the guided inquiry-based module is considered more effective for improving students’ logical thinking. Based on the data obtained from the research shows the modules available to help teachers and students in learning activities. The developed Physics module is integrated with every syntax present in guided inquiry method, so it can be used to improve students’ logical thinking ability.

INFORMATIONAL-METHODICAL SUPPORT OF THE COURSE «MATHEMATICAL LOGIC AND THEORY OF ALGORITHMS»

Directory of Open Access Journals (Sweden)

Y. I. Sinko

2010-06-01

Full Text Available In this article the basic principles of training technique of future teachers of mathematics to foundations of mathematical logic and theory of algorithms in the Kherson State University with the use of information technologies are examined. General description of functioning of the methodical system of learning of mathematical logic with the use of information technologies, in that variant, when information technologies are presented by the integrated specialized programmatic environment of the educational purpose «MatLog» is given.

Formal Analysis of Soft Errors using Theorem Proving

Directory of Open Access Journals (Sweden)

Sofiène Tahar

2013-07-01

Full Text Available Modeling and analysis of soft errors in electronic circuits has traditionally been done using computer simulations. Computer simulations cannot guarantee correctness of analysis because they utilize approximate real number representations and pseudo random numbers in the analysis and thus are not well suited for analyzing safety-critical applications. In this paper, we present a higher-order logic theorem proving based method for modeling and analysis of soft errors in electronic circuits. Our developed infrastructure includes formalized continuous random variable pairs, their Cumulative Distribution Function (CDF properties and independent standard uniform and Gaussian random variables. We illustrate the usefulness of our approach by modeling and analyzing soft errors in commonly used dynamic random access memory sense amplifier circuits.

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

Directory of Open Access Journals (Sweden)

Mitsuhiko Fujio

2012-01-01

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

A formal account of the dual extension of knowledge and concept in C-K design theory

NARCIS (Netherlands)

Hendriks, L.; Kazakci, A.O.; Marjanović, D.; Štorga, M.; Pavković, N.; Bojčetić, N.

2010-01-01

The paper presents a contribution to the formalization efforts of C-K design theory. First, we analyze the notion of "dual expansion of concepts and knowledge" in C-K design theory and we discuss how such a reasoning process can be modeled using first-order logic. Then, we present a basic formal

Making Sense of Value and Value Co-Creation in Service Logic

OpenAIRE

Grönroos, Christian; Voima, Päivi

2012-01-01

In order to further develop the logic of service, value creation, value co-creation and value have to be formally and rigorously defined, so that the nature, content and locus of value and the roles of service providers and customers in value creation can be unambiguously assessed. In the present article, following the underpinning logic of value-in-use, it is demonstrated that in order to achieve this, value creation is best defined as the customer’s creation of value-in-use. The analysis sh...

Modern logic and quantum mechanics

International Nuclear Information System (INIS)

Garden, R.W.

1984-01-01

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

Masses of Formal Philosophy

DEFF Research Database (Denmark)

Masses of Formal Philosophy is an outgrowth of Formal Philosophy. That book gathered the responses of some of the most prominent formal philosophers to five relatively open and broad questions initiating a discussion of metaphilosophical themes and problems surrounding the use of formal methods i...... in philosophy. Including contributions from a wide range of philosophers, Masses of Formal Philosophy contains important new responses to the original five questions.......Masses of Formal Philosophy is an outgrowth of Formal Philosophy. That book gathered the responses of some of the most prominent formal philosophers to five relatively open and broad questions initiating a discussion of metaphilosophical themes and problems surrounding the use of formal methods...

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

Science.gov (United States)

Xu, Huan

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

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

Science.gov (United States)

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

2013-04-01

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

A Logic Model for Evaluating the Academic Health Department.

Science.gov (United States)

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

2016-01-01

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

MRI definition of target volumes using fuzzy logic method for three-dimensional conformal radiation therapy

International Nuclear Information System (INIS)

Caudrelier, Jean-Michel; Vial, Stephane; Gibon, David; Kulik, Carine; Fournier, Charles; Castelain, Bernard; Coche-Dequeant, Bernard; Rousseau, Jean

2003-01-01

Purpose: Three-dimensional (3D) volume determination is one of the most important problems in conformal radiation therapy. Techniques of volume determination from tomographic medical imaging are usually based on two-dimensional (2D) contour definition with the result dependent on the segmentation method used, as well as on the user's manual procedure. The goal of this work is to describe and evaluate a new method that reduces the inaccuracies generally observed in the 2D contour definition and 3D volume reconstruction process. Methods and Materials: This new method has been developed by integrating the fuzziness in the 3D volume definition. It first defines semiautomatically a minimal 2D contour on each slice that definitely contains the volume and a maximal 2D contour that definitely does not contain the volume. The fuzziness region in between is processed using possibility functions in possibility theory. A volume of voxels, including the membership degree to the target volume, is then created on each slice axis, taking into account the slice position and slice profile. A resulting fuzzy volume is obtained after data fusion between multiorientation slices. Different studies have been designed to evaluate and compare this new method of target volume reconstruction and a classical reconstruction method. First, target definition accuracy and robustness were studied on phantom targets. Second, intra- and interobserver variations were studied on radiosurgery clinical cases. Results: The absolute volume errors are less than or equal to 1.5% for phantom volumes calculated by the fuzzy logic method, whereas the values obtained with the classical method are much larger than the actual volumes (absolute volume errors up to 72%). With increasing MRI slice thickness (1 mm to 8 mm), the phantom volumes calculated by the classical method are increasing exponentially with a maximum absolute error up to 300%. In contrast, the absolute volume errors are less than 12% for phantom

On the Logical Foundations of the Jauch-Piron Approach to Quantum Physics

Science.gov (United States)

Cattaneo, Gianpiero; Pozza, Carlo Dalla; Garola, Claudio; Nisticò, Giuseppe

1988-11-01

We make a critical analysis of the basic concepts of the Jauch-Piron (JP) approach to quantum physics. Then, we exhibit a formalized presentation of the mathematical structure of the JP theory by introducing it as a completely formalized syntactic system, i.e., we construct a formalized language L e and formally state the logical-deductive structure of the JP theory by means of L e . Finally, we show that the JP syntactic system can be endowed with an intended interpretation, which yields a physical model of the system. A mathematical model endowed with a physical interpretation is given which establishes (in the usual sense of the model theory) the coherence of the JP syntactic system.

Method and program for decay scheme reconstruction based on formal logical analysis of gamma-gamma coincidence matrix

International Nuclear Information System (INIS)

Adam, J.; Tsupko-Sitnikov, V.M.

1996-01-01

A new, rigorously substantiated approach to construction of decay schemes on the basis of γ-γ coincidence data is described. Complete decay modes (concrete cascades of transitions from excited to the ground-state of a nucleus excited in a decay or a reaction) and continuity regions in complete modes (regions of successive transitions) are isolated by logical operations with rows (columns) of a symmetrical coincidence matrix where rows (columns) correspond to energies of coinciding transitions and matrix elements are unities and zeros, depending on the presence or absence of the given coincidence. To reject false complete modes and continuity regions arising from incompleteness of the coincidence data and errors in them, energy selection is introduced for complete modes and continuity regions, which demands that total energy of their constituent transitions should be equal to total energy of some other complete modes and continuity regions and to the energies of singles. With the continuity regions found, it is possible to order transitions in the selected complete modes and to algorithmize matching of complete modes into a decay scheme. 10 refs., 3 figs

Interdisciplinarity, logic of uncertainty and fuzzy logic in primary school

Directory of Open Access Journals (Sweden)

Luciana Delli Rocili

2015-12-01

Full Text Available On the occasion of the 120th anniversary of Mathesis, this work wants to be a memory, a tribute to two great presidents of Mathesis: Bruno de Finetti and Angelo Fadini. Both have pursued the idea of interdisciplinary teaching and research. Bruno de Finetti, with his books on The invention of truth, (1934, and on Logic and Intuitive Mathematics, (1959, and his very famous "Theory of probability", (1970, shows a rejection of formal education, comfortable, monodisciplinary, made of certainties, and chooses the impervious way of addressing the problems that are to the base of science. Angelo Fadini, with his papers and books on Theory of Fuzzy Sets, shows first in Italy several logical questions which puts as the basis for practical applications in Architecture. This paper is an attempt to experiment, in an interdisciplinary framework, the basic ideas of Bruno de Finetti and Angelo Fadini in primary school, in the belief that in the Primary School are formed ideas and intuitions, while in the secondary school the attention is focused mainly on specific issues of Mathematics. We shows some results of a still ongoing experimentation.   Interdisciplinarietà, logica dell'incerto e logica sfumata nella scuola primaria In occasione dei 120 anni della Mathesis, questo lavoro vuole essere un ricordo, un omaggio a due grandi Presidenti della Mathesis: Bruno de Finetti e Angelo Fadini. Entrambi hanno portato avanti l’idea della interdisciplinarietà nell’insegnamento e nella ricerca. Bruno de Finetti, con la sua “Matematica Logico Intuitiva” del 1959, e la sua “Teoria delle probabilità”, del 1970, e ancora prima, con “L’invenzione della verità”, del 1934, mostra un rifiuto dell’insegnamento formale, comodo, monodisciplinare, fatto di certezze, e sceglie la strada impervia dell’affrontare i problemi che sono alla base della scienza. Angelo Fadini, con la sua Teoria degli Insiemi Sfocati, mostra per primo in Italia varie questioni

Embedding Logics into Product Logic

Czech Academy of Sciences Publication Activity Database

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

1998-01-01

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

Using logic model methods in systematic review synthesis: describing complex pathways in referral management interventions.

Science.gov (United States)

Baxter, Susan K; Blank, Lindsay; Woods, Helen Buckley; Payne, Nick; Rimmer, Melanie; Goyder, Elizabeth

2014-05-10

There is increasing interest in innovative methods to carry out systematic reviews of complex interventions. Theory-based approaches, such as logic models, have been suggested as a means of providing additional insights beyond that obtained via conventional review methods. This paper reports the use of an innovative method which combines systematic review processes with logic model techniques to synthesise a broad range of literature. The potential value of the model produced was explored with stakeholders. The review identified 295 papers that met the inclusion criteria. The papers consisted of 141 intervention studies and 154 non-intervention quantitative and qualitative articles. A logic model was systematically built from these studies. The model outlines interventions, short term outcomes, moderating and mediating factors and long term demand management outcomes and impacts. Interventions were grouped into typologies of practitioner education, process change, system change, and patient intervention. Short-term outcomes identified that may result from these interventions were changed physician or patient knowledge, beliefs or attitudes and also interventions related to changed doctor-patient interaction. A range of factors which may influence whether these outcomes lead to long term change were detailed. Demand management outcomes and intended impacts included content of referral, rate of referral, and doctor or patient satisfaction. The logic model details evidence and assumptions underpinning the complex pathway from interventions to demand management impact. The method offers a useful addition to systematic review methodologies. PROSPERO registration number: CRD42013004037.

Enric Trillas a passion for fuzzy sets : a collection of recent works on fuzzy logic

CERN Document Server

Verdegay, Jose; Esteva, Francesc

2015-01-01

This book presents a comprehensive collection of the latest and most significant research advances and applications in the field of fuzzy logic. It covers fuzzy structures, rules, operations and mathematical formalisms, as well as important applications of fuzzy logic in a number of fields, like decision-making, environmental prediction and prevention, communication, controls and many others. Dedicated to Enric Trillas in recognition of his pioneering research in the field, the book also includes a foreword by Lotfi A. Zadeh and an outlook on the future of fuzzy logic.

Indicators of Informal and Formal Decision-Making about a Socioscientific Issue

Science.gov (United States)

Dauer, Jenny M.; Lute, Michelle L.; Straka, Olivia

2017-01-01

We propose two contrasting types of student decision-making based on social and cognitive psychology models of separate mental processes for problem solving. Informal decision-making uses intuitive reasoning and is subject to cognitive biases, whereas formal decision-making uses effortful, logical reasoning. We explored indicators of students'…

A Rewriting Logic Approach to Type Inference

Science.gov (United States)

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

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

A vector matching method for analysing logic Petri nets

Science.gov (United States)

Du, YuYue; Qi, Liang; Zhou, MengChu

2011-11-01

Batch processing function and passing value indeterminacy in cooperative systems can be described and analysed by logic Petri nets (LPNs). To directly analyse the properties of LPNs, the concept of transition enabling vector sets is presented and a vector matching method used to judge the enabling transitions is proposed in this article. The incidence matrix of LPNs is defined; an equation about marking change due to a transition's firing is given; and a reachable tree is constructed. The state space explosion is mitigated to a certain extent from directly analysing LPNs. Finally, the validity and reliability of the proposed method are illustrated by an example in electronic commerce.

On the Application of Formal Methods to Clinical Guidelines, an Artificial Intelligence Perspective

NARCIS (Netherlands)

Hommersom, A.J.

2008-01-01

In computer science, all kinds of methods and techniques have been developed to study systems, such as simulation of the behaviour of a system. Furthermore, it is possible to study these systems by proving formal formal properties or by searching through all the possible states that a system may be

Pemodelan dan Verifikasi Formal Protokol EE-OLSR dengan UPPAAL CORA

Directory of Open Access Journals (Sweden)

Rachmat Wahid Saleh Insani

2016-01-01

Protocol verification process generally be done by simulation and testing. However, these processes unable to verify there are no subtle error or design flaw in protocol. Model Checking is an algorithmic method runs in fully automatic to verify a system. UPPAAL is a model checker tool to model, verify, and simulate a system in Timed Automata. UPPAAL CORA is model checker tool to verify EE-OLSR protocol modelled in Linearly Priced Timed Automata, if the protocol satisfy the energy efficient property formulated by formal specification language in Weighted Computation Tree Logic syntax. Model Checking Technique to verify the protocols results in the protocol is satisfy the energy efficient property only when the packet transmission traffic happens.

On Fitting a Formal Method into Practice

DEFF Research Database (Denmark)

Gmehlich, Rainer; Grau, Katrin; Hallerstede, Stefan

2011-01-01

. The interaction between the two proved to be crucial for the success of the case study. The heart of the problem was tracing informal requirements from Problem Frames descriptions to formal Event-B models. To a large degree, this issue dictated the approach that had to be used for formal modelling. A dedicated...

Formal methods in the design of Ada 1995

Science.gov (United States)

Guaspari, David

1995-01-01

Formal, mathematical methods are most useful when applied early in the design and implementation of a software system--that, at least, is the familiar refrain. I will report on a modest effort to apply formal methods at the earliest possible stage, namely, in the design of the Ada 95 programming language itself. This talk is an 'experience report' that provides brief case studies illustrating the kinds of problems we worked on, how we approached them, and the extent (if any) to which the results proved useful. It also derives some lessons and suggestions for those undertaking future projects of this kind. Ada 95 is the first revision of the standard for the Ada programming language. The revision began in 1988, when the Ada Joint Programming Office first asked the Ada Board to recommend a plan for revising the Ada standard. The first step in the revision was to solicit criticisms of Ada 83. A set of requirements for the new language standard, based on those criticisms, was published in 1990. A small design team, the Mapping Revision Team (MRT), became exclusively responsible for revising the language standard to satisfy those requirements. The MRT, from Intermetrics, is led by S. Tucker Taft. The work of the MRT was regularly subject to independent review and criticism by a committee of distinguished Reviewers and by several advisory teams--for example, the two User/Implementor teams, each consisting of an industrial user (attempting to make significant use of the new language on a realistic application) and a compiler vendor (undertaking, experimentally, to modify its current implementation in order to provide the necessary new features). One novel decision established the Language Precision Team (LPT), which investigated language proposals from a mathematical point of view. The LPT applied formal mathematical analysis to help improve the design of Ada 95 (e.g., by clarifying the language proposals) and to help promote its acceptance (e.g., by identifying a

Versatile Formal Methods Applied to Quantum Information.

Energy Technology Data Exchange (ETDEWEB)

Witzel, Wayne [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Rudinger, Kenneth Michael [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Sarovar, Mohan [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)

2015-11-01

Using a novel formal methods approach, we have generated computer-veri ed proofs of major theorems pertinent to the quantum phase estimation algorithm. This was accomplished using our Prove-It software package in Python. While many formal methods tools are available, their practical utility is limited. Translating a problem of interest into these systems and working through the steps of a proof is an art form that requires much expertise. One must surrender to the preferences and restrictions of the tool regarding how mathematical notions are expressed and what deductions are allowed. Automation is a major driver that forces restrictions. Our focus, on the other hand, is to produce a tool that allows users the ability to con rm proofs that are essentially known already. This goal is valuable in itself. We demonstrate the viability of our approach that allows the user great exibility in expressing state- ments and composing derivations. There were no major obstacles in following a textbook proof of the quantum phase estimation algorithm. There were tedious details of algebraic manipulations that we needed to implement (and a few that we did not have time to enter into our system) and some basic components that we needed to rethink, but there were no serious roadblocks. In the process, we made a number of convenient additions to our Prove-It package that will make certain algebraic manipulations easier to perform in the future. In fact, our intent is for our system to build upon itself in this manner.

Intuition and the axiomatic method

CERN Document Server

Carson, Emily

2006-01-01

Following developments in modern geometry, logic and physics, many scientists and philosophers in the modern era considered Kant's theory of intuition to be obsolete. But this only represents one side of the story concerning Kant, intuition and twentieth century science. Several prominent mathematicians and physicists were convinced that the formal tools of modern logic, set theory and the axiomatic method are not sufficient for providing mathematics and physics with satisfactory foundations. All of Hilbert, Gödel, Poincaré, Weyl and Bohr thought that intuition was an indispensable element in

From Safety Analysis to Formal Specification

DEFF Research Database (Denmark)

Hansen, Kirsten Mark; Ravn, Anders P.; Stavridou, Victoria

1998-01-01

Software for safety critical systems must deal with the hazards identified bysafety analysis. This paper investigates, how the results of onesafety analysis technique, fault trees, are interpreted as software safetyrequirements to be used in the program design process. We propose thatfault tree...... analysis and program development use the samesystem model. This model is formalized in areal-time, interval logic, based on a conventional dynamic systems modelwith state evolving over time. Fault trees are interpreted astemporal formulas, and it is shown how such formulas can be usedfor deriving safety...

Fourier Series Formalization in ACL2(r

Directory of Open Access Journals (Sweden)

Cuong K. Chau

2015-09-01

Full Text Available We formalize some basic properties of Fourier series in the logic of ACL2(r, which is a variant of ACL2 that supports reasoning about the real and complex numbers by way of non-standard analysis. More specifically, we extend a framework for formally evaluating definite integrals of real-valued, continuous functions using the Second Fundamental Theorem of Calculus. Our extended framework is also applied to functions containing free arguments. Using this framework, we are able to prove the orthogonality relationships between trigonometric functions, which are the essential properties in Fourier series analysis. The sum rule for definite integrals of indexed sums is also formalized by applying the extended framework along with the First Fundamental Theorem of Calculus and the sum rule for differentiation. The Fourier coefficient formulas of periodic functions are then formalized from the orthogonality relations and the sum rule for integration. Consequently, the uniqueness of Fourier sums is a straightforward corollary. We also present our formalization of the sum rule for definite integrals of infinite series in ACL2(r. Part of this task is to prove the Dini Uniform Convergence Theorem and the continuity of a limit function under certain conditions. A key technique in our proofs of these theorems is to apply the overspill principle from non-standard analysis.

Two-sorted Point-Interval Temporal Logics

DEFF Research Database (Denmark)

Balbiani, Philippe; Goranko, Valentin; Sciavicco, Guido

2011-01-01

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as particular, duration-less intervals. Here we develop explicitly two-sorted point-interval temporal logical framework...... whereby time instants (points) and time periods (intervals) are considered on a par, and the perspective can shift between them within the formal discourse. We focus on fragments involving only modal operators that correspond to the inter-sort relations between points and intervals. We analyze...

IMPROVEMENT OF GRAPH INTERPRETATION ABILITY USING HYPERTEXT-ASSISTED KINEMATIC LEARNING AND FORMAL THINKING ABILITY

Directory of Open Access Journals (Sweden)

S. R. Manurung

2018-01-01

Full Text Available The effectiveness of hypertext media in improving graph interpretation ability is investigated in this paper. In addition, joint ability of the formal thinking to improve the graph ability of prospective students is considered. The research design used is the one-group pretest-posttest experimental design is carried out in the research by taking 36 students on from Physics Education Program in one institute for teacher education in Medan. The test consists of graph interpretation ability test in the topic of kinematics and Test of Logical Thinking (TOLT or formal thinking before learning and graph interpretation ability test after learning. The data are then analysed by using SPSS based two ways Analisys of Variance (ANOVA method. The results show that the ability to interpretate graph is significantly improved by using hypertext media assisted kinematic learning.

SACS2: Dynamic and Formal Safety Analysis Method for Complex Safety Critical System

International Nuclear Information System (INIS)

Koh, Kwang Yong; Seong, Poong Hyun

2009-01-01

Fault tree analysis (FTA) is one of the most widely used safety analysis technique in the development of safety critical systems. However, over the years, several drawbacks of the conventional FTA have become apparent. One major drawback is that conventional FTA uses only static gates and hence can not capture dynamic behaviors of the complex system precisely. Although several attempts such as dynamic fault tree (DFT), PANDORA, formal fault tree (FFT) and so on, have been made to overcome this problem, they can not still do absolute or actual time modeling because they adapt relative time concept and can capture only sequential behaviors of the system. Second drawback of conventional FTA is its lack of rigorous semantics. Because it is informal in nature, safety analysis results heavily depend on an analyst's ability and are error-prone. Finally reasoning process which is to check whether basic events really cause top events is done manually and hence very labor-intensive and timeconsuming for the complex systems. In this paper, we propose a new safety analysis method for complex safety critical system in qualitative manner. We introduce several temporal gates based on timed computational tree logic (TCTL) which can represent quantitative notion of time. Then, we translate the information of the fault trees into UPPAAL query language and the reasoning process is automatically done by UPPAAL which is the model checker for time critical system

The relationship between the Wigner-Weyl kinetic formalism and the complex geometrical optics method

OpenAIRE

Maj, Omar

2004-01-01

The relationship between two different asymptotic techniques developed in order to describe the propagation of waves beyond the standard geometrical optics approximation, namely, the Wigner-Weyl kinetic formalism and the complex geometrical optics method, is addressed. More specifically, a solution of the wave kinetic equation, relevant to the Wigner-Weyl formalism, is obtained which yields the same wavefield intensity as the complex geometrical optics method. Such a relationship is also disc...

Fuzzy-logic based strategy for validation of multiplex methods: example with qualitative GMO assays.

Science.gov (United States)

Bellocchi, Gianni; Bertholet, Vincent; Hamels, Sandrine; Moens, W; Remacle, José; Van den Eede, Guy

2010-02-01

This paper illustrates the advantages that a fuzzy-based aggregation method could bring into the validation of a multiplex method for GMO detection (DualChip GMO kit, Eppendorf). Guidelines for validation of chemical, bio-chemical, pharmaceutical and genetic methods have been developed and ad hoc validation statistics are available and routinely used, for in-house and inter-laboratory testing, and decision-making. Fuzzy logic allows summarising the information obtained by independent validation statistics into one synthetic indicator of overall method performance. The microarray technology, introduced for simultaneous identification of multiple GMOs, poses specific validation issues (patterns of performance for a variety of GMOs at different concentrations). A fuzzy-based indicator for overall evaluation is illustrated in this paper, and applied to validation data for different genetically modified elements. Remarks were drawn on the analytical results. The fuzzy-logic based rules were shown to be applicable to improve interpretation of results and facilitate overall evaluation of the multiplex method.

Mixing Categories and Modal Logics in the Quantum Setting

Science.gov (United States)

Cinà, Giovanni

The study of the foundations of Quantum Mechanics, especially after the advent of Quantum Computation and Information, has benefited from the application of category-theoretic tools and modal logics to the analysis of Quantum processes: we witness a wealth of theoretical frameworks casted in either of the two languages. This paper explores the interplay of the two formalisms in the peculiar context of Quantum Theory. After a review of some influential abstract frameworks, we show how different modal logic frames can be extracted from the category of finite dimensional Hilbert spaces, connecting the Categorical Quantum Mechanics approach to some modal logics that have been proposed for Quantum Computing. We then apply a general version of the same technique to two other categorical frameworks, the `topos approach' of Doering and Isham and the sheaf-theoretic work on contextuality by Abramsky and Brandenburger, suggesting how some key features can be expressed with modal languages.

CODING LOGICAL MECHANISM AND STEREOTYPING IN GENDER CYBER HUMORS

Directory of Open Access Journals (Sweden)

Truly Almendo Pasaribu

2016-07-01

Full Text Available Gender-related humors have their own way of being funny; and this research aims to find out how and why they are funny. For this purpose, both researchers have collected 50 gender cyber humors and analyzed them, first, to decode how their logical mechanism relates to specific linguistic features, and secondly, to uncover how gender stereotyping contributes to the comical effects. The twisting of logic and linguistic ambiguity is analyzed formally using Attardos (2001 General Theory of Verbal Humor (GTVH and supported by gender studies. The findings reveal that the logical mechanism consists of elements of incongruities, and gender stereotyping presents negative stereotypical images. The analysis further shows that some gender stereotypical images ridicule traditional roles of man and woman while others make fun of non-traditional representations. This shift from women only to both men and women as targets of gender humors has been an impact of effective feminist movements.

Technologies for faults diagnosis of FPGA logic blocks

Directory of Open Access Journals (Sweden)

C. U. Ngene

2012-08-01

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

The Halden Reactor Project workshop on improved system development using case-tools based on formal methods

International Nuclear Information System (INIS)

Gran, Bjoern Axel; Sivertsen, Terje; Stoelen, Ketil; Thunem, Harald; Zhang, Wenhui

1999-02-01

The workshop 'Improved system development using case-tools based on formal methods' was organised in Halden, December 1-2, 1998. The purpose of the workshop was to present and discuss the state-of-the-art with respect to formal approaches. The workshop had two invited presentations: 'Formality in specification and modelling: developments in software engineering practice' by John Fitzgerald (Centre for Software Reliability, UK), and 'Formal methods in industry - reaching results when correctness is not the only issue' by Oeystein Haugen (Ericsson NorARC, Norway). The workshop also had several presentations divided into three sessions on industrial experience, tools, and combined approaches. Each day there was a discussion. The first was on the effect of formalization, while the second was on the role of formal verification. At the end of the workshop, the presentations and discussions were summarised into specific recommendations. This report summarises the presentations of the speakers, the discussions, the recommendations, and the demonstrations given at the workshop (author) (ml)

Flat Coalgebraic Fixed Point Logics

Science.gov (United States)

Schröder, Lutz; Venema, Yde

Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the μ-calculus. The family of such flat fixed point logics includes, e.g., CTL, the *-nesting-free fragment of PDL, and the logic of common knowledge. Here, we extend this notion to the generic semantic framework of coalgebraic logic, thus covering a wide range of logics beyond the standard μ-calculus including, e.g., flat fragments of the graded μ-calculus and the alternating-time μ-calculus (such as ATL), as well as probabilistic and monotone fixed point logics. Our main results are completeness of the Kozen-Park axiomatization and a timed-out tableaux method that matches ExpTime upper bounds inherited from the coalgebraic μ-calculus but avoids using automata.

Fuzzy logic of quasi-truth an algebraic treatment

CERN Document Server

Di Nola, Antonio; Turunen, Esko

2016-01-01

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

User Interface Technology for Formal Specification Development

Science.gov (United States)

Lowry, Michael; Philpot, Andrew; Pressburger, Thomas; Underwood, Ian; Lum, Henry, Jr. (Technical Monitor)

1994-01-01

Formal specification development and modification are an essential component of the knowledge-based software life cycle. User interface technology is needed to empower end-users to create their own formal specifications. This paper describes the advanced user interface for AMPHION1 a knowledge-based software engineering system that targets scientific subroutine libraries. AMPHION is a generic, domain-independent architecture that is specialized to an application domain through a declarative domain theory. Formal specification development and reuse is made accessible to end-users through an intuitive graphical interface that provides semantic guidance in creating diagrams denoting formal specifications in an application domain. The diagrams also serve to document the specifications. Automatic deductive program synthesis ensures that end-user specifications are correctly implemented. The tables that drive AMPHION's user interface are automatically compiled from a domain theory; portions of the interface can be customized by the end-user. The user interface facilitates formal specification development by hiding syntactic details, such as logical notation. It also turns some of the barriers for end-user specification development associated with strongly typed formal languages into active sources of guidance, without restricting advanced users. The interface is especially suited for specification modification. AMPHION has been applied to the domain of solar system kinematics through the development of a declarative domain theory. Testing over six months with planetary scientists indicates that AMPHION's interactive specification acquisition paradigm enables users to develop, modify, and reuse specifications at least an order of magnitude more rapidly than manual program development.

Logic and Learning

DEFF Research Database (Denmark)

Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick

2014-01-01

Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study of inform......Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...... of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method....

Formal methods and their applicability in the development of safety critical software systems

International Nuclear Information System (INIS)

Sievertsen, T.

1995-01-01

The OECD Halden Reactor Project has for a number of years been involved in the development and application of a formal software specification and development method based on algebraic specification and the HRP Prover. In parallel to this activity the Project has been evaluating and comparing different methods and approaches to formal software development by their application on realistic case examples. Recent work has demonstrated that algebraic specification and the HRP Prover can be used both in the specification and design of a software system, even down to a concrete model which can be translated into the chosen implementation language. The HRP Prover is currently being used in a case study on the applicability of the methodology in the development of a power range monitoring system for a nuclear power plant. The presentation reviews some of the experiences drawn from the Project's research activities in this area, with special emphasis on questions relating to applicability and limitations, and the role of formal methods in the development of safety-critical software systems. (14 refs., 1 fig.)

Probabilistic logics and probabilistic networks

CERN Document Server

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

2014-01-01

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

A Hierarchy of Compatibility and Comeasurability Levels in Quantum Logics with Unique Conditional Probabilities

International Nuclear Information System (INIS)

Niestegge, Gerd

2010-01-01

In the quantum mechanical Hilbert space formalism, the probabilistic interpretation is a later ad-hoc add-on, more or less enforced by the experimental evidence, but not motivated by the mathematical model itself. A model involving a clear probabilistic interpretation from the very beginning is provided by the quantum logics with unique conditional probabilities. It includes the projection lattices in von Neumann algebras and here probability conditionalization becomes identical with the state transition of the Lueders-von Neumann measurement process. This motivates the definition of a hierarchy of five compatibility and comeasurability levels in the abstract setting of the quantum logics with unique conditional probabilities. Their meanings are: the absence of quantum interference or influence, the existence of a joint distribution, simultaneous measurability, and the independence of the final state after two successive measurements from the sequential order of these two measurements. A further level means that two elements of the quantum logic (events) belong to the same Boolean subalgebra. In the general case, the five compatibility and comeasurability levels appear to differ, but they all coincide in the common Hilbert space formalism of quantum mechanics, in von Neumann algebras, and in some other cases. (general)

Automatic Testing with Formal Methods

NARCIS (Netherlands)

Tretmans, G.J.; Belinfante, Axel

1999-01-01

The use of formal system specifications makes it possible to automate the derivation of test cases from specifications. This allows to automate the whole testing process, not only the test execution part of it. This paper presents the state of the art and future perspectives in testing based on

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

Science.gov (United States)

Chen, Shyi-Ming; Chen, Shen-Wen

2015-03-01

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

Fuzzy logic control to be conventional method

International Nuclear Information System (INIS)

Eker, Ilyas; Torun, Yunis

2006-01-01

Increasing demands for flexibility and fast reactions in modern process operation and production methods result in nonlinear system behaviour of partly unknown systems, and this necessitates application of alternative control methods to meet the demands. Fuzzy logic (FL) control can play an important role because knowledge based design rules can easily be implemented in systems with unknown structure, and it is going to be a conventional control method since the control design strategy is simple and practical and is based on linguistic information. Computational complexity is not a limitation any more because the computing power of computers has been significantly improved even for high speed industrial applications. This makes FL control an important alternative method to the conventional PID control method for use in nonlinear industrial systems. This paper presents a practical implementation of the FL control to an electrical drive system. Such drive systems used in industry are composed of masses moving under the action of position and velocity dependent forces. These forces exhibit nonlinear behaviour. For a multi-mass drive system, the nonlinearities, like Coulomb friction and dead zone, significantly influence the operation of the systems. The proposed FL control configuration is based on speed error and change of speed error. The feasibility and effectiveness of the control method are experimentally demonstrated. The results obtained from conventional FL control, fuzzy PID and adaptive FL control are compared with traditional PID control for the dynamic responses of the closed loop drive system

Fuzzy logic control to be conventional method

Energy Technology Data Exchange (ETDEWEB)

Eker, Ilyas [University of Gaziantep, Gaziantep (Turkey). Department of Electrical and Electronic Engineering; Torun, Yunis [University of Gaziantep, Gaziantep (Turkey). Technical Vocational School of Higher Education

2006-03-01

Increasing demands for flexibility and fast reactions in modern process operation and production methods result in nonlinear system behaviour of partly unknown systems, and this necessitates application of alternative control methods to meet the demands. Fuzzy logic (FL) control can play an important role because knowledge based design rules can easily be implemented in systems with unknown structure, and it is going to be a conventional control method since the control design strategy is simple and practical and is based on linguistic information. Computational complexity is not a limitation any more because the computing power of computers has been significantly improved even for high speed industrial applications. This makes FL control an important alternative method to the conventional PID control method for use in nonlinear industrial systems. This paper presents a practical implementation of the FL control to an electrical drive system. Such drive systems used in industry are composed of masses moving under the action of position and velocity dependent forces. These forces exhibit nonlinear behaviour. For a multi-mass drive system, the nonlinearities, like Coulomb friction and dead zone, significantly influence the operation of the systems. The proposed FL control configuration is based on speed error and change of speed error. The feasibility and effectiveness of the control method are experimentally demonstrated. The results obtained from conventional FL control, fuzzy PID and adaptive FL control are compared with traditional PID control for the dynamic responses of the closed loop drive system. (author)

The multi-criteria optimization for the formation of the multiple-valued logic model of a robotic agent

International Nuclear Information System (INIS)

Bykovsky, A Yu; Sherbakov, A A

2016-01-01

The C-valued Allen-Givone algebra is the attractive tool for modeling of a robotic agent, but it requires the consensus method of minimization for the simplification of logic expressions. This procedure substitutes some undefined states of the function for the maximal truth value, thus extending the initially given truth table. This further creates the problem of different formal representations for the same initially given function. The multi-criteria optimization is proposed for the deliberate choice of undefined states and model formation. (paper)

The gap values in the profile matching method by fuzzy logic

Science.gov (United States)

Sitepu, S. A.; Efendi, S.; Situmorang, Z.

2018-03-01

In this research, the determination of the appropriate values of Gap for the assessment of promotion criteria of position in an institution / company. In this study the authors use Fuzzy Sugeno logic on the determination of Gap values used in Profile Matching method. Test results of 5 employees obtained the eligibility of promotion with the position of Z* values between in 3.20 to 4.11.

Loregic: A Method to Characterize the Cooperative Logic of Regulatory Factors

Science.gov (United States)

Wang, Daifeng; Yan, Koon-Kiu; Sisu, Cristina; Cheng, Chao; Rozowsky, Joel; Meyerson, William; Gerstein, Mark B.

2015-01-01

The topology of the gene-regulatory network has been extensively analyzed. Now, given the large amount of available functional genomic data, it is possible to go beyond this and systematically study regulatory circuits in terms of logic elements. To this end, we present Loregic, a computational method integrating gene expression and regulatory network data, to characterize the cooperativity of regulatory factors. Loregic uses all 16 possible two-input-one-output logic gates (e.g. AND or XOR) to describe triplets of two factors regulating a common target. We attempt to find the gate that best matches each triplet’s observed gene expression pattern across many conditions. We make Loregic available as a general-purpose tool (github.com/gersteinlab/loregic). We validate it with known yeast transcription-factor knockout experiments. Next, using human ENCODE ChIP-Seq and TCGA RNA-Seq data, we are able to demonstrate how Loregic characterizes complex circuits involving both proximally and distally regulating transcription factors (TFs) and also miRNAs. Furthermore, we show that MYC, a well-known oncogenic driving TF, can be modeled as acting independently from other TFs (e.g., using OR gates) but antagonistically with repressing miRNAs. Finally, we inter-relate Loregic’s gate logic with other aspects of regulation, such as indirect binding via protein-protein interactions, feed-forward loop motifs and global regulatory hierarchy. PMID:25884877

Leveraging Formal Methods and Fuzzing to Verify Security and Reliability Properties of Large-Scale High-Consequence Systems

Energy Technology Data Exchange (ETDEWEB)

Ruthruff, Joseph. R. [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Armstrong, Robert C. [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Davis, Benjamin Garry [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Mayo, Jackson R. [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Punnoose, Ratish J. [Sandia National Lab. (SNL-CA), Livermore, CA (United States)

2012-09-01

Formal methods describe a class of system analysis techniques that seek to prove specific properties about analyzed designs, or locate flaws compromising those properties. As an analysis capability,these techniques are the subject of increased interest from both internal and external customers of Sandia National Laboratories. Given this lab's other areas of expertise, Sandia is uniquely positioned to advance the state-of-the-art with respect to several research and application areas within formal methods. This research project was a one-year effort funded by Sandia's CyberSecurity S&T Investment Area in its Laboratory Directed Research & Development program to investigate the opportunities for formal methods to impact Sandia's present mission areas, more fully understand the needs of the research community in the area of formal methods and where Sandia can contribute, and clarify from those potential research paths those that would best advance the mission-area interests of Sandia. The accomplishments from this project reinforce the utility of formal methods in Sandia, particularly in areas relevant to Cyber Security, and set the stage for continued Sandia investments to ensure this capabilityis utilized and advanced within this laboratory to serve the national interest.

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

Science.gov (United States)

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

2012-07-01

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

Formal aspects of resilience

Directory of Open Access Journals (Sweden)

Diana-Maria Drigă

2015-12-01

Full Text Available The concept of resilience has represented during the recent years a leading concern both in Romania, within the European Union and worldwide. Specialists in economics, management, finance, legal sciences, political sciences, sociology, psychology, grant a particular interest to this concept. Multidisciplinary research of resilience has materialized throughout the time in multiple conceptualizations and theorizing, but without being a consensus between specialists in terms of content, specificity and scope. Through this paper it is intended to clarify the concept of resilience, achieving an exploration of the evolution of this concept in ecological, social and economic environment. At the same time, the paper presents aspects of feedback mechanisms and proposes a formalization of resilience using the logic and mathematical analysis.

Evaluating pharmacy leader development through the seven action logics.

Science.gov (United States)

Philip, Achsah; Desai, Avani; Nguyen, Phouc Anne; Birney, Patrick; Colavecchia, Anthony; Karralli, Rusol; Smith, Lindsey; Lorimer, Dirk; Burgess, Gwen; Munch, Kyle; Daniel, Nelvin; Lionetti, Jason; Garey, Kevin W

2016-01-15

Pharmacy leader development over time was analyzed using the seven action logics. As part of an ongoing leadership seminar series, students were required to select a visionary pharmacy leader and conduct a structured interview to evaluate pharmacy leaders' action logics. A standardized questionnaire comprising 13 questions was created by the class. Questions addressed leadership qualities during the leaders' early years, education years, and work years. Transcripts were then coded by two separate trained investigators based on the leader's stage of life to provide a score for each action logic individually over time. Kappa coefficient was used to evaluate interrater agreement. A total of 14 leaders were interviewed. All leaders were currently employed and had won national awards for their contributions to pharmacy practice. Overall, there was 82% agreement between the two evaluators' scores for the various characteristics. Action logics changed based on the leaders' life stage. Using aggregate data from all leader interviews, a progression from lower-order action logics (opportunist, diplomat, expert) to higher-order action logics (strategist, alchemist) was found. Ten leaders (71%) were diplomats during their early years. Six leaders (43%) were experts during their education years, and 4 (29%) were strategists or alchemists. During the third life stage analyzed (the work years), 6 leaders (43%) were strategists, and 2 were alchemists. During their work years, all leaders had a percentage of their answers coded as alchemist (range, 5-22%). Throughout their professional careers, pharmacy leaders continually develop skills through formal education and mentorship that follow action logics. Copyright © 2016 by the American Society of Health-System Pharmacists, Inc. All rights reserved.

The completeness and applications of the formal system L

Institute of Scientific and Technical Information of China (English)

裴道武; 王国俊

2002-01-01

Since the formal deductive system L\\{\\}*was built up in 1997, it has played important roles in the theoretical and applied research of fuzzy logic and fuzzy reasoning. But, up to now, the completeness problem of the system L\\{\\}* is still an open problem. In this paper, the properties and structure of R0 algebras are further studied, and it is shown that every tautology on the R0 interval [0,1] is also a tautology on any R0 algebra. Furthermore, based on the particular structure of L\\{\\}*_Lindenbaum algebra, the completeness and strong completeness of the system L\\{\\}* are proved. Some applications of the system L\\{\\}* in fuzzy reasoning are also discussed, and the obtained results and examples show that the system L\\{\\}* is suprior to some other important fuzzy logic systems.

Fuzzy logic control of nuclear power plant

International Nuclear Information System (INIS)

Yao Liangzhong; Guo Renjun; Ma Changwen

1996-01-01

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

A Logic-Based Psychotherapy Approach to Treating Patients Which Focuses on Faultless Logical Functioning: A Case Study Method

Directory of Open Access Journals (Sweden)

Fernando Almeida

2017-12-01

Full Text Available Many clinical patients present to mental health clinics with depressive symptoms, anxiety, psychosomatic complaints, and sleeping problems. These symptoms which originated may originate from marital problems, conflictual interpersonal relationships, problems in securing work, and housing issues, among many others. These issues might interfere which underlie the difficulties that with the ability of the patients face in maintaining faultless logical reasoning (FLR and faultless logical functioning (FLF. FLR implies to assess correctly premises, rules, and conclusions. And FLF implies assessing not only FLR, but also the circumstances, life experience, personality, events that validate a conclusion. Almost always, the symptomatology is accompanied by intense emotional changes. Clinical experience shows that a logic-based psychotherapy (LBP approach is not practiced, and that therapists’ resort to psychopharmacotherapy or other types of psychotherapeutic approaches that are not focused on logical reasoning and, especially, logical functioning. Because of this, patients do not learn to overcome their reasoning and functioning errors. The aim of this work was to investigate how LBP works to improve the patients’ ability to think and function in a faultless logical way. This work describes the case studies of three patients. For this purpose we described the treatment of three patients. With this psychotherapeutic approach, patients gain knowledge that can then be applied not only to the issues that led them to the consultation, but also to other problems they have experienced, thus creating a learning experience and helping to prevent such patients from becoming involved in similar problematic situations. This highlights that LBP is a way of treating symptoms that interfere on some level with daily functioning. This psychotherapeutic approach is relevant for improving patients’ quality of life, and it fills a gap in the literature by describing

Extending Value Logic Thinking to Value Logic Portfolios

DEFF Research Database (Denmark)

Andersen, Poul Houman; Ritter, Thomas

2014-01-01

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

Cosmic logic: a computational model

International Nuclear Information System (INIS)

Vanchurin, Vitaly

2016-01-01

We initiate a formal study of logical inferences in context of the measure problem in cosmology or what we call cosmic logic. We describe a simple computational model of cosmic logic suitable for analysis of, for example, discretized cosmological systems. The construction is based on a particular model of computation, developed by Alan Turing, with cosmic observers (CO), cosmic measures (CM) and cosmic symmetries (CS) described by Turing machines. CO machines always start with a blank tape and CM machines take CO's Turing number (also known as description number or Gödel number) as input and output the corresponding probability. Similarly, CS machines take CO's Turing number as input, but output either one if the CO machines are in the same equivalence class or zero otherwise. We argue that CS machines are more fundamental than CM machines and, thus, should be used as building blocks in constructing CM machines. We prove the non-computability of a CS machine which discriminates between two classes of CO machines: mortal that halts in finite time and immortal that runs forever. In context of eternal inflation this result implies that it is impossible to construct CM machines to compute probabilities on the set of all CO machines using cut-off prescriptions. The cut-off measures can still be used if the set is reduced to include only machines which halt after a finite and predetermined number of steps

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

NARCIS (Netherlands)

Huisman, Marieke

2001-01-01

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

Symmetries in Genetic Systems and the Concept of Geno-Logical Coding

Directory of Open Access Journals (Sweden)

Sergey V. Petoukhov

2016-12-01

Full Text Available The genetic code of amino acid sequences in proteins does not allow understanding and modeling of inherited processes such as inborn coordinated motions of living bodies, innate principles of sensory information processing, quasi-holographic properties, etc. To be able to model these phenomena, the concept of geno-logical coding, which is connected with logical functions and Boolean algebra, is put forward. The article describes basic pieces of evidence in favor of the existence of the geno-logical code, which exists in p­arallel with the known genetic code of amino acid sequences but which serves for transferring inherited processes along chains of generations. These pieces of evidence have been received due to the analysis of symmetries in structures of molecular-genetic systems. The analysis has revealed a close connection of the genetic system with dyadic groups of binary numbers and with other mathematical objects, which are related with dyadic groups: Walsh functions (which are algebraic characters of dyadic groups, bit-reversal permutations, logical holography, etc. These results provide a new approach for mathematical modeling of genetic structures, which uses known mathematical formalisms from technological fields of noise-immunity coding of information, binary analysis, logical holography, and digital devices of artificial intellect. Some opportunities for a development of algebraic-logical biology are opened.

Microelectromechanical reprogrammable logic device

Science.gov (United States)

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

2016-01-01

In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme. PMID:27021295

Microelectromechanical reprogrammable logic device

KAUST Repository

Hafiz, Md Abdullah Al

2016-03-29

In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.

Formal Verification -26 ...

Indian Academy of Sciences (India)

by testing of the components and successful testing leads to the software being ... Formal verification is based on formal methods which are mathematically based ..... scenario under which a similar error could occur. There are various other ...

Software Formal Inspections Guidebook

Science.gov (United States)

1993-01-01

The Software Formal Inspections Guidebook is designed to support the inspection process of software developed by and for NASA. This document provides information on how to implement a recommended and proven method for conducting formal inspections of NASA software. This Guidebook is a companion document to NASA Standard 2202-93, Software Formal Inspections Standard, approved April 1993, which provides the rules, procedures, and specific requirements for conducting software formal inspections. Application of the Formal Inspections Standard is optional to NASA program or project management. In cases where program or project management decide to use the formal inspections method, this Guidebook provides additional information on how to establish and implement the process. The goal of the formal inspections process as documented in the above-mentioned Standard and this Guidebook is to provide a framework and model for an inspection process that will enable the detection and elimination of defects as early as possible in the software life cycle. An ancillary aspect of the formal inspection process incorporates the collection and analysis of inspection data to effect continual improvement in the inspection process and the quality of the software subjected to the process.

Three-valued logics in modal logic

NARCIS (Netherlands)

Kooi, Barteld; Tamminga, Allard

2013-01-01

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

A Logical Process Calculus

Science.gov (United States)

Cleaveland, Rance; Luettgen, Gerald; Bushnell, Dennis M. (Technical Monitor)

2002-01-01

This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, LPC extends Milner's Calculus of Communicating Systems with operators from the alternation-free linear-time mu-calculus (LT(mu)). Semantically, LPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must-testing preorder as well as LT(mu's) satisfaction relation, while being compositional for all LPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of: (1) both minimal and maximal fixed-point operators and (2) an unimple-mentability predicate on process terms, which tags inconsistent specifications. The utility of LPC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification.

Integrated development environment for fuzzy logic applications

Science.gov (United States)

Pagni, Andrea; Poluzzi, Rinaldo; Rizzotto, GianGuido; Lo Presti, Matteo

1993-12-01

During the last five years, Fuzzy Logic has gained enormous popularity, both in the academic and industrial worlds, breaking up the traditional resistance against changes thanks to its innovative approach to problems formalization. The success of this new methodology is pushing the creation of a brand new class of devices, called Fuzzy Machines, to overcome the limitations of traditional computing systems when acting as Fuzzy Systems and adequate Software Tools to efficiently develop new applications. This paper aims to present a complete development environment for the definition of fuzzy logic based applications. The environment is also coupled with a sophisticated software tool for semiautomatic synthesis and optimization of the rules with stability verifications. Later it is presented the architecture of WARP, a dedicate VLSI programmable chip allowing to compute in real time a fuzzy control process. The article is completed with two application examples, which have been carried out exploiting the aforementioned tools and devices.

Automated Generation of Formal Models from ST Control Programs for Verification Purposes

CERN Document Server

Fernandez Adiego, B; Tournier, J-C; Blanco Vinuela, E; Blech, J-O; Gonzalez Suarez, V

2014-01-01

In large industrial control systems such as the ones installed at CERN, one of the main issues is the ability to verify the correct behaviour of the Programmable Logic Controller (PLC) programs. While manual and automated testing can achieve good results, some obvious problems remain unsolved such as the difficulty to check safety or liveness properties. This paper proposes a general methodology and a tool to verify PLC programs by automatically generating formal models for different model checkers out of ST code. The proposed methodology defines an automata-based formalism used as intermediate model (IM) to transform PLC programs written in ST language into different formal models for verification purposes. A tool based on Xtext has been implemented that automatically generates models for the NuSMV and UPPAAL model checkers and the BIP framework.

Analogical proportions: another logical view

Science.gov (United States)

Prade, Henri; Richard, Gilles

This paper investigates the logical formalization of a restricted form of analogical reasoning based on analogical proportions, i.e. statements of the form a is to b as c is to d. Starting from a naive set theoretic interpretation, we highlight the existence of two noticeable companion proportions: one states that a is to b the converse of what c is to d (reverse analogy), while the other called paralogical proportion expresses that what a and b have in common, c and d have it also. We identify the characteristic postulates of the three types of proportions and examine their consequences from an abstract viewpoint. We further study the properties of the set theoretic interpretation and of the Boolean logic interpretation, and we provide another light on the understanding of the role of permutations in the modeling of the three types of proportions. Finally, we address the use of these proportions as a basis for inference in a propositional setting, and relate it to more general schemes of analogical reasoning. The differences between analogy, reverse-analogy, and paralogy is still emphasized in a three-valued setting, which is also briefly presented.

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.

Dealing with Resilience Conceptualisation. Formal Ontologies as a Tool for Implementation of Intelligent Geographic Information Systems

Directory of Open Access Journals (Sweden)

Giampiero Lombardini

2014-05-01

Full Text Available The paper addresses the issue of the representation of the concept of resilience (urban, environmental and landscape resilience in the context of geographic information systems. In the current technical and scientific debate, resilience is configured as an intrinsic property of a system to switch from one equilibrium state to another without losing its basic internal structure, also definable in terms of "identity." The paths to success or stable growth as well as those of continuing and recursive crisis, although already explained in macroeconomic terms through the mechanisms of accumulation and multiplication (cumulative advantage, are also interpreted in terms of resilience. So, in the field of studies on spatial planning, the concept of resilience became particularly significant in an era characterized by great instability of social systems, deep economic and environmental crisis. In the process of urban and regional planning, conceive the development of an urban region in terms of resilience means using the logic of complex systems and then adapt in this way their methods of knowledge representation. The concept of resilience is multi-dimensional and vague, so its conceptualization is complex. The formal ontologies can be a useful tool to orient geographic information systems towards more complex forms of knowledge representation and to adapt them to the requirements of logic and formal complex systems, such as today's urban regions.

Logic without unique readability - a study of semantic and syntactic ambiguity

DEFF Research Database (Denmark)

Bentzen, Martin Mose

One of the main reasons for introducing a formal language is to remove ambiguity, the possibility of assigning several meanings to a linguistic expression. Typically, this is achieved through ensuring unique readability of formulas by using brackets (or another convention, such as Polish notation...... not hold true universally. Whereas e.g. scope ambiguities in natural languages have been studied extensively, ambiguous formal languages have not been the focus of in depth research. Here, we lift the assumption of unique readability by omitting the brackets from propositional logic, making it possible...... to formally distinguish between syntactic and semantic ambiguity. A valuation then amounts to a semantic disambiguation, and rather than a unique valuation (truth value), there is a set of valuations corresponding to ways a formula could have been constructed. We show what happens to familiar concepts...

"Glitch Logic" and Applications to Computing and Information Security

Science.gov (United States)

Stoica, Adrian; Katkoori, Srinivas

2009-01-01

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

Intuitionistic hybrid logic

DEFF Research Database (Denmark)

Braüner, Torben

2011-01-01

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

Fuzzy forecasting based on fuzzy-trend logical relationship groups.

Science.gov (United States)

Chen, Shyi-Ming; Wang, Nai-Yi

2010-10-01

In this paper, we present a new method to predict the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) based on fuzzy-trend logical relationship groups (FTLRGs). The proposed method divides fuzzy logical relationships into FTLRGs based on the trend of adjacent fuzzy sets appearing in the antecedents of fuzzy logical relationships. First, we apply an automatic clustering algorithm to cluster the historical data into intervals of different lengths. Then, we define fuzzy sets based on these intervals of different lengths. Then, the historical data are fuzzified into fuzzy sets to derive fuzzy logical relationships. Then, we divide the fuzzy logical relationships into FTLRGs for forecasting the TAIEX. Moreover, we also apply the proposed method to forecast the enrollments and the inventory demand, respectively. The experimental results show that the proposed method gets higher average forecasting accuracy rates than the existing methods.

Flow Logic for Process Calculi

DEFF Research Database (Denmark)

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

2012-01-01

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

Multi-class Mode of Action Classification of Toxic Compounds Using Logic Based Kernel Methods.

Science.gov (United States)

Lodhi, Huma; Muggleton, Stephen; Sternberg, Mike J E

2010-09-17

Toxicity prediction is essential for drug design and development of effective therapeutics. In this paper we present an in silico strategy, to identify the mode of action of toxic compounds, that is based on the use of a novel logic based kernel method. The technique uses support vector machines in conjunction with the kernels constructed from first order rules induced by an Inductive Logic Programming system. It constructs multi-class models by using a divide and conquer reduction strategy that splits multi-classes into binary groups and solves each individual problem recursively hence generating an underlying decision list structure. In order to evaluate the effectiveness of the approach for chemoinformatics problems like predictive toxicology, we apply it to toxicity classification in aquatic systems. The method is used to identify and classify 442 compounds with respect to the mode of action. The experimental results show that the technique successfully classifies toxic compounds and can be useful in assessing environmental risks. Experimental comparison of the performance of the proposed multi-class scheme with the standard multi-class Inductive Logic Programming algorithm and multi-class Support Vector Machine yields statistically significant results and demonstrates the potential power and benefits of the approach in identifying compounds of various toxic mechanisms. Copyright © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Method of resonating groups in the Faddeev-Hahn equation formalism for three-body nuclear problem

CERN Document Server

Nasirov, M Z

2002-01-01

The Faddeev-Hahn equation formalism for three-body nuclear problem is considered. For solution of the equations the method of resonant groups have applied. The calculations of tritium binding energy and doublet nd-scattering length have been carried out. The results obtained shows that Faddeev-Hahn equation formalism is very simple and effective. (author)

A Mixed Methods Study of Barriers to Formal Diagnosis of Autism Spectrum Disorder in Adults

Science.gov (United States)

Lewis, Laura Foran

2017-01-01

Delayed diagnosis of autism spectrum disorder (ASD) into adulthood is common, and self-diagnosis is a growing phenomenon. This mixed methods study aimed to explore barriers to formal diagnosis of ASD in adults. In a qualitative strand, secondary analysis of data on the experiences of 114 individuals who were self-diagnosed or formally diagnosed…

On the use of fuzzy logics in the operator support system of an experimental facility

International Nuclear Information System (INIS)

Mozhaev, A.A.

1988-01-01

Problems of consrtuction of the computerized operator support system of the experimental device are considered on the basis of the imitation decision-making model which uses the fuzzy logic apparatus for a formal description of the decision-making process. 22 refs.; 4 figs.; 2 tabs

Formal languages, automata and numeration systems, v.2

CERN Document Server

Rigo, Michel

2014-01-01

The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t

Fuzzy logic in management

CERN Document Server

Carlsson, Christer; Fullér, Robert

2004-01-01

Fuzzy Logic in Management demonstrates that difficult problems and changes in the management environment can be more easily handled by bringing fuzzy logic into the practice of management. This explicit theme is developed through the book as follows: Chapter 1, "Management and Intelligent Support Technologies", is a short survey of management leadership and what can be gained from support technologies. Chapter 2, "Fuzzy Sets and Fuzzy Logic", provides a short introduction to fuzzy sets, fuzzy relations, the extension principle, fuzzy implications and linguistic variables. Chapter 3, "Group Decision Support Systems", deals with group decision making, and discusses methods for supporting the consensus reaching processes. Chapter 4, "Fuzzy Real Options for Strategic Planning", summarizes research where the fuzzy real options theory was implemented as a series of models. These models were thoroughly tested on a number of real life investments, and validated in 2001. Chapter 5, "Soft Computing Methods for Reducing...

The logic of crime fiction genre in modern person’s consciousness

Directory of Open Access Journals (Sweden)

G. O. Krapivnyk

2014-08-01

Full Text Available The author provides philosophical anthropological analysis of the logic of the crime fiction genre in the modern person’s consciousness. It was shown that detective texts convey hyper-orderliness, which compensates for the lack of systematization in real life, directly influences the recipient, setting the limits of personal freedom, and indirectly structures social order. The research assumes that classical crime fiction is related to the positivist philosophy, rationalism and scientific thinking, whereas the formula of the late Modern crime fiction stories is gradually getting more sophisticated, which reflects the evolution of the philosophical thinking on the whole. The special feature of the crime fiction genre logic is in the fact that available in crime fiction texts typical formal logical elements of a hypothesis, versions, evidence and contradiction are combined by the addressers with creative inspiration, intuition, true life, which are not the characteristics of pure science. The logic in the texts of the crime fiction genre helps a modern person to virtually build a system of universal philosophical and cultural values, applied by the society as its basis for social norms, rules and laws of any modern state. In addition, the specific logic of investigation encourages person’s everyday activities, since cultural reading enables a person not only to perceive but also to transfer and use the laws of logic, inherent in the crime fiction genre, in their professional activities, including research work.

Classical logic and logicism in human thought

OpenAIRE

Elqayam, Shira

2012-01-01

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

Efficient formalism for treating tapered structures using the Fourier modal method

DEFF Research Database (Denmark)

Østerkryger, Andreas Dyhl; Gregersen, Niels

2016-01-01

We investigate the development of the mode occupations in tapered structures using the Fourier modal method. In order to use the Fourier modal method, tapered structures are divided into layers of uniform refractive index in the propagation direction and the optical modes are found within each...... layer. This is not very efficient and in this proceeding we take the first steps towards a more efficient formalism for treating tapered structures using the Fourier modal method. We show that the coupling coefficients through the structure are slowly varying and that only the first few modes...

Controller Design from Temporal Logic: Undecidability need not matter

DEFF Research Database (Denmark)

Fränzle, Martin

1997-01-01

to a peculiar property of such models, namely that transitions can follow each other arbitrarily close in time, which they cannot in reality. However, intelligent exploitation of exactly this property is the core of many undecidability results in the field. Consequently, some of the intricacy of designing...... ``Controller Design from Temporal Logic: Undecidability Need Not Matter'' sets out to prove that this hypothesis is actually true and applies to some well-studied design formalisms. The demonstrator formalism used throughout is the core of the Duration Calculi, which is a major group of calculi proposed...... for slightly more restrictive model classes, where the additional constraints on the temporal distribution of possible state changes are derived from considerations concerning the physical properties of embedded controllers. In the remainder, these considerations are shown to apply for interesting classes...

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

International Nuclear Information System (INIS)

Sang Ziru; Huang Shanshan; Chen Lian; Jin Ge

2010-01-01

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

On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics

OpenAIRE

Gore, Rajeev; Postniece, Linda; Tiu, Alwen F

2011-01-01

We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call "shallow calculi", where inference rules are only applied at the root node in a nested sequent. Our shallow calculi are extensions of Kashima's calculus for tense logic and share an essential characteristic with display calculi, namely, the presence of str...

Proceedings First Workshop on Quantitative Formal Methods : theory and applications (QFM'09, Eindhoven, The Netherlands, November 3, 2009)

NARCIS (Netherlands)

Andova, S.; McIver, A.; D'Argenio, P.R.; Cuijpers, P.J.L.; Markovski, J.; Morgan, C.; Núñez, M.

2009-01-01

This volume contains the papers presented at the 1st workshop on Quantitative Formal Methods: Theory and Applications, which was held in Eindhoven on 3 November 2009 as part of the International Symposium on Formal Methods 2009. This volume contains the final versions of all contributions accepted

Edge detection methods based on generalized type-2 fuzzy logic

CERN Document Server

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

2017-01-01

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

Artificial intelligence/fuzzy logic method for analysis of combined signals from heavy metal chemical sensors

International Nuclear Information System (INIS)

Turek, M.; Heiden, W.; Riesen, A.; Chhabda, T.A.; Schubert, J.; Zander, W.; Krueger, P.; Keusgen, M.; Schoening, M.J.

2009-01-01

The cross-sensitivity of chemical sensors for several metal ions resembles in a way the overlapping sensitivity of some biological sensors, like the optical colour receptors of human retinal cone cells. While it is difficult to assign crisp classification values to measurands based on complex overlapping sensory signals, fuzzy logic offers a possibility to mathematically model such systems. Current work goes into the direction of mixed heavy metal solutions and the combination of fuzzy logic with heavy metal-sensitive, silicon-based chemical sensors for training scenarios of arbitrary sensor/probe combinations in terms of an electronic tongue. Heavy metals play an important role in environmental analysis. As trace elements as well as water impurities released from industrial processes they occur in the environment. In this work, the development of a new fuzzy logic method based on potentiometric measurements performed with three different miniaturised chalcogenide glass sensors in different heavy metal solutions will be presented. The critical validation of the developed fuzzy logic program will be demonstrated by means of measurements in unknown single- and multi-component heavy metal solutions. Limitations of this program and a comparison between calculated and expected values in terms of analyte composition and heavy metal ion concentration will be shown and discussed.

Artificial intelligence/fuzzy logic method for analysis of combined signals from heavy metal chemical sensors

Energy Technology Data Exchange (ETDEWEB)

Turek, M. [Institute of Nano- and Biotechnologies (INB), Aachen University of Applied Sciences, Campus Juelich, Juelich (Germany); Institute of Bio- and Nanosystems (IBN), Research Centre Juelich GmbH, Juelich (Germany); Heiden, W.; Riesen, A. [Bonn-Rhein-Sieg University of Applied Sciences, Sankt Augustin (Germany); Chhabda, T.A. [Institute of Nano- and Biotechnologies (INB), Aachen University of Applied Sciences, Campus Juelich, Juelich (Germany); Schubert, J.; Zander, W. [Institute of Bio- and Nanosystems (IBN), Research Centre Juelich GmbH, Juelich (Germany); Krueger, P. [Institute of Biochemistry and Molecular Biology, RWTH Aachen, Aachen (Germany); Keusgen, M. [Institute for Pharmaceutical Chemistry, Philipps-University Marburg, Marburg (Germany); Schoening, M.J. [Institute of Nano- and Biotechnologies (INB), Aachen University of Applied Sciences, Campus Juelich, Juelich (Germany); Institute of Bio- and Nanosystems (IBN), Research Centre Juelich GmbH, Juelich (Germany)], E-mail: m.j.schoening@fz-juelich.de

2009-10-30

The cross-sensitivity of chemical sensors for several metal ions resembles in a way the overlapping sensitivity of some biological sensors, like the optical colour receptors of human retinal cone cells. While it is difficult to assign crisp classification values to measurands based on complex overlapping sensory signals, fuzzy logic offers a possibility to mathematically model such systems. Current work goes into the direction of mixed heavy metal solutions and the combination of fuzzy logic with heavy metal-sensitive, silicon-based chemical sensors for training scenarios of arbitrary sensor/probe combinations in terms of an electronic tongue. Heavy metals play an important role in environmental analysis. As trace elements as well as water impurities released from industrial processes they occur in the environment. In this work, the development of a new fuzzy logic method based on potentiometric measurements performed with three different miniaturised chalcogenide glass sensors in different heavy metal solutions will be presented. The critical validation of the developed fuzzy logic program will be demonstrated by means of measurements in unknown single- and multi-component heavy metal solutions. Limitations of this program and a comparison between calculated and expected values in terms of analyte composition and heavy metal ion concentration will be shown and discussed.

Reprogrammable logic in memristive crossbar for in-memory computing

Science.gov (United States)

Cheng, Long; Zhang, Mei-Yun; Li, Yi; Zhou, Ya-Xiong; Wang, Zhuo-Rui; Hu, Si-Yu; Long, Shi-Bing; Liu, Ming; Miao, Xiang-Shui

2017-12-01

Memristive stateful logic has emerged as a promising next-generation in-memory computing paradigm to address escalating computing-performance pressures in traditional von Neumann architecture. Here, we present a nonvolatile reprogrammable logic method that can process data between different rows and columns in a memristive crossbar array based on material implication (IMP) logic. Arbitrary Boolean logic can be executed with a reprogrammable cell containing four memristors in a crossbar array. In the fabricated Ti/HfO2/W memristive array, some fundamental functions, such as universal NAND logic and data transfer, were experimentally implemented. Moreover, using eight memristors in a 2  ×  4 array, a one-bit full adder was theoretically designed and verified by simulation to exhibit the feasibility of our method to accomplish complex computing tasks. In addition, some critical logic-related performances were further discussed, such as the flexibility of data processing, cascading problem and bit error rate. Such a method could be a step forward in developing IMP-based memristive nonvolatile logic for large-scale in-memory computing architecture.

A Quantum Computational Semantics for Epistemic Logical Operators. Part I: Epistemic Structures

Science.gov (United States)

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

2014-10-01

Some critical open problems of epistemic logics can be investigated in the framework of a quantum computational approach. The basic idea is to interpret sentences like "Alice knows that Bob does not understand that π is irrational" as pieces of quantum information (generally represented by density operators of convenient Hilbert spaces). Logical epistemic operators ( to understand, to know…) are dealt with as (generally irreversible) quantum operations, which are, in a sense, similar to measurement-procedures. This approach permits us to model some characteristic epistemic processes, that concern both human and artificial intelligence. For instance, the operation of "memorizing and retrieving information" can be formally represented, in this framework, by using a quantum teleportation phenomenon.

Reconfigurable chaotic logic gates based on novel chaotic circuit

International Nuclear Information System (INIS)

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

2014-01-01

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

Visual Temporal Logic as a Rapid Prototying Tool

DEFF Research Database (Denmark)

Fränzle, Martin; Lüth, Karsten

2001-01-01

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

Formal verification of automated teller machine systems using SPIN

Science.gov (United States)

Iqbal, Ikhwan Mohammad; Adzkiya, Dieky; Mukhlash, Imam

2017-08-01

Formal verification is a technique for ensuring the correctness of systems. This work focuses on verifying a model of the Automated Teller Machine (ATM) system against some specifications. We construct the model as a state transition diagram that is suitable for verification. The specifications are expressed as Linear Temporal Logic (LTL) formulas. We use Simple Promela Interpreter (SPIN) model checker to check whether the model satisfies the formula. This model checker accepts models written in Process Meta Language (PROMELA), and its specifications are specified in LTL formulas.

Synthesis of FBD-based PLC design from NuSCR formal specification

International Nuclear Information System (INIS)

Yoo, Junbeom; Cha, Sungdeok; Kim, Chang Hwoi; Song, Duck Yong

2005-01-01

NuSCR is a formal specification language to document requirements for real-time embedded software with nuclear engineering applications in mind. Domain experts actively participated in selecting how to best represent various aspects. It uses tabular notations to specify required computations and automata to document state- or time-dependent behavior. As programmable logic controllers (PLCs) are widely used to implement real-time embedded software, synthesis of PLC code from a formal specification is desirable if transformation rules can be rigorously defined. In addition to improved productivity, results of safety analysis performed on requirements remain valid. In this paper, we demonstrate how NuSCR specification can be translated into semantically equivalent function block diagram (FBD) code. The process, except the initial phase where user provides information on missing or implicit details, is automated. Since executable code can be automatically generated using CASE tools from FBD, much of software development is automated. Proposed technique is currently being used in developing reactor protection system (RPS) for nuclear power plants in Korea, and experience to date has been positive. We demonstrate the proposed approach using the fixed set-point rising trip which is one of the most complex trip logics included in the RPS

Quantum logic

International Nuclear Information System (INIS)

Mittelstaedt, P.

1979-01-01

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

Deciding Full Branching Time Logic by Program Transformation

Science.gov (United States)

Pettorossi, Alberto; Proietti, Maurizio; Senni, Valerio

We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a monadic ω -program, that is, a stratified program defining nullary or unary predicates on infinite lists. This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. In the second step we verify the property of interest by using a proof method for monadic ω-programs.

A Hybrid Method for Modeling and Solving Supply Chain Optimization Problems with Soft and Logical Constraints

Directory of Open Access Journals (Sweden)

Paweł Sitek

2016-01-01

Full Text Available This paper presents a hybrid method for modeling and solving supply chain optimization problems with soft, hard, and logical constraints. Ability to implement soft and logical constraints is a very important functionality for supply chain optimization models. Such constraints are particularly useful for modeling problems resulting from commercial agreements, contracts, competition, technology, safety, and environmental conditions. Two programming and solving environments, mathematical programming (MP and constraint logic programming (CLP, were combined in the hybrid method. This integration, hybridization, and the adequate multidimensional transformation of the problem (as a presolving method helped to substantially reduce the search space of combinatorial models for supply chain optimization problems. The operation research MP and declarative CLP, where constraints are modeled in different ways and different solving procedures are implemented, were linked together to use the strengths of both. This approach is particularly important for the decision and combinatorial optimization models with the objective function and constraints, there are many decision variables, and these are summed (common in manufacturing, supply chain management, project management, and logistic problems. The ECLiPSe system with Eplex library was proposed to implement a hybrid method. Additionally, the proposed hybrid transformed model is compared with the MILP-Mixed Integer Linear Programming model on the same data instances. For illustrative models, its use allowed finding optimal solutions eight to one hundred times faster and reducing the size of the combinatorial problem to a significant extent.

Students’ logical-mathematical intelligence profile

Science.gov (United States)

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

2018-04-01

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

A critical study of fuzzy logic as a scientific method in social sciences ...

African Journals Online (AJOL)

The logic of the social sciences, from its inception, has been certain and classic. By advent of Fuzzy logic, gradually making use of it was common because of frequent capabilities and applications that in resolving problems of this science was been attributed to it. Changing of logic in a science or epistemic system has many ...

Characteristics of a Circular Logic and Its Treatment

International Nuclear Information System (INIS)

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

2007-01-01

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

Software Safety Analysis of Digital Protection System Requirements Using a Qualitative Formal Method

International Nuclear Information System (INIS)

Lee, Jang-Soo; Kwon, Kee-Choon; Cha, Sung-Deok

2004-01-01

The safety analysis of requirements is a key problem area in the development of software for the digital protection systems of a nuclear power plant. When specifying requirements for software of the digital protection systems and conducting safety analysis, engineers find that requirements are often known only in qualitative terms and that existing fault-tree analysis techniques provide little guidance on formulating and evaluating potential failure modes. A framework for the requirements engineering process is proposed that consists of a qualitative method for requirements specification, called the qualitative formal method (QFM), and a safety analysis method for the requirements based on causality information, called the causal requirements safety analysis (CRSA). CRSA is a technique that qualitatively evaluates causal relationships between software faults and physical hazards. This technique, extending the qualitative formal method process and utilizing information captured in the state trajectory, provides specific guidelines on how to identify failure modes and the relationship among them. The QFM and CRSA processes are described using shutdown system 2 of the Wolsong nuclear power plants as the digital protection system example

A methodology to migrate the gene ontology to a description logic environment using DAML+OIL.

Science.gov (United States)

Wroe, C J; Stevens, R; Goble, C A; Ashburner, M

2003-01-01

The Gene Ontology Next Generation Project (GONG) is developing a staged methodology to evolve the current representation of the Gene Ontology into DAML+OIL in order to take advantage of the richer formal expressiveness and the reasoning capabilities of the underlying description logic. Each stage provides a step level increase in formal explicit semantic content with a view to supporting validation, extension and multiple classification of the Gene Ontology. The paper introduces DAML+OIL and demonstrates the activity within each stage of the methodology and the functionality gained.

Reconstruction and logical modeling of glucose repression signaling pathways in Saccharomyces cerevisiae

Directory of Open Access Journals (Sweden)

Oliveira Ana

2009-01-01

Full Text Available Abstract Background In the yeast Saccharomyces cerevisiae, the presence of high levels of glucose leads to an array of down-regulatory effects known as glucose repression. This process is complex due to the presence of feedback loops and crosstalk between different pathways, complicating the use of intuitive approaches to analyze the system. Results We established a logical model of yeast glucose repression, formalized as a hypergraph. The model was constructed based on verified regulatory interactions and it includes 50 gene transcripts, 22 proteins, 5 metabolites and 118 hyperedges. We computed the logical steady states of all nodes in the network in order to simulate wildtype and deletion mutant responses to different sugar availabilities. Evaluation of the model predictive power was achieved by comparing changes in the logical state of gene nodes with transcriptome data. Overall, we observed 71% true predictions, and analyzed sources of errors and discrepancies for the remaining. Conclusion Though the binary nature of logical (Boolean models entails inherent limitations, our model constitutes a primary tool for storing regulatory knowledge, searching for incoherencies in hypotheses and evaluating the effect of deleting regulatory elements involved in glucose repression.

Landslide susceptibility mapping by comparing weight of evidence, fuzzy logic, and frequency ratio methods

Directory of Open Access Journals (Sweden)

V. Vakhshoori

2016-09-01

Full Text Available A regional scale basin susceptible to landslide located in Qaemshahr area in northern Iran was chosen for comparing the reliability of weight of evidence (WofE, fuzzy logic, and frequency ratio (FR methods for landslide susceptibility mapping. The locations of 157 landslides were identified using Google Earth® or extracted from archived data, from which, 22 rockslides were eliminated from the data-set due to their different conditions. The 135 remaining landslides were randomly divided into two groups of modelling (70% and validation (30% data-sets. Elevation, slope degree, slope aspect, lithology, land use/cover, normalized difference vegetation index, rainfall, distance to drainage network, roads, and faults were considered as landslide causative factors. The landslide susceptibility maps were prepared using the three mentioned methods. The validation process was measured by the success and prediction rates calculated by area under receiver operating characteristic curve. The ‘OR’, ‘AND’, ‘SUM’, and ‘PRODUCT’ operators of the fuzzy logic method were unacceptable because these operators classify the target area into either very high or very low susceptible zones that are inconsistent with the physical conditions of the study area. The results of fuzzy ‘GAMMA’ operators were relatively reliable while, FR and WofE methods showed results that are more reliable.

Analysis of selected structures for model-based measuring methods using fuzzy logic

Energy Technology Data Exchange (ETDEWEB)

Hampel, R.; Kaestner, W.; Fenske, A.; Vandreier, B.; Schefter, S. [Hochschule fuer Technik, Wirtschaft und Sozialwesen Zittau/Goerlitz (FH), Zittau (DE). Inst. fuer Prozesstechnik, Prozessautomatisierung und Messtechnik e.V. (IPM)

2000-07-01

Monitoring and diagnosis of safety-related technical processes in nuclear enginering can be improved with the help of intelligent methods of signal processing such as analytical redundancies. This chapter gives an overview about combined methods in form of hybrid models using model based measuring methods (observer) and knowledge-based methods (fuzzy logic). Three variants of hybrid observers (fuzzy-supported observer, hybrid observer with variable gain and hybrid non-linear operating point observer) are explained. As a result of the combination of analytical and fuzzy-based algorithms a new quality of monitoring and diagnosis is achieved. The results will be demonstrated in summary for the example water level estimation within pressure vessels (pressurizer, steam generator, and Boiling Water Reactor) with water-steam mixture during the accidental depressurization. (orig.)

Analysis of selected structures for model-based measuring methods using fuzzy logic

International Nuclear Information System (INIS)

Hampel, R.; Kaestner, W.; Fenske, A.; Vandreier, B.; Schefter, S.

2000-01-01

Monitoring and diagnosis of safety-related technical processes in nuclear engineering can be improved with the help of intelligent methods of signal processing such as analytical redundancies. This chapter gives an overview about combined methods in form of hybrid models using model based measuring methods (observer) and knowledge-based methods (fuzzy logic). Three variants of hybrid observers (fuzzy-supported observer, hybrid observer with variable gain and hybrid non-linear operating point observer) are explained. As a result of the combination of analytical and fuzzy-based algorithms a new quality of monitoring and diagnosis is achieved. The results will be demonstrated in summary for the example water level estimation within pressure vessels (pressurizer, steam generator, and Boiling Water Reactor) with water-steam mixture during the accidental depressurization. (orig.)

INDONESIA PUBLIC BANKS PERFORMANCE EVALUATION USING FUZZY LOGIC

Directory of Open Access Journals (Sweden)

Sugiarto Sugiarto

2016-10-01

Full Text Available Return on Asset (ROA is a variable that has the greatest ability in predicting public banks stock prices in Indonesia. The coefficient of determination of ROA on public banks stock prices in Indonesia reached 54.8%. ROA has a significant positive influence on public bank stock prices in Indonesia. Fuzzy logic process on the performance of the 15 public banks in Indonesia have been carried out using the data of ROA for the period 2010 up to 2013. Bank reference performance according to ROA is based on Bank Indonesia Letter No. 6 / 23DPNP / 2011. The performance of each bank was analyzed by conventional methods and as a comparison used fuzzy logic. The evaluation with fuzzy logic method able to provide added value to the currently enforced performance evaluation method. There is significant difference in conclusion between the determination of fuzzy logic models and conventional method

Fuzzy logic and neural networks basic concepts & application

CERN Document Server

Alavala, Chennakesava R

2008-01-01

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

A Formalization of Linkage Analysis

DEFF Research Database (Denmark)

Ingolfsdottir, Anna; Christensen, A.I.; Hansen, Jens A.

In this report a formalization of genetic linkage analysis is introduced. Linkage analysis is a computationally hard biomathematical method, which purpose is to locate genes on the human genome. It is rooted in the new area of bioinformatics and no formalization of the method has previously been ...

Towards a formal taxonomy of hybrid uncertainty representations

Energy Technology Data Exchange (ETDEWEB)

Joslyn, C.; Rocha, L.

1997-02-01

Recent years have seen a proliferation of methods in addition to probability theory to represent information and uncertainty, including fuzzy sets and systems, fuzzy measures, rough sets, random sets, possibility distributions, imprecise probabilities, etc. We can identify these fields collectively as General Information Theory. The components of GIT represent information according to different axiomatic bases, and are thus capable of capturing different semantic aspects of uncertainty. Traditionally, these semantic criteria include such categories as fuzziness, vagueness, nonspecificity, conflict, and randomness. So it is clear that there is a pressing need for the GIT community to synthesize these methods, searching out larger formal frameworks within which to place these various components with respect to each other. Ideally, syntactic (mathematical) generalization can both aid and be aided by the semantic analysis available in terms of the conceptual categories outlined above. In this paper we present some preliminary ideas about how to formally relate various uncertainty representations together in a taxonomic lattice, capturing both syntactic and semantic generalization. Some partial and provisional results are shown. Assume a simple finite universe of discourse {Omega} = (a, b, c). We want to describe a situation in which we ask a question of the sort {open_quotes}what is the value of a variable x which takes values in {Omega}?{close_quotes}. When there is no uncertainty, we have a single alternative, say x = a. In logical terms, we would say that the proposition p: {open_quotes}the value of x is a{close_quotes} is TRUE. Our approach begins with two primitive concepts which can change our knowledge of x, each of which represents a different form of uncertainty, nonspecificity and fuxxiness.

Where Are the Logical Errors in the Theory of Big Bang?

Science.gov (United States)

Kalanov, Temur Z.

2015-04-01

The critical analysis of the foundations of the theory of Big Bang is proposed. The unity of formal logic and of rational dialectics is methodological basis of the analysis. It is argued that the starting point of the theory of Big Bang contains three fundamental logical errors. The first error is the assumption that a macroscopic object (having qualitative determinacy) can have an arbitrarily small size and can be in the singular state (i.e., in the state that has no qualitative determinacy). This assumption implies that the transition, (macroscopic object having the qualitative determinacy) --> (singular state of matter that has no qualitative determinacy), leads to loss of information contained in the macroscopic object. The second error is the assumption that there are the void and the boundary between matter and void. But if such boundary existed, then it would mean that the void has dimensions and can be measured. The third error is the assumption that the singular state of matter can make a transition into the normal state without the existence of the program of qualitative and quantitative development of the matter, without controlling influence of other (independent) object. However, these assumptions conflict with the practice and, consequently, formal logic, rational dialectics, and cybernetics. Indeed, from the point of view of cybernetics, the transition, (singular state of the Universe) -->(normal state of the Universe),would be possible only in the case if there was the Managed Object that is outside the Universe and have full, complete, and detailed information about the Universe. Thus, the theory of Big Bang is a scientific fiction.

The origin of the logic of symbolic mathematics Edmund Husserl and Jacob Klein

CERN Document Server

Hopkins, Burt C

2011-01-01

Burt C. Hopkins presents the first in-depth study of the work of Edmund Husserl and Jacob Klein on the philosophical foundations of the logic of modern symbolic mathematics. Accounts of the philosophical origins of formalized concepts-especially mathematical concepts and the process of mathematical abstraction that generates them-have been paramount to the development of phenomenology. Both Husserl and Klein independently concluded that it is impossible to separate the historical origin of the thought that generates the basic concepts of mathematics from their philosophical meanings. Hopkins explores how Husserl and Klein arrived at their conclusion and its philosophical implications for the modern project of formalizing all knowledge.

FUZZY LOGIC IN LEGAL EDUCATION

Directory of Open Access Journals (Sweden)

Z. Gonul BALKIR

2011-04-01

Full Text Available The necessity of examination of every case within its peculiar conditions in social sciences requires different approaches complying with the spirit and nature of social sciences. Multiple realities require different and various perceptual interpretations. In modern world and social sciences, interpretation of perception of valued and multi-valued have been started to be understood by the principles of fuzziness and fuzzy logic. Having the verbally expressible degrees of truthness such as true, very true, rather true, etc. fuzzy logic provides the opportunity for the interpretation of especially complex and rather vague set of information by flexibility or equivalence of the variables’ of fuzzy limitations. The methods and principles of fuzzy logic can be benefited in examination of the methodological problems of law, especially in the applications of filling the legal loopholes arising from the ambiguities and interpretation problems in order to understand the legal rules in a more comprehensible and applicable way and the efficiency of legal implications. On the other hand, fuzzy logic can be used as a technical legal method in legal education and especially in legal case studies and legal practice applications in order to provide the perception of law as a value and the more comprehensive and more quality perception and interpretation of value of justice, which is the core value of law. In the perception of what happened as it has happened in legal relationships and formations, the understanding of social reality and sociological legal rules with multi valued sense perspective and the their applications in accordance with the fuzzy logic’s methods could create more equivalent and just results. It can be useful for the young lawyers and law students as a facilitating legal method especially in the materialization of the perception and interpretation of multi valued and variables. Using methods and principles of fuzzy logic in legal

Orthogonal Algorithm of Logic Probability and Syndrome-Testable Analysis

Institute of Scientific and Technical Information of China (English)

无

1990-01-01

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

Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing

KAUST Repository

Luo, Zhaochu

2016-11-16

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

Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing

KAUST Repository

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

2016-01-01

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

A tristate optical logic system

Science.gov (United States)

Basuray, A.; Mukhopadhyay, S.; Kumar Ghosh, Hirak; Datta, A. K.

1991-09-01

A method is described to represent data in a tristate logic system which are subsequently replaced by Modified Trinary Numbers (MTN). This system is advantagegeous in parallel processing as carry and borrow free operations in arithmatic computation is possible. The logical operations are also modified according to the three states available. A possible practical application of the same using polarized light is also suggested.

Logical Characterisation of Ontology Construction using Fuzzy Description Logics

DEFF Research Database (Denmark)

Badie, Farshad; Götzsche, Hans

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

A Verification Study on the Loop-Breaking Logic of FTREX

International Nuclear Information System (INIS)

Choi, Jong Soo

2008-01-01

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

Parametric Analysis of Flexible Logic Control Model

Directory of Open Access Journals (Sweden)

Lihua Fu

2013-01-01

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

Manipulating potential wells in Logical Stochastic Resonance to obtain XOR logic

International Nuclear Information System (INIS)

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

2012-01-01

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

Integration of relational and textual biomedical sources. A pilot experiment using a semi-automated method for logical schema acquisition.

Science.gov (United States)

García-Remesal, M; Maojo, V; Billhardt, H; Crespo, J

2010-01-01

Bringing together structured and text-based sources is an exciting challenge for biomedical informaticians, since most relevant biomedical sources belong to one of these categories. In this paper we evaluate the feasibility of integrating relational and text-based biomedical sources using: i) an original logical schema acquisition method for textual databases developed by the authors, and ii) OntoFusion, a system originally designed by the authors for the integration of relational sources. We conducted an integration experiment involving a test set of seven differently structured sources covering the domain of genetic diseases. We used our logical schema acquisition method to generate schemas for all textual sources. The sources were integrated using the methods and tools provided by OntoFusion. The integration was validated using a test set of 500 queries. A panel of experts answered a questionnaire to evaluate i) the quality of the extracted schemas, ii) the query processing performance of the integrated set of sources, and iii) the relevance of the retrieved results. The results of the survey show that our method extracts coherent and representative logical schemas. Experts' feedback on the performance of the integrated system and the relevance of the retrieved results was also positive. Regarding the validation of the integration, the system successfully provided correct results for all queries in the test set. The results of the experiment suggest that text-based sources including a logical schema can be regarded as equivalent to structured databases. Using our method, previous research and existing tools designed for the integration of structured databases can be reused - possibly subject to minor modifications - to integrate differently structured sources.

Proving termination of logic programs with delay declarations

NARCIS (Netherlands)

E. Marchiori; F. Teusink (Frank)

1996-01-01

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

Formal Methods Applications in Air Transportation

Science.gov (United States)

Farley, Todd

2009-01-01

The U.S. air transportation system is the most productive in the world, moving far more people and goods than any other. It is also the safest system in the world, thanks in part to its venerable air traffic control system. But as demand for air travel continues to grow, the air traffic control system s aging infrastructure and labor-intensive procedures are impinging on its ability to keep pace with demand. And that impinges on the growth of our economy. Air traffic control modernization has long held the promise of a more efficient air transportation system. Part of NASA s current mission is to develop advanced automation and operational concepts that will expand the capacity of our national airspace system while still maintaining its excellent record for safety. It is a challenging mission, as efforts to modernize have, for decades, been hamstrung by the inability to assure safety to the satisfaction of system operators, system regulators, and/or the traveling public. In this talk, we ll provide a brief history of air traffic control, focusing on the tension between efficiency and safety assurance, and the promise of formal methods going forward.

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

Science.gov (United States)

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

2011-03-23

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

Transforming equality logic to propositional logic

NARCIS (Netherlands)

Zantema, H.; Groote, J.F.

2003-01-01

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

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

Location priority for non-formal early childhood education school based on promethee method and map visualization

Science.gov (United States)

Ayu Nurul Handayani, Hemas; Waspada, Indra

2018-05-01

Non-formal Early Childhood Education (non-formal ECE) is an education that is held for children under 4 years old. The implementation in District of Banyumas, Non-formal ECE is monitored by The District Government of Banyumas and helped by Sanggar Kegiatan Belajar (SKB) Purwokerto as one of the organizer of Non-formal Education. The government itself has a program for distributing ECE to all villages in Indonesia. However, The location to construct the ECE school in several years ahead is not arranged yet. Therefore, for supporting that program, a decision support system is made to give some recommendation villages for constructing The ECE building. The data are projected based on Brown’s Double Exponential Smoothing Method and utilizing Preference Ranking Organization Method for Enrichment Evaluation (Promethee) to generate priority order. As the recommendations system, it generates map visualization which is colored according to the priority level of sub-district and village area. The system was tested with black box testing, Promethee testing, and usability testing. The results showed that the system functionality and Promethee algorithm were working properly, and the user was satisfied.

The rate of acquisition of formal operational schemata in adolescence: A secondary analysis

Science.gov (United States)

Eckstein, Shulamith G.; Shemesh, Michal

A theoretical model of cognitive development is applied to the study of the acquisition of formal operational schemata by adolescents. The model predicts that the proportion of adolescents who have not yet acquired the ability to perform a a specific Piagetian-like task is an exponentially decreasing function of age. The model has been used to analyze the data of two large-scale studies performed in the United States and in Israel. The functional dependence upon age was found to be the same in both countries for tasks which are used to assess the following formal operations: proportional reasoning, probabilistic reasoning, correlations, and combinatorial analysis. Different functional dependence was found for tasks assessing conservation, control of variables, and prepositional logic. These results give support to the unity hypothesis of cognitive development, that is, the hypothesis that the various schemata of formal thought appear simultaneously.

Logic and Ontology

Directory of Open Access Journals (Sweden)

Newton C. A. da Costa

2002-12-01

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

Fusion Control of Flexible Logic Control and Neural Network

Directory of Open Access Journals (Sweden)

Lihua Fu

2014-01-01

Full Text Available Based on the basic physical meaning of error E and error variety EC, this paper analyzes the logical relationship between them and uses Universal Combinatorial Operation Model in Universal Logic to describe it. Accordingly, a flexible logic control method is put forward to realize effective control on multivariable nonlinear system. In order to implement fusion control with artificial neural network, this paper proposes a new neuron model of Zero-level Universal Combinatorial Operation in Universal Logic. And the artificial neural network of flexible logic control model is implemented based on the proposed neuron model. Finally, stability control, anti-interference control of double inverted-pendulum system, and free walking of cart pendulum system on a level track are realized, showing experimentally the feasibility and validity of this method.

Formal Analysis of Domain Models

National Research Council Canada - National Science Library

Bharadwaj, Ramesh

2002-01-01

Recently, there has been a great deal of interest in the application of formal methods, in particular, precise formal notations and automatic analysis tools for the creation and analysis of requirements specifications (i.e...

On the Predictability of Classical Propositional Logic

OpenAIRE

Finger, Marcelo; Reis, Poliana

2013-01-01

In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction, that opposes considering Boolean Logic as trivial in any sense. For that, we study the predictability of classical logic, which we take to be the distribution of the runtime of its decision process. We present a series of experiments that det...

Improvements to Earthquake Location with a Fuzzy Logic Approach

Science.gov (United States)

Gökalp, Hüseyin

2018-01-01

In this study, improvements to the earthquake location method were investigated using a fuzzy logic approach proposed by Lin and Sanford (Bull Seismol Soc Am 91:82-93, 2001). The method has certain advantages compared to the inverse methods in terms of eliminating the uncertainties of arrival times and reading errors. In this study, adopting this approach, epicentral locations were determined based on the results of a fuzzy logic space concerning the uncertainties in the velocity models. To map the uncertainties in arrival times into the fuzzy logic space, a trapezoidal membership function was constructed by directly using the travel time difference between the two stations for the P- and S-arrival times instead of the P- and S-wave models to eliminate the need for obtaining information concerning the velocity structure of the study area. The results showed that this method worked most effectively when earthquakes occurred away from a network or when the arrival time data contained phase reading errors. In this study, to resolve the problems related to determining the epicentral locations of the events, a forward modeling method like the grid search technique was used by applying different logical operations (i.e., intersection, union, and their combination) with a fuzzy logic approach. The locations of the events were depended on results of fuzzy logic outputs in fuzzy logic space by searching in a gridded region. The process of location determination with the defuzzification of only the grid points with the membership value of 1 obtained by normalizing all the maximum fuzzy output values of the highest values resulted in more reliable epicentral locations for the earthquakes than the other approaches. In addition, throughout the process, the center-of-gravity method was used as a defuzzification operation.

Formal Testing of Correspondence Carrying Software

NARCIS (Netherlands)

Bujorianu, M.C.; Bujorianu, L.M.; Maharaj, S.

2008-01-01

Nowadays formal software development is characterised by use of multitude formal specification languages. Test case generation from formal specifications depends in general on a specific language, and, moreover, there are competing methods for each language. There is a need for a generic approach to

Formal verification of industrial control systems

CERN Multimedia

CERN. Geneva

2015-01-01

Verification of critical software is a high priority but a challenging task for industrial control systems. For many kinds of problems, testing is not an efficient method. Formal methods, such as model checking appears to be an appropriate complementary method. However, it is not common to use model checking in industry yet, as this method needs typically formal methods expertise and huge computing power. In the EN-ICE-PLC section, we are working on a [methodology][1] and a tool ([PLCverif][2]) to overcome these challenges and to integrate formal verification in the development process of our PLC-based control systems. [1]: http://cern.ch/project-plc-formalmethods [2]: http://cern.ch/plcverif

A Subjective Logic Formalisation of the Principle of Polyrepresentation for Information Needs

DEFF Research Database (Denmark)

Lioma, Christina; Larsen, Birger; Schütze, Hinrich

2010-01-01

of the principle of Polyrepresentation, a theoretical framework for reasoning about different representations arising from interactive information retrieval in a given context. Although the principle of Polyrepresentation has received attention from many researchers, not much empirical work has been done based...... on it. One reason may be that it has not yet been formalised mathematically. In this paper we propose an up-to-date and flexible mathematical formalisation of the principle of Polyrepresentation for information needs. Specifically, we apply Subjective Logic to model different representations...... of information needs as beliefs marked by degrees of uncertainty. We combine such beliefs using different logical operators, and we discuss these combinations with respect to different retrieval scenarios and situations. A formal model is introduced and discussed, with illustrative applications to the modelling...

Quantum Logic as a Dynamic Logic

NARCIS (Netherlands)

Baltag, A.; Smets, S.

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

Quantum logic as a dynamic logic

NARCIS (Netherlands)

Baltag, Alexandru; Smets, Sonja

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