Strong backdoors for default logic
From MaRDI portal
(Redirected from Strong backdoors for default logic)
Strong backdoors for default logic (scientific article; zbMATH DE number 7918246)
Strong backdoors for default logic (scientific article; zbMATH DE number 7918246)
Cites work
- A logic for default reasoning
- A multiparametric view on answer set programming
- A unifying approach for nonmonotonic S4F, (reflexive) autoepistemic logic, and answer set programming
- Augmenting tractable fragments of abstract argumentation
- Backdoor sets for CSP
- Backdoor treewidth for SAT
- Backdoors into heterogeneous classes of SAT and CSP
- Backdoors to normality for disjunctive logic programs
- Backdoors to q-Horn
- Backdoors to satisfaction
- Backdoors to tractable answer set programming
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Circumscription - a form of non-monotonic reasoning
- Complexity Results for Nonmonotonic Logics
- Default logic and bounded treewidth
- Default logic and bounded treewidth
- Describing parameterized complexity classes
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Fixed-parameter tractable reductions to SAT
- Fundamentals of parameterized complexity
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3132713 (Why is no real title available?)
- scientific article; zbMATH DE number 4158606 (Why is no real title available?)
- scientific article; zbMATH DE number 478394 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- New problems complete for nondeterministic log space
- Non-monotonic logic. I
- Nonmonotonic Logic II
- On renamable Horn and generalized Horn functions
- On self-transformable combinatorial problems
- On sentences which are true of direct unions of algebras
- On the intertranslatability of non-monotonic logics
- On the parameterized complexity of non-monotonic logics
- On the relation between default and autoepistemic logic
- Paradigms for parameterized enumeration
- Parameterised complexity of abduction in Schaefer's framework
- Parameterized Approximation Problems
- Parameterized complexity of abduction in Schaefer's framework
- Parametrized complexity theory.
- Polynomial-time inference of all valid implications for Horn and related formulae
- Proof complexity of propositional default logic
- Propositional default logics made easier: computational complexity of model checking.
- Recognition of q-Horn formulae in linear time
- Satisfiability of acyclic and almost acyclic CNF formulas
- Semantical considerations on nonmonotonic logic
- Strong Backdoors for Default Logic
- The complexity class θp2: Recent results and applications in AI and modal logic
- The complexity of propositional implication
- The complexity of reasoning for fragments of autoepistemic logic
- The complexity of reasoning for fragments of default logic
- The complexity of satisfiability problems
- Theory and Applications of Satisfiability Testing
- Tight lower bounds for certain parameterized NP-hard problems
- Translating default logic into standard autoepistemic logic
- Treewidth and counting projected answer sets
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
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)
