• Sorted by Date • Classified by Publication Type • Sorted by First Author Last Name • Classified by Author Last Name •
L. Chang and Alan K. Mackworth. Constraint-Based Inference Using Local Consistency in Junction Graphs. In Proceedings of the ECAI 2006 Workshop on Inference Methods Based on Graphical Structures of Knowledge, WIGSK 2006, pp. 1–6, Riva del Garda, Italy, August 2006.
The concept of local consistency plays a central role in constraint satisfaction and has been extended to handle general constraint-based inference (CBI) problems. We propose a family of novel generalized local consistency concepts for the junction graph representation of CBI problems. These concepts are based on a general condition that depends only on the existence and property of the multiplicative absorbing element and does not depend on the other semiring properties of CBI problems.We present several local consistency enforcing algorithms and their approximation variants. Theoretical complexity analyses and empirical experimental results for the application of these algorithms to both MaxCSP and probability inference are given. We also discuss the relationship between these local consistency concepts and message passing schemes such as junction tree algorithms and loopy message propagation.
@InProceedings{ECAI06,
author = {L. Chang and Alan K. Mackworth},
title = {Constraint-Based Inference Using Local Consistency in Junction Graphs},
year = {2006},
month = {August},
booktitle = {Proceedings of the ECAI 2006 Workshop on Inference Methods Based on Graphical Structures of Knowledge, WIGSK 2006},
address = {Riva del Garda, Italy},
pages = {1--6},
abstract = {The concept of local consistency plays a central role in constraint
satisfaction and has been extended to handle general constraint-based
inference (CBI) problems. We propose a family of novel generalized
local consistency concepts for the junction graph representation of
CBI problems. These concepts are based on a general condition that
depends only on the existence and property of the multiplicative absorbing
element and does not depend on the other semiring properties
of CBI problems.We present several local consistency enforcing
algorithms and their approximation variants. Theoretical complexity
analyses and empirical experimental results for the application
of these algorithms to both MaxCSP and probability inference are
given. We also discuss the relationship between these local consistency
concepts and message passing schemes such as junction tree
algorithms and loopy message propagation.},
bib2html_pubtype ={Refereed Conference Proceeding},
bib2html_rescat ={},
}
Generated by bib2html.pl (written by Patrick Riley ) on Wed Apr 23, 2014 19:08:34