IJCAI 2020poster0 citations
Variable Elimination in Binary CSPs (Extended Abstract)
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
Abstract
We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. We propose new rules and compare them, both theoretically and experimentally. We give optimised algorithms to apply these rules and show that each defines a novel tractable class. Using our variable-elimination rules in preprocessing allowed us to solve more benchmark problems than without.
Constraints and SAT: Constraint Satisfaction
BibTeX
@inproceedings{ijcai2020p702,
title = {Variable Elimination in Binary CSPs (Extended Abstract)},
author = {Cooper, Martin C. and El Mouelhi, Achref and Terrioux, Cyril},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-20}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Christian Bessiere},
pages = {5035--5039},
year = {2020},
month = {7},
note = {Journal track},
doi = {10.24963/ijcai.2020/702},
url = {https://doi.org/10.24963/ijcai.2020/702},
}