Journal article icon

Journal article

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Abstract:

The Constraint Satisfaction Problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tractability in such problems, such as the property of being tree-structured. In this paper we introduce the broken-triangle property, which allows us to define a novel tractable class for this problem which significantly generalizes the class of problems with tree structure. We show that the broken-triangle property is c...

Expand abstract

Actions


Access Document


Journal:
Artificial Intelligence More from this journal
Volume:
174
Issue:
9–10
Pages:
570-584
Publication date:
2010-01-01
DOI:
UUID:
uuid:89dc33cc-b69b-4ed4-ac50-da1c29e49043
Local pid:
cs:4995
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP