ML Anthology

Making Simple Tabular ReductionWorks on Negative Table Constraints

Hongbo Li, Yanchun Liang, Jinsong Guo, Zhanshan Li
AAAI 2013 pp. 1629-1630
doi:10.1609/AAAI.V27I1.8519 /aaai/2013/li2013aaai-making/

Abstract

Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In this work, we propose a novel STR algorithm and its improvement, which work on negative table constraints. Our preliminary experiments are performed on some random instances and a certain benchmark instances. The results show that the new algorithms outperform GAC-valid and the MDD-based GAC algorithm.

PDF AAAI Semantic Scholar

Cite

Text

Li et al. "Making Simple Tabular ReductionWorks on Negative Table Constraints." AAAI Conference on Artificial Intelligence, 2013. doi:10.1609/AAAI.V27I1.8519

Markdown

[Li et al. "Making Simple Tabular ReductionWorks on Negative Table Constraints." AAAI Conference on Artificial Intelligence, 2013.](https://mlanthology.org/aaai/2013/li2013aaai-making/) doi:10.1609/AAAI.V27I1.8519

BibTeX

@inproceedings{li2013aaai-making,
  title     = {{Making Simple Tabular ReductionWorks on Negative Table Constraints}},
  author    = {Li, Hongbo and Liang, Yanchun and Guo, Jinsong and Li, Zhanshan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {1629-1630},
  doi       = {10.1609/AAAI.V27I1.8519},
  url       = {https://mlanthology.org/aaai/2013/li2013aaai-making/}
}