Switch to: References

Add citations

You must login to add citations.
  1. Conciliatory Reasoning, Self-Defeat, and Abstract Argumentation.Aleks Https://Orcidorg Knoks - 2023 - Review of Symbolic Logic 16 (3):740-787.
    According to conciliatory views on the significance of disagreement, it’s rational for you to become less confident in your take on an issue in case your epistemic peer’s take on it is different. These views are intuitively appealing, but they also face a powerful objection: in scenarios that involve disagreements over their own correctness, conciliatory views appear to self-defeat and, thereby, issue inconsistent recommendations. This paper provides a response to this objection. Drawing on the work from defeasible logics paradigm and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Structured Arguments and Their Aggregation: A Reply to Selinger.Chris Reed - 2014 - Argumentation 28 (3):395-399.
    Selinger provides a new take on what is being referred to in the computational literature as ‘structured argumentation’. In this commentary the differences and similarities with existing work are highlighted as a way of demonstrating how philosophical and computational approaches to argumentation are increasingly coming together and complementing one another.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Theory of disjunctive attacks, Part I.D. Gabbay & M. Gabbay - 2016 - Logic Journal of the IGPL 24 (2):186-218.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • The attack as strong negation, part I.D. Gabbay & M. Gabbay - 2015 - Logic Journal of the IGPL 23 (6):881-941.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal and temporal argumentation networks.H. Barringer, D. M. Gabbay & J. Woods - 2012 - Argument and Computation 3 (2-3):203 - 227.
    The traditional Dung networks depict arguments as atomic and study the relationships of attack between them. This can be generalised in two ways. One is to consider various forms of attack, support, feedback, etc. Another is to add content to nodes and put there not just atomic arguments but more structure, e.g. proofs in some logic or simply just formulas from a richer language. This paper offers to use temporal and modal language formulas to represent arguments in the nodes of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • How to construct Remainder Sets for Paraconsistent Revisions: Preliminary Report.Rafael Testa, Eduardo Fermé, Marco Garapa & Maurício Reis - 2018 - 17th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING.
    Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation