Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework

DOI10.1145/3582499arXiv2102.11782OpenAlexW3131365428MaRDI QIDQ6116364

Arne Meier, Yasir Mahmood, Johannes Schmidt

Publication date: 18 July 2023

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.11782

zbMATH Keywords

parameterized complexitySchaefer's frameworklogic-based argumentation

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Exact exponential algorithms.
• Using arguments for making and explaining decisions
• The complexity of propositional implication
• Bases for Boolean co-clones
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Parameterised complexity of abduction in Schaefer's framework
• What makes propositional abduction tractable
• Paradigms for parameterized enumeration
• Redundancy in logic. I: CNF propositional formulae
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• Complexity Classifications for Logic-Based Argumentation
• Properties and Complexity of Some Formal Inter-agent Dialogues
• Parameterized complexity of abduction in Schaefer’s framework
• The complexity of satisfiability problems
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
• Partial Polymorphisms and Constraint Satisfaction Problems
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• A logic-based theory of deductive arguments

This page was built for publication: Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework