English
Related papers

Related papers: A Semantic Tableau Method for Argument Constructio…

200 papers

In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic. If the student has previous notions of basic set theory, this approach to semantical tableaux can clarify her the way…

Computers and Society · Computer Science 2015-07-15 Nino Guallart , Angel Nepomuceno-Fernandez

We set out a general methodology for producing tableau systems for propositional logics via a tableau metatheory that provides general and formal notions for different tableau systems that vary by semantics or formulae. Moreover, by dint of…

Logic in Computer Science · Computer Science 2025-11-24 T. Jarmuzek , R. Gore

This paper describes how automated deduction methods for natural language processing can be applied more efficiently by encoding context in a more elaborate way. Our work is based on formal approaches to context, and we provide a tableau…

Artificial Intelligence · Computer Science 2007-05-23 Christof Monz

In this position paper, we propose a reasoning framework that can model the reasoning process underlying natural language inferences. The framework is based on the semantic tableau method, a well-studied proof system in formal logic. Like…

Computation and Language · Computer Science 2025-02-10 Lasha Abzianidze

In this paper we present a theorem proving methodology for a restricted but significant fragment of the conditional language made up of (boolean combinations of) conditional statements with unnested antecedents. The method is based on the…

Logic in Computer Science · Computer Science 2007-05-23 Alberto Artosi , Guido Governatori

Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…

cmp-lg · Computer Science 2008-02-03 Pablo Gervas

We propose a presentation of classical propositional tableaux elaborated by application of methods that are noteworthy in program design, namely program derivation with separation of concerns. We start by deriving from a straightforward…

Computers and Society · Computer Science 2015-07-15 Juan Michelini , Alvaro Tasistro

We present a tableau calculus for reasoning in fragments of natural language. We focus on the problem of pronoun resolution and the way in which it complicates automated theorem proving for natural language processing. A method for…

Computation and Language · Computer Science 2007-05-23 Christof Monz , Maarten de Rijke

We propose a novel ranking-based semantics for Dung-style argumentation frameworks with the help of conditional logics. Using an intuitive translation for an argumentation framework to generate conditionals, we can apply nonmonotonic…

Artificial Intelligence · Computer Science 2020-08-07 Kenneth Skiba , Matthias Thimm

In this paper, we propose a fresh perspective on argumentation semantics, to view them as a relational database. It offers encapsulation of the underlying argumentation graph, and allows us to understand argumentation semantics under a…

Artificial Intelligence · Computer Science 2021-04-27 Ryuta Arisaka , Takayuki Ito

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules that can then be used to reason within the…

Logic in Computer Science · Computer Science 2015-07-01 Renate A. Schmidt , Dmitry Tishkovsky

In this paper we present tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a…

Logic · Mathematics 2025-01-17 Meghdad Ghari

In this paper, an application of automated theorem proving techniques to computational semantics is considered. In order to compute the presuppositions of a natural language discourse, several inference tasks arise. Instead of treating…

Computation and Language · Computer Science 2007-05-23 Christof Monz

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

In this paper we present analytic tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give…

Logic · Mathematics 2016-06-14 Meghdad Ghari

In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. It is well known, as the logical foundation of the…

Artificial Intelligence · Computer Science 2013-01-11 Xiaowang Zhang , Guohui Xiao , Zuoquan Lin

Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled…

Artificial Intelligence · Computer Science 2013-03-08 John Fox , Paul J. Krause , Morten Elvang-Gøransson

A number of flexible tactic-based logical frameworks are nowadays available that can implement a wide range of mathematical theories using a common higher-order metalanguage. Used as proof assistants, one of the advantages of such powerful…

Logic in Computer Science · Computer Science 2010-03-26 João Marcos

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré
‹ Prev 1 2 3 10 Next ›