Details
| Original language | English |
|---|---|
| Article number | 15 |
| Number of pages | 36 |
| Journal | ACM Transactions on Computational Logic |
| Volume | 25 |
| Issue number | 3 |
| Early online date | 30 Mar 2024 |
| Publication status | Published - 17 Jun 2024 |
Abstract
In this article, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection (parameterised by the solution size) as well as backdoor evaluation (parameterised by the size of the given backdoor) for various kinds of target classes (CNF, KROM, MONOTONE) and all SCHAEFER classes. Also, we study generalisations of HORN-formulas, namely QHORN, RHORN, as well as DUALHORN. For these classes, we also classify the computational complexity of the implication problem. We show that backdoor detection is fixed-parameter tractable for the considered target classes and prove a complete trichotomy for backdoor evaluation. The problems are either fixed-parameter tractable, para-DeltaP2-complete, or para-NP-complete, depending on the target class.
Keywords
- backdoors, default logic, Parameterised complexity
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- General Computer Science
- Mathematics(all)
- Logic
- Mathematics(all)
- Computational Mathematics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: ACM Transactions on Computational Logic, Vol. 25, No. 3, 15, 17.06.2024.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Strong Backdoors for Default Logic
AU - Fichte, Johannes Klaus
AU - Meier, Arne
AU - Schindler, Irena
N1 - Publisher Copyright: © 2024 Copyright held by the owner/author(s).
PY - 2024/6/17
Y1 - 2024/6/17
N2 - In this article, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection (parameterised by the solution size) as well as backdoor evaluation (parameterised by the size of the given backdoor) for various kinds of target classes (CNF, KROM, MONOTONE) and all SCHAEFER classes. Also, we study generalisations of HORN-formulas, namely QHORN, RHORN, as well as DUALHORN. For these classes, we also classify the computational complexity of the implication problem. We show that backdoor detection is fixed-parameter tractable for the considered target classes and prove a complete trichotomy for backdoor evaluation. The problems are either fixed-parameter tractable, para-DeltaP2-complete, or para-NP-complete, depending on the target class.
AB - In this article, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection (parameterised by the solution size) as well as backdoor evaluation (parameterised by the size of the given backdoor) for various kinds of target classes (CNF, KROM, MONOTONE) and all SCHAEFER classes. Also, we study generalisations of HORN-formulas, namely QHORN, RHORN, as well as DUALHORN. For these classes, we also classify the computational complexity of the implication problem. We show that backdoor detection is fixed-parameter tractable for the considered target classes and prove a complete trichotomy for backdoor evaluation. The problems are either fixed-parameter tractable, para-DeltaP2-complete, or para-NP-complete, depending on the target class.
KW - backdoors
KW - default logic
KW - Parameterised complexity
UR - http://www.scopus.com/inward/record.url?scp=85200594708&partnerID=8YFLogxK
U2 - 10.1145/3655024
DO - 10.1145/3655024
M3 - Article
AN - SCOPUS:85200594708
VL - 25
JO - ACM Transactions on Computational Logic
JF - ACM Transactions on Computational Logic
SN - 1529-3785
IS - 3
M1 - 15
ER -