Epistemic Logic with Partial Dependency Operator

In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses decent expressivity and beautiful properties. Several interesting examples are provided, which highlight this logic's practical usage. The logic's bisimulation is then discussed, and we give a sound and strongly complete axiomatization for a sub-language of the logic

Reasoning about embedded dependencies using inclusion dependencies

The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic

In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parametrisations with respect to the central decision problems. The model checking problem (MC) of PDL is NP-complete. The subject of this research is to identify a list of parametrisations (formula-size, treewidth, treedepth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) showing a different picture: under team-size, or dep-arity SAT is paraNP-complete whereas under all other mentioned parameters the problem is in FPT. Finally, we introduce a variant of the satisfiability problem, asking for teams of a given size, and show for this problem an almost complete picture.Comment: Update includes refined result

Asymmetric Hybrids: Dialogues for Computational Concept Combination

When people combine concepts these are often characterised as “hybrid”, “impossible”, or “humorous”. However, when simply considering them in terms of extensional logic, the novel concepts understood as a conjunctive concept will often lack meaning having an empty extension (consider “a tooth that is a chair”, “a pet flower”, etc.). Still, people use different strategies to produce new non-empty concepts: additive or integrative combination of features, alignment of features, instantiation, etc. All these strategies involve the ability to deal with conflicting attributes and the creation of new (combinations of) properties. We here consider in particular the case where a Head concept has superior ‘asymmetric’ control over steering the resulting concept combination (or hybridisation) with a Modifier concept. Specifically, we propose a dialogical approach to concept combination and discuss an implementation based on axiom weakening, which models the cognitive and logical mechanics of this asymmetric form of hybridisation

Probabilistic Team Semantics

Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team semantics has been generalised to accommodate also multisets and probabilistic dependencies. In this article we study a variant of probabilistic team semantics and relate this framework to a Tarskian two-sorted logic. We also show that very simple quantifier-free formulae of our logic give rise to backslashmathrm NP NP -hard model checking problems.Peer reviewe

Correlators at large c without information loss

SCOAP

Facets of Distribution Identities in Probabilistic Team Semantics

We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different probabilistic atoms such as conditional independence and different variants of marginal distribution equivalences. We also relate the framework to the first-order theory of the reals and apply our methods to the open question on the complexity of the implication problem of conditional independence.Peer reviewe

Cu-based thin rolled foils: relationship among alloy composition, micromechanical and antiviral properties against SARS-CoV-2

The healthcare-associated infections (HAIs) and pandemics caused by multidrug-resistant (MDR) and new-generation pathogens threaten the whole world community. Cu and its alloys have been attracting widespread interest as anti-contamination materials due to the rapid inactivation of MDR-superbugs and viruses. Applying thin Cu-based foils on pre-existing surfaces in hygiene-sensitive areas represents a quick, simple, cost-effective self-sanitising practice. However, the influence of chemical composition and microstructure should be deeply investigated when evaluating the antimicrobial capability and durability of Cu-based materials. The effect of composition on micromechanical and antiviral properties was investigated by comparing Cu15Zn and Cu18Ni20Zn (foil thickness from 13 to 27 μm) with Phosphorous High-Conductivity (PHC) Cu. The influence of recrystallisation annealing of PHC Cu was also investigated. Microstructural characterisation was carried out by optical (OM) and scanning electron (FEG-SEM) microscopy, Energy-dispersive Spectroscopy (EDS) and Electron-Backscattered Diffraction (EBSD). The micromechanical behaviour was assessed by microhardness, microscale abrasion and scratch tests. Cu-based foils were exposed to SARS-CoV-2 for different time points in quasi-dry conditions (artificial sweat solution), evaluating their antiviral capability by quantitative Reverse-Transcriptase Polymerase Chain Reaction (qRT-PCR). Surface morphology, contact angle measurements and Cu release were measured. All Cu-based surfaces completely inactivated SARS-CoV-2 in 10 min: pure Cu was the best option regarding antiviral efficiency, while Cu15Zn showed the best trade-off between micromechanical and antiviral properties

An Open, Large-Scale, Collaborative Effort to Estimate the Reproducibility of Psychological Science

Reproducibility is a defining feature of science. However, because of strong incentives for innovation and weak incentives for confirmation, direct replication is rarely practiced or published. The Reproducibility Project is an open, large-scale, collaborative effort to systematically examine the rate and predictors of reproducibility in psychological science. So far, 72 volunteer researchers from 41 institutions have organized to openly and transparently replicate studies published in three prominent psychological journals in 2008. Multiple methods will be used to evaluate the findings, calculate an empirical rate of replication, and investigate factors that predict reproducibility. Whatever the result, a better understanding of reproducibility will ultimately improve confidence in scientific methodology and findings