Parameterized complexity of abduction in Schaefer's framework

DOI10.1093/LOGCOM/EXAA079MaRDI QIDQ5028318zbMATH OpenOpenAlexFDO

Authors Yasir Mahmood, Arne Meier, Johannes Schmidt

Publication date 8 February 2022

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exaa079

zbMATH Keywords

abductionco-clonesnon-monotonic reasoningparameterized complexitySchaefer's framework

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• 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 computational complexity of abduction
• What makes propositional abduction tractable

Cited in

(5)

• Parameterised complexity of abduction in Schaefer's framework
• The Complexity of Abduction for Equality Constraint Languages
• Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework
• Strong backdoors for default logic
• Strong backdoors for default logic

This page was built for publication: Parameterized 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 Q5028318)