Conference item icon

Conference item

Hybrid tractable CSPs which generalize tree structure

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 hybrid tractable class for this problem which significantly generalizes the class of problems with tree structure. We show that the broken-triangle property is ...

Expand abstract

Actions


Authors


Publisher:
IOS Press
Volume:
178
Publication date:
2008-01-01
ISSN:
0922-6389
URN:
uuid:2cd4b8d4-420f-4b14-9efa-03a04a765e1c
Local pid:
cs:104
ISBN:
978-1-58603-891-5

Terms of use


Metrics


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