Theory of semi-instantiation in abstract argumentation

DOI10.1007/S11787-015-0133-9zbMATH Open1407.68465arXiv1504.07020OpenAlexW778163028MaRDI QIDQ528522FDOQ528522

Authors: Dov Gabbay 

Publication date: 12 May 2017

Published in: Logica Universalis (Search for Journal in Brave)

Abstract: We study instantiated abstract argumentation frames of the form $(S,R,I)$, where $(S,R)$ is an abstract argumentation frame and where the arguments $x$ of $S$ are instantiated by $I(x)$ 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 finding such extensions. We further develop a theory of instantiation in the abstract, using the framework of Boolean attack formations and of conjunctive and disjunctive attacks. We discuss applications and compare critically with the existing related literature.

Full work available at URL: https://arxiv.org/abs/1504.07020

Recommendations

• On the semantics of abstract argumentation
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• scientific article; zbMATH DE number 7696694
• The hidden power of abstract argumentation semantics
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• A Logic of Abstract Argumentation
• A general approach to extension-based semantics in abstract argumentation
• Explanation semantics for abstract argumentation
• On the semantics of abstract argumentation frameworks: a logic programming approach
• Abducible Semantics and Argumentation

zbMATH Keywords

argumentationBoolean attack formationssemi-instantiation

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Cites Work

• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Title not available (Why is that?)
• On the evaluation of argumentation formalisms
• A logical account of formal argumentation
• SCC-recursiveness: a general schema for argumentation semantics
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• Title not available (Why is that?)
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• Fibring argumentation frames
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Argumentation and answer set programming
• Approximating operators and semantics for abstract dialectical frameworks
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
• Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger
• Sequent-based argumentation for normative reasoning
• An equational approach to logic programming
• Solving weighted argumentation frameworks with soft constraints
• Revision, acceptability and context. Theoretical and algorithmic aspects.
• Title not available (Why is that?)
• The attack as strong negation. I
• The equational approach to contrary-to-duty obligations
• Revisiting Abstract Argumentation Frameworks
• A formalist philosophy of mathematics. I: Arithmetic

Cited In (12)

• On the instantiation of knowledge bases in abstract argumentation frameworks
• On the graded acceptability of arguments in abstract and instantiated argumentation
• Abstract argumentation systems
• Theory Instantiation
• On the semantics of abstract argumentation
• Beyond maxi-consistent argumentation operators
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Towards a general theory of decomposability in abstract argumentation
• Title not available (Why is that?)
• Abducible Semantics and Argumentation
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• Automata for infinite argumentation structures

This page was built for publication: Theory of semi-instantiation in abstract argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528522)