---
res:
  bibo_abstract:
  - "<jats:title>Abstract</jats:title>\r\n               <jats:p>Abductive reasoning
    is a non-monotonic formalism stemming from the work of Peirce. It describes the
    process of deriving the most plausible explanations of known facts. Considering
    the positive version, asking for sets of variables as explanations, we study,
    besides the problem of wether there exists a set of explanations, two explanation
    size limited variants of this reasoning problem (less than or equal to, and equal
    to a given size bound). In this paper, we present a thorough two-dimensional classification
    of these problems: the first dimension is regarding the parameterized complexity
    under a wealth of different parameterizations, and the second dimension spans
    through all possible Boolean fragments of these problems in Schaefer’s constraint
    satisfaction framework with co-clones (T. J. Schaefer. The complexity of satisfiability
    problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing,
    May 1–3, 1978, San Diego, California, USA, R.J. Lipton, W.A. Burkhard, W.J. Savitch,
    E.P. Friedman, A.V. Aho eds, pp. 216–226. ACM, 1978). Thereby, we almost complete
    the parameterized complexity classification program initiated by Fellows et al.
    (The parameterized complexity of abduction. In Proceedings of the Twenty-Sixth
    AAAI Conference on Articial Intelligence, July 22–26, 2012, Toronto, Ontario,
    Canada, J. Homann, B. Selman eds. AAAI Press, 2012), partially building on the
    results by Nordh and Zanuttini (What makes propositional abduction tractable.
    Artificial Intelligence, 172, 1245–1284, 2008). In this process, we outline a
    fine-grained analysis of the inherent parameterized intractability of these problems
    and pinpoint their FPT parts. As the standard algebraic approach is not applicable
    to our problems, we develop an alternative method that makes the algebraic tools
    partially available again.</jats:p>@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Yasir
      foaf_name: Mahmood, Yasir
      foaf_surname: Mahmood
  - foaf_Person:
      foaf_givenName: Arne
      foaf_name: Meier, Arne
      foaf_surname: Meier
  - foaf_Person:
      foaf_givenName: Johannes
      foaf_name: Schmidt, Johannes
      foaf_surname: Schmidt
  bibo_doi: 10.1093/logcom/exaa079
  bibo_issue: '1'
  bibo_volume: 31
  dct_date: 2021^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0955-792X
  - http://id.crossref.org/issn/1465-363X
  dct_language: eng
  dct_publisher: Oxford University Press (OUP)@
  dct_subject:
  - Logic
  - Hardware and Architecture
  - Arts and Humanities (miscellaneous)
  - Software
  - Theoretical Computer Science
  dct_title: Parameterized complexity of abduction in Schaefer’s framework@
...