Results 51 to 60 of about 47,932 (337)
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2020 The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.
Manuel Bodirsky, Johannes Greiner
doaj +1 more source
Strategy Logic with Imperfect Information
, 2018 We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, the problem turns out to be undecidable.
Berthon, Raphaël +4 more
core +1 more source
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages [PDF]
, 2007 The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the
Glasser, Christian +2 more
core +7 more sources
Insights into PI3K/AKT signaling in B cell development and chronic lymphocytic leukemia
FEBS Letters, EarlyView.This Review explores how the phosphoinositide 3‐kinase and protein kinase B pathway shapes B cell development and drives chronic lymphocytic leukemia, a common blood cancer. It examines how signaling levels affect disease progression, addresses treatment challenges, and introduces novel experimental strategies to improve therapies and patient outcomes.
Maike Buchner
wiley +1 more source
FEBS Letters, EarlyView.To explore the impact of the overexpression of the multidrug‐transporter P‐glycoprotein (ABCB1) on membrane fluidity, we compared the transversal gradient of mobility and microviscosity in plasma membranes of drug‐sensitive Chinese hamster ovary cells (AuxB1) and their multidrug‐resistant derivatives (B30) using the fluorescent n‐(9‐anthroyloxy) fatty ...
Roger Busche +2 more
wiley +1 more source
Parameterized Verification of Coverability in Well-Structured Broadcast Networks [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies.
A.R. Balasubramanian
doaj +1 more source
Equivalence-Checking on Infinite-State Systems: Techniques and Results
, 2005 The paper presents a selection of recently developed and/or used techniques for equivalence-checking on infinite-state systems, and an up-to-date overview of existing results (as of September 2004)
Jancar, Petr, Kucera, Antonin
core +1 more source
Specifying Graph Languages with Type Graphs [PDF]
, 2017 We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped homomorphically to a given ...
Corradini, Andrea +2 more
core +2 more sources
Circulating histones as clinical biomarkers in critically ill conditions
FEBS Letters, EarlyView.Circulating histones are emerging as promising biomarkers in critical illness due to their diagnostic, prognostic, and therapeutic potential. Detection methods such as ELISA and mass spectrometry provide reliable approaches for quantifying histone levels in plasma samples.
José Luis García‐Gimenez +17 more
wiley +1 more source
Boundedness in languages of infinite words [PDF]
Logical Methods in Computer Science, 2017 We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions.
Mikołaj Bojańczyk, Thomas Colcombet
doaj +1 more source