Results 11 to 20 of about 776,600 (243)
The Logic of Time: from Aristotle to Computer Science [PDF]
, 2017 Charla tipo conferencia-seminario dada para alumnos de un másterThis short course will explore that continuous thread which connects the discussion about time in philosophy with the modern use of temporal logic in computer science. It will go through the
Bresolin, Davide
core
Logical consequences. Theory and applications: An introduction. [PDF]
, 2020 2nd edition. The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind.
Augusto, Luis M.
core
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
"Boring formal methods" or "Sherlock Holmes deduction methods"?
, 2016 This paper provides an overview of common challenges in teaching of logic and formal methods to Computer Science and IT students. We discuss our experiences from the course IN3050: Applied Logic in Engineering, introduced as a "logic for everybody ...
BF Sherman +11 more
core +1 more source
Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic [PDF]
, 2000 Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Goedel logic based on the truth value set [0,1].
Baaz, Matthias, Zach, Richard
core +4 more sources
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Completeness of Flat Coalgebraic Fixpoint Logics
, 2010 Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type.
Gastin, P. +3 more
core +1 more source
Preservation and decomposition theorems for bounded degree structures [PDF]
, 2015 We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a \^ad ...
Harwath, Frederik +2 more
core +2 more sources
Digital twins to accelerate target identification and drug development for immune‐mediated disorders
FEBS Open Bio, EarlyView.Digital twins integrate patient‐derived molecular and clinical data into personalised computational models that simulate disease mechanisms. They enable rapid identification and validation of therapeutic targets, prediction of drug responses, and prioritisation of candidate interventions.
Anna Niarakis, Philippe Moingeon
wiley +1 more source
Representation results for defeasible logic [PDF]
, 2000 The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism ...
Antoniou, G. +3 more
core +7 more sources