Skip to main content

2020 | Buch

Logic and Argumentation

Third International Conference, CLAR 2020, Hangzhou, China, April 6–9, 2020, Proceedings

insite
SUCHEN

Über dieses Buch

This book constitutes the refereed proceedings of the Third International Conference on Logic and Argumentation, CLAR 2020, held in Hangzhou, China, in April 2020. The 14 full and 7 short papers presented were carefully reviewed and selected from 31 submissions. The papers cover the focus of the CLAR series, including formal models of argumentation, logics for decision making and uncertainreasoning, formal models of evidence, con rmation, and justi cation, logics forgroup cognition and social network, reasoning about norms, formal representationsof natural language and legal texts, as well as applications of argumentationon climate engineering.

Inhaltsverzeichnis

Frontmatter

Long Presentations

Frontmatter
Group Belief
Abstract
While logical formalizations of group notions of knowledge such as common and distributed knowledge have received considerable attention in the literature, most approaches being based on modal logic, group notions of belief have received much less attention. In this paper we systematically study standard notions of group knowledge and belief under different assumptions about which properties knowledge and belief have. In particular, we map out (lack of) preservation of knowledge/belief properties against different standard definitions of group knowledge/belief. It turns out that what is called group belief most often is not actually belief, i.e., does not have the properties of belief. In fact, even what is called group knowledge is sometimes not actually knowledge either. For example, under the common assumption that belief has the KD45 properties, distributed belief is not actually belief (it does not satisfy the D axiom). In the literature there is no detailed completeness proof for axiomatizations of KD45 with distributed belief that we are aware of, and there has been some confusion regarding soundness of such axiomatizations related to the mentioned lack of preservation. In this paper we also present a detailed completeness proof for a sound axiomatization of KD45 with distributed belief.
Thomas Ågotnes, Yì N. Wáng
Broadening Label-Based Argumentation Semantics with May-Must Scales
Abstract
The semantics as to which set of arguments in a given argumentation graph may be acceptable (acceptability semantics) can be characterised in a few different ways. Among them, the labelling-based approach allows for a concise and flexible determination of acceptability statuses of arguments through assignment of a label indicating acceptance, rejection, or undecided to each argument. In this work, we contemplate a way of broadening it by accommodating may- and must- conditions for an argument to be accepted and rejected, as determined by the number(s) of rejected and accepted attacking arguments. We show that the broadened label-based semantics can be used to express more mild indeterminacy than inconsistency for acceptability judgement when, for example, it may be the case that an argument is accepted and when it may also be the case that it is rejected. We identify that finding which conditions a labelling satisfies for every argument can be an undecidable problem, which has an unfavourable implication to semantics. We propose to address this problem by enforcing a labelling to maximally respect the conditions, while keeping the rest that would necessarily cause non-termination labelled undecided.
Ryuta Arisaka, Takayuki Ito
Semirings of Evidence
Abstract
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models evidence by a semiring. Hence justification terms can be interpreted as polynomial functions on that semiring. This provides an adequate semantics for evidence terms and clarifies the role of variables in justification logic. Moreover, the algebraic structure makes it possible to compute with evidence. Depending on the chosen semiring this can be used to model trust, probabilities, cost, etc. Last but not least the semiring approach seems promising for obtaining a realization procedure for modal fixed point logics.
Michael Baur, Thomas Studer
Logic Programming, Argumentation and Human Reasoning
Abstract
The weak completion semantics, a computational logic approach, has been shown to adequately model various episodes of human reasoning. Since the inception of abstract argumentation in the 1990s, connections between argumentation semantics and logic programming semantics have been studied, but existing work on this connection has not yet covered the weak completion semantics. In this paper we define a novel translation from logic programs to abstract argumentation frameworks and show that under this translation the weak completion semantics corresponds to the grounded semantics of abstract argumentation. Combining this translation with argumentation semantics other than grounded semantics gives rise to novel logic programming semantics. We discuss the potential relevance of these novel semantics to modeling human reasoning and give an outlook on possible future research on this topic.
Marcos Cramer, Emmanuelle-Anna Dietz Saldanha
Reasoning About Degrees of Confirmation
Abstract
We present a probabilistic logic for reasoning about degrees of confirmation. We provide a sound and strongly complete axiomatization for the logic. We show that the problem of deciding satisfiability is in PSPACE.
Šejla Dautović, Dragan Doder, Zoran Ognjanović
Ideal Related Algebras and Their Logics Extended Abstract
Abstract
We present previously unknown algebraic semantics for Sobociński’s logics S4.4, also known as \(\mathbf {S4.3DumB_2}\), and the autoepistemic logic KD45. The operators on the respective algebras are generalizations of the unary discriminator defined via suitable ideals. We also explore unification and admissible rules for these logics.
Ivo Düntsch, Wojciech Dzik
Computer-Supported Analysis of Arguments in Climate Engineering
Abstract
Climate Engineering (CE) is the intentional large-scale intervention in the Earth’s climate system to counter climate change. CE is highly controversial, spurring global debates about whether and under which conditions it should be considered. We focus on the computer-supported analysis of a small subset of the arguments pro and contra CE interventions as presented in the work of Betz and Cacean (2012), namely those drawing on the “ethics of risk”; these arguments point out uncertainties in future deployment of CE technologies. The aim of this paper is to demonstrate and explain the application of higher-order interactive and automated theorem proving (utilizing shallow semantical embeddings) to the logical analysis of “real-life” argumentative discourse.
David Fuenmayor, Christoph Benzmüller
A Logic of Knowledge and Belief Based on Abstract Arguments
Abstract
We introduce a logic of knowledge and belief in a framework in which belief has a standard KD45 characterization and knowledge undergoes the classical tripartite analysis that knowledge is justified true belief, which has a natural link to the studies of logics of evidence and justification. The characterization of knowledge is based on a flexible model that avoids unwanted properties concerned with the problem of logical omniscience. We axiomatize the logic, prove its soundness and completeness, and then extend the logic to a multi-agent setting. We also compare our framework with existing logics of knowledge and belief.
Xu Li, Yì N. Wáng
A Meta-level Annotation Language for Legal Texts
Abstract
There are many legal texts which can greatly benefit from the support of automated reasoning. Such support depends on the existence of a logical formalization of the legal text. Among the methods used for the creation of these knowledge bases, annotation tools attempt to abstract over the logical language and support non-logicians in their efforts to formalize documents. Nevertheless, legal documents use a rich language which is not easy to annotate. In this paper, an existing annotation tool is being extended in order to support the formalization of a complex example - the GDPR’s article 13. The complexity of the article prevents a direct annotation using logical and deontical operators. This is overcome by the implementation of several macros. We demonstrate the automated reasoning over the formalized article and argue that macros can be used to formalize complex legal texts.
Tomer Libal
Towards an Executable Methodology for the Formalization of Legal Texts
Abstract
A methodology for the formalization of legal texts is presented. This methodology is based on features of the NAI Suite, a recently developed formalization environment for legal texts. The ability of the tool to execute queries is used in order to drive a correct formalization until all queries are validated. The approach is studied on a fragment of the Smoking Prohibition (Children in Motor Vehicles) (Scotland) Act 2016 of the Scottish Parliament.
Tomer Libal, Alexander Steen
Goal-Driven Structured Argumentation for Patient Management in a Multimorbidity Setting
Abstract
We use computational argumentation to both analyse and generate solutions for reasoning in multimorbidity about consistent recommendations, according to different patient-centric goals. Reasoning in this setting carries a complexity related to the multiple variables involved. These variables reflect the co-existing health conditions that should be considered when defining a proper therapy. However, current Clinical Decision Support Systems (CDSSs) are not equipped to deal with such a situation. They do not go beyond the straightforward application of the rules that build their knowledge base and simple interpretation of Computer-Interpretable Guidelines (CIGs). We provide a computational argumentation system equipped with goal-seeking mechanisms to combine independently generated recommendations, with the ability to resolve conflicts and generate explanations for its results. We also discuss its advantages over and relation to Multiple-criteria Decision-making (MCDM) in this particular setting.
Tiago Oliveira, Jérémie Dauphin, Ken Satoh, Shusaku Tsumoto, Paulo Novais
Intuitionistic-Bayesian Semantics of First-Order Logic for Generics
Abstract
Generics are used frequently in various natural languages. Cohen’s theory (1999) is one of the most promising theories of generics. Cohen proposes a probabilistic account of generics. Leslie (2007, 2008) points out the three shortcomings of Cohen’s theory. Asher and Pelletier (2013) point out five more shortcomings of Cohen’s theory. The aim of this paper is to propose a new version of logic for generics—First-Order Logic for Generics (\(\mathsf {FLG}\))—that can overcome all of the eight shortcomings. To accomplish this goal, we provide the language of \(\mathsf {FLG}\) with an intuitionistic-Bayesian semantics.
Satoru Suzuki
Ambiguity Preference and Context Learning in Uncertain Signaling
Abstract
Lexical ambiguity is present in many natural languages, but ambiguous words and phrases do not seem to be advantageous. Therefore, the presence of ambiguous words in natural language warrants explanation. We justify the existence of ambiguity from the perspective of the context dependence. The main contribution of the paper is that we constructed a context learning process such that the interlocutors can infer opponent’s private belief from the conversation. A sufficient condition is proved to show if the learning can be successful. Furthermore, we investigate when the learning fails, how the interlocutors choose among degrees of ambiguous expressions through an adaptive learning.
Liping Tang
A Decidable Multi-agent Logic for Reasoning About Actions, Instruments, and Norms
Abstract
We formally introduce a novel, yet ubiquitous, category of norms: norms of instrumentality. Norms of this category describe which actions are obligatory, or prohibited, as instruments for certain purposes. We propose the Logic of Agency and Norms (\(\mathsf {LAN}\)) that enables reasoning about actions, instrumentality, and normative principles in a multi-agent setting. Leveraging \(\mathsf {LAN}\), we formalize norms of instrumentality and compare them to two prevalent norm categories: norms to be and norms to do. Last, we pose principles relating the three categories and evaluate their validity vis-à-vis notions of deliberative acting. On a technical note, the logic will be shown decidable via the finite model property.
Kees van Berkel, Tim Lyon, Francesco Olivieri

Short Presentations

Frontmatter
Preservation of Admissibility with Rationality and Feasibility Constraints
Abstract
The paper considers the problem of in what circumstances an aggregation rule guarantees an admissible output extension that represents a good compromise between several input extensions of abstract argumentation framework, each provided by a different individual. To achieve this, we introduce the concept of concrete admissibility for abstract argumentations by strengthening Dung’s admissibility. We also define a model for extension aggregation that clearly separates the constraint supposed to be satisfied by individuals and the constraint that must be met by the collective decision. Using this model, we show that the majority rule guarantees admissible sets on newly defined admissible sets.
Weiwei Chen
Uncertainty in Argumentation Schemes: Negative Consequences and Basic Slippery Slope
Abstract
This study is an approach to encompass uncertainty in the well-known Argumentation Scheme from Negative Consequences and in the more recent “Basic Slippery Slope Argument” proposed by Douglas Walton. This work envisages two new kinds of uncertainty that should be taken into account, one related to time and one related to the material relation between premises and conclusion. Furthermore, it is argued that some modifications to the structure of these Argumentation Schemes or to their Critical Questions could facilitate the process of Knowledge Extraction and modeling from these two argumentative patterns. For example, the study suggests to change the premises of the Basic Slippery Slope related to the Control and the Loss of Control.
Davide Liga, Monica Palmirani
Reasoning as Speech Acts
Abstract
By considering reasoning as speech acts, the paper gives a new perspective to evaluate good reasoning, that is, not only involving the consequence relation between premisses and conclusions, but also involving the goal of doing reasoning by an agent. Moreover, in this paper, we propose a framework for characterizing the reasoning for persuasion from the logical perspective.
Chinghui Su, Liwu Rong, Fei Liang
Dynamics of Fuzzy Argumentation Frameworks
Abstract
Dung’s theory of abstract argumentation plays an incremental role in artificial intelligence. The research about the dynamics theory of argumentation efficiently identifies the justified arguments when arguments or attacks change. However, the dynamics theory is absent in fuzzy argumentation framework (FAF). We want to calculate the semantics of the updated FAF by partially reusing the semantics of the previous FAF. In this paper, we explore the dynamics theory in FAFs. First, we introduce all the changes of FAF, including not only the changes of arguments and attacks but also the increases or decreases of their fuzzy degrees. Thus, the changes in FAFs are more complicated than standard AF. Then by extending Liao’s division-based approach, we provide an efficient algorithm for computing some basic semantics. This algorithm conserves part of the semantics in the previous FAF. Thus, we can efficiently compute the belief degree to which arguments are justified.
Zongshun Wang, Jiachao Wu
Probabilistic Three-Valued Argumentation Frameworks
Abstract
Dung’ AF has been extended in many different directions. One particular direction is to allow uncertainty in AFs. Among others, probability and fuzzy theory are typical approaches used in this direction. In this paper, we argue that arguments can be both fuzzy and random. We thus introduce probabilistic-fuzzy argumentation frameworks in which probabilities and fuzzy values are combined to describe fuzzy and random arguments. We introduce an algorithm for revising probabilities. Based on this algorithm, we study semantics of probabilistic-fuzzy argumentation frameworks.
Jiachao Wu, Hengfei Li
Further Steps Towards a Logic of Polarization in Social Networks
Abstract
In this paper we look at different ways of modally defining properties related to the concept of balance in signed social networks where relations can be either positive or negative. The motivation is to be able to formally reason about the social phenomenon of group polarization, for which balance theory forms a network-theoretical underpinning. The starting point is a recently developed basic modal logic that axiomatizes the class of social networks that are balanced up to a certain degree. This property is not modally definable but can be captured using a deduction rule. In this paper we examine different possibilities for extending this basic language, in order to, first, be able to define frame properties such as balance and related properties such as non-overlapping positive and negative relations and collective connectedness as axioms, and, second, be able to define the property of full balance rather than balanced-up-to-a-degree. We consider extensions with both static modalities such as the universal and the difference modality, the intersection modality, and nominals known from hybrid logic, as well as dynamic global bridge modalities known from sabotage logic. Along the way we provide axioms for weak balance. Finally, to explore measures of how far a network is from polarization, we consider and compare variations of distance measures between models in relation to balance.
Mina Young Pedersen, Sonja Smets, Thomas Ågotnes
A Formalization of the Slippery Slope Argument
Abstract
To bridge the gap between human reasoning and machine reasoning, one of the key problems in argumentation research is how to model natural language arguments by formal argumentation. The slippery slope argument (SSA) is a commonly used type of argument in the context of deliberation, with the intent of persuading people not to take a particular action. In this paper, an argumentation theory for the basic form of SSA is given based on the formal argumentation framework \(ASPIC^+\) and argumentation schemes of SSA. Then, an SSA occurrence in a popular blog post about gene editing is taken as an example. By analyzing the case, this paper tries to model these arguments based on our argumentation theory and evaluates the arguments using abstract argumentation frameworks. The paper then points out that since whether an SSA is persuasive rests on whether its ultimate consequence is really unacceptable to the audience, value judgement should play an important role in the deliberation.
Zhe Yu
Backmatter
Metadaten
Titel
Logic and Argumentation
herausgegeben von
Mehdi Dastani
Prof. Huimin Dong
Prof. Dr. Leon van der Torre
Copyright-Jahr
2020
Electronic ISBN
978-3-030-44638-3
Print ISBN
978-3-030-44637-6
DOI
https://doi.org/10.1007/978-3-030-44638-3