Results 31 to 40 of about 4,114 (268)
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]
Logical Methods in Computer ScienceWe 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
Unification in the Description Logic EL [PDF]
Logical 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
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
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs [PDF]
, 2008 Managing uncertainty and/or vagueness is starting to play an important role in Semantic Web representation languages. Our aim is to overview basic concepts on representing uncertain and vague knowledge in current Semantic Web ontology and rule languages (and their combination).
openaire +4 more sources
The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome
FEBS Letters, EarlyView.This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley +1 more source
Preferential Description Logics [PDF]
, 2007 We extend the Description Logic ALC with a "typicality" operator T that allows us to reason about the prototypical properties and inheritance with exceptions. The resulting logic is called ALC + T. The typicality operator is intended to select the "most normal" or "most typical" instances of a concept. In our framework, knowledge bases may then contain,
Laura Giordano 0001 +3 more
openaire +1 more source
Моделирование и анализ информационных систем, 2021 Sequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the streams of instructions or responses.
Anton Romanovich Gnatenko +1 more
doaj +1 more source
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
Description logics as polyadic modal logics
CoRR, 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
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests [PDF]
Logical Methods in Computer ScienceSHACL 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