Results 111 to 120 of about 39,716 (258)

Decidable varieties of p-algebras [PDF]

arXiv
We show that for quasivarieties of p-algebras the properties of (i) having decidable first-order theory and (ii) having decidable first-order theory of the finite members, coincide. The only two quasivarieties with these properties are the trivial variety and the variety of Boolean algebras.
arxiv  

Special Issue of Selected Extended Papers of IJCAR 2020. [PDF]

J Autom Reason, 2022
Peltier N, Sofronie-Stokkermans V.
europepmc   +1 more source

Enhancing patient engagement in cancer research: a focus on patient‐centric approaches to scientific discovery

Molecular Oncology, EarlyView.
Patient engagement involves actively including patients in healthcare decisions and research to ensure care and studies align with their needs. This approach improves outcomes, trust, and communication while fostering collaboration between patients and professionals.
Estela Cepeda, Marina Reguero, Vanesa Abón, Marta Puyol   +3 more
wiley   +1 more source

A variety with solvable, but not uniformly solvable, word problem [PDF]

Proc. London Math. Soc. 66 (1993), 225-256, 1993
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the ...
arxiv  

On the Theory of Structural Subtyping

, 2003
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let $\Sigma$ be a language consisting of function symbols (representing type constructors) and $C$ a decidable structure in the relational language $L ...
Kuncak, Viktor, Rinard, Martin
core   +4 more sources

A large‐scale retrospective study in metastatic breast cancer patients using circulating tumour DNA and machine learning to predict treatment outcome and progression‐free survival

Molecular Oncology, EarlyView.
There is an unmet need in metastatic breast cancer patients to monitor therapy response in real time. In this study, we show how a noninvasive and affordable strategy based on sequencing of plasma samples with longitudinal tracking of tumour fraction paired with a statistical model provides valuable information on treatment response in advance of the ...
Emma J. Beddowes, Mario Ortega Duran, Solon Karapanagiotis, Alistair Martin, Meiling Gao, Riccardo Masina, Ramona Woitek, James Tanner, Fleur Tippin, Justine Kane, Jonathan Lay, Anja Brouwer, Stephen‐John Sammut, Suet‐Feung Chin, Davina Gale, Dana W. Y. Tsui, Sarah‐Jane Dawson, Nitzan Rosenfeld, Maurizio Callari, Oscar M. Rueda, Carlos Caldas   +20 more
wiley   +1 more source

Infinite Time Turing Machines [PDF]

arXiv, 1998
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of computation on the reals and concepts of decidability and semi-decidability for sets of reals as well as individual ...
arxiv  

A review of data abstraction. [PDF]

Front Artif Intell, 2023
Cima G, Console M, Lenzerini M, Poggi A.
europepmc   +1 more source

Multidimensional OMICs reveal ARID1A orchestrated control of DNA damage, splicing, and cell cycle in normal‐like and malignant urothelial cells

Molecular Oncology, EarlyView.
Loss of the frequently mutated chromatin remodeler ARID1A, a subunit of the SWI/SNF cBAF complex, results in less open chromatin, alternative splicing, and the failure to stop cells from progressing through the cell cycle after DNA damage in bladder (cancer) cells. Created in BioRender. Epigenetic regulators, such as the SWI/SNF complex, with important
Rebecca M. Schlösser, Florian Krumbach, Eyleen Corrales, Geoffroy Andrieux, Christian Preisinger, Franziska Liss, Alexandra Golzmann, Melanie Boerries, Kerstin Becker, Ruth Knüchel, Stefan Garczyk, Bernhard Lüscher   +11 more
wiley   +1 more source

Strong equivalence of reversible circuits is coNP-complete [PDF]

arXiv, 2013
It is well-known that deciding equivalence of logic circuits is a coNP-complete problem. As a corollary, the problem of deciding weak equivalence of reversible circuits, i.e. ignoring the ancilla bits, is also coNP-complete. The complexity of deciding strong equivalence, including the ancilla bits, is less obvious and may depend on gate set.
arxiv