Improving the Performance of Consistency Algorithms by Localizing and Bolstering Propagation in a Tree Decomposition | Zendy

Shant Karakashian | Zendy; Robert J. Woodward | Zendy; Berthe Y. Choueiry | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Improving the Performance of Consistency Algorithms by Localizing and Bolstering Propagation in a Tree Decomposition

Author(s) -

Shant Karakashian,

Robert J. Woodward,

Berthe Y. Choueiry

Publication year - 2013

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v27i1.8594

Subject(s) - local consistency , consistency (knowledge bases) , constraint satisfaction problem , decomposition method (queueing theory) , treewidth , constraint graph , constraint (computer aided design) , decomposition , constraint satisfaction , tree decomposition , tree (set theory) , computer science , mathematical optimization , algorithm , graph , theoretical computer science , mathematics , discrete mathematics , combinatorics , artificial intelligence , pathwidth , ecology , geometry , line graph , probabilistic logic , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research