Computing ideal sceptical argumentation (Q1028947): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Logic programming and knowledge representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract, argumentation-theoretic approach to default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of assumption-based argumentation for default reasoning. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dialectic proof procedures for assumption-based, admissible argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two party immediate response disputes: Properties and efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argumentation Semantics for Defeasible Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing argumentation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the acceptability semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536329 / rank
 
Normal rank

Revision as of 18:02, 1 July 2024

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

    Statements

    Identifiers