Computer Science and Engineering, Department of
Date of this Version
2011
Abstract
•Introduction
•R(*,m)C Property & Algorithm
•Exploit Tree Decomposition to
–Avoid useless update & reduce propagation effort
↪ Update queue: PROCESSQ ⟿ PROCESSMQ
↪ The two algorithms yield the same filtering
–Synthesize & add new constraints to improve propagation
↪ Property enforced: R(*,m)C ⟿ T-R(*,m,z)C
↪ The same algorithm yields stronger filtering
•Experimental Results
•Conclusion
Comments
Karakashian, Woodward & Choueiry in Ninth International Symposium on Abstraction, Reformulation and Approximation (SARA) 2011. Pages 62-69. Copyright 2011, AAAI Press. Used by permission.