Related papers: Cogent argument extensions are weakly admissible b…

Kedem's Comment [arXiv:1402.1352] on our Letter [PRL 112, 040406 (2014)] contains only the criticism that we did not consider complex weak values. We point out follow-up work which uses the same analysis as in our Letter, includes any type…

We consider the notion of a vacuous reduct semantics for abstract argumentation frameworks, which, given two abstract argumentation semantics {\sigma} and {\tau}, refines {\sigma} (base condition) by accepting only those {\sigma}-extensions…

Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise)…

Argumentation is a very active research field of Artificial Intelligence concerned with the representation and evaluation of arguments used in dialogues between humans and/or artificial agents. Acceptability semantics of formal…

In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…

We establish a framework for the study of the effective theory of weak convergence of measures. We define two effective notions of weak convergence of measures on $\mathbb{R}$: one uniform and one non-uniform. We show that these notions are…

Negation is a common linguistic phenomenon. Yet language models face challenges with negation in many natural language understanding tasks such as question answering and natural language inference. In this paper, we experiment with seamless…

This paper studies a fundamental mechanism of how to detect a conflict between arguments given sentiments regarding acceptability of the arguments. We introduce a concept of the inverse problem of the abstract argumentation to tackle the…

To characterize the asymptotic behavior of fixed-point iterations of non-expansive operators with no fixed points, Bauschke et al. [Fixed Point Theory Appl. (2016)] recently studied cosmic convergence and conjectured that cosmic convergence…

We show that the recently proposed weak gravity conjecture\cite{AMNV0601} can be extended to a class of scalar field theories. Taking gravity into account, we find an upper bound on the gravity interaction strength, expressed in terms of…

We discuss the (twisted) weak positivity theorem. We also treat some applications.

In Dung's abstract argumentation, arguments are either acceptable or unacceptable, given a chosen notion of acceptability. This gives a coarse way to compare arguments. In this paper, we propose a counting approach for a more fine-gained…

We introduce a notion of weak convergence in arbitrary metric spaces. Metric functionals are key in our analysis: weak convergence of sequences in a given metric space is tested against all the metric functionals defined on said space. When…

This paper defines an argumentation semantics for extended logic programming and shows its equivalence to the well-founded semantics with explicit negation. We set up a general framework in which we extensively compare this semantics to…

We study probabilistically informative (weak) versions of transitivity, by using suitable definitions of defaults and negated defaults, in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults…

We completely characterize connected Lie groups all of whose countable subgroups are weakly amenable. We also provide a characterization of connected semisimple Lie groups that are weakly amenable. Finally, we show that a connected Lie…

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…

Looking at bivariate copulas from the perspective of conditional distributions and considering weak convergence of almost all conditional distributions yields the notion of weak conditional convergence. At first glance, this notion of…

Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and optionally provide support for strong…

This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…