English
Related papers

Related papers: Notes on Abstract Argumentation Theory

200 papers

The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…

Artificial Intelligence · Computer Science 2018-10-12 Pietro Baroni , Federico Cerutti , Paul E. Dunne , Massimiliano Giacomin

Most of the existing work that focus on the identification of implicit knowledge in arguments generally represent implicit knowledge in the form of commonsense or factual knowledge. However, such knowledge is not sufficient to understand…

Computation and Language · Computer Science 2021-10-27 Keshav Singh , Naoya Inoue , Farjana Sultana Mim , Shoichi Naitoh , Kentaro Inui

In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…

Artificial Intelligence · Computer Science 2022-01-26 AnneMarie Borg , Floris Bex

This paper explores the application of automated planning to automated theorem proving, which is a branch of automated reasoning concerned with the development of algorithms and computer programs to construct mathematical proofs. In…

Artificial Intelligence · Computer Science 2023-12-12 Alice Petrov , Christian Muise

This note imparts heuristic arguments and theorectical evidences that contradict the abc conjecture over the rational numbers. In addition, the rudimentary datails for transforming this problem into the doimain of equidistribution theory…

Number Theory · Mathematics 2007-05-23 N. A. Carella

We add strong negation $N$ to classical logic and interpret the attack relation of "$x$ attacks $y$" in argumentation as $(x\to Ny)$. We write a corresponding object level (using $N$ only) classical theory for each argumentation network and…

Logic in Computer Science · Computer Science 2015-06-11 Dov Gabbay , Michael Gabbay

Realizability for knowledge representation formalisms studies the following question: given a semantics and a set of interpretations, is there a knowledge base whose semantics coincides exactly with the given interpretation set? We…

Artificial Intelligence · Computer Science 2016-04-01 Thomas Linsbichler , Jörg Pührer , Hannes Strass

Explainable Artificial Intelligence and Formal Argumentation have received significant attention in recent years. Argumentation-based systems often lack explainability while supporting decision-making processes. Counterfactual and…

Artificial Intelligence · Computer Science 2024-05-08 Gianvincenzo Alfano , Sergio Greco , Francesco Parisi , Irina Trubitsyna

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

Weighted gradual semantics provide an acceptability degree to each argument representing the strength of the argument, computed based on factors including background evidence for the argument, and taking into account interactions between…

Artificial Intelligence · Computer Science 2024-08-21 Assaf Libman , Nir Oren , Bruno Yun

We define an abstract notion of double Lie algebroid, which includes as particular cases: (1) the double Lie algebroid of a double Lie groupoid in the sense of the author, such as the iterated tangent bundle of an ordinary manifold, and…

Differential Geometry · Mathematics 2007-05-23 K. C. H. Mackenzie

Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree…

Combinatorics · Mathematics 2017-04-19 Reinhard Diestel

Computational models of argument quality (AQ) have focused primarily on assessing the overall quality or just one specific characteristic of an argument, such as its convincingness or its clarity. However, previous work has claimed that…

Computation and Language · Computer Science 2020-11-04 Lily Ng , Anne Lauscher , Joel Tetreault , Courtney Napoles

At its core, abstraction is the process of generalizing from specific instances to broader concepts or models, with the primary objective of reducing complexity while preserving properties essential to the intended purpose. It is…

Logic in Computer Science · Computer Science 2026-01-06 Andrzej Szalas

Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the…

Logic in Computer Science · Computer Science 2023-06-22 Nao Hirokawa , Aart Middeldorp , Christian Sternagel , Sarah Winkler

Dung's famous abstract argumentation frameworks represent the core formalism for many problems and applications in the field of argumentation which significantly evolved within the last decade. Recent work in the field has thus focused on…

Artificial Intelligence · Computer Science 2016-04-20 Wolfgang Dvořák , Sarah Alice Gaggl , Johannes Wallner , Stefan Woltran

This text is an introduction to the study of NIP (or dependent) theories. It is meant to serve two purposes. The first is to present various aspects of NIP theories and give the reader the background material needed to understand almost any…

Logic · Mathematics 2014-07-22 Pierre Simon

In search of a meaningful 2-dimensional analog to mono- tonicity, we introduce two new definitions and give examples of and dis- cuss the relationship between these definitions and others that we found in the literature. Note: After we…

Classical Analysis and ODEs · Mathematics 2013-07-01 Heather A. Van Dyke , Kevin R. Vixie , Thomas J. Asaki

Neural abstractive summarization models have led to promising results in summarizing relatively short documents. We propose the first model for abstractive summarization of single, longer-form documents (e.g., research papers). Our approach…

Computation and Language · Computer Science 2018-05-23 Arman Cohan , Franck Dernoncourt , Doo Soon Kim , Trung Bui , Seokhwan Kim , Walter Chang , Nazli Goharian

We propose a simple approach for the abstractive summarization of long legal opinions that considers the argument structure of the document. Legal opinions often contain complex and nuanced argumentation, making it challenging to generate a…

Computation and Language · Computer Science 2023-06-02 Mohamed Elaraby , Yang Zhong , Diane Litman
‹ Prev 1 3 4 5 6 7 10 Next ›