Tree dualities for constraint satisfaction

DOI10.1007/978-3-642-15205-4_4MaRDI QIDQ3586031zbMATH OpenOpenAlexFDO

Authors Andrei Krokhin

Publication date 3 September 2010

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15205-4_4

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in computer science (03B70)

Recommendations

• Dualities for Constraint Satisfaction Problems
• CSP duality and trees of bounded pathwidth
• Asking the Metaquestions in Constraint Tractability
• Graph-Theoretic Concepts in Computer Science
• The complexity of homomorphism and constraint satisfaction problems seen from the other side

Cited in

(9)

• Finite dualities, in particular in full homomorphisms
• Dualities for Constraint Satisfaction Problems
• Constraint satisfaction with bounded treewidth revisited
• scientific article; zbMATH DE number 2090031 (Why is no real title available?)
• The data complexity of ontology-mediated queries with closed predicates
• Finding optimal satisficing strategies for and-or trees
• Adjoint functors and tree duality
• CSP duality and trees of bounded pathwidth
• Regular families of forests, antichains and duality pairs of relational structures

This page was built for publication: Tree dualities for constraint satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586031)