نتایج جستجو برای: formalization

تعداد نتایج: 7767  

2013
Ejaz Ghani Ravi Kanbur

FORMALITY: CONCEPTS, MEASUREMENT, AND TRENDS ..................................................................................... 3 CONCEPTS .................................................................................................................................................................... 3 MEASUREMENT AND TRENDS ....................................................................

Journal: :Studia Logica 1991
Albert Visser

1991
E Fiesler

In order to assist the eld of neural networks in its maturing a formal ization and a solid foundation are essential Additionally to permit the introduction of formal proofs it is essential to have an all encompassing formal mathematical de nition of a neural network Most neural networks even biological ones exhibit a layered struc ture This publication shows that all neural networks can be repr...

2012
Naeem Ahmad Abbasi Roger Villemaire Chun-Yi Su Amir G. Aghdam Ali Ghrayeb

Formal Reliability Analysis using Higher-Order Logic Theorem Proving Naeem Ahmad Abbasi, Ph. D. Concordia University, 2012 Traditional techniques used in the reliability analysis of engineering systems have limitations. Paper-and-pencil based analysis is prone to human error and simulation based techniques cannot be computationally one hundred percent accurate. An alternative to these two tradi...

2002
Frederick Butler Iliano Cervesato Aaron D. Jaggard Andre Scedrov

We give three formalizations of the Kerberos 5 authentication protocol in the Multi-Set Rewriting (MSR)formalism. One is a high-level formalization containing just enough detail to prove authentication andconfidentiality properties of the protocol. A second formalization refines this by adding a variety of protocoloptions; we similarly refine proofs of properties in the first fo...

Journal: :Mathematical Structures in Computer Science 2011
Claudio Sacerdoti Coen Enrico Tassi

We describe some formal topological results, formalized in Matita 1/2, presented in predicative intuitionistic logic and in terms of Overlap Algebras. Overlap Algebras are new algebraic structures designed to ease reasoning about subsets in an algebraic way within intuitionistic logic. We find that they also ease the formalization of formal topological results in an interactive theorem prover. ...

2002
Anna Ingólfsdóttir Anders Lyhne Christensen Jens Alsted Hansen Jacob Johnsen John Knudsen Jacob Illum Rasmussen Ja ob Johnsen

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 established. Initially, the biological model is presented. On the basis of this biological model we ...

Journal: :Social Science Research Network 2021

The aim of this report is to evaluate “e-formalization” in European countries. To tackle informality, the lockdown and physical distancing measures resulting from COVID-19 pandemic has resulted a decrease onsite workplace inspections Europe greater use e-initiatives as complement traditional inspection. Therefore, made e-formalization more relevant pertinent, accelerating trend towards innovati...

2009
Michael Baumgartner

In ever so many philosophical introductions to formal logic the latter is presented as the philosopher’s ars iudicandi, i. e. as the instrument that evaluates the quality of philosophical arguments or, more generally, of informal reasoning. 1 Irrespective of its content, an argument is only worthy of consideration if it is valid, i. e. if the truth of its premise(s) necessitates the truth of it...

2007
Mathilde Arnaud

Pitts and Shinwell introduced an idealized programming language containing constructs for binding and also for pattern matching against this binding construct. They prove a result about which operations on names can co-exist with the binding construct in this language. What makes this construct interesting is that it generates a new name at the moment of “unbinding”. In this report we describe ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید