Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
On the Violation of Circuits in Decomposable Negation Normal Form
verfasst von : Lucas Bordeaux, Nina Narodytska
Erschienen in: AI 2012: Advances in Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Local Search approaches to constraint satisfaction are based on the ability to compute
violation
scores. These estimate ’how far’ a given assignment is from satisfying the constraints, and aim at guiding the search towards assignments whose violation will, ultimately, be null. We study the computation of violation functions for Boolean predicates encoded in
Decomposable Negation Normal Form
, an important class of logical circuits that encode interesting constraints. We show that for these circuits an elegant and efficient violation function first proposed by Z. Stachniak is ”ideal” in a certain sense. We discuss more broadly the notion of ”ideal” violation and discuss the implications of this result.