Results 41 to 50 of about 2,297,669 (248)

An ontology for software component matching [PDF]

open access: yes, 2003
The Web is likely to be a central platform for software development in the future. We investigate how Semantic Web technologies, in particular ontologies, can be utilised to support software component development in a Web environment.
Claus Pahl, Pahl, Claus
core   +1 more source

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]

open access: yesLogical Methods in Computer Science
We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete.
Stephane Demri, Karin Quaas
doaj   +1 more source

‘Guide and Prejudice’— How Argonautes recognize targets across domains of life

open access: yesFEBS Letters, EarlyView.
Argonaute proteins use short nucleic‐acid guides to locate and regulate specific targets across all domains of life. Despite striking diversity—from human gene silencing to bacterial immune defence—all Argonautes share a conserved three‐stage recognition logic: guide‐directed sampling, progressive target pairing with a conformational checkpoint and ...
Jack P. K. Bravo
wiley   +1 more source

Unification in the Description Logic EL [PDF]

open access: yesLogical Methods in Computer Science, 2010
The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies.
Franz Baader, Barbara Morawska
doaj   +1 more source

Description logics as polyadic modal logics

open access: yesCoRR, 2021
We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be used to define operations on relations of all arities. As a concrete system to illustrate our approach, we investigate the polyadic version of ALC extended with relational ...
Jonne Iso-Tuisku, Antti Kuusisto
openaire   +2 more sources

Reasoning with Large A-Boxes in Fuzzy Description Logics using DL reasoners: An Experimental Evaluation [PDF]

open access: yes, 2008
Cimiano P, Haase P, Ji Q, et al. Reasoning with Large A-Boxes in Fuzzy Description Logics using DL reasoners: An Experimental Evaluation. In: Proceedings of the ESWC Workshop on Advancing Reasoning on the Web: Scalability and Commonsense ...
Haase, Peter   +7 more
core  

From junk to function — How weak selection in eukaryotes builds new parts and drives genomic complexity

open access: yesFEBS Letters, EarlyView.
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley   +1 more source

Artificial molecular machines and motors—Design and control of nanoscale motion

open access: yesFEBS Letters, EarlyView.
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley   +1 more source

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests [PDF]

open access: yesLogical Methods in Computer Science
SHACL is a W3C-proposed schema language for expressing structural constraints on RDF graphs. Recent work on formalizing this language has revealed a striking relationship to description logics.
Bart Bogaerts   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy