scientific article; zbMATH DE number 2080314
From MaRDI portal
Publication:4473033
zbMath1044.68777MaRDI QIDQ4473033
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1894/18940291.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Tractability-preserving transformations of global cost functions ⋮ Semantic forgetting in answer set programming ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ Virtual pairwise consistency in cost function networks ⋮ Approximate Counting with Deterministic Guarantees for Affinity Computation ⋮ On the limits of forgetting in answer set programming ⋮ Soft arc consistency revisited ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Hybrid backtracking bounded by tree-decomposition of constraint networks
This page was built for publication:
