Dynamic constraint satisfaction problems over models
Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Horváth, Ákos [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
Constraint satisfaction programming |
|---|
| Anmerkung: |
© Springer-Verlag 2010 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Software and systems modeling - Springer-Verlag, 2002, 11(2011), 3 vom: 01. Jan., Seite 385-408 |
|---|---|
| Übergeordnetes Werk: |
volume:11 ; year:2011 ; number:3 ; day:01 ; month:01 ; pages:385-408 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10270-010-0185-5 |
|---|
| Katalog-ID: |
OLC2044244160 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2044244160 | ||
| 003 | DE-627 | ||
| 005 | 20230502181501.0 | ||
| 007 | tu | ||
| 008 | 200820s2011 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10270-010-0185-5 |2 doi | |
| 035 | |a (DE-627)OLC2044244160 | ||
| 035 | |a (DE-He213)s10270-010-0185-5-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 54.50$jProgrammierung: Allgemeines |2 bkl | ||
| 100 | 1 | |a Horváth, Ákos |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Dynamic constraint satisfaction problems over models |
| 264 | 1 | |c 2011 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag 2010 | ||
| 520 | |a Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. | ||
| 650 | 4 | |a Constraint satisfaction programming | |
| 650 | 4 | |a Graph transformation | |
| 650 | 4 | |a Dynamic constraint satisfaction programming | |
| 650 | 4 | |a Flexible constraint satisfaction problem | |
| 700 | 1 | |a Varró, Dániel |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Software and systems modeling |d Springer-Verlag, 2002 |g 11(2011), 3 vom: 01. Jan., Seite 385-408 |w (DE-627)356568156 |w (DE-600)2092265-6 |w (DE-576)10203768X |x 1619-1366 |7 nnns |
| 773 | 1 | 8 | |g volume:11 |g year:2011 |g number:3 |g day:01 |g month:01 |g pages:385-408 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10270-010-0185-5 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4046 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4325 | ||
| 936 | b | k | |a 54.50$jProgrammierung: Allgemeines |q VZ |0 181569876 |0 (DE-625)181569876 |
| 951 | |a AR | ||
| 952 | |d 11 |j 2011 |e 3 |b 01 |c 01 |h 385-408 | ||
| author_variant |
á h áh d v dv |
|---|---|
| matchkey_str |
article:16191366:2011----::yaicntanstsatopo |
| hierarchy_sort_str |
2011 |
| bklnumber |
54.50$jProgrammierung: Allgemeines |
| publishDate |
2011 |
| allfields |
10.1007/s10270-010-0185-5 doi (DE-627)OLC2044244160 (DE-He213)s10270-010-0185-5-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 54.50$jProgrammierung: Allgemeines bkl Horváth, Ákos verfasserin aut Dynamic constraint satisfaction problems over models 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. Constraint satisfaction programming Graph transformation Dynamic constraint satisfaction programming Flexible constraint satisfaction problem Varró, Dániel aut Enthalten in Software and systems modeling Springer-Verlag, 2002 11(2011), 3 vom: 01. Jan., Seite 385-408 (DE-627)356568156 (DE-600)2092265-6 (DE-576)10203768X 1619-1366 nnns volume:11 year:2011 number:3 day:01 month:01 pages:385-408 https://doi.org/10.1007/s10270-010-0185-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4277 GBV_ILN_4325 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 AR 11 2011 3 01 01 385-408 |
| spelling |
10.1007/s10270-010-0185-5 doi (DE-627)OLC2044244160 (DE-He213)s10270-010-0185-5-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 54.50$jProgrammierung: Allgemeines bkl Horváth, Ákos verfasserin aut Dynamic constraint satisfaction problems over models 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. Constraint satisfaction programming Graph transformation Dynamic constraint satisfaction programming Flexible constraint satisfaction problem Varró, Dániel aut Enthalten in Software and systems modeling Springer-Verlag, 2002 11(2011), 3 vom: 01. Jan., Seite 385-408 (DE-627)356568156 (DE-600)2092265-6 (DE-576)10203768X 1619-1366 nnns volume:11 year:2011 number:3 day:01 month:01 pages:385-408 https://doi.org/10.1007/s10270-010-0185-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4277 GBV_ILN_4325 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 AR 11 2011 3 01 01 385-408 |
| allfields_unstemmed |
10.1007/s10270-010-0185-5 doi (DE-627)OLC2044244160 (DE-He213)s10270-010-0185-5-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 54.50$jProgrammierung: Allgemeines bkl Horváth, Ákos verfasserin aut Dynamic constraint satisfaction problems over models 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. Constraint satisfaction programming Graph transformation Dynamic constraint satisfaction programming Flexible constraint satisfaction problem Varró, Dániel aut Enthalten in Software and systems modeling Springer-Verlag, 2002 11(2011), 3 vom: 01. Jan., Seite 385-408 (DE-627)356568156 (DE-600)2092265-6 (DE-576)10203768X 1619-1366 nnns volume:11 year:2011 number:3 day:01 month:01 pages:385-408 https://doi.org/10.1007/s10270-010-0185-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4277 GBV_ILN_4325 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 AR 11 2011 3 01 01 385-408 |
| allfieldsGer |
10.1007/s10270-010-0185-5 doi (DE-627)OLC2044244160 (DE-He213)s10270-010-0185-5-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 54.50$jProgrammierung: Allgemeines bkl Horváth, Ákos verfasserin aut Dynamic constraint satisfaction problems over models 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. Constraint satisfaction programming Graph transformation Dynamic constraint satisfaction programming Flexible constraint satisfaction problem Varró, Dániel aut Enthalten in Software and systems modeling Springer-Verlag, 2002 11(2011), 3 vom: 01. Jan., Seite 385-408 (DE-627)356568156 (DE-600)2092265-6 (DE-576)10203768X 1619-1366 nnns volume:11 year:2011 number:3 day:01 month:01 pages:385-408 https://doi.org/10.1007/s10270-010-0185-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4277 GBV_ILN_4325 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 AR 11 2011 3 01 01 385-408 |
| allfieldsSound |
10.1007/s10270-010-0185-5 doi (DE-627)OLC2044244160 (DE-He213)s10270-010-0185-5-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 54.50$jProgrammierung: Allgemeines bkl Horváth, Ákos verfasserin aut Dynamic constraint satisfaction problems over models 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. Constraint satisfaction programming Graph transformation Dynamic constraint satisfaction programming Flexible constraint satisfaction problem Varró, Dániel aut Enthalten in Software and systems modeling Springer-Verlag, 2002 11(2011), 3 vom: 01. Jan., Seite 385-408 (DE-627)356568156 (DE-600)2092265-6 (DE-576)10203768X 1619-1366 nnns volume:11 year:2011 number:3 day:01 month:01 pages:385-408 https://doi.org/10.1007/s10270-010-0185-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4277 GBV_ILN_4325 54.50$jProgrammierung: Allgemeines VZ 181569876 (DE-625)181569876 AR 11 2011 3 01 01 385-408 |
| language |
English |
| source |
Enthalten in Software and systems modeling 11(2011), 3 vom: 01. Jan., Seite 385-408 volume:11 year:2011 number:3 day:01 month:01 pages:385-408 |
| sourceStr |
Enthalten in Software and systems modeling 11(2011), 3 vom: 01. Jan., Seite 385-408 volume:11 year:2011 number:3 day:01 month:01 pages:385-408 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Constraint satisfaction programming Graph transformation Dynamic constraint satisfaction programming Flexible constraint satisfaction problem |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Software and systems modeling |
| authorswithroles_txt_mv |
Horváth, Ákos @@aut@@ Varró, Dániel @@aut@@ |
| publishDateDaySort_date |
2011-01-01T00:00:00Z |
| hierarchy_top_id |
356568156 |
| dewey-sort |
14 |
| id |
OLC2044244160 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2044244160</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502181501.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10270-010-0185-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2044244160</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10270-010-0185-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Horváth, Ákos</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dynamic constraint satisfaction problems over models</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint satisfaction programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph transformation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic constraint satisfaction programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Flexible constraint satisfaction problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Varró, Dániel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Software and systems modeling</subfield><subfield code="d">Springer-Verlag, 2002</subfield><subfield code="g">11(2011), 3 vom: 01. Jan., Seite 385-408</subfield><subfield code="w">(DE-627)356568156</subfield><subfield code="w">(DE-600)2092265-6</subfield><subfield code="w">(DE-576)10203768X</subfield><subfield code="x">1619-1366</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:3</subfield><subfield code="g">day:01</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:385-408</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10270-010-0185-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="q">VZ</subfield><subfield code="0">181569876</subfield><subfield code="0">(DE-625)181569876</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2011</subfield><subfield code="e">3</subfield><subfield code="b">01</subfield><subfield code="c">01</subfield><subfield code="h">385-408</subfield></datafield></record></collection>
|
| author |
Horváth, Ákos |
| spellingShingle |
Horváth, Ákos ddc 004 bkl 54.50$jProgrammierung: Allgemeines misc Constraint satisfaction programming misc Graph transformation misc Dynamic constraint satisfaction programming misc Flexible constraint satisfaction problem Dynamic constraint satisfaction problems over models |
| authorStr |
Horváth, Ákos |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)356568156 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1619-1366 |
| topic_title |
004 VZ 54.50$jProgrammierung: Allgemeines bkl Dynamic constraint satisfaction problems over models Constraint satisfaction programming Graph transformation Dynamic constraint satisfaction programming Flexible constraint satisfaction problem |
| topic |
ddc 004 bkl 54.50$jProgrammierung: Allgemeines misc Constraint satisfaction programming misc Graph transformation misc Dynamic constraint satisfaction programming misc Flexible constraint satisfaction problem |
| topic_unstemmed |
ddc 004 bkl 54.50$jProgrammierung: Allgemeines misc Constraint satisfaction programming misc Graph transformation misc Dynamic constraint satisfaction programming misc Flexible constraint satisfaction problem |
| topic_browse |
ddc 004 bkl 54.50$jProgrammierung: Allgemeines misc Constraint satisfaction programming misc Graph transformation misc Dynamic constraint satisfaction programming misc Flexible constraint satisfaction problem |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Software and systems modeling |
| hierarchy_parent_id |
356568156 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Software and systems modeling |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)356568156 (DE-600)2092265-6 (DE-576)10203768X |
| title |
Dynamic constraint satisfaction problems over models |
| ctrlnum |
(DE-627)OLC2044244160 (DE-He213)s10270-010-0185-5-p |
| title_full |
Dynamic constraint satisfaction problems over models |
| author_sort |
Horváth, Ákos |
| journal |
Software and systems modeling |
| journalStr |
Software and systems modeling |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
385 |
| author_browse |
Horváth, Ákos Varró, Dániel |
| container_volume |
11 |
| class |
004 VZ 54.50$jProgrammierung: Allgemeines bkl |
| format_se |
Aufsätze |
| author-letter |
Horváth, Ákos |
| doi_str_mv |
10.1007/s10270-010-0185-5 |
| normlink |
181569876 |
| normlink_prefix_str_mv |
181569876 (DE-625)181569876 |
| dewey-full |
004 |
| title_sort |
dynamic constraint satisfaction problems over models |
| title_auth |
Dynamic constraint satisfaction problems over models |
| abstract |
Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. © Springer-Verlag 2010 |
| abstractGer |
Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. © Springer-Verlag 2010 |
| abstract_unstemmed |
Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools. © Springer-Verlag 2010 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4277 GBV_ILN_4325 |
| container_issue |
3 |
| title_short |
Dynamic constraint satisfaction problems over models |
| url |
https://doi.org/10.1007/s10270-010-0185-5 |
| remote_bool |
false |
| author2 |
Varró, Dániel |
| author2Str |
Varró, Dániel |
| ppnlink |
356568156 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10270-010-0185-5 |
| up_date |
2024-07-03T22:46:24.317Z |
| _version_ |
1803599776914079744 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2044244160</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502181501.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10270-010-0185-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2044244160</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10270-010-0185-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Horváth, Ákos</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dynamic constraint satisfaction problems over models</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework and provide an evaluation of its performance with comparison to related tools.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint satisfaction programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph transformation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic constraint satisfaction programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Flexible constraint satisfaction problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Varró, Dániel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Software and systems modeling</subfield><subfield code="d">Springer-Verlag, 2002</subfield><subfield code="g">11(2011), 3 vom: 01. Jan., Seite 385-408</subfield><subfield code="w">(DE-627)356568156</subfield><subfield code="w">(DE-600)2092265-6</subfield><subfield code="w">(DE-576)10203768X</subfield><subfield code="x">1619-1366</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:3</subfield><subfield code="g">day:01</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:385-408</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10270-010-0185-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.50$jProgrammierung: Allgemeines</subfield><subfield code="q">VZ</subfield><subfield code="0">181569876</subfield><subfield code="0">(DE-625)181569876</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2011</subfield><subfield code="e">3</subfield><subfield code="b">01</subfield><subfield code="c">01</subfield><subfield code="h">385-408</subfield></datafield></record></collection>
|
| score |
7.400342 |