Results 61 to 70 of about 693,962 (268)
Abstract Proof by induction is commonplace in modern mathematics and computational logic. This paper overviews and discusses our recent results in turning saturation-based first-order theorem proving into a powerful framework for automating inductive reasoning.
Laura Kovács +3 more
openaire +1 more source
, 2010 YAGO is an automatically generated ontology out of Wikipedia and WordNet. It is eventually represented in a proprietary flat text file format and a core comprises 10 million facts and formulas. We present a translation of YAGO into the Bernays-Schonfinkel Horn class with equality.
Martin Suda 0001 +2 more
openaire +3 more sources
SIAM Journal on Discrete Mathematics, 2023 Recently, the saturation problem of $0$-$1$ matrices gained a lot of attention. This problem can be regarded as a saturation problem of ordered bipartite graphs. Motivated by this, we initiate the study of the saturation problem of ordered and cyclically ordered graphs.
Vladimir Boskovic, Balázs Keszegh
openaire +3 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic
Notre Dame Journal of Formal Logic, 2011 We discuss automorphisms of saturated models of PA and boundedly saturated models of PA. We show that Smorynski's Lemma and Kaye's Theorem are not only true for countable recursively saturated models of PA but also true for all boundedly saturated models of PA with slight modifications.
Nurkhaidarov, Ermek S., Shochat, Erez
openaire +2 more sources
On Minimum Saturated Matrices [PDF]
Graphs and Combinatorics, 2012 31 pages, included a C ...
Andrzej Dudek +2 more
openaire +2 more sources
Investigating transcription factor dynamics in health and disease using FRAP
FEBS Letters, EarlyView.FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source
Nuclear FusionPlasma fluence at the divertor of a future magnetic confinement fusion device can accumulate up to ∼10 ^28 –10 ^29 m ^−2 per year. Yet hydrogen isotope (HI) retention under such high-fluence plasma exposure has been rarely reported.
Yi-Wen Sun +10 more
doaj +1 more source
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source