English
Related papers

Related papers: A Preliminary Report on Probabilistic Attack Norma…

200 papers

In many real-life situations that involve exchanges of arguments, individuals may differ on their assessment of which supports between the arguments are in fact justified, i.e., they put forward different support-relations. When confronted…

Artificial Intelligence · Computer Science 2021-06-23 Weiwei Chen

Conceptual combination performs a fundamental role in creating the broad range of compound phrases utilized in everyday language. This article provides a novel probabilistic framework for assessing whether the semantics of conceptual…

Computation and Language · Computer Science 2014-11-24 Peter D. Bruza , Kirsty Kitto , Brentyn J. Ramm , Laurianne Sitbon

`Linguistic annotation' covers any descriptive or analytic notations applied to raw language data. The basic data may be in the form of time functions -- audio, video and/or physiological recordings -- or it may be textual. The added…

Computation and Language · Computer Science 2007-05-23 Steven Bird , Mark Liberman

Abstract Persuasion Argumentation (APA) is a dynamic argumentation formalism that extends Dung argumentation with persuasion relations. In this work, we show through two-counter Minsky machine encoding that APA dynamics is Turing-complete.

Logic in Computer Science · Computer Science 2019-03-20 Ryuta Arisaka

A framework with sets of attacking arguments (SETAF) is an extension of the well-known Dung's Abstract Argumentation Frameworks (AAFs) that allows joint attacks on arguments. In this paper, we provide a translation from Normal Logic…

Artificial Intelligence · Computer Science 2024-07-09 João Alcântara , Renan Cordeiro , Samy Sá

Recently generating natural language explanations has shown very promising results in not only offering interpretable explanations but also providing additional information and supervision for prediction. However, existing approaches…

Computation and Language · Computer Science 2022-05-30 Wangchunshu Zhou , Jinyi Hu , Hanlin Zhang , Xiaodan Liang , Maosong Sun , Chenyan Xiong , Jian Tang

This article introduces probabilistic disjunctive normal forms (PDNFs) as a framework for representing and reasoning about uncertainty in logical systems. Unlike classical DNFs, PDNFs assign real-valued weights to variables, encoding…

Logic in Computer Science · Computer Science 2026-03-13 Alexander Kuznetsov

We explore denotational interpreters: denotational semantics that produce coinductive traces of a corresponding small-step operational semantics. By parameterising our denotational interpreter over the semantic domain and then varying it,…

Programming Languages · Computer Science 2024-07-15 Sebastian Graf , Simon Peyton Jones , Sven Keidel

We propose a novel approach to logic-based learning which generates assumption-based argumentation (ABA) frameworks from positive and negative examples, using a given background knowledge. These ABA frameworks can be mapped onto logic…

Artificial Intelligence · Computer Science 2023-05-26 Maurizio Proietti , Francesca Toni

A topological shape analysis is proposed and utilized to learn concepts that reflect shape commonalities. Our approach is two-fold: i) a spatial topology analysis of point cloud segment constellations within objects. Therein constellations…

Computer Vision and Pattern Recognition · Computer Science 2018-11-22 Christian A. Mueller , Andreas Birk

We introduce a compositional framework for convex analysis based on the notion of convex bifunction of Rockafellar. This framework is well-suited to graphical reasoning, and exhibits rich dualities such as the Legendre-Fenchel transform,…

Category Theory · Mathematics 2024-01-30 Dario Stein , Richard Samuelson

The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…

Artificial Intelligence · Computer Science 2013-02-08 Henry E. Kyburg

We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…

Logic in Computer Science · Computer Science 2022-04-11 Tom Hirschowitz , Ambroise Lafont

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

Logic in Computer Science · Computer Science 2025-10-01 Luke Bayzid , Alexandre Madeira , Manuel A. Martins

Quantitative Bipolar Argumentation Frameworks (QBAFs) provide an alternative approach to computing argument acceptability in Bipolar Argumentation Frameworks (BAFs). Each argument is assigned an initial strength, which is then updated to a…

Artificial Intelligence · Computer Science 2026-05-05 Gianvincenzo Alfano , Sergio Greco , Lucio La Cava , Francesco Parisi , Irina Trubitsyna

Argumentation is a process of evaluating and comparing a set of arguments. A way to compare them consists in using a ranking-based semantics which rank-order arguments from the most to the least acceptable ones. Recently, a number of such…

Artificial Intelligence · Computer Science 2016-02-03 Elise Bonzon , Jérôme Delobelle , Sébastien Konieczny , Nicolas Maudet

We present a metagrammatical formalism, {\em generic rules}, to give a default interpretation to grammar rules. Our formalism introduces a process of {\em dynamic binding} interfacing the level of pure grammatical knowledge representation…

cmp-lg · Computer Science 2008-02-03 Julio Gonzalo , Teresa Solias

Theories of natural language and concepts have been unable to model the flexibility, creativity, context-dependence, and emergence, exhibited by words, concepts and their combinations. The mathematical formalism of quantum theory has…

Artificial Intelligence · Computer Science 2016-09-09 Diederik Aerts , Jan Broekaert , Liane Gabora , Sandro Sozzo

The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor.…

Artificial Intelligence · Computer Science 2020-02-19 Sarah A. Gaggl , Norbert Manthey , Alessandro Ronca , Johannes P. Wallner , Stefan Woltran

The paper introduces a framework for representation and acquisition of knowledge emerging from large samples of textual data. We utilise a tensor-based, distributional representation of simple statements extracted from text, and show how…

Artificial Intelligence · Computer Science 2012-10-12 Vit Novacek