Nonlocality enables two parties to win specific games with probabilities strictly higher than allowed by any classical theory. Nevertheless, all known such examples consider games where the two parties have a common interest, since they jointly win or lose the game. The main question we ask here is whether the nonlocal feature of quantum mechanics can offer an advantage in a scenario where the ...

A number of puzzles about propositional attitudes in semantics and philosophy revolve around apparent referential dependencies between different attitudes within a single agent's mental state. In a series of papers, Hans Kamp (2003… 2015) offers a general framework for describing such interconnected attitude complexes, building on DRT and dynamic semantics. I demonstrate that Kamp's proposal ca...

Understanding relationships between text passages is key for information analysis. We focus here on the contradiction relationship, and build a system to detect conflicting statements. We show that such a system needs to make more fine-grained distinctions than the common systems for entailment. Also, we argue for the centrality of event coreference and therefore incorporate a component based o...

Distributed knowledge based applications in open domain rely on common sense infor­ mation which is bound to be uncertain and incomplete. To draw the useful conclusions from ambiguous data, one must address un­ certainties and conflicts incurred in a holis­ tic view. No integrated frameworks are vi­ able without an in-depth analysis of con­ flicts incurred by uncertainties. In this pa­ per, we ...

The problem of model/program repair focuses on revising an existing model/program to satisfy new properties. These properties can be safety, liveness, availability, or fault-tolerance requirements. Existing solutions focus on adding compatible properties, i.e., properties that can be satisfied while preserving the existing properties. In other words, they try to generate programs that satisfy t...

We propose a method to model agents’ schedules aiming to resolve conflicts between agents based on the defeasible reasoning by VALPSN(Vector Annotated Logic Program with Strong Negation). In the method, first, agents’ schedules are defined by Billington’s defensible theories. The defensible theories are translated into VALPSNs as the next step and the VALPSNs’ stable models are computed aa the ...

A simulation model is developed and used to better understand the diffusion of conflicting knowledge in a social network. Within the simulation, correct and incorrect knowledge diffuse simultaneously, however, simulation agents are not explicitly made aware that contradictory information exists. Instead, they may become aware of this by obtaining both correct and incorrect knowledge of the same...