Pakota: A System for Enforcement in Abstract Argumentation

DOI10.1007/978-3-319-48758-8_25zbMath1483.68383OpenAlexW2539750312MaRDI QIDQ2835885

Matti Järvisalo, Johannes Peter Wallner, Andreas Niskanen

Publication date: 30 November 2016

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_25

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change, Pakota: A System for Enforcement in Abstract Argumentation

Uses Software

• MiniSat
• Glucose
• Open-WBO
• LMHS
• maxino

Cites Work

• Unnamed Item
• Unnamed Item
• Looking-ahead in backtracking algorithms for abstract argumentation
• Normal and strong expansion equivalence for argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• Algorithms for decision problems in argument systems under preferred semantics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• LMHS: A SAT-IP Hybrid MaxSAT Solver
• Pakota: A System for Enforcement in Abstract Argumentation
• A Translation-Based Approach for Revision of Argumentation Frameworks
• Open-WBO: A Modular MaxSAT Solver,
• Counterexample-guided abstraction refinement for symbolic model checking
• Theory and Applications of Satisfiability Testing
• Exploiting the Power of mip Solvers in maxsat
• Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach