Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Probabilistic interpretations of argumentative attacks: Logical and experimental results.Niki Pfeifer & Christian G. Fermüller - 2023 - Argument and Computation 14 (1):75-107.
    We present an interdisciplinary approach to argumentation combining logical, probabilistic, and psychological perspectives. We investigate logical attack principles which relate attacks among claims with logical form. For example, we consider the principle that an argument that attacks another argument claiming A triggers the existence of an attack on an argument featuring the stronger claim A ∧ B. We formulate a number of such principles pertaining to conjunctive, disjunctive, negated, and implicational claims. Some of these attack principles seem to be prima (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Argumentation frameworks with necessities and their relationship with logic programs.Farid Nouioua & Sara Boutouhami - 2023 - Argument and Computation 14 (1):17-58.
    This paper presents a comprehensive study of argumentation frameworks with necessities (AFNs), a bipolar extension of Dung Abstract argumentation frameworks (AFs) where the support relation captures a positive interaction between arguments having the meaning of necessity: the acceptance of an argument may require the acceptance of other argument(s). The paper discusses new main acceptability semantics for AFNs and their characterization both by a direct approach and a labelling approach. It examines the relationship between AFNs and Dung AFs and shows the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Comparing logic programming and formal argumentation; the case of ideal and eager semantics.Martin Caminada, Sri Harikrishnan & Samy Sá - 2022 - Argument and Computation 13 (1):93-120.
    The connection between logic programming and formal argumentation has been studied starting from the landmark 1995 paper of Dung. Subsequent work has identified a standard translation from logic programs to argumentation frameworks, under which pairwise correspondences hold between various logic programming semantics and various formal argumentation semantics. This includes the correspondence between 3-valued stable and complete semantics, between well-founded and grounded semantics and between 2-valued stable and stable semantics. In the current paper, we show that the existing translation is able (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Assumption-based argumentation with preferences and goals for patient-centric reasoning with interacting clinical guidelines.Kristijonas Čyras, Tiago Oliveira, Amin Karamlou & Francesca Toni - 2021 - Argument and Computation 12 (2):149-189.
    A paramount, yet unresolved issue in personalised medicine is that of automated reasoning with clinical guidelines in multimorbidity settings. This entails enabling machines to use computerised generic clinical guideline recommendations and patient-specific information to yield patient-tailored recommendations where interactions arising due to multimorbidities are resolved. This problem is further complicated by patient management desiderata, in particular the need to account for patient-centric goals as well as preferences of various parties involved. We propose to solve this problem of automated reasoning with (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Rationality and maximal consistent sets for a fragment of ASPIC + without undercut.Gabriella Pigozzi & Srdjan Vesic - 2021 - Argument and Computation 12 (1):3-47.
    Structured argumentation formalisms, such as ASPIC +, offer a formal model of defeasible reasoning. Usually such formalisms are highly parametrized and modular in order to provide a unifying framework in which different forms of reasoning can be expressed. This generality comes at the price that, in their most general form, formalisms such as ASPIC + do not satisfy important rationality postulates, such as non-interference. Similarly, links to other forms of knowledge representation, such as reasoning with maximal consistent sets of rules, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An abstract and structured account of dialectical argument strength.Henry Prakken - 2024 - Artificial Intelligence 335 (C):104193.
    Download  
     
    Export citation  
     
    Bookmark  
  • An axiomatic analysis of structured argumentation with priorities.Phan Minh Dung - 2016 - Artificial Intelligence 231 (C):107-150.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On argument acceptability change towards legal interpretation dynamics.Martín O. Moguillansky & Luciano H. Tamargo - 2020 - Artificial Intelligence and Law 29 (3):311-350.
    We propose a formal theory built upon an abstract argumentation framework for handling argumentation dynamics. To that end, we analyze the acceptability dynamics of arguments through the proposal of two different kinds of sets of arguments which are somehow responsible for the acceptability/rejection of a given argument. We develop a study of the consequences of breaking the construction of such sets towards the acceptance of an analyzed argument. This brings about the proposal of a novel change operation which allows to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Equivalence in logic-based argumentation.Leila Amgoud, Philippe Besnard & Srdjan Vesic - 2014 - Journal of Applied Non-Classical Logics 24 (3):181-208.
    This paper investigates when two abstract logic-based argumentation systems are equivalent. It defines various equivalence criteria, investigates the links between them, and identifies cases where two systems are equivalent with respect to each of the proposed criteria. In particular, it shows that under some reasonable conditions on the logic underlying an argumentation system, the latter has an equivalent finite subsystem, called core. This core constitutes a threshold under which arguments of the system have not yet attained their final status and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An argumentation-based approach for reasoning about trust in information sources.Leila Amgoud & Robert Demolombe - 2014 - Argument and Computation 5 (2-3):191-215.
    During a dialogue, agents exchange information with each other and need thus to deal with incoming information. For that purpose, they should be able to reason effectively about trustworthiness of information sources. This paper proposes an argument-based system that allows an agent to reason about its own beliefs and information received from other sources. An agent's beliefs are of two kinds: beliefs about the environment and beliefs about trusting sources . Six basic forms of trust are discussed in the paper (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Sequent-based logical argumentation.Ofer Arieli & Christian Straßer - 2015 - Argument and Computation 6 (1):73-99.
    We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks between arguments are represented by sequent elimination rules, and deductions are made according to Dung-style skeptical or credulous semantics. This framework accommodates different languages and logics in which arguments may be represented, allows for a flexible and simple way of expressing and identifying arguments, supports a variety of attack relations, and is faithful to standard methods of drawing conclusions (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • An appreciation of John Pollock's work on the computational study of argument.Henry Prakken & John Horty - 2012 - Argument and Computation 3 (1):1 - 19.
    John Pollock (1940?2009) was an influential American philosopher who made important contributions to various fields, including epistemology and cognitive science. In the last 25 years of his life, he also contributed to the computational study of defeasible reasoning and practical cognition in artificial intelligence. He developed one of the first formal systems for argumentation-based inference and he put many issues on the research agenda that are still relevant for the argumentation community today. This paper presents an appreciation of Pollock's work (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Automata for infinite argumentation structures.Pietro Baroni, Federico Cerutti, Paul E. Dunne & Massimiliano Giacomin - 2013 - Artificial Intelligence 203 (C):104-150.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness.Wolfgang Dvořák, Anna Rapberger & Stefan Woltran - 2023 - Artificial Intelligence 324 (C):104011.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Belief Revision and Computational Argumentation: A Critical Comparison.Pietro Baroni, Eduardo Fermé, Massimiliano Giacomin & Guillermo Ricardo Simari - 2022 - Journal of Logic, Language and Information 31 (4):555-589.
    This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one hand assessing the (not fully explored yet) relationships between two lively research fields in the broad area of defeasible reasoning and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Constructing argument graphs with deductive arguments: a tutorial.Philippe Besnard & Anthony Hunter - 2014 - Argument and Computation 5 (1):5-30.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • A general account of argumentation with preferences.Sanjay Modgil & Henry Prakken - 2013 - Artificial Intelligence 195 (C):361-397.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • A QBF-based formalization of abstract argumentation semantics.Ofer Arieli & Martin W. A. Caminada - 2013 - Journal of Applied Logic 11 (2):229-252.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The complexity landscape of claim-augmented argumentation frameworks.Wolfgang Dvořák, Alexander Greßler, Anna Rapberger & Stefan Woltran - 2023 - Artificial Intelligence 317 (C):103873.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Complexity of abstract argumentation under a claim-centric view.Wolfgang Dvořák & Stefan Woltran - 2020 - Artificial Intelligence 285 (C):103290.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Theory of Semi-Instantiation in Abstract Argumentation.D. M. Gabbay - 2016 - Logica Universalis 10 (4):431-516.
    We study instantiated abstract argumentation frames of the form, where is an abstract argumentation frame and where the arguments x of S are instantiated by I as well formed formulas of a well known logic, for example as Boolean formulas or as predicate logic formulas or as modal logic formulas. We use the method of conceptual analysis to derive the properties of our proposed system. We seek to define the notion of complete extensions for such systems and provide algorithms for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Complexity of logic-based argumentation in Post's framework.Nadia Creignou, Johannes Schmidt, Michael Thomas & Stefan Woltran - 2011 - Argument and Computation 2 (2-3):107 - 129.
    Many proposals for logic-based formalisations of argumentation consider an argument as a pair (Φ,α), where the support Φ is understood as a minimal consistent subset of a given knowledge base which has to entail the claim α. In case the arguments are given in the full language of classical propositional logic reasoning in such frameworks becomes a computationally costly task. For instance, the problem of deciding whether there exists a support for a given claim has been shown to be -complete. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Methods for solving reasoning problems in abstract argumentation – A survey.Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner & Stefan Woltran - 2015 - Artificial Intelligence 220 (C):28-63.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Classical logic, argument and dialectic.M. D'Agostino & S. Modgil - 2018 - Artificial Intelligence 262 (C):15-51.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Logical limits of abstract argumentation frameworks.Leila Amgoud & Philippe Besnard - 2013 - Journal of Applied Non-Classical Logics 23 (3):229-267.
    Dung’s (1995) argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, w.r.t. a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is used to. This raises some questions about the compatibility of the setting with a logical formalism (i.e., whether it is possible to (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Bisimulation between base argumentation and premise-conclusion argumentation.Jinsheng Chen, Beishui Liao & Leendert van der Torre - 2024 - Artificial Intelligence 336 (C):104203.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computational complexity of flat and generic Assumption-Based Argumentation, with and without probabilities.Kristijonas Čyras, Quentin Heinrich & Francesca Toni - 2021 - Artificial Intelligence 293 (C):103449.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • An analysis of critical-link semantics with variable degrees of justification.Bin Wei & Henry Prakken - 2016 - Argument and Computation 7 (1):35-53.
    Download  
     
    Export citation  
     
    Bookmark  
  • A postulate-driven study of logical argumentation.Ofer Arieli, AnneMarie Borg & Christian Straßer - 2023 - Artificial Intelligence 322 (C):103966.
    Download  
     
    Export citation  
     
    Bookmark  
  • Normal and strong expansion equivalence for argumentation frameworks.Ringo Baumann - 2012 - Artificial Intelligence 193 (C):18-44.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Characterizing strong equivalence for argumentation frameworks.Emilia Oikarinen & Stefan Woltran - 2011 - Artificial Intelligence 175 (14-15):1985-2009.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Rationality and maximal consistent sets for a fragment of ASPIC + without undercut.Jesse Heyninck & Christian Straßer - 2021 - Argument and Computation 12 (1):3-47.
    Structured argumentation formalisms, such as ASPIC +, offer a formal model of defeasible reasoning. Usually such formalisms are highly parametrized and modular in order to provide a unifying framework in which different forms of reasoning can be expressed. This generality comes at the price that, in their most general form, formalisms such as ASPIC + do not satisfy important rationality postulates, such as non-interference. Similarly, links to other forms of knowledge representation, such as reasoning with maximal consistent sets of rules, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations