Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

DOI10.1007/978-3-319-48758-8_19zbMath1483.68379OpenAlexW2543048251MaRDI QIDQ2835878

Francesco Parisi, Sergio Greco

Publication date: 30 November 2016

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_19

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (5)

On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach ⋮ Acceptance in incomplete argumentation frameworks ⋮ Incremental computation for structured argumentation over dynamic DeLP knowledge bases ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

Uses Software

• NP Datalog
• Tweety

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normal and strong expansion equivalence for argumentation frameworks
• Characterizing strong equivalence for argumentation frameworks
• On the input/output behavior of argumentation frameworks
• Advances in knowledge representation, logic programming, and abstract argumentation. Essays dedicated to Gerhard Brewka on the occasion of his 60th birthday
• Dynamics of argumentation systems: a division-based method
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Two party immediate response disputes: Properties and efficiency
• On efficiently estimating the probability of extensions in abstract argumentation frameworks
• Argumentation in artificial intelligence
• Computing ideal sceptical argumentation
• The computational complexity of ideal semantics
• Towards fixed-parameter tractable algorithms for abstract argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On the equivalence between logic programming semantics and argumentation semantics
• On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
• The Matrix Approach for Abstract Argumentation Frameworks
• Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
• Parameterized Splitting: A Simple Modification-Based Approach
• On the Complexity of Probabilistic Abstract Argumentation Frameworks
• Splitting an Argumentation Framework
• Revising option status in argument-based decision systems1
• atalog: A logic language for expressing search and optimization problems
• Change in Abstract Argumentation Frameworks: Adding an Argument
• Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
• Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols
• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments

This page was built for publication: Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks