Strong backdoors for default logic
From MaRDI portal
Publication:6570091
DOI10.1145/3655024MaRDI QIDQ6570091FDOQ6570091
Authors: Johannes K. Fichte, Arne Meier, Irena Schindler 
Publication date: 10 July 2024
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Cites Work
- Fundamentals of parameterized complexity
- Fixed-parameter tractable reductions to SAT
- Title not available (Why is that?)
- Recognition of \(q\)-Horn formulae in linear time
- Polynomial-time inference of all valid implications for Horn and related formulae
- Parametrized complexity theory.
- Backdoors to q-Horn
- Backdoors to satisfaction
- Graph structure and monadic second-order logic. A language-theoretic approach
- Title not available (Why is that?)
- Parameterized Approximation Problems
- The complexity of satisfiability problems
- Satisfiability of acyclic and almost acyclic CNF formulas
- Title not available (Why is that?)
- Backdoors into heterogeneous classes of SAT and CSP
- Theory and Applications of Satisfiability Testing
- On sentences which are true of direct unions of algebras
- A logic for default reasoning
- Non-monotonic logic. I
- New problems complete for nondeterministic log space
- Semantical considerations on nonmonotonic logic
- Circumscription - a form of non-monotonic reasoning
- Tight lower bounds for certain parameterized NP-hard problems
- The complexity class θp2: Recent results and applications in AI and modal logic
- The complexity of propositional implication
- On the intertranslatability of non-monotonic logics
- The complexity of reasoning for fragments of autoepistemic logic
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Complexity Results for Nonmonotonic Logics
- Backdoors to normality for disjunctive logic programs
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- The complexity of reasoning for fragments of default logic
- Proof complexity of propositional default logic
- On the relation between default and autoepistemic logic
- Augmenting tractable fragments of abstract argumentation
- Translating default logic into standard autoepistemic logic
- Title not available (Why is that?)
- On the parameterized complexity of non-monotonic logics
- Nonmonotonic Logic II
- On renamable Horn and generalized Horn functions
- Backdoors to tractable answer set programming
- Propositional default logics made easier: computational complexity of model checking.
- On self-transformable combinatorial problems
- Title not available (Why is that?)
- Describing parameterized complexity classes
- Backdoor treewidth for SAT
- Backdoors for linear temporal logic
- Parameterised complexity of abduction in Schaefer's framework
- Default logic and bounded treewidth
- Treewidth and counting projected answer sets
- A multiparametric view on answer set programming
- Paradigms for parameterized enumeration
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Strong Backdoors for Default Logic
- Default logic and bounded treewidth
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Backdoor Sets for CSP.
- Parameterized complexity of abduction in Schaefer’s framework
- A Unifying Approach for Nonmonotonic S4F, (Reflexive) Autoepistemic Logic, and Answer Set Programming
This page was built for publication: Strong backdoors for default logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570091)
