Variable Elimination in Binary CSPs

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux

JAIR 2019 pp. 589-624

doi:10.1613/JAIR.1.11295 /jair/2019/cooper2019jair-variable/

Abstract

We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability. We study variable-elimination rules based on the language of forbidden patterns enriched with counting and quantification over variables and values. We propose new rules and compare them, both theoretically and experimentally. We give optimised algorithms to apply these rules and show that each define a novel tractable class. Using our variable-elimination rules in preprocessing allowed us to solve more benchmark problems than without.

PDF JAIR Semantic Scholar

Cite

Text

Cooper et al. "Variable Elimination in Binary CSPs." Journal of Artificial Intelligence Research, 2019. doi:10.1613/JAIR.1.11295

Markdown

[Cooper et al. "Variable Elimination in Binary CSPs." Journal of Artificial Intelligence Research, 2019.](https://mlanthology.org/jair/2019/cooper2019jair-variable/) doi:10.1613/JAIR.1.11295

BibTeX

@article{cooper2019jair-variable,
  title     = {{Variable Elimination in Binary CSPs}},
  author    = {Cooper, Martin C. and El Mouelhi, Achref and Terrioux, Cyril},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2019},
  pages     = {589-624},
  doi       = {10.1613/JAIR.1.11295},
  volume    = {66},
  url       = {https://mlanthology.org/jair/2019/cooper2019jair-variable/}
}