Loading...
Loading...

Go to the content (press return)

Limited discrepancy AND/OR search and its application to optimization tasks in graphical models

Author
Larrosa, J.; Rollon, E.; Dechter, R.
Type of activity
Presentation of work at congresses
Name of edition
25th International Joint Conference on Artificial Intelligence
Date of publication
2016
Presentation's date
2016-07-15
Book of congress proceedings
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence: New York, New York, USA, 9–15 July 2016
First page
617
Last page
623
Publisher
AAAI Press (Association for the Advancement of Artificial Intelligence)
Project funding
Logic-Based Smart Solutions
Repository
http://hdl.handle.net/2117/97596 Open in new window
URL
http://www.ijcai.org/Proceedings/2016 Open in new window
Abstract
Many combinatorial problems are solved with a Depth-First search (DFS) guided by a heuristic and it is well-known that this method is very fragile with respect to heuristic mistakes. One standard way to make DFS more robust is to search by increasing number of discrepancies. This approach has been found useful in several domains where the search structure is a height-bounded OR tree. In this paper we investigate the generalization of discrepancy-based search to AND/OR search trees and propose an...
Citation
Larrosa, J., Rollón, E., Dechter, R. Limited discrepancy AND/OR search and its application to optimization tasks in graphical models. A: International Join Conference on Artificial Intelligence. "Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence: New York, New York, USA, 9–15 July 2016". New York: AAAI Press (Association for the Advancement of Artificial Intelligence), 2016, p. 617-623.
Keywords
AND/OR search trees, Graphical models, LDS, Limited discrepancy search algorithm
Group of research
LOGPROG - Logic and Programming

Participants

Attachments