Skip to main content
Journal Article

Maintaining dominance consistency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2833 945-949
DOI: 10.1007/978-3-540-45193-8_84
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new type of local consistency is presented. The local consistency is based on pruning "by analogy" and can be associated with symmetry breaking via dominance detection and interchangeability methods. We present an algorithm for achieving the local consistency and show how it can be combined with forward checking. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Razgon, I., & Meisels, A. (2003). Maintaining dominance consistency. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 945–949. https://doi.org/10.1007/978-3-540-45193-8_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free