English
Related papers

Related papers: Relations between assumption-based approaches in n…

200 papers

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, exhibiting a classical…

Logic in Computer Science · Computer Science 2023-08-11 Eben Blaisdell , Max Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, considering a classical…

Logic in Computer Science · Computer Science 2023-07-24 Eben Blaisdell , Max I. Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

In this paper we provide a unifying description of different types of semantics of modal logic found in the literature via the framework of topological categories. In the style of categorical logic, we establish an exact correspondence…

Category Theory · Mathematics 2023-08-01 Lingyuan Ye

The profusion of knowledge encoded in large language models (LLMs) and their ability to apply this knowledge zero-shot in a range of settings makes them promising candidates for use in decision-making. However, they are currently limited by…

Computation and Language · Computer Science 2026-05-08 Gabriel Freedman , Adam Dejl , Deniz Gorur , Xiang Yin , Antonio Rago , Francesca Toni

The paper studies the notion of supposition encoded in non-Archimedean conditional probability (and revealed in the acceptance of the so-called indicative conditionals). The notion of qualitative change of view that thus arises is…

Artificial Intelligence · Computer Science 2007-05-23 Horacio Arlo-Costa

We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…

Artificial Intelligence · Computer Science 2019-01-21 Ryuta Arisaka , Stefano Bistarelli , Francesco Santini

We study properties related to relevance in non-monotonic consequence relations obtained by systems of structured argumentation. Relevance desiderata concern the robustness of a consequence relation under the addition of irrelevant…

Artificial Intelligence · Computer Science 2020-05-15 AnneMarie Borg , Christian Straßer

The purpose of the paper is to introduce a new approach of planning called Assumption-Based Planning. This approach is a very interesting way to devise a planner based on a multi-agent system in which the production of a global shared plan…

Artificial Intelligence · Computer Science 2018-10-22 Damien Pellier , Humbert Fiorino

This paper presents Abduction and Argumentation as two principled forms for reasoning, and fleshes out the fundamental role that they can play within Machine Learning. It reviews the state-of-the-art work over the past few decades on the…

Artificial Intelligence · Computer Science 2020-10-27 Antonis Kakas , Loizos Michael

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

Logic in Computer Science · Computer Science 2016-08-31 Gopalan Nadathur

We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…

Logic in Computer Science · Computer Science 2023-07-20 Peter Hanukaev , Harley Eades

This paper investigates the extension of lattice-based logics into modal languages. We observe that such extensions admit multiple approaches, as the interpretation of the necessity operator is not uniquely determined by the underlying…

Logic in Computer Science · Computer Science 2025-10-01 Alfredo R. Freire , Manuel A. Martins

Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a…

Artificial Intelligence · Computer Science 2013-04-05 Mary McLeish

The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and information is inconsistent.…

Artificial Intelligence · Computer Science 2014-05-01 Wenzhao Qiao , Nico Roos

Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to…

Artificial Intelligence · Computer Science 2009-09-25 Nir Friedman , Joseph Y. Halpern , Daphne Koller

Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…

Logic · Mathematics 2017-05-10 Renato Neves , Alexandre Madeira , Luis S. Barbosa , Manuel A. Martins

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

In computational argumentation, gradual semantics are fine-grained alternatives to extension-based and labelling-based semantics . They ascribe a dialectical strength to (components of) arguments sanctioning their degree of acceptability.…

Artificial Intelligence · Computer Science 2025-08-04 Anna Rapberger , Fabrizio Russo , Antonio Rago , Francesca Toni
‹ Prev 1 4 5 6 7 8 10 Next ›