Using constraints with memory to implement variable elimination

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 216-220

  Śanchez, Marti ^a   Meseguer, Pedro ^a   Larrosa, Javier ^b  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE CONSISTENCY; ALL SOLUTIONS; CONSTRAINT NETWORKS; EQUIVALENT NETWORK; EXPERIMENTAL EVIDENCE; SOLVING ALGORITHM; VARIABLE ELIMINATION;

EID: 85017386413     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (7)

1. U. Bertele and F. Brioschi, Nonserial Dynamic Programming, Academic Press, 1972.
2. R. Dechter, Bucket elimination: A unifying framework for reasoning, Artifical Intelligence, 113, 41-85, (1999).
3. R. Dechter and J. Pearl, Network-based heuristics for constraint satisfaction problems, Artifical Intelligence, 34, 1-38, (1987).
4. G. Gottlob, N. Leone, and F. Scarcello, A comparison of structural csp decomposition methods, Artificial Intelligence, 124(2), 243-282, (2000).
5. J. Larrosa and E. Morancho, Solving still life with soft constraints and variable elimination, in Proc. CP-2003, pp. 466-479, (2003).
6. J. Pearl, Probabilistic Inference in Intelligent Systems. Networks of Plausible Inference, Morgan Kaufmann, San Mateo, CA, 1988.
7. T. Walsh, Sat v csp, in Proc. CP-2000, pp. 441-456, (2000).