A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
From MaRDI portal
Publication:6179525
DOI10.1007/978-3-031-40875-5_6MaRDI QIDQ6179525
Publication date: 16 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Logic in artificial intelligence (68T27) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Cites Work
- Quantified maximum satisfiability
- Characteristics of multiple viewpoints in abstract argumentation
- Propositional knowledge base revision and minimal change
- The first international competition on computational models of argumentation: results and analysis
- An extension-based approach to belief revision in abstract argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Constrained incomplete argumentation frameworks
- Design and results of the second international competition on computational models of argumentation
- How we designed winning algorithms for abstract argumentation and which insight we attained
- A Translation-Based Approach for Revision of Argumentation Frameworks
- Merging Information Under Constraints: A Logical Framework
- Synthesizing Argumentation Frameworks from Examples
- Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
- Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity
- A Bayesian approach to forward and inverse abstract argumentation problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
