Computing ideal sceptical argumentation (Q1028947)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Computing ideal sceptical argumentation	scientific article

Statements

scholarly article

0 references

Computing ideal sceptical argumentation (English)

0 references

Artificial Intelligence

0 references

publication date

9 July 2009

0 references

zbMATH Keywords

abstract argumentation

0 references

assumption-based argumentation

0 references

ideal semantics

0 references

proof procedure

0 references

dispute

0 references

0 references

Paolo Mancarella

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.artint.2007.05.003

0 references

Logic programming and knowledge representation

0 references

An abstract, argumentation-theoretic approach to default reasoning

0 references

On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks

0 references

On the computational complexity of assumption-based argumentation for default reasoning.

0 references

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

0 references

Dialectic proof procedures for assumption-based, admissible argumentation

0 references

Two party immediate response disputes: Properties and efficiency

0 references

Argumentation Semantics for Defeasible Logic

0 references

Computing argumentation in logic programming

0 references

0 references

Computing the acceptability semantics

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.ARTINT.2007.05.003

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1028947

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