scientific article; zbMATH DE number 2243365

zbMath1080.68658arXiv1107.0043MaRDI QIDQ5715675

Andrei A. Krokhin, Martin C. Cooper, David A. Cohen, Peter G. Jeavons

Publication date: 4 January 2006

Full work available at URL: https://arxiv.org/abs/1107.0043

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (19)

The Expressive Power of Binary Submodular Functions ⋮ Supermodular functions and the complexity of MAX CSP ⋮ Modularity-based decompositions for valued CSP ⋮ Tractability of explaining classifier decisions ⋮ A dichotomy for minimum cost graph homomorphisms ⋮ The Expressive Power of Valued Constraints: Hierarchies and Collapses ⋮ Binarisation for Valued Constraint Satisfaction Problems ⋮ Colouring, constraint satisfaction, and complexity ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ The complexity of soft constraint satisfaction ⋮ Minimum cost homomorphisms to semicomplete multipartite digraphs ⋮ The expressive power of valued constraints: Hierarchies and collapses ⋮ The expressive power of binary submodular functions ⋮ Soft arc consistency revisited ⋮ Minimum cost and list homomorphisms to semicomplete digraphs ⋮ Minimum Cost Homomorphisms to Reflexive Digraphs ⋮ The complexity of approximating conservative counting CSPs ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited

This page was built for publication: