Complexity Classifications for Logic-Based Argumentation
From MaRDI portal
Publication:2946726
DOI10.1145/2629421zbMath1354.68251arXiv1304.5388OpenAlexW2125216182MaRDI QIDQ2946726
Johannes Schmidt, Nadia Creignou, Uwe Egly
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.5388
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework ⋮ Time Complexity of Constraint Satisfaction via Universal Algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Structure identification of Boolean relations and plain bases for co-clones
- Bases for Boolean co-clones
- The complexity of facets resolved
- On the algebraic structure of combinatorial problems
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- What makes propositional abduction tractable
- Closed systems of functions and predicates
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Complexity Classifications for Propositional Abduction in Post's Framework
- The Complexity of the Warranted Formula Problem in Propositional Argumentation
- The complexity of logic-based abduction
- Properties and Complexity of Some Formal Inter-agent Dialogues
- The complexity of satisfiability problems
- A Complete Classification of the Complexity of Propositional Abduction
- Mathematical Foundations of Computer Science 2005
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- Partial Polymorphisms and Constraint Satisfaction Problems
- A logic-based theory of deductive arguments
This page was built for publication: Complexity Classifications for Logic-Based Argumentation
