Default logic and bounded treewidth (Q5918613): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2020.104675 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Backdoors for Default Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Approach to Courcelle's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF as an alternative to Courcelle's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion-based QBF Solving on Tree Decompositions* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set solving with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: DynASP2.5: Dynamic Programming on Tree Decompositions in Action / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taming high treewidth with abstraction, nested dynamic programming, and database technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paradigms for parameterized enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Default logic and bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtractive reductions and complete problems for counting complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Enumeration Problems with Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for propositional model counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028795 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2020.104675 / rank
 
Normal rank

Latest revision as of 02:39, 17 December 2024

scientific article; zbMATH DE number 7488448
Language Label Description Also known as
English
Default logic and bounded treewidth
scientific article; zbMATH DE number 7488448

    Statements

    Default logic and bounded treewidth (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2022
    0 references
    parameterized algorithms
    0 references
    tree decompositions
    0 references
    dynamic programming
    0 references
    Reiter's default logic
    0 references
    propositional logic
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers