Answer Set Planning Under Action Costs

Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language Kc, which extends the declarative planning language K by action costs. Kc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems under other optimality criteria, such as computing ``shortest'' plans (with the least number of steps), and refinement combinations of cheapest and fastest plans. We study complexity aspects of the language Kc and provide a transformation to logic programs, such that planning problems are solved via answer set programming. Furthermore, we report experimental results on selected problems. Our experience is encouraging that answer set planning may be a valuable approach to expressive planning systems in which intricate planning problems can be naturally specified and solved

New Tower of Babel: Probing the Antecedents and Consequences of Linguistic Ostracism

While workplace interactions are likely to be conducted in English, the lingua franca of international business (Janssens, Lambert, & Steyaert, 2004), employees may occasionally switch to their native language in their interactions with coworkers who share knowledge of this language. Linguistic ostracism (LO) refers to situations in which two or more people use a language that others in their presence cannot understand (Dotan-Eliaz, Sommer, & Rubin, 2009). This dissertation explored the contextual antecedents of LO in a business setting, probed managerial techniques currently used to mitigate the effects of LO, and examined the relationship between LO and organizational citizenship behaviors. For Study 1, I conducted semi-structured interviews (N = 24) with professionals across three hierarchical levels in multinational corporations. Interviewees reported LO occurring more frequently in organizations lacking in language training, managerial training, or language-based policies. Managerial actions included acting on experience and creating an environment of open communication. Study 2 was an online survey disseminated to professionals (N = 171) across various industries and linguistically diverse organizations. This study tested the Language-Based Exclusion (LBE) model proposed by Kulkarni and Sommer (2014) and summoned additional support for the contextual antecedents uncovered in Study 1. Consistent with the LBE model, positive state affect mediated the relationship between LO and self-reported prosocial behavior. No evidence was found for social identity or procedural justice as mediators as predicted by the LBE model. The mediating effects of positive state affect were significant among people high but not low in the desire for control. LO was associated with lower levels of perceived competence on the part of sources of ostracism, although not when ostracized participants reported benign motives (e.g., the sources did not speak English). Ostracized participants also reported lower levels of prosocial behavior and higher levels of negative impact if working in weak compared to strong organizational diversity climates. Collectively, the findings of this dissertation suggest that LO may be mitigated in organizations by way of making contextual changes and/or changes in managerial actions. Several new research avenues for Industrial-Organizational and International Business scholars alike are also discussed

Bell inequality violation by entangled single photon states generated from a laser, a LED or a Halogen lamp

In single-particle or intraparticle entanglement, two degrees of freedom of a single particle, e.g., momentum and polarization of a single photon, are entangled. Single-particle entanglement (SPE) provides a source of non classical correlations which can be exploited both in quantum communication protocols and in experimental tests of noncontextuality based on the Kochen-Specker theorem. Furthermore, SPE is robust under decoherence phenomena. Here, we show that single-particle entangled states of single photons can be produced from attenuated sources of light, even classical ones. To experimentally certify the entanglement, we perform a Bell test, observing a violation of the Clauser, Horne, Shimony and Holt (CHSH) inequality. On the one hand, we show that this entanglement can be achieved even in a classical light beam, provided that first-order coherence is maintained between the degrees of freedom involved in the entanglement. On the other hand, we prove that filtered and attenuated light sources provide a flux of independent SPE photons that, from a statistical point of view, are indistinguishable from those generated by a single photon source. This has important consequences, since it demonstrates that cheap, compact, and low power entangled photon sources can be used for a range of quantum technology applications

Exchange-Repairs: Managing Inconsistency in Data Exchange

In a data exchange setting with target constraints, it is often the case that a given source instance has no solutions. In such cases, the semantics of target queries trivialize. The aim of this paper is to introduce and explore a new framework that gives meaningful semantics in such cases by using the notion of exchange-repairs. Informally, an exchange-repair of a source instance is another source instance that differs minimally from the first, but has a solution. Exchange-repairs give rise to a natural notion of exchange-repair certain answers (XR-certain answers) for target queries. We show that for schema mappings specified by source-to-target GAV dependencies and target equality-generating dependencies (egds), the XR-certain answers of a target conjunctive query can be rewritten as the consistent answers (in the sense of standard database repairs) of a union of conjunctive queries over the source schema with respect to a set of egds over the source schema, making it possible to use a consistent query-answering system to compute XR-certain answers in data exchange. We then examine the general case of schema mappings specified by source-to-target GLAV constraints, a weakly acyclic set of target tgds and a set of target egds. The main result asserts that, for such settings, the XR-certain answers of conjunctive queries can be rewritten as the certain answers of a union of conjunctive queries with respect to the stable models of a disjunctive logic program over a suitable expansion of the source schema.Comment: 29 pages, 13 figures, submitted to the Journal on Data Semantic

cFFR as an alternative to FFR: please do not contrast simplicity!

info:eu-repo/semantics/publishedVersio

Complexity transitions in global algorithms for sparse linear systems over finite fields

We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify phase transitions in the structure of the solution space and to connect them to changes in performance of a global algorithm, namely Gaussian elimination. Crossing phase boundaries produces a dramatic increase in memory and CPU requirements necessary to the algorithms. In turn, this causes the saturation of the upper bounds for the running time. We illustrate the results on the specific problem of integer factorization, which is of central interest for deciphering messages encrypted with the RSA cryptosystem.Comment: 23 pages, 8 figure

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertree-width is a measure for the cyclicity and therefore tractability of the encoded computation problem. Many NP-hard decision and computation problems are known to be tractable on instances whose structure corresponds to hypergraphs of bounded hypertree-width. Intuitively, the smaller the hypertree-width, the faster the computation problem can be solved. In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width. Our benchmark evaluations have shown that det-k-decomp significantly outperforms opt-k-decomp, the only exact hypertree decomposition algorithm so far. Even compared to the best heuristic algorithm, we obtained competitive results as long as the hypergraphs are not too large.Comment: 19 pages, 6 figures, 3 table

The Multi-center Evaluation of the Accuracy of the Contrast MEdium INduced Pd/Pa RaTiO in Predicting FFR (MEMENTO-FFR) Study.

AIMS: Adenosine administration is needed for the achievement of maximal hyperaemia fractional flow reserve (FFR) assessment. The objective was to test the accuracy of Pd/Pa ratio registered during submaximal hyperaemia induced by non-ionic contrast medium (contrast FFR [cFFR]) in predicting FFR and comparing it to the performance of resting Pd/Pa in a collaborative registry of 926 patients enrolled in 10 hospitals from four European countries (Italy, Spain, France and Portugal). METHODS AND RESULTS: Resting Pd/Pa, cFFR and FFR were measured in 1,026 coronary stenoses functionally evaluated using commercially available pressure wires. cFFR was obtained after intracoronary injection of contrast medium, while FFR was measured after administration of adenosine. Resting Pd/Pa and cFFR were significantly higher than FFR (0.93±0.05 vs. 0.87±0.08 vs. 0.84±0.08, p<0.001). A strong correlation and a close agreement at Bland-Altman analysis between cFFR and FFR were observed (r=0.90, p<0.001 and 95% CI of disagreement: from -0.042 to 0.11). ROC curve analysis showed an excellent accuracy (89%) of the cFFR cut-off of ≤0.85 in predicting an FFR value ≤0.80 (AUC 0.95 [95% CI: 0.94-0.96]), significantly better than that observed using resting Pd/Pa (AUC: 0.90, 95% CI: 0.88-0.91; p<0.001). A cFFR/FFR hybrid approach showed a significantly lower number of lesions requiring adenosine than a resting Pd/Pa/FFR hybrid approach (22% vs. 44%, p<0.0001). CONCLUSIONS: cFFR is accurate in predicting the functional significance of coronary stenosis. This could allow limiting the use of adenosine to obtain FFR to a minority of stenoses with considerable savings of time and costs.info:eu-repo/semantics/publishedVersio