Results 61 to 70 of about 491,607 (366)
Journal of Pure and Applied Algebra, 1995 For a finite group \(G\), the decision problem for the theory of \(\mathbb{Z} G\)-lattices is considered. In the representation-finite case, decidability is shown under the assumption that each indecomposable is explicitly given as a matrix representation. By extension of an argument of Garavaglia, the authors show that \(\mathbb{Z} G\)-lattices in the
Marcja, Annalisa, Toffalori, Carlo
openaire +2 more sources
Decidability properties for fragments of CHR
, 2010 We study the decidability of termination for two CHR dialects which, similarly to the Datalog like languages, are defined by using a signature which does not allow function symbols (of arity >0). Both languages allow the use of the = built-in in the body
Betz +12 more
core +1 more source
FEBS Letters, EarlyView.Antimicrobial resistance (AMR) is of huge importance, resulting in over 1 million deaths each year. Here, we describe how a new drug, enmetazobactam, designed to help fight resistant bacterial diseases, inhibits a key enzyme (GES‐1) responsible for AMR. Our data show it is a more potent inhibitor than the related tazobactam, with high‐level computation
Michael Beer +10 more
wiley +1 more source
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]
Logical Methods in Computer Science, 2013 We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Luis Barguñó +4 more
doaj +1 more source
Eliminating Recursion from Monadic Datalog Programs on Trees
, 2015 We study the problem of eliminating recursion from monadic datalog programs on trees with an infinite set of labels. We show that the boundedness problem, i.e., determining whether a datalog program is equivalent to some nonrecursive one is undecidable ...
D Calvanese +12 more
core +1 more source
Novel and unscrutinized immune entities of the zebrafish gut
FEBS Letters, EarlyView.Understudied cells of the zebrafish immune system include bona fide immune cells and epithelial (‐derived) cells with immune functions. Research focusing on zebrafish cells which demonstrate similarities to mammalian immune cell counterparts may help us understand the pathologies in which they are implicated. Currently available and advanced tools make
Audrey Inge Schytz Andersen‐Civil +5 more
wiley +1 more source
Topological Semantics and Decidability [PDF]
, 2007 It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal logics of $T_0$
Sustretov, Dmitry
core +6 more sources
Generalized Post Embedding Problems
, 2014 The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions.
Karandikar, Prateek +1 more
core +1 more source
Imeglimin attenuates liver fibrosis by inhibiting vesicular ATP release from hepatic stellate cells
FEBS Letters, EarlyView.Imeglimin, at clinically relevant concentrations, inhibits vesicular ATP accumulation and release from hepatic stellate cells, thereby attenuating purinergic signaling and reducing fibrogenic activation. This mechanism reveals a newly identified antifibrotic action of imeglimin beyond glycemic control.
Seiji Nomura +8 more
wiley +1 more source
On Decidability of Hyperbolicity
Combinatorica, 2022 We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
Dvořák, Zdeněk, Postle, Luke
openaire +2 more sources