Theory of semi-instantiation in abstract argumentation

DOI10.1007/s11787-015-0133-9zbMath1407.68465arXiv1504.07020OpenAlexW778163028MaRDI QIDQ528522

Dov M. Gabbay

Publication date: 12 May 2017

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

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

zbMATH Keywords

argumentationBoolean attack formationssemi-instantiation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating operators and semantics for abstract dialectical frameworks
• A formalist philosophy of mathematics. I: Arithmetic
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• On the evaluation of argumentation formalisms
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Fibring argumentation frames
• A logical account of formal argumentation
• SCC-recursiveness: a general schema for argumentation semantics
• Sequent-Based Argumentation for Normative Reasoning
• An Equational Approach to Logic Programming
• Argumentation and Answer Set Programming
• Solving Weighted Argumentation Frameworks with Soft Constraints
• Revision, Acceptability and Context
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• The attack as strong negation, part I
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
• The Equational Approach to Contrary-to-duty Obligations
• Revisiting Abstract Argumentation Frameworks

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