This manuscript presents a topological argumentation framework for modelling notions of evidence-based (i.e., justified) belief. Our framework relies on so-called topological evidence models to represent the pieces of evidence that an agent has at her disposal, and it uses abstract argumentation theory to select the pieces of evidence that the agent will use to define her beliefs. The tools from abstract argumentation theory allow us to model agents who make decisions in the presence of contradictory information. Thanks to this, it (...) is possible to define two new notions of beliefs, grounded beliefs and fully grounded beliefs. These notions are discussed in this paper, analysed and compared with the existing notion of topological justified belief. This comparison revolves around three main issues: closure under conjunction introduction, the level of consistency and their logical strength. (shrink)

The logic of justification provides an in-depth analysis of the epistemic states of an agent. This paper aims at solving some of the problems to which the common interpretation of the operators of justification logic is subject by providing a framework in which a crucial distinction between potential and explicit justifiers is exploited. The paper is subdivided into three sections. The first section offers an introduction to a basic system LJ of justification logic and to the problems concerning its interpretation. (...) In the second section, three new systems of justification logic are introduced and characterised with respect to an appropriate semantics. The final section shows why the highlighted problems do not afflict the new systems and how it is possible to interpret LJ in the new framework. (shrink)

The aim of this paper is to provide an intuitive semantics for systems of justification logic which allows us to cope with the distinction between implicit and explicit justifiers. The paper is subdivided into three sections. In the first one, the distinction between implicit and explicit justifiers is presented and connected with a proof-theoretic distinction between two ways of interpreting sequences of sentences; that is, as sequences of axioms in a certain set and as sequences proofs constructed from that set (...) of axioms. In the second section, a basic system of justification logic for implicit and explicit justifiers is analyzed and some significant facts about it are proved. In the final section, an adequate semantics is proposed, and the system is proved to be sound and complete whit respect to it. (shrink)

The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics with distributive substructural logics. Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is also shown that the framework presents a natural solution to the problem of logical omniscience.

In the 1980s, Pollock’s work on default reasons started the quest in the AI community for a formal system of defeasible argumentation. The main goal of this paper is to provide a logic of structured defeasible arguments using the language of justification logic. In this logic, we introduce defeasible justification assertions of the type t : F that read as “t is a defeasible reason that justifies F”. Such formulas are then interpreted as arguments and their acceptance semantics is given (...) in analogy to Dung’s abstract argumentation framework semantics. We show that a large subclass of Dung’s frameworks that we call “warranted” frameworks is a special case of our logic in the sense that Dung’s frameworks can be obtained from justification logic-based theories by focusing on a single aspect of attacks among justification logic arguments and Dung’s warranted frameworks always have multiple justification logic instantiations called “realizations”. We first define a new justification logic that relies on operational semantics for default logic. One of the key features that is absent in standard justification logics is the possibility to weigh different epistemic reasons or pieces of evidence that might conflict with one another. To amend this, we develop a semantics for “defeaters”: conflicting reasons forming a basis to doubt the original conclusion or to believe an opposite statement. This enables us to formalize non-monotonic justifications that prompt extension revision already for normal default theories. Then we present our logic as a system for abstract argumentation with structured arguments. The format of conflicting reasons overlaps with the idea of attacks between arguments to the extent that it is possible to define all the standard notions of argumentation framework extensions. Using the definitions of extensions, we establish formal correspondence between Dung’s original argumentation semantics and our operational semantics for default theories. One of the results shows that the notorious attack cycles from abstract argumentation cannot always be realized as justification logic default theories. (shrink)

This paper explores the relationship between dynamic and truth conditional semantics for epistemic modals. It provides a generalization of a standard dynamic update semantics for modals. This new semantics derives a Kripke semantics for modals and a standard dynamic semantics for modals as special cases. The semantics allows for new characterizations of a variety of principles in modal logic, including the inconsistency of ‘p and might not p’. Finally, the semantics provides a construction procedure for transforming any truth conditional semantics (...) for modals into a dynamic semantics for modals with similar properties. (shrink)

Analyzing situations where information is partial, incomplete or contradictory has created a demand for quantitative belief measures that are weaker than classic probability theory. In this paper, we compare two frameworks that have been proposed for this task, Dempster-Shafer theory and non-standard probability theory based on Belnap-Dunn logic. We show the two frameworks to assume orthogonal perspectives on informational shortcomings, but also provide a partial correspondence result. Lastly, we also compare various dynamical rules of the two frameworks, all seen as (...) generalizations of classic Bayes’ conditioning. (shrink)

Is knowledge definable as justified true belief? We argue that one can legitimately answer positively or negatively, depending on whether or not one’s true belief is justified by what we call adequate reasons. To facilitate our argument we introduce a simple propositional logic of reason-based belief, and give an axiomatic characterization of the notion of adequacy for reasons. We show that this logic is sufficiently flexible to accommodate various useful features, including quantification over reasons. We use our framework to contrast (...) two notions of JTB: one internalist, the other externalist. We argue that Gettier cases essentially challenge the internalist notion but not the externalist one. Our approach commits us to a form of infallibilism about knowledge, but it also leaves us with a puzzle, namely whether knowledge involves the possession of only adequate reasons, or leaves room for some inadequate reasons. We favor the latter position, which reflects a milder and more realistic version of infallibilism. (shrink)

In this paper, we explore the relation between an agent’s doxastic attitude and her arguments in support of a given claim. Our main contribution is the design of a logical setting that allows us reason about binary arguments which are either in favour or against a certain claim. This is a setting in which arguments and propositions are the basic building blocks so that the concept of argument-based belief emerges in a straightforward way. We work against the background of Dung’s (...) abstract argumentation framework, extending it to a new setting in which we can study the formal properties of binary arguments as well as the larger structures they establish. This paper introduces a formal ‘two-dimensional’ language to talk about propositions and arguments, for which a sound and complete axiom system is provided. (shrink)

This article aims to show that the incompatibility between the application of logic to norms and values and the expressive conception of these notions – basically summed up by the Frege–Geach problem – can be overcome. To this end, a logic is constructed for the expressive conception of norms and values which provides a solution to the Frege–Geach problem and is not affected by the limitations that occur in some previous attempts. More specifically, a pragmatic language LP is introduced which (...) is an extension of the language L of standard propositional logic, obtained by adding two categories of logical-pragmatic signs to the vocabulary of L: the signs of pragmatic mood (,,, standing for assertion, obligation and approval, respectively) and the pragmatic connectives (∼, ∩, ∪, ⊃, ≡, standing for pragmatic negation, conjunction, disjunction, implication and bi-implication, respectively). The notions of pragmatic validity, consistency (satisfiability), compatibility, equivalence and inference are then defined, and some criteria of pragmatic validity are given. It is thus possible to carry out in LP inferences on norms and values expressively understood, adequately formalizing Geach's problematic inferences. (shrink)

Epistemic logic is usually employed to model two aspects of a situation: the factual and the epistemic aspects. Truth, however, is not always attainable, and in many cases we are forced to reason only with whatever information is available to us. In this paper, we will explore a four-valued epistemic logic designed to deal with these situations, where agents have only knowledge about the available information, which can be incomplete or conflicting, but not explicitly about facts. This layer of available (...) information or evidence, which is the object of the agents’ knowledge, can be seen as a database. By adopting this sceptical posture in our semantics, we prepare the ground for logics where the notion of knowledge—or more appropriately, belief—is entirely based on evidence. The technical results include a set of reduction axioms for public announcements, correspondence proofs, and a complete tableau system. In summary, our contributions are twofold: on the one hand we present an intuition and possible application for many-valued modal logics, and on the other hand we develop a logic that models the dynamics of evidence in a simple and intuitively clear fashion. (shrink)

Argument evaluation, one of the central problems in argumentation theory, consists in studying what makes an argument a good one. This paper proposes a formal approach to argument evaluation from the perspective of justification logic. We adopt a multi-agent setting, accepting the intuitive idea that arguments are always evaluated by someone. Two general restrictions are imposed on our analysis: non-deductive arguments are left out and the goal of argument evaluation is fixed: supporting a given proposition. Methodologically, our approach uses several (...) existing tools borrowed from justification logic, awareness logic, doxastic logic and logics for belief dependence. We start by introducing a basic logic for argument evaluation, where a list of argumentative and doxastic notions can be expressed. Later on, we discuss how to capture the mentioned form of argument evaluation by defining a preference operator in the object language. The intuitive picture behind this definition is that, when assessing a couple of arguments, the agent puts them to a test consisting of several criteria. As a result of this process, a preference relation among the evaluated arguments is established by the agent. After showing that this operator suffers a special form of logical omniscience, called preferential omniscience, we discuss how to define an explicit version of it, more suitable to deal with non-ideal agents. The present work exploits the formal notion of awareness in order to model several informal phenomena: awareness of sentences, availability of arguments and communication between agents and external sources. We discuss several extensions of the basic logic and offer completeness and decidability results for all of them. (shrink)

The main objective of this paper is to define a logic for reasoning about distributed time-stamped claims. Such a logic is interesting for theoretical reasons, i.e. as a logic per se, but also because it has a number of practical applications, in particular when one needs to reason about a huge amount of pieces of evidence collected from different sources, where some of the pieces of evidence may be contradictory and some sources are considered to be more trustworthy than others. (...) We introduce the time-stamped claim logic including a sound and complete sequent calculus. In order to show how time-stamped claim logic can be used in practice, we consider a concrete cyber-attribution case study. (shrink)

The paper relates evidence and justification logics, both philosophically and technically. On the philosophical side, it is suggested that the difference between the approaches to evidence in the two families of logics can be explained as a result of their focusing on two different notions of support provided by evidence. On the technical side, a justification logic with operators pertaining to both kinds of support is shown to be sound and complete with respect to a special class of awareness models. (...) In addition, a realization theorem with respect to K is shown to hold for the logic. (shrink)