Graphical Models: Queries, Complexity, Algorithms

DOI10.4230/LIPICS.STACS.2020.4MaRDI QIDQ5874274zbMATH OpenOpenAlexFDO

Authors M. C. Cooper, Simon de Givry, Thomas Schiex

Publication date 7 February 2023

Full work available at URL https://hal.science/hal-02547692

zbMATH Keywords

artificial intelligencecomputational complexitygraphical modelslocal consistencymessage passingoptimizationsubmodularitytree decompositionvalued constraints

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(7)

• AND/OR search spaces for graphical models
• Multiple-choice knapsack constraint in graphical models
• Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
• Virtual pairwise consistency in cost function networks
• Tractability of explaining classifier decisions
• An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
• Scaling neuro-symbolic problem solving: solver-free learning of constraints and objectives

This page was built for publication: Graphical Models: Queries, Complexity, Algorithms

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