Results 21 to 30 of about 3,261,962 (390)
Automatic verification of finite-state concurrent systems using temporal logic specifications
TOPL, 1986 We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size
E. Clarke, E. Emerson, A. Sistla
semanticscholar +1 more source
Choreographies, Logically [PDF]
Distributed Computing, 2014 In Choreographic Programming, a distributed system is programmed by giving a choreography, a global description of its interactions, instead of separately specifying the behaviour of each of its processes. Process implementations in terms of a distributed language can then be automatically projected from a choreography.
Marco Carbone +2 more
openaire +6 more sources
SIGA, 1992 Linear logic was introduced by Girard in 1987 [11] . Since then many results have supported Girard' s statement, "Linear logic is a resource conscious logic," and related slogans .
P. Lincoln
semanticscholar +1 more source
Spin and charge drift-diffusion in ultra-scaled MRAM cells
Scientific Reports, 2022 Designing advanced single-digit shape-anisotropy MRAM cells requires an accurate evaluation of spin currents and torques in magnetic tunnel junctions (MTJs) with elongated free and reference layers.
Simone Fiorentini +6 more
doaj +1 more source
Static Seeding and Clustering of LSTM Embeddings to Learn From Loosely Time-Decoupled Events
IEEE Access, 2023 Humans learn from the occurrence of events at different places and times to predict similar trajectories of events. We define loosely decoupled time (LDT) phenomena as two or more events that could occur in different places and across different timelines
Christian G. Manasseh +3 more
doaj +1 more source
Transition Semantics - The Dynamics of Dependence Logic [PDF]
, 2013 We examine the relationship between Dependence Logic and game logics. A variant of Dynamic Game Logic, called Transition Logic, is developed, and we show that its relationship with Dependence Logic is comparable to the one between First-Order Logic and ...
Galliani, Pietro
core +1 more source
Notre Dame Journal of Formal Logic, 1999 The paper starts with an examination and critique of Tarski's well-known proposed explication of the notion of logical operation in the type structure over a given domain of individuals as one which is invariant with respect to arbitrary permutations of the domain.
openaire +3 more sources
Informal Logic referees 2011-2012
Informal Logic, 2013 The Editors express their gratitude and appreciation to the indi-viduals listed below who served as referees for Informal Logic for Volumes 31 (2011) and 32 (2012).
Informal Logic Editors
doaj +3 more sources
On the Concept of a Notational Variant [PDF]
, 2017 In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic.
C Caleiro +14 more
core +1 more source
, 2009 It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and therefore cannot be distributive either - as opposed to the standard lattice models that are orthomodular and ...
Norman D. Megill, Mladen Pavicic
openaire +3 more sources