Results 31 to 40 of about 3,086 (177)

New Improvements in Automatic Structure Elucidation Using the LSD (Logic for Structure Determination) and the SISTEMAT Expert Systems

Natural Product Communications, 2010
This article describes the integration of the LSD (Logic for Structure Determination) and SISTEMAT expert systems that were both designed for the computer-assisted structure elucidation of small organic molecules.
Bertrand Plainchont, Jean-Marc Nuzillard, Gilberto V. Rodrigues, Marcelo J. P. Ferreira, Marcus T. Scotti, Vicente P. Emerenciano   +5 more
doaj   +1 more source

Basic Logic and Quantum Entanglement [PDF]

, 2006
As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up.
Battilotti G, Bell J S, Birkhoff G, Gentzen G, Jozsa R, Nielsen M A, P A Zizzi, Zizzi P   +7 more
core   +2 more sources

A substructural logic for layered graphs [PDF]

Journal of Logic and Computation, 2014
Complex systems, be they natural or synthetic, are ubiquitous. In particular, complex networks of devices and services underpin most of society's operations. By their very nature, such systems are difficult to conceptualize and reason about effectively.
Collinson, M, McDonald, K, Pym, D
openaire   +2 more sources

Distribution-Free Modal Logics: Sahlqvist–Van Benthem Correspondence

Logics
We present an extension and generalization of Sahlqvist–van Benthem correspondence to the case of distribution-free modal logic, with, or without negation and/or implication connectives.
Chrysafis Hartonas
doaj   +1 more source

Type Classes for Lightweight Substructural Types

, 2015
Linear and substructural types are powerful tools, but adding them to standard functional programming languages often means introducing extra annotations and typing machinery.
Gan, Edward, Morrisett, Greg, Tov, Jesse A.   +2 more
core   +2 more sources

Weak consistency and strong paraconsistency

tripleC: Communication, Capitalism & Critique, 2009
In a standard sense, consistency and paraconsistency are understood as, respectively, the absence of any contradiction and as the absence of the ECQ (“E contradictione quodlibet”) rule that allows us to conclude any well formed formula from any ...
Gemma Robles
doaj   +1 more source

Canonical formulas for k-potent commutative, integral, residuated lattices

, 2016
Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4.
Bezhanishvili, Nick, Galatos, Nick, Spada, Luca   +2 more
core   +1 more source

Free choice permission as resource-sensitive reasoning

Semantics and Pragmatics, 2010
Free choice permission is a long-standing puzzle in deontic logic and in natural language semantics. It involves what appears to be a conjunctive use of "or": from "You may eat an apple or a pear", we can infer that "You may eat an apple" and that "You ...
Chris Barker
doaj   +1 more source

A graph-theoretic account of logics [PDF]

, 2009
A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source).
Coniglio, Marcelo E., Rasga, J., Sernadas, A., Sernadas, C.   +3 more
core   +2 more sources

Cis‐ and Trans‐Regulatory Factors Independently Shape Phenotypic Heterogeneity of Retinitis Pigmentosa

Advanced Science, EarlyView.
A zebrafish model carrying an identical human RHO S334X allele reveals two independent genetic layers shaping retinitis pigmentosa (RP) severity: a protective 3‐bp cis‐regulatory insertion that attenuates transgene expression, and a dominant trans‐acting modifier that restores a severe phenotype.
Cong Cui, Kotone Nakagawa, Takumi Tateno, Ayaka Dan, Dexin Meng, Yoshihiro Omori, Soma Tomihara, Suzuri Okamoto, Shigeru Sato, Motokazu Tsujikawa   +9 more
wiley   +1 more source