Weakest link in formal argumentation: lookahead and principle-based analysis

DOI10.1007/978-3-031-40875-5_5OpenAlexW4385444757MaRDI QIDQ6139087

Chen Chen, Leendert van der Torre, Pere Pardo, Liuwen Yu

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40875-5_5

zbMATH Keywords

knowledge representationreasoningformal argumentationweakest linkprinciple-based analysisprioritised structured argumentation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general account of argumentation with preferences
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• An axiomatic analysis of structured argumentation with priorities
• How to reason defeasibly
• Preferred answer sets for extended logic programs
• Justification and defeat
• An abstract, argumentation-theoretic approach to default reasoning
• Expressing preferences in default logic
• Fundamental properties of attack relations in structured argumentation with priorities
• Corrigendum to: ``A general account of argumentation with preferences
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the interaction between logic and preference in structured argumentation
• Argumentation Semantics for Defeasible Logic
• Prioritized norms in formal argumentation
• Defeasible reasoning with variable degrees of justification