Solving infinite-domain CSPs using the patchwork property (Q6157211): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Homogenizable structures and model completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Homogenizable Classes of Finite Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description logics with concrete domains and general concept inclusions revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability Results in the Block Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching interval algebra: an almost complete picture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Infinite-Domain Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The universal homogeneous binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog and constraint satisfaction with infinite templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-dichotomies in Constraint Satisfaction Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model-Theoretic View on Qualitative Constraint Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Phylogeny Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal constraint satisfaction problems / 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: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point algebras for temporal reasoning: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogenizable relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive conditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about partially ordered events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Properties of Boolean Contact Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5819562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of Relational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressive power and complexity in algebraic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and tractability in qualitative spatial and temporal reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constants and finite unary relations in qualitative constraint reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5869576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems on Intervals and Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slightly Superexponential Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tableau algorithm for description logics with concrete domains and general TBoxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of homogeneous structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with AND/OR Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability problems on intervals and unit intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Phylogenetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank

Latest revision as of 10:27, 1 August 2024

scientific article; zbMATH DE number 7698058
Language Label Description Also known as
English
Solving infinite-domain CSPs using the patchwork property
scientific article; zbMATH DE number 7698058

    Statements

    Solving infinite-domain CSPs using the patchwork property (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 June 2023
    0 references
    constraint satisfaction problem
    0 references
    parameterized complexity
    0 references
    treewidth
    0 references
    infinite domain
    0 references
    lower bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers