Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Georg Gottlob / rank
 
Normal rank
Property / author
 
Property / author: Francesco Scarcello / rank
 
Normal rank
Property / author
 
Property / author: Martha Sideris / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Smodels / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59259714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction from a deductive viewpoint / 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: Propositional lower bounds: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in logic programming and stable model computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for backtrack-bounded search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank

Latest revision as of 10:51, 4 June 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter complexity in AI and nonmonotonic reasoning
scientific article

    Statements

    Fixed-parameter complexity in AI and nonmonotonic reasoning (English)
    0 references
    15 July 2002
    0 references
    parameterized complexity
    0 references
    mixed-parameter tractability
    0 references
    nonmonotonic reasoning
    0 references
    constraint satisfaction
    0 references
    conjunctive queries
    0 references
    prime implicants
    0 references
    logic programming
    0 references
    stable models
    0 references
    circumscription
    0 references
    0 references
    0 references
    0 references

    Identifiers