bluuebunny/crossref_metadata_2025_split huggingface dataset:
Children’s Living Arrangements After Divorce and the Quality of the Father-Child Relationship; Father Involvement as an Important Underlying Mechanism
Authors: Vrolijk Paula , Keizer Renske 
Published: July 2021

AbstractUsing data from the multi-actor Divorce in Flanders survey, this study aimed to provide a more comprehensive understanding of linkages between children’s living arrangements after divorce and father-child relationship quality. First, we tested whether father involvement and co-parental relationship quality explained linkages between living arrangements and father-child relationship quality. Second, we examined whether child’s loyalty conflicts and child’s sex moderated associations between living arrangements and father-child relationship quality. Finally, we explored whether results differed when fathers or children reported on their relationship. Results show that father-child relationship quality (irrespectively of the reporter) was significantly higher for children living in JPC but only compared to children who live solely with their mother. Furthermore, father involvement explained the association between living arrangements and father-child relationship quality (again irrespectively of the reporter). The co-parental relationship also explained part of this association, but only when children reported on father-child relationship quality. The association between children’s living arrangement and father-child relationship quality was stronger for sons than daughters. This association did not differ by loyalty conflicts. These findings highlight the importance of enabling fathers to remain involved after divorce and having a positive co-parental relationship for maintaining high quality relationships between fathers and children.
The Socioeconomic Gradient of Shared Physical Custody in Two Welfare States: Comparison Between Spain and Sweden
Authors: Garriga Anna , Turunen Jani , Bernardi Laura 
Published: July 2021

AbstractThis study contributes to the emerging literature on the diffusion of SPC across social strata, by comparing two national contexts, Sweden and Spain, with different prevalence rates of SPC and with diverging social and gender policies in the early XXI century. We draw on the 2006 and 2014 comparative cross-sectional data from the Spanish and Swedish Health Behaviour in School-Aged Children (HBSC), to test two competitive hypotheses (diffusion and diverging destinies hypotheses) on the association of parental socioeconomic status, children’s living arrangements in separated families and their relative prevalence in a populaiton. We also examine whether such association is modified by the great increase in SPC in both countries between 2006 and 2014. We present empirical evidence that, independently from the context, SPC arrangements are more frequent among parents with higher socioeconomic status and sole-custody arrangements among other parents; however, social inequality in post-separation arrangements differ in the two countries over time. In Spain, we find evidence in favour of the diffusion hypothesis with increases in the prevalence of SPC going hand in hand with the diffusion of SPC across social strata. By contrast, the Swedish data support the diverging destinies hypothesis with increases in SPC producing no variation in its social stratification over time.
Subformula Linking for Intuitionistic Logic with Application to Type Theory
Authors: Chaudhuri Kaustuv 
Published: July 2021

AbstractSubformula linking is an interactive theorem proving technique that was initially proposed for (classical) linear logic. It is based on truth and context preserving rewrites of a conjecture that are triggered by a user indicatinglinksbetween subformulas, which can be done by direct manipulation, without the need of tactics or proof languages. The system guarantees that a true conjecture can always be rewritten to a known, usually trivial, theorem. In this work, we extend subformula linking to intuitionistic first-order logic with simply typed lambda-terms as the term language of this logic. We then use a well known embedding of intuitionistic type theory into this logic to demonstrate one way to extend linking to type theory.
Proof Search and Certificates for Evidential Transactions
Authors: Nigam Vivek , Reis Giselle , Rahmouni Samar , Ruess Harald 
Published: July 2021

AbstractAttestation logics have been used for specifying systems with policies involving different principals. Cyberlogic is an attestation logic used for the specification of Evidential Transactions (ETs). In such transactions, evidence has to be provided supporting its validity with respect to given policies. For example, visa applicants may be required to demonstrate that they have sufficient funds to visit a foreign country. Such evidence can be expressed as a Cyberlogic proof, possibly combined with non-logical data (e.g., a digitally signed document). A key issue is how to construct and communicate such evidence/proofs. It turns out that attestation modalities are challenging to use established proof-theoretic methods such as focusing. Our first contribution is the refinement of Cyberlogic proof theory with knowledge operators which can be used to represent knowledge bases local to one or more principals. Our second contribution is the identification of an executable fragment of Cyberlogic, called Cyberlogic programs, enabling the specification of ETs. Our third contribution is a sound and complete proof system for Cyberlogic programs enabling proof search similar to search in logic programming. Our final contribution is a proof certificate format for Cyberlogic programs inspired by Foundational Proof Certificates as a means to communicate evidence and check its validity.
Multi-Dimensional Interpretations for Termination of Term Rewriting
Authors: Yamada Akihisa 
Published: July 2021

AbstractInterpretation methods constitute a foundation of termination analysis for term rewriting. From time to time remarkable instances of interpretation methods appeared, such as polynomial interpretations, matrix interpretations, arctic interpretations, and their variants. In this paper we introduce a general framework, the multi-dimensional interpretation method, that subsumes these variants as well as many previously unknown interpretation methods as instances. Employing the notion of derivers, we prove the soundness of the proposed method in an elegant way. We implement the proposed method in the termination prover and verify its significance through experiments.
Computing Optimal Repairs of Quantified ABoxes w.r.t. Static $$\mathcal {EL}$$ TBoxes
Authors: Baader Franz , Koopmann Patrick , Kriegel Francesco , Nuradiansyah Adrian 
Published: July 2021

AbstractThe application of automated reasoning approaches to Description Logic (DL) ontologies may produce certain consequences that either are deemed to be wrong or should be hidden for privacy reasons. The question is then how to repair the ontology such that the unwanted consequences can no longer be deduced. An optimal repair is one where the least amount of other consequences is removed. Most of the previous approaches to ontology repair are of a syntactic nature in that they remove or weaken the axioms explicitly present in the ontology, and thus cannot achieve semantic optimality. In previous work, we have addressed the problem of computing optimal repairs of (quantified) ABoxes, where the unwanted consequences are described by concept assertions of the lightweight DL $$\mathcal {EL}$$EL. In the present paper, we improve on the results achieved so far in two ways. First, we allow for the presence of terminological knowledge in the form of an$$\mathcal {EL}$$ELTBox. This TBox is assumed to be static in the sense that it cannot be changed in the repair process. Second, the construction of optimal repairs described in our previous work is best case exponential. We introduce an optimized construction that is exponential only in the worst case. First experimental results indicate that this reduces the size of the computed optimal repairs considerably.
A Unifying Splitting Framework
Authors: Ebner Gabriel , Blanchette Jasmin , Tourret Sophie 
Published: July 2021

AbstractAVATAR is an elegant and effective way to split clauses in a saturation prover using a SAT solver. But is it refutationally complete? And how does it relate to other splitting architectures? To answer these questions, we present a unifying framework that extends a saturation calculus (e.g., superposition) with splitting and embeds the result in a prover guided by a SAT solver. The framework also allows us to study locking, a subsumption-like mechanism based on the current propositional model. Various architectures are instances of the framework, including AVATAR, labeled splitting, and SMT with quantifiers.
Making Higher-Order Superposition Work
Authors: Vukmirović Petar , Bentkamp Alexander , Blanchette Jasmin , Cruanes Simon , Nummelin Visa , Tourret Sophie 
Published: July 2021

AbstractSuperposition is among the most successful calculi for first-order logic. Its extension to higher-order logic introduces new challenges such as infinitely branching inference rules, new possibilities such as reasoning about formulas, and the need to curb the explosion of specific higher-order rules. We describe techniques that address these issues and extensively evaluate their implementation in the Zipperposition theorem prover. Largely thanks to their use, Zipperposition won the higher-order division of the CASC-J10 competition.
Dual Proof Generation for Quantified Boolean Formulas with a BDD-based Solver
Authors: Bryant Randal E. , Heule Marijn J. H. 
Published: July 2021

AbstractExisting proof-generating quantified Boolean formula (QBF) solvers must construct a different type of proof depending on whether the formula is false (refutation) or true (satisfaction). We show that a QBF solver based on ordered binary decision diagrams (BDDs) can emit a single dual proof as it operates, supporting either outcome. This form consists of a sequence of equivalence-preserving clause addition and deletion steps in an extended resolution framework. For a false formula, the proof terminates with the empty clause, indicating conflict. For a true one, it terminates with all clauses deleted, indicating tautology. Both the length of the proof and the time required to check it are proportional to the total number of BDD operations performed. We evaluate our solver using a scalable benchmark based on a two-player tiling game.
Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant
Authors: Schurr Hans-Jörg , Fleury Mathias , Desharnais Martin 
Published: July 2021

AbstractWe present a fast and reliable reconstruction of proofs generated by the SMT solver veriT in Isabelle. The fine-grained proof format makes the reconstruction simple and efficient. For typical proof steps, such as arithmetic reasoning and skolemization, our reconstruction can avoid expensive search. By skipping proof steps that are irrelevant for Isabelle, the performance of proof checking is improved. Our method increases the success rate of Sledgehammer by halving the failure rate and reduces the checking time by 13%. We provide a detailed evaluation of the reconstruction time for each rule. The runtime is influenced by both simple rules that appear very often and common complex rules.
Neural Precedence Recommender
Authors: Bártek Filip , Suda Martin 
Published: July 2021

AbstractThe state-of-the-art superposition-based theorem provers for first-order logic rely on simplification orderings on terms to constrain the applicability of inference rules, which in turn shapes the ensuing search space. The popular Knuth-Bendix simplification ordering is parameterized by symbol precedence—a permutation of the predicate and function symbols of the input problem’s signature. Thus, the choice of precedence has an indirect yet often substantial impact on the amount of work required to complete a proof search successfully.This paper describes and evaluates a symbol precedence recommender, a machine learning system that estimates the best possible precedence based on observations of prover performance on a set of problems and random precedences. Using the graph convolutional neural network technology, the system does not presuppose the problems to be related or share a common signature. When coupled with the theorem prover Vampire and evaluated on the TPTP problem library, the recommender is found to outperform a state-of-the-art heuristic by more than 4 % on unseen problems.
Automatically Building Diagrams for Olympiad Geometry Problems
Authors: Krueger Ryan , Han Jesse Michael , Selsam Daniel 
Published: July 2021

AbstractWe present a method for automatically building diagrams for olympiad-level geometry problems and implement our approach in a new open-source software tool, the Geometry Model Builder (GMB). Central to our method is a new domain-specific language, the Geometry Model-Building Language (GMBL), for specifying geometry problems along with additional metadata useful for building diagrams. A GMBL program specifies (1) how to parameterize geometric objects (or sets of geometric objects) and initialize these parameterized quantities, (2) which quantities to compute directly from other quantities, and (3) additional constraints to accumulate into a (differentiable) loss function. A GMBL program induces a (usually) tractable numerical optimization problem whose solutions correspond to diagrams of the original problem statement, and that we can solve reliably using gradient descent. Of the 39 geometry problems since 2000 appearing in the International Mathematical Olympiad, 36 can be expressed in our logic and our system can produce diagrams for 94% of them on average. To the best of our knowledge, our method is the first in automated geometry diagram construction to generate models for such complex problems.
The Lean 4 Theorem Prover and Programming Language
Authors: Moura Leonardo de , Ullrich Sebastian 
Published: July 2021

AbstractLean 4 is a reimplementation of the Lean interactive theorem prover (ITP) in Lean itself. It addresses many shortcomings of the previous versions and contains many new features. Lean 4 is fully extensible: users can modify and extend the parser, elaborator, tactics, decision procedures, pretty printer, and code generator. The new system has a hygienic macro system custom-built for ITPs. It contains a new typeclass resolution procedure based on tabled resolution, addressing significant performance problems reported by the growing user base. Lean 4 is also an efficient functional programming language based on a novel programming paradigm calledfunctional but in-place. Efficient code generation is crucial for Lean users because many write custom proof automation procedures in Lean itself.
Characteristics and Prognosis of Colorectal Cancer after Liver or Kidney Transplantation
Authors: Kim Minsung , Kim Chan Wook , Hwang Shin , Kim Young Hoon , Lee Jong Lyul , Yoon Yong Sik , Park In Ja , Lim Seok‐Byung , Yu Chang Sik , Kim Jin Cheon , Han Duck Jong , Lee Sung‐Gyu 
Published: July 2021

AbstractBackgroundThe purpose of this study was to evaluate the characteristics and prognosis of de novo CRC patients who underwent liver or kidney transplantation.MethodsWe retrospectively reviewed the medical records of 66 de novo CRC patients selected from 8,734 liver transplant (LT) or kidney transplant (KT) recipients. We analyzed characteristics and survival outcomes of de novo CRC patients and sporadic CRC patients who underwent radical surgery with stage I‐III in Asan Medical Center between 2005 and 2016. Survival outcomes were analyzed via the 1:4 matching method.ResultsThe standard incidence ratio (SIR) of de novo CRC in KT recipients is 1.67 in men and 2.54 in women. That in LT recipients is 3.10 in men and 2.25 in women. Compared with sporadic CRC patients, de novo CRC patients had more colon cancer than rectal cancer (p=0.041). In 9 patients (13.6%), CRC was diagnosed within one year after transplantation, 21 patients (31.8%) were diagnosed between 1–5 years, and the remaining 36 patients (54.6%) were diagnosed thereafter. There were no significant differences in recurrence‐free survival and overall survival between the two groups (p=0.211 and p=0.324, respectively).ConclusionsThe risk of developing de novo CRC in transplant recipients was higher than in the general population. The survival outcome of de novo CRC was no different compared with the sporadic CRC. Therefore, regular surveillance is essential for timely diagnosis and treatment for transplantation patients. A large prospective study for an intense CRC surveillance program in transplantation patients is needed.
Responsiveness of afferent renal nerve units in renovascular hypertension in rats
Authors: Rodionova Kristina , Hilgers Karl F. , Rafii-Tabrizi Salman , Doellner Johannes , Cordasic Nada , Linz Peter , Karl Anna-Lena , Ott Christian , Schmieder Roland E. , Schiffer Mario , Amann Kerstin , Veelken Roland , Ditting Tilmann 
Published: July 2021

AbstractPrevious data suggest that renal afferent nerve activity is increased in hypertension exerting sympathoexcitatory effects. Hence, we wanted to test the hypothesis that in renovascular hypertension, the activity of dorsal root ganglion (DRG) neurons with afferent projections from the kidneys is augmented depending on the degree of intrarenal inflammation. For comparison, a nonhypertensive model of mesangioproliferative nephritis was investigated. Renovascular hypertension (2-kidney, 1-clip [2K1C]) was induced by unilateral clipping of the left renal artery and mesangioproliferative glomerulonephritis (anti-Thy1.1) by IV injection of a 1.75-mg/kg BW OX-7 antibody. Neuronal labeling (dicarbocyanine dye [DiI]) in all rats allowed identification of renal afferent dorsal root ganglion (DRG) neurons. A current clamp was used to characterize neurons as tonic (sustained action potential [AP] firing) or phasic (1–4 AP) upon stimulation by current injection. All kidneys were investigated using standard morphological techniques. DRG neurons exhibited less often tonic response if in vivo axonal input from clipped kidneys was received (30.4% vs. 61.2% control, p < 0.05). However, if the nerves to the left clipped kidneys were cut 7 days prior to investigation, the number of tonic renal neurons completely recovered to well above control levels. Interestingly, electrophysiological properties of neurons that had in vivo axons from the right non-clipped kidneys were not distinguishable from controls. Renal DRG neurons from nephritic rats also showed less often tonic activity upon current injection (43.4% vs. 64.8% control, p < 0.05). Putative sympathoexcitatory and impaired sympathoinhibitory renal afferent nerve fibers probably contribute to increased sympathetic activity in 2K1C hypertension.
Diagnostic instruments for the assessment of disruptive mood dysregulation disorder: a systematic review of the literature
Authors: Mürner-Lavanchy Ines , Kaess Michael , Koenig Julian 
Published: July 2021

AbstractDisruptive mood dysregulation disorder (DMDD) involves non-episodic irritability and frequent severe temper outbursts in children. Since the inclusion of the diagnosis in the DSM-5, there is no established gold-standard in the assessment of DMDD. In this systematic review of the literature, we provide a synopsis of existing diagnostic instruments for DMDD. Bibliographic databases were searched for any studies assessing DMDD. The systematic search of the literature yielded K = 1167 hits, of which n = 110 studies were included. The most frequently used measure was the Kiddie Schedule for Affective Disorders and Schizophrenia DMDD module (25%). Other studies derived diagnostic criteria from interviews not specifically designed to measure DMDD (47%), chart review (7%), clinical diagnosis without any specific instrument (6%) or did not provide information about the assessment (9%). Three structured interviews designed to diagnose DMDD were used in six studies (6%). Interrater reliability was reported in 36% of studies (ranging from κ = 0.6–1) while other psychometric properties were rarely reported. This systematic review points to a variety of existing diagnostic measures for DMDD with good reliability. Consistent reporting of psychometric properties of recently developed DMDD interviews, as well as their further refinement, may help to ascertain the validity of the diagnosis.
Effect of Net Charge on DNA-Binding, Protein-Binding and Anticancer Properties of Copper(I) Phosphine-Diimine Complexes
Authors: Alsaedi Sammar , Babgi Bandar A. , Abdellatif Magda H. , Emwas Abdul-Hamid , Jaremko Mariusz , Humphrey Mark G. , Hussien Mostafa A. 
Published: July 2021

AbstractThe syntheses of [Cu(PPh3)2(L)]NO3 and [Cu(PPh3)2(L-SO3Na)]NO3 were achieved through the reaction of Cu(PPh3)2NO3 and equimolar amount of the ligands (L = 5,6-diphenyl-3-[2-pyridyl]-1,2,4-triazine; LSO3Na = 5,6-diphenyl-3-[2-pyridyl]-1,2,4-triazine-4,4′-disulfonic acid disodium salt). The complexes were characterized by NMR and IR spectroscopy and mass spectrometry. The compounds exhibit similar absorption and emission spectra, suggesting a similar electronic structure. Ct-DNA binding studies show the strong influence of the net charge as Cu-L (positively charged) is able to bind to ct-DNA while Cu-LSO3Na (negatively charged) is not. The net charge of the complexes affects the thermodynamic and kinetic binding parameters toward human serum albumin. HSA-binding of the complexes was further investigated by molecular docking, revealing different binding sites on the HSA protein as a function of the net charge. The different anticancer activities of the complexes towards ovcar-3 and hope-62 cancer cell lines are suggestive of a role for the overall charge of the complexes. Interaction with the DNA is not the major mechanism for this class of complexes. The overall net charge of the pharmacophore (anticancer agent) should be a key consideration in the design of anticancer metal complexes.
Interaction rituals, emotions, and early childhood science: digital microscopes and collective joy in a multilingual classroom
Authors: Wilmes Sara E. D. 
Published: July 2021

AbstractIn her original article, “Identity, Agency and the Internal Conversations of Science and Math Teachers Implementing instructional reforms in High-Need Urban Schools”, Stacy Olitsky (2021) takes us on an exploration of the identity development and agencies exerted by two teachers working to implement science instructional reforms in high-need urban schools. Olitsky (2021) utilizes Interaction Ritual Theory as a lens to examine a seldom viewed and even intimate aspect of teacher’s worlds, namely teachers’ self-talk. In this forum article I embrace the invitation extended by Olitsky, through an exploration of the interaction rituals that took place among students and a teacher working with digital microscopes in an early childhood classroom. I draw upon the theoretical lens of communitas to illuminate the power of collective joy that formed. Specifically, I will share two vignettes from a multilingual early childhood classroom to illustrate how teacher-guided and student-guided spaces afforded interactions that lead to the development of collective joy. I show how collective work with the microscopes allowed for joy and surprise to occur within a classroom of plurilingual students who are participating in their first schooled experiences of science. I conclude with a discussion of the power of student-driven instructional spaces as places for students working to learn science, and the language of instruction, to collectively experience joy as they explore.