Projection, Inference, and Consistency
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 4175-4178.
Abstract
Projection can be seem as a unifying concept that underlies inference in logic and consistency maintenance in constraint programming. This perspective allows one to import projection methods into both areas, resulting in deeper insight as well as faster solution methods. We show that inference in propositional logic can be achieved by Benders decomposition, an optimization method based on projection. In constraint programming, viewing consistency maintenance as projection suggests a new but natural concept of consistency that is achieved by projection onto a subset of variables. We show how to solve this combinatorial projection problem for some global constraints frequently used in constraint programming. The resulting projections are useful when propagated through decision diagrams rather than the traditional domain store.
@inproceedings{ijcai2016p625,
title = {Projection, Inference, and Consistency},
author = {Hooker, John N.},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {4175--4178},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/625},
}
TY - CPAPER TI - Projection, Inference, and Consistency AU - Hooker, John N. T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 4175 EP - 4178 UR - https://ijcai.org/proceedings/2016/625 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
