Deriving explanations and implications for constraint satisfaction problems

  • Eugene C. Freuder
  • , Chavalit Likitvivatanavong
  • , Richard J. Wallace

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

We explore the problem of deriving explanations and implications for constraint satisfaction problems (CSPs). We show that consistency methods can be used to generate inferences that support both functions. Explanations take the form of trees that show the basis for assignments and deletions in terms of previous selections. These ideas are illustrated by dynamic, interactive testbeds.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2001 - 7th International Conference, CP 2001, Proceedings
EditorsToby Walsh
PublisherSpringer Verlag
Pages585-589
Number of pages5
ISBN (Print)3540428631, 9783540428633
DOIs
Publication statusPublished - 2001
Event7th International Conference on Principles and Practice of Constraint Programming, CP 2001 - Paphos, Cyprus
Duration: 26 Nov 20011 Dec 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2239
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Principles and Practice of Constraint Programming, CP 2001
Country/TerritoryCyprus
CityPaphos
Period26/11/011/12/01

Fingerprint

Dive into the research topics of 'Deriving explanations and implications for constraint satisfaction problems'. Together they form a unique fingerprint.

Cite this