Practical Investigation of Constraints with Graph Views
Identifieur interne : 002993 ( Main/Exploration ); précédent : 002992; suivant : 002994Practical Investigation of Constraints with Graph Views
Auteurs : Tobias Müller [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2000.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
Abstract: Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment.
Url:
DOI: 10.1007/3-540-45349-0_24
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000357
- to stream Istex, to step Curation: 000278
- to stream Istex, to step Checkpoint: 002224
- to stream Main, to step Merge: 002A61
- to stream PascalFrancis, to step Corpus: 000231
- to stream PascalFrancis, to step Curation: 000008
- to stream PascalFrancis, to step Checkpoint: 000136
- to stream Main, to step Merge: 002B60
- to stream Main, to step Curation: 002993
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Practical Investigation of Constraints with Graph Views</title><author><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1BC3CB2E693D400121EE34B63090B2EBE17D8044</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1007/3-540-45349-0_24</idno><idno type="url">https://api.istex.fr/document/1BC3CB2E693D400121EE34B63090B2EBE17D8044/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000357</idno><idno type="wicri:Area/Istex/Curation">000278</idno><idno type="wicri:Area/Istex/Checkpoint">002224</idno><idno type="wicri:doubleKey">0302-9743:2000:Muller T:practical:investigation:of</idno><idno type="wicri:Area/Main/Merge">002A61</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:01-0040926</idno><idno type="wicri:Area/PascalFrancis/Corpus">000231</idno><idno type="wicri:Area/PascalFrancis/Curation">000008</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000136</idno><idno type="wicri:doubleKey">0302-9743:2000:Muller T:practical:investigation:of</idno><idno type="wicri:Area/Main/Merge">002B60</idno><idno type="wicri:Area/Main/Curation">002993</idno><idno type="wicri:Area/Main/Exploration">002993</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Practical Investigation of Constraints with Graph Views</title><author><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50, D-66041, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2000</date></imprint><idno type="ISSN">0302-9743</idno></series><idno type="istex">1BC3CB2E693D400121EE34B63090B2EBE17D8044</idno><idno type="DOI">10.1007/3-540-45349-0_24</idno><idno type="ChapterID">Chap24</idno><idno type="ChapterID">24</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Combinatorial optimization</term><term>Constraint satisfaction</term><term>Debugging</term><term>Tree(graph)</term><term>Visualization</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Arbre graphe</term><term>Débogage</term><term>Optimisation combinatoire</term><term>Satisfaction contrainte</term><term>Visualisation</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name></region><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002993 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002993 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:1BC3CB2E693D400121EE34B63090B2EBE17D8044
|texte= Practical Investigation of Constraints with Graph Views
}}
| This area was generated with Dilib version V0.6.20. |  |