DMCA
A Path-Optimal GAC Algorithm for Table Constraints (2012)
Cached
Download Links
| Venue: | 20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI'12), FRANCE |
| Citations: | 6 - 2 self |
BibTeX
@MISC{Lecoutre12apath-optimal,
author = {Christophe Lecoutre and Chavalit Likitvivatanavong and Roland H. C. Yap},
title = { A Path-Optimal GAC Algorithm for Table Constraints},
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Filtering by Generalized Arc Consistency (GAC) is a fundamental technique in Constraint Programming. Recent advances in GAC algorithms for extensional constraints rely on direct manipulation of tables during search. Simple Tabular Reduction (STR), which systematically removes invalid tuples from tables, has been shown to be a simple yet efficient approach. STR2, a refinement of STR, is considered to be among the best filtering algorithms for positive table constraints. In this paper, we introduce a new GAC algorithm called STR3 that is specifically designed to enforce GAC during search. STR3 can completely avoid unnecessary traversal of tables, making it optimal along any path of the search tree. Our experiments show that STR3 is much faster than STR2 when the average size of the tables is not reduced drastically during search.
Keyphrases
path-optimal gac algorithm table constraint gac algorithm fundamental technique search tree invalid tuples average size positive table constraint constraint programming unnecessary traversal generalized arc consistency extensional constraint recent advance simple tabular reduction new gac algorithm direct manipulation filtering algorithm efficient approach
