Parameterised complexity of abduction in Schaefer's framework

DOI10.1007/978-3-030-36755-8_13OpenAlexW2996540084MaRDI QIDQ2177589FDOQ2177589

Authors: Yasir Mahmood, Arne Meier, Johannes Schmidt 

Publication date: 6 May 2020

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

Recommendations

• Parameterized complexity of abduction in Schaefer's framework
• Complexity classifications for propositional abduction in Post's framework
• A Complete Classification of the Complexity of Propositional Abduction
• scientific article; zbMATH DE number 512816
• The Complexity of Abduction for Equality Constraint Languages

zbMATH Keywords

abductionparameterised complexitySchaefer's frameworkco-clones

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in computer science (03B70)

Cited In (5)

• Strong backdoors for default logic
• Strong backdoors for default logic
• The Complexity of Abduction for Equality Constraint Languages
• Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework
• Scalable algorithms for abduction via enumerative syntax-guided synthesis

This page was built for publication: Parameterised complexity of abduction in Schaefer's framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177589)