English
Related papers

Related papers: Some Notes on Temporal Justification Logic

200 papers

A simple framework for reasoning under uncertainty and intervention is introduced. This is achieved in three steps. First, logic is restated in set-theoretic terms to obtain a framework for reasoning under certainty. Second, this framework…

Statistics Theory · Mathematics 2010-08-18 Pedro A. Ortega

Understanding a \textit{reinforcement learning} policy, which guides state-to-action mappings to maximize rewards, necessitates an accompanying explanation for human comprehension. In this paper, we introduce a set of \textit{linear…

Artificial Intelligence · Computer Science 2025-05-01 Mikihisa Yuasa , Huy T. Tran , Ramavarapu S. Sreenivas

While argument mining has achieved significant success in classifying argumentative relations between statements (support, attack, and neutral), we have a limited computational understanding of logical mechanisms that constitute those…

Computation and Language · Computer Science 2021-05-18 Yohan Jo , Seojin Bang , Chris Reed , Eduard Hovy

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only…

Logic in Computer Science · Computer Science 2021-02-16 Guido Governatori , Michael J. Maher

A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason about policies. Because we use first-order logic, policies…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Vicky Weissman

We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post's theorem.

Logic in Computer Science · Computer Science 2015-06-24 Thomas Studer

We consider multi-agent argumentation, where each agent's view of the arguments is encoded as an argumentation framework (AF). Then we study deliberative processes than can occur on this basis. We think of a deliberative process as taking…

Logic in Computer Science · Computer Science 2014-08-08 Truls Pedersen , Sjur Dyrkolbotn

The aim of illocutionary logic is to explain how context can affect the meaning of certain special kinds of performative utterances. Recall that performative utterances are understood as follows: a speaker performs the illocutionary act…

Logic in Computer Science · Computer Science 2011-02-24 Andrew Schumann

We present a new temporal logic called Distribution Temporal Logic (DTL) defined over predicates of belief states and hidden states of partially observable systems. DTL can express properties involving uncertainty and likelihood that cannot…

Systems and Control · Computer Science 2013-10-31 Austin Jones , Mac Schwager , Calin Belta

We present a uniform non-monotonic solution to the problems of reasoning about action on the basis of an argumentation-theoretic approach. Our theory is provably correct relative to a sensible minimisation policy introduced on top of a…

Artificial Intelligence · Computer Science 2011-09-13 N. Y. Foo , Q. B. Vo

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

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…

Logic in Computer Science · Computer Science 2019-07-18 João Rasga , Cristina Sernadas , Erisa Karafili , Luca Viganò

We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…

Logic in Computer Science · Computer Science 2010-03-24 Ph. Balbiani , R. Echahed , A. Herzig

In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…

Logic in Computer Science · Computer Science 2017-03-08 Kamal Lodaya , Paritosh K. Pandya

Our manuscript studies linear temporal (with UNTIL and NEXT) logic based at a conception of intransitive time. non-transitive time. In particular, we demonstrate how the notion of knowledge might be represented in such a framework (here we…

Logic in Computer Science · Computer Science 2015-03-31 Vladimir Rybakov

Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…

Artificial Intelligence · Computer Science 2018-09-05 Anthony Hunter

In this survey we review dynamic epistemic logics with modalities for quantification over information change. Of such logics we present complete axiomatizations, focussing on axioms involving the interaction between knowledge and such…

Logic in Computer Science · Computer Science 2023-03-22 Hans van Ditmarsch

We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…

Logic in Computer Science · Computer Science 2025-04-07 Silvio Ghilardi , Jérémie Marquès

Is knowledge definable as justified true belief ("JTB")? 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…

Logic in Computer Science · Computer Science 2021-12-28 Paul Égré , Paul Marty , Bryan Renne

Prediction without justification has limited applicability. As a remedy, we learn to extract pieces of input text as justifications -- rationales -- that are tailored to be short and coherent, yet sufficient for making the same prediction.…

Computation and Language · Computer Science 2016-11-04 Tao Lei , Regina Barzilay , Tommi Jaakkola
‹ Prev 1 4 5 6 7 8 10 Next ›