Results 41 to 50 of about 16,441 (253)
Interpolation in fragments of intuitionistic propositional logic [PDF]
Abstract We show in this paper that all fragments of intuitionistic propositional logic based on a subset of the connectives ∧, ∨, →, ¬ satisfy interpolation. Fragments containing ↔ or ¬¬ are briefly considered.
openaire +4 more sources
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
On Sub-Propositional Fragments of Modal Logic
In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the so-called core fragment, defined as the intersection of the Horn and the Krom fragments, plus their sub-fragments obtained
Davide Bresolin +2 more
openaire +7 more sources
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley +1 more source
MK-fuzzy Automata and MSO Logics [PDF]
We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network ...
Manfred Droste +3 more
doaj +1 more source
A structurally complete fragment of relevant logic.
In the fragment of relevant logic \(R\) whose connectives are \(\to\) and \(\&\), every admissible rule is derivable. The proof is a non-trivial variant of the argument in the intuitionist case.
Slaney, John K., Meyer, Robert K.
openaire +2 more sources
Tractable Reasoning in a Fragment of Separation Logic [PDF]
In 2004, Berdine, Calcagno and O'Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed that entailment in this fragment is in coNP, but the precise complexity of this problem has been open since.
Byron Cook +4 more
openaire +2 more sources
Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Quantum Uncertainties and Holism Seem to Render Irrelevant Qudit-Semantics
We consider a semantics based on the peculiar holistic features of the quantum formalism. Any formula of the language gives rise to a quantum circuit that transforms the density operator associated to the formula into the density operator associated to ...
Roberto Leporini
doaj +1 more source

