Looking-ahead in backtracking algorithms for abstract argumentation

We refine implemented backtracking algorithms for a number of problems related to Dung's argumentation frameworks. Under admissible, preferred, complete, stable, semi stable, and ideal semantics we add enhancements, what are so-called global looking-ahead pruning strategies, to the-state-of-the-art implementations of two problems. First, we tackle the extension enumeration problem: constructing some/all set(s) of acceptable arguments of a given argumentation framework. Second, we address the acceptance decision problem: deciding whether an argument is in some/all set(s) of accepted arguments of a given argumentation framework. The experiments that we report show that the speedup gain of the new enhancements is quite significant.     

On Diagonal Subdifferential Operators in Nonreflexive Banach Spaces

Consider a real-valued bifunction f defined on C ×C, where C is a closed and convex subset of a Banach space X, which is concave in its first argument and convex in its second one. We study its subdifferential with respect to the second argument, evaluated at pairs of the form (x,x), and the subdifferential of − f with respect to its first argument, evaluated at the same pairs. We prove that if f vanishes whenever both arguments coincide, these operators are maximal monotone, under rather undemanding continuity assumptions on f. We also establish similar results under related assumptions on f, e.g. monotonicity and convexity in the second argument. These results were known for the case in which the Banach space is reflexive and C = X. Here we use a different approach, based upon a recently established sufficient condition for maximal monotonicity of operators, in order to cover the nonreflexive and constrained case (C ≠ X). Our results have consequences in terms of the reformulation of equilibrium problems as variational inequality ones.     

A probabilistic approach to modelling uncertain logical arguments

Argumentation can be modelled at an abstract level using a directed graph where each node denotes an argument and each arc denotes an attack by one argument on another. Since arguments are often uncertain, it can be useful to quantify the uncertainty associated with each argument. Recently, there have been proposals to extend abstract argumentation to take this uncertainty into account. This assigns a probability value for each argument that represents the degree to which the argument is believed to hold, and this is then used to generate a probability distribution over the full subgraphs of the argument graph, which in turn can be used to determine the probability that a set of arguments is admissible or an extension. In order to more fully understand uncertainty in argumentation, in this paper, we extend this idea by considering logic-based argumentation with uncertain arguments. This is based on a probability distribution over models of the language, which can then be used to give a probability distribution over arguments that are constructed using classical logic. We show how this formalization of uncertainty of logical arguments relates to uncertainty of abstract arguments, and we consider a number of interesting classes of probability assignments.     

Valued preference-based instantiation of argumentation frameworks with varied strength defeats

A Dung-style argumentation framework aims at representing conflicts among elements called arguments. The basic ingredients of this framework is a set of arguments and a Boolean abstract (i.e., its origin is not known) binary defeat relation. Preference-based argumentation frameworks are instantiations of Dung's framework in which the defeat relation is derived from an attack relation and a preference relation over the arguments. Recently, Dung's framework has been extended in order to consider the strength of the defeat relation, i.e., to quantify the degree to which an argument defeats another argument. In this paper, we instantiate this extended framework by a preference-based argumentation framework with a valued preference relation. As particular cases, the latter can be derived from a weight function over the arguments or a Boolean preference relation. We show under some reasonable conditions that there are “less situations” in which a defense between arguments holds with a valued preference relation compared to a Boolean preference relation. Finally, we provide some conditions that the valued preference relation shall satisfy when it is derived from a weight function.     

The Easy Argument

Suppose Ted is in an ordinary house in good viewing conditions and believes red, his table is red, entirely because he sees his table and its color; he also believes not-white, it is false that his table is white and illuminated by a red light, because not-white is entailed by red. The following three claims about this table case clash, but each seems plausible: 1. Ted’s epistemic position is strong enough for him to know red. 2. Ted cannot know not-white on the basis of red. 3. The epistemic closure principle, suitably restricted, is true. Stewart Cohen has called this three-way clash of intuitions the problem of easy knowledge. If we wish to resolve the clash without accepting skepticism, we seem to have two options. According to the hard argument, the best response is to reject 3. The easy argument rejects 2. But there may be a third alternative, the reverse argument, which rejects 1 without ceding a substantial amount of ground to the skeptic. In this essay I criticize recent versions of the reverse argument and the hard argument, thereby lending support to the easy argument.     

A perturbation theorem for positive contraction semigroups on L 1-spaces with applications to transport equations and Kolmogorov's differential equations

In this paper, a criterion is given for assuring that a linear positive contraction C ₀-semigroup defined on an L ¹-space is generated by the closure of A+B, A and B being suitable unbounded linear operators. Furthermore, this criterion is applied to the transport equation, Kolmogorov's differential equations, and a transport equation modelling cell growth.     

A functional calculus for analytic generators ofC 0-groups

In [9] and [3] anF(S )-functional calculus for sectorial operators is constructed via the Dunford-Riesz integral. This calculus implicitely defines the well-known complex powers of such operators. Sectorial operators with bounded imaginary powers turn out to be of particular interest due to the remarkable Dore-Venni theorem. In [12] this theorem is proved via the theory of analytic generators ofC ₀-groups. These results suggest the existence ofF(S )-functional, calculi forC ₀-groups and their analytic generators. In this paper we show that such functional calculi indeed exsist, however the approach via the Dunford-Riesz integral is no longer viable. Therefore a different approach via an approximation argument is introduced. Existence and uniqueness theorems are given and we show how the functional calculi relate to known results. Examples illustrate the theory.     

Tractability of quasilinear problems I: General results

The tractability of multivariate problems has usually been studied only for the approximation of linear operators. In this paper we study the tractability of quasilinear multivariate problems. That is, we wish to approximate nonlinear operators S_d(·,·) that depend linearly on the first argument and satisfy a Lipschitz condition with respect to both arguments. Here, both arguments are functions of d variables. Many computational problems of practical importance have this form. Examples include the solution of specific Dirichlet, Neumann, and Schrödinger problems. We show, under appropriate assumptions, that quasilinear problems, whose domain spaces are equipped with product or finite-order weights, are tractable or strongly tractable in the worst case setting.This paper is the first part in a series of papers. Here, we present tractability results for quasilinear problems under general assumptions on quasilinear operators and weights. In future papers, we shall verify these assumptions for quasilinear problems such as the solution of specific Dirichlet, Neumann, and Schrödinger problems.     

Optimization of dialectical outcomes in dialogical argumentation

When informal arguments are presented, there may be imprecision in the language used, and so the audience may be uncertain as to the structure of the argument graph as intended by the presenter of the arguments. For a presenter of arguments, it is useful to know the audience's argument graph, but the presenter may be uncertain as to the structure of it. To model the uncertainty as to the structure of the argument graph in situations such as these, we can use probabilistic argument graphs. The set of subgraphs of an argument graph is a sample space. A probability value is assigned to each subgraph such that the sum is 1, thereby reflecting the uncertainty over which is the actual subgraph. We can then determine the probability that a particular set of arguments is included or excluded from an extension according to a particular Dung semantics. We represent and reason with extensions from a graph and from its subgraphs, using a logic of dialectical outcomes that we present. We harness this to define the notion of an argumentation lottery, which can be used by the audience to determine the expected utility of a debate, and can be used by the presenter to decide which arguments to present by choosing those that maximize expected utility. We investigate some of the options for using argumentation lotteries, and provide a computational evaluation.     

A note onC P estimates for certain kernels

For a certain class of operators defined by integral kernels, a necessary and sufficient condition is given for the belonging to the Schatten-von Neumann idealsC _P. The operators considered generalize the classical Hankel operators; the results thus extend Peller's characterization of the Hankel operators in a classC _P.     

AFRA: Argumentation framework with recursive attacks

The issue of representing attacks to attacks in argumentation is receiving an increasing attention as a useful conceptual modelling tool in several contexts. In this paper we present AFRA, a formalism encompassing unlimited recursive attacks within argumentation frameworks. AFRA satisfies the basic requirements of definition simplicity and rigorous compatibility with Dung’s theory of argumentation. This paper provides a complete development of the AFRA formalism complemented by illustrative examples and a detailed comparison with other recursive attack formalizations.     

Algorithms for generating arguments and counterarguments in propositional logic

A common assumption for logic-based argumentation is that an argument is a pair 〈Φ,α〉 where Φ is minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. Different logics provide different definitions for consistency and entailment and hence give us different options for formalising arguments and counterarguments. The expressivity of classical propositional logic allows for complicated knowledge to be represented but its computational cost is an issue. In previous work we have proposed addressing this problem using connection graphs and resolution in order to generate arguments for claims that are literals. Here we propose a development of this work to generate arguments for claims that are disjunctive clauses of more than one disjunct, and also to generate counteraguments in the form of canonical undercuts (i.e. arguments that with a claim that is the negation of the conjunction of the support of the argument being undercut).     

Newton's recursion formula for a 2-matrix argument

Newton's recursion formula for solving nonlinear equations of a 1-matrix (vector) argument is generalized to the case of a 2-matrix argument. The Jacobian 4-matrix of the system is introduced. At the k th recursion the computational process reduces to solving the system of linear algebraic equations obtained, whose order is determined by the number of elements of the 2-matrix argument.Translated fromMatematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 34, 1991, pp. 99–100.     

On the Cauchy problem for quasilinear hyperbolic systems with a retarded argument

Summary Quasilinear hyperbolic systems with a retarded argument in the Schauder canonic form are considered, with Cauchy data, and several independent variables. The proof of existence and uniqueness theorem is based on recent results due to L. Cesari and P. Bassanini for systems without a retarded argument.     

Analytic completeness theorem for singular biprobability models

The aim of the paper is to prove tha analytic completeness theorem for a logic L(∫₁, ∫₂)_A^s with two integral operators in the singular case. The case of absolute continuity was proved in [4]. MSC: 03B48, 03C70.     

Korovkin-type theorems and applications

Let {T _n } be a sequence of linear operators on C[0,1], satisfying that {T _n (e _i )} converge in C[0,1] (not necessarily to e _i ) for i = 0,1,2, where e _i = t ⁱ . We prove Korovkin-type theorem and give quantitative results on C ²[0,1] and C[0,1] for such sequences. Furthermore, we define King’s type q-Bernstein operator and give quantitative results for the approximation properties of such operators.      

Essential norm of the difference of composition operators on Bloch space

Let ϕ and ψ be holomorphic self-maps of the unit disk, and denote by C _ϕ , C _ψ the induced composition operators. This paper gives some simple estimates of the essential norm for the difference of composition operators C _ϕ −C _ψ from Bloch spaces to Bloch spaces in the unit disk. Compactness of the difference is also characterized.     

The zeta functions of complexes from PGL(3): A representation-theoretic approach

The zeta function attached to a finite complex X _Γ arising from the Bruhat-Tits building for PGL₃(F) was studied in [KL], where a closed form expression was obtained by a combinatorial argument. This identity can be rephrased using operators on vertices, edges, and directed chambers of X _Γ. In this paper we re-establish the zeta identity from a different aspect by analyzing the eigenvalues of these operators using representation theory. As a byproduct, we obtain equivalent criteria for a Ramanujan complex in terms of the eigenvalues of the operators on vertices, edges, and directed chambers, respectively.     

A degree theoretic approach for multiple solutions of constant sign for nonlinear elliptic equations

We consider nonlinear elliptic equations driven by the p-Laplacian differential operator. Using degree theoretic arguments based on the degree map for operators of type (S)₊ , we prove theorems on the existence of multiple nontrivial solutions of constant sign.