Search

The Zirconium (Z = 40) isotopic chain has attracted interest for more than four decades. The abrupt lowering of the energy of the first $2^+$ state and the increase in the transition strength B(E2; $2_1^\rightarrow 0_1^+$ going from $^{98}$Zr to $^{100}$Zr has been the first example of "quantum phase transition" in nuclear shapes, which has few equivalents in the nuclear chart. Although a multitude of experiments have been performed to measure nuclear properties related to nuclear shapes and collectivity in the region, none of the measured lifetimes were obtained using the Recoil Distance Doppler Shift method in the $\gamma\gamma$-coincidence mode where a gate on the direct feeding transition of the state of interest allows a strict control of systematical errors. This work reports the results of lifetime measurements for the first yrast excited states in $^{98-104}$Zr carried out to extract reduced transition probabilities. The new lifetime values in $\gamma\gamma$-coincidence and $\gamma$-single mode are compared with the results of former experiments. Recent predictions of the Interacting Boson Model with Configuration Mixing, the Symmetry Conserving Configuration Mixing model based on the Hartree-Fock-Bogoliubov approach and the Monte Carlo Shell Model are presented and compared with the experimental data.

We present the first measurement of the $^{47}$K($d,p\gamma$)$^{48}$K transfer reaction, performed in inverse kinematics using a reaccelerated beam of $^{47}$K. The level scheme of $^{48}$K has been greatly extended with nine new bound excited states identified and spectroscopic factors deduced. Detailed comparisons with SDPF-U and SDPF-MU shell-model calculations reveal a number of discrepancies with these results, and a preference for SDPF-MU is found. Intriguingly, an apparent systematic overestimation of spectroscopic factors and a poor reproduction of the energies for 1$^-$ states suggests that the mixing between the $\pi s^{\,\,\,1}_{1/2} d^{\,\,\,4}_{3/2}$ and $\pi s^{\,\,\,2}_{1/2} d^{\,\,\,3}_{3/2}$ proton configurations in $^{48}$K is not correctly described using current interactions, challenging our descriptions of light $N=28$ nuclei., Comment: 7 pages, 3 figures, 1 table

We introduce the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) the two-variable fragment of first-order logic as well as the so-called fluted fragment. We show that the adjacent fragment has the finite model property, and that the satisfiability problem for its k-variable sub-fragment is in (k-1)-NExpTime. Using known results on the fluted fragment, it follows that the satisfiability problem for the whole adjacent fragment is Tower-complete. We additionally consider the effect of the adjacency requirement on the well-known guarded fragment of first-order logic, whose satisfiability problem is TwoExpTime-complete. We show that the satisfiability problem for the intersection of the adjacent and guarded adjacent fragments remains TwoExpTime-hard. Finally, we show that any relaxation of the adjacency condition on the allowed order of variables in argument sequences yields a logic whose satisfiability and finite satisfiability problems are undecidable., Comment: Under submission to the Journal of Symbolic Logic. The paper extends and revises our ICALP 2023 paper. arXiv admin note: text overlap with arXiv:2305.03133

We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHb Self reg OIQ) over quasi-forests and establish its NP-completeness. This completes the data complexity landscape for decidable fragments of ZOIQ, and reproves known results on decidable fragments of OWL2 (SR family). Using the same technique, we establish coNEXPTIME-completeness (w.r.t. the combined complexity) of the entailment problem of rooted queries in ZIQ., Comment: Accepted to IJCAI 2024. A version with the appendix will appear soon

Zinc alloys have emerged as promising candidates for biodegradable materials due to their remarkable biocompatibility and favorable mechanical characteristics. The incorporation of alloying elements plays an essential role in advancing the tensile strength of Zn alloys. Nevertheless, achieving uniform dispersion of these elements poses challenges due to chemical segregation during solidification. In this study, rapid solidification followed by high-pressure torsion was successfully employed to fabricate Zn-Li-Mn-Mg-Cu alloys characterized by ultrafine-grained microstructures with evenly distributed nanometric intermetallic phases. A comprehensive examination, including phase composition, microstructural evolution, tensile properties and deformation mechanisms, was conducted. The impact of varying annealing temperatures on microstructural stability was systematically examined. The combined implementation of rapid solidification and high-pressure torsion yielded alloys with an average grain size below 360 nm, thereby demonstrating exceptional mechanical properties including yield stress (YS), ultimate tensile strength (UTS), and elongation to failure (Ef) equal to at least 325+-6 MPa, 350+-8 MPa and 40+-11 %, respectively. Heat treatment notably augmented the mechanical properties, resulting in a YS = 440+-11 MPa and UTS = 491+-6 MPa, while preserving plasticity (Ef = 23+-4 %) in the Zn-0.33Li-0.27Mn-0.14Mg-0.1Cu alloy. Nanoindentation strain rate jump tests identified thermally activated mechanisms and grain boundary sliding as dominant deformation mechanisms.

We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path expressions employing, respectively, regular and visibly-pushdown languages. The first one, ALCreg, is a notational variant of the well-known Propositional Dynamic Logic of Fischer and Ladner. The second one, ALCvpl, was introduced and investigated by Loding and Serre in 2007. The logic ALCvpl generalises many known decidable non-regular extensions of ALCreg. We provide a series of undecidability results. First, we show that decidability of the concept satisfiability problem for ALCvpl is lost upon adding the seemingly innocent Self operator. Second, we establish undecidability for the concept satisfiability problem for ALCvpl extended with nominals. Interestingly, our undecidability proof relies only on one single non-regular (visibly-pushdown) language, namely on r#s# := { r^n s^n | n in N } for fixed role names r and s. Finally, in contrast to the classical database setting, we establish undecidability of query entailment for queries involving non-regular atoms from r#s#, already in the case of ALC-TBoxes.

We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well as the fluted fragment. We show that the adjacent fragment has the finite model property, and that its satisfiability problem is no harder than for the fluted fragment (and hence is Tower-complete). We further show that any relaxation of the adjacency condition on the allowed order of variables in argument sequences yields a logic whose satisfiability and finite satisfiability problems are undecidable. Finally, we study the effect of the adjacency requirement on the well-known guarded fragment (GF) of first-order logic. We show that the satisfiability problem for the guarded adjacent fragment (GA) remains 2ExpTime-hard, thus strengthening the known lower bound for GF., Comment: Full version of our ICALP 2023 paper

Order-invariant first-order logic is an extension of first-order logic FO where formulae can make use of a linear order on the structures, under the proviso that they are order-invariant, i.e. that their truth value is the same for all linear orders. We continue the study of the two-variable fragment of order-invariant first-order logic initiated by Zeume and Harwath, and study its complexity and expressive power. We first establish coNExpTime-completeness for the problem of deciding if a given two-variable formula is order-invariant, which tightens and significantly simplifies the coN2ExpTime proof by Zeume and Harwath. Second, we address the question of whether every property expressible in order-invariant two-variable logic is also expressible in first-order logic without the use of a linear order. We suspect that the answer is ``no''. To justify our claim, we present a class of finite tree-like structures (of unbounded degree) in which a relaxed variant of order-invariant two-variable FO expresses properties that are not definable in plain FO. By contrast, we show that if one restricts their attention to classes of structures of bounded degree, then the expressive power of order-invariant two-variable FO is contained within FO., Comment: arXiv admin note: substantial text overlap with arXiv:2207.04986, under submission to LMCS

The COVID-19 pandemic has introduced new opportunities for health communication, including an increase in the public use of online outlets for health-related emotions. People have turned to social media networks to share sentiments related to the impacts of the COVID-19 pandemic. In this paper we examine the role of social messaging shared by Persons in the Public Eye (i.e. athletes, politicians, news personnel) in determining overall public discourse direction. We harvested approximately 13 million tweets ranging from 1 January 2020 to 1 March 2022. The sentiment was calculated for each tweet using a fine-tuned DistilRoBERTa model, which was used to compare COVID-19 vaccine-related Twitter posts (tweets) that co-occurred with mentions of People in the Public Eye. Our findings suggest the presence of consistent patterns of emotional content co-occurring with messaging shared by Persons in the Public Eye for the first two years of the COVID-19 pandemic influenced public opinion and largely stimulated online public discourse. We demonstrate that as the pandemic progressed, public sentiment shared on social networks was shaped by risk perceptions, political ideologies and health-protective behaviours shared by Persons in the Public Eye, often in a negative light., Comment: 7 Pages, 4 Figures

This study investigated and compared public sentiment related to COVID-19 vaccines expressed on two popular social media platforms, Reddit and Twitter, harvested from January 1, 2020, to March 1, 2022. To accomplish this task, we created a fine-tuned DistilRoBERTa model to predict sentiments of approximately 9.5 million Tweets and 70 thousand Reddit comments. To fine-tune our model, our team manually labeled the sentiment of 3600 Tweets and then augmented our dataset by the method of back-translation. Text sentiment for each social media platform was then classified with our fine-tuned model using Python and the Huggingface sentiment analysis pipeline. Our results determined that the average sentiment expressed on Twitter was more negative (52% positive) than positive and the sentiment expressed on Reddit was more positive than negative (53% positive). Though average sentiment was found to vary between these social media platforms, both displayed similar behavior related to sentiment shared at key vaccine-related developments during the pandemic. Considering this similar trend in shared sentiment demonstrated across social media platforms, Twitter and Reddit continue to be valuable data sources that public health officials can utilize to strengthen vaccine confidence and combat misinformation. As the spread of misinformation poses a range of psychological and psychosocial risks (anxiety, fear, etc.), there is an urgency in understanding the public perspective and attitude toward shared falsities. Comprehensive educational delivery systems tailored to the population's expressed sentiments that facilitate digital literacy, health information-seeking behavior, and precision health promotion could aid in clarifying such misinformation., Comment: 11 Pages, 5 Figures, and 1 Table

We establish coNExpTime-completeness of the problem of deciding order-invariance of a given two variable first-order formula, improving and significantly simplifying coTwoNExpTime bound by Zeume and Harwath.

We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. While the complexities of their satisfiability problems are now well-established, their model theory, however, is poorly understood. Our paper aims to provide some insight into it. We start by providing suitable notions of bisimulation for ordered logics. We next employ bisimulations to compare the relative expressive power of ordered logics, and to characterise our logics as bisimulation-invariant fragments of FO a la van Benthem. Afterwards, we study the Craig Interpolation Property~(CIP). We refute yet another claim from the infamous work by Purdy, by showing that the fluted and forward fragments do not enjoy CIP. We complement this result by showing that the ordered fragment and the guarded ordered logics enjoy CIP. These positive results rely on novel and quite intricate model constructions, which take full advantage of the "forwardness" of our logics., Comment: Accepted to the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)

The low-lying excited states in the neutron-deficient $N=Z+1$ nucleus $^{87}_{43}$Tc$^{\ }_{44}$ have been studied via the fusion-evaporation reaction $^{54}$Fe($^{36}$Ar, $2n1p$)$^{87}$Tc at the Grand Acc\'el\'erateur National d'Ions Lourds (GANIL), France. The AGATA spectrometer was used in conjunction with the auxiliary NEDA, Neutron Wall, and DIAMANT detector arrays to measure coincident prompt $\gamma$-rays, neutrons, and charged particles emitted in the reaction. A level scheme of $^{87}$Tc from the (9/2$^{+}_{g.s.}$) state to the (33/2$^{+}_{1}$) state was established based on 6 mutually coincident $\gamma$-ray transitions. The constructed level structure exhibits a rotational behavior with a sharp backbending at $\hbar\omega\approx 0.50$ MeV. A decrease in alignment frequency and increase in alignment sharpness in the odd-mass isotonic chains around $N=44$ is proposed as an effect of the enhanced isoscalar neutron-proton interactions in odd-mass nuclei when approaching the $N=Z$ line.

We present a unified approach to (both finite and unrestricted) worst-case optimal entailment of (unions of) conjunctive queries (U)CQs in the wide class of "locally-forward" description logics. The main technique that we employ is a generalisation of Lutz's spoiler technique, originally developed for CQ entailment in ALCHQ. Our result closes numerous gaps present in the literature, most notably implying ExpTime-completeness of (U)CQ-querying for any superlogic of ALC contained in ALCHbregQ, and, as we believe, is abstract enough to be employed as a black-box in many new scenarios.

During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of restriction imposed on formulae from the language. Despite the success of the mentioned logics in areas like formal verification and knowledge representation, such first-order fragments are too weak to express even the simplest statistical constraints, required for modelling of influence networks or in statistical reasoning. In this work we investigate the extensions of these classical decidable logics with percentage quantifiers, specifying how frequently a formula is satisfied in the indented model. We show, surprisingly, that all the mentioned decidable fragments become undecidable under such extension, sharpening the existing results in the literature. Our negative results are supplemented by decidability of the two-variable guarded fragment with even more expressive counting, namely Presburger constraints. Our results can be applied to infer decidability of various modal and description logics, e.g. Presburger Modal Logics with Converse or ALCI, with expressive cardinality constraints., Comment: To appear in FSTTCS 2021

In logic-based knowledge representation, query answering has essentially replaced mere satisfiability checking as the inferencing problem of primary interest. For knowledge bases in the basic description logic ALC, the computational complexity of conjunctive query (CQ) answering is well known to be ExpTime-complete and hence not harder than satisfiability. This does not change when the logic is extended by certain features (such as counting or role hierarchies), whereas adding others (inverses, nominals or transitivity together with role-hierarchies) turns CQ answering exponentially harder. We contribute to this line of results by showing the surprising fact that even extending ALC by just the Self operator - which proved innocuous in many other contexts - increases the complexity of CQ entailment to 2ExpTime. As common for this type of problem, our proof establishes a reduction from alternating Turing machines running in exponential space, but several novel ideas and encoding tricks are required to make the approach work in that specific, restricted setting., Comment: Minor stylistic improvements comparing to the 1st version

Adding propositional quantification to the modal logics K, T or S4 is known to lead to undecidability but CTL with propositional quantification under the tree semantics (tQCTL) admits a non-elementary Tower-complete satisfiability problem. We investigate the complexity of strict fragments of tQCTL as well as of the modal logic K with propositional quantification under the tree semantics. More specifically, we show that tQCTL restricted to the temporal operator EX is already Tower-hard, which is unexpected as EX can only enforce local properties. When tQCTL restricted to EX is interpreted on N-bounded trees for some N >= 2, we prove that the satisfiability problem is AExpPol-complete; AExpPol-hardness is established by reduction from a recently introduced tiling problem, instrumental for studying the model-checking problem for interval temporal logics. As consequences of our proof method, we prove Tower-hardness of tQCTL restricted to EF or to EXEF and of the well-known modal logics such as K, KD, GL, K4 and S4 with propositional quantification under a semantics based on classes of trees.

High-resolution gamma-ray spectroscopy of 18N is performed with the Advanced GAmma Tracking Array AGATA, following deep-inelastic processes induced by an 18O beam on a 181Ta target. Six states are newly identified, which together with the three known excitations exhaust all negative-parity excited states expected in 18N below the neutron threshold. Spin and parities are proposed for all located states on the basis of decay branchings and comparison with large-scale shell-model calculations performed in the p-sd space, with the YSOX interaction. Of particular interest is the location of the 0^-_1 and 1^-_2 excitations, which provide strong constrains for cross-shell p-sd matrix elements based on realistic interactions, and help to simultaneously reproduce the ground and first-excited states in 16N and 18N, for the first time. Understanding the 18N structure may also have significant impact on neutron-capture cross-section calculations in r-process modeling including light neutron-rich nuclei.

A novel Monte Carlo technique has been developed to determine lifetimes of excited states in the tens-to-hundreds femtoseconds range. The method is applied to low-energy heavy-ion binary reactions populating nuclei with complex velocity distributions. Its relevance is demonstrated in connection with the $^{18}$O(7.0 MeV/u) + $^{181}$Ta experiment, performed at GANIL with the AGATA+VAMOS+PARIS setup, to study neutron-rich O, C, N, ... nuclei. Excited states in $^{17}$O and $^{19}$O, with known lifetimes, are used to validate the method over the $\sim$20-400 fs lifetime-sensitivity range. Emphasis is given to the unprecedented position resolution provided by $\gamma$-tracking arrays, which turns out to be essential for reaching the required accuracy in Doppler-shift correction, at the basis of the detailed analysis of $\gamma$-ray lineshape and resulting state lifetime determination. The technique is anticipated to be an important tool for lifetime investigations in exotic neutron-rich nuclei, produced with intense ISOL-type beams.

The fusion and transfer induced fission reaction $^{9}$Be($^{238}$U,~f) with 6.2 MeV/u beam energy, using a unique setup consisting of AGATA, VAMOS++ and EXOGAM detectors, was used to populate through the fission process and study the neutron-rich $^{119,121}$In isotopes. This setup enabled the prompt-delayed $\gamma$-ray spectroscopy of isotopes in the time range of $100~\rm{ns} - 200~\mu\rm{s}$. In the odd-$A$ $^{119,121}$In isotopes, indications of a short half-life $19/2^{-}$ isomeric state, in addition to the previously known $25/2^{+}$ isomeric state, were observed from the present data. Further, new prompt transitions above the $25/2^{+}$ isomer in $^{121}$In were identified along with reevaluation of its half-life. The experimental data were compared with the theoretical results obtained in the framework of large-scale shell-model calculations in a restricted model space. The $\langle \pi g_{9/2} \nu h_{11/2};I \arrowvert \hat{\mathcal{H}}\arrowvert \pi g_{9/2} \nu h_{11/2};I\rangle$ two-body matrix elements of residual interaction were modified to explain the excitation energies and the $B(E2)$ transition probabilities in the neutron-rich In isotopes. The (i) decreasing trend of $E(29/2^{+}) - E(25/2^{+})$ in odd-In (with dominant configuration $\pi g_{9/2}^{-1}\nu h_{11/2}^{-2}$ and maximum aligned spin of $29/2^{+}$) and (ii) increasing trend of $E(27/2^{+}) - E(23/2^{+})$ in odd-Sb (with dominant configuration $\pi g_{7/2}^{+1}\nu h_{11/2}^{-2}$ and maximum aligned spin of $27/2^{+}$) with increasing neutron number could be understood as a consequence of hole-hole and particle-hole interactions, respectively., Comment: Accepted for publication in Phys. Rev. C

We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic modal logic ML with the composition operator | from static ambient logic, whereas ML(*) contains the separating conjunction * from separation logic. Though both operators are second-order in nature, we show that ML(|) is as expressive as the graded modal logic GML (on finite trees) whereas ML(*) lies strictly between ML and GML. Moreover, we establish that the satisfiability problem for ML(*) is Tower-complete, whereas for ML(|) is (only) AExpPol-complete. As a by-product, we solve several open problems related to sister logics, such as static ambient logic, modal separation logic, and second-order modal logic on finite trees., Comment: Extra material for our LICS 2020 paper published under the same title

Linear Temporal Logic (LTL) interpreted on finite traces is a robust specification framework popular in formal verification. However, despite the high interest in the logic in recent years, the topic of their quantitative extensions is not yet fully explored. The main goal of this work is to study the effect of adding weak forms of percentage constraints (e.g. that most of the positions in the past satisfy a given condition, or that sigma is the most-frequent letter occurring in the past) to fragments of LTL. Such extensions could potentially be used for the verification of influence networks or statistical reasoning. Unfortunately, as we prove in the paper, it turns out that percentage extensions of even tiny fragments of LTL have undecidable satisfiability and model-checking problems. Our undecidability proofs not only sharpen most of the undecidability results on logics with arithmetics interpreted on words known from the literature, but also are fairly simple. We also show that the undecidability can be avoided by restricting the allowed usage of the negation, and briefly discuss how the undecidability results transfer to first-order logic on words., Comment: Full version of FOSSACS 2021 paper

We introduce and investigate the expressive description logic (DL) ALCSCC++, in which the global and local cardinality constraints introduced in previous papers can be mixed. On the one hand, we prove that this does not increase the complexity of satisfiability checking and other standard inference problems. On the other hand, the satisfiability problem becomes undecidable if inverse roles are added to the languages. In addition, even without inverse roles, conjunctive query entailment in this DL turns out to be undecidable. We prove that decidability of querying can be regained if global and local constraints are not mixed and the global constraints are appropriately restricted. The latter result is based on a locally-acyclic model construction, and it reduces query entailment to ABox consistency in the restricted setting, i.e., to ABox consistency w.r.t. restricted cardinality constraints in ALCSCC, for which we can show an ExpTime upper bound., Comment: Technical report for the paper of the same title accepted to ECAI 2020

To test the predictive power of ab initio nuclear structure theory, the lifetime of the second 2+ state in neutron-rich 20O, tau(2+_2 ) = 150(+80-30) fs, and an estimate for the lifetime of the second 2+ state in 16C have been obtained, for the first time. The results were achieved via a novel Monte Carlo technique that allowed us to measure nuclear state lifetimes in the tens-to-hundreds femtoseconds range, by analyzing the Doppler-shifted gamma-transition line shapes of products of low-energy transfer and deep-inelastic processes in the reaction 18O (7.0 MeV/u) + 181Ta. The requested sensitivity could only be reached owing to the excellent performances of the AGATA gamma-tracking array, coupled to the PARIS scintillator array and to the VAMOS++ magnetic spectrometer. The experimental lifetimes agree with predictions of ab initio calculations using two- and three-nucleon interactions, obtained with the valence-space in-medium similarity renormalization group for 20O, and with the no-core shell model for 16C. The present measurement shows the power of electromagnetic observables, determined with high-precision gamma spectroscopy, to assess the quality of first-principles nuclear structure calculations, complementing common benchmarks based on nuclear energies. The proposed experimental approach will be essential for short lifetimes measurements in unexplored regions of the nuclear chart, including r-process nuclei, when intense ISOL-type beams become available.