Strong backdoors for default logic
From MaRDI portal
Publication:6610193
DOI10.1145/3655024WikidataQ130807650 ScholiaQ130807650MaRDI QIDQ6610193
Johannes K. Fichte, Irena Schindler, Arne Meier
Publication date: 25 September 2024
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Backdoors to q-Horn
- Fundamentals of parameterized complexity
- Satisfiability of acyclic and almost acyclic CNF formulas
- On the parameterized complexity of non-monotonic logics
- Proof complexity of propositional default logic
- Backdoors into heterogeneous classes of SAT and CSP
- The complexity of propositional implication
- Semantical considerations on nonmonotonic logic
- On the relation between default and autoepistemic logic
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Non-monotonic logic. I
- Recognition of \(q\)-Horn formulae in linear time
- Polynomial-time inference of all valid implications for Horn and related formulae
- On renamable Horn and generalized Horn functions
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Backdoor treewidth for SAT
- Augmenting tractable fragments of abstract argumentation
- Propositional default logics made easier: computational complexity of model checking.
- Describing parameterized complexity classes
- On the intertranslatability of non-monotonic logics
- Parameterised complexity of abduction in Schaefer's framework
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- A multiparametric view on answer set programming
- Treewidth and counting projected answer sets
- Backdoors to tractable answer set programming
- Paradigms for parameterized enumeration
- Parametrized complexity theory.
- Tight lower bounds for certain parameterized NP-hard problems
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Strong Backdoors for Default Logic
- The complexity of reasoning for fragments of default logic
- Backdoors to Satisfaction
- The Complexity of Reasoning for Fragments of Autoepistemic Logic
- Fixed-Parameter Tractable Reductions to SAT
- Parameterized Approximation Problems
- On self-transformable combinatorial problems
- Nonmonotonic Logic II
- Complexity Results for Nonmonotonic Logics
- New problems complete for nondeterministic log space
- Translating default logic into standard autoepistemic logic
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- A Unifying Approach for Nonmonotonic S4F, (Reflexive) Autoepistemic Logic, and Answer Set Programming
- Backdoor Sets for CSP.
- Parameterized complexity of abduction in Schaefer’s framework
- The complexity class θp2: Recent results and applications in AI and modal logic
- Backdoors to Normality for Disjunctive Logic Programs
- Theory and Applications of Satisfiability Testing
- The complexity of satisfiability problems
- On sentences which are true of direct unions of algebras
- Default logic and bounded treewidth
- Default logic and bounded treewidth
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 Q6610193)
