Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks (Q2835878)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks	scientific article

Statements

scholarly article

0 references

Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks (English)

0 references

0 references

Francesco Parisi

0 references

Logics in Artificial Intelligence

0 references

publication date

30 November 2016

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-48758-8_19

0 references

Revising option status in argument-based decision systems1

0 references

On the input/output behavior of argumentation frameworks

0 references

On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method''

0 references

Splitting an Argumentation Framework

0 references

Normal and strong expansion equivalence for argumentation frameworks

0 references

0 references

Parameterized Splitting: A Simple Modification-Based Approach

0 references

Argumentation in artificial intelligence

0 references

0 references

Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension

0 references

Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

0 references

On the equivalence between logic programming semantics and argumentation semantics

0 references

Change in Abstract Argumentation Frameworks: Adding an Argument

0 references

Methods for solving reasoning problems in abstract argumentation -- a survey

0 references

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games

0 references

Computing ideal sceptical argumentation

0 references

The computational complexity of ideal semantics

0 references

Two party immediate response disputes: Properties and efficiency

0 references

Towards fixed-parameter tractable algorithms for abstract argumentation

0 references

Complexity of semi-stable and stage semantics in argumentation frameworks

0 references

Advances in knowledge representation, logic programming, and abstract argumentation. Essays dedicated to Gerhard Brewka on the occasion of his 60th birthday

0 references

On the Complexity of Probabilistic Abstract Argumentation Frameworks

0 references

On efficiently estimating the probability of extensions in abstract argumentation frameworks

0 references

Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments

0 references

atalog: A logic language for expressing search and optimization problems

0 references

Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

0 references

Dynamics of argumentation systems: a division-based method

0 references

Characterizing strong equivalence for argumentation frameworks

0 references

0 references

The Matrix Approach for Abstract Argumentation Frameworks

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-48758-8_19

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2835878

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2835878&oldid=36291157"