Model selection and testing for an automated constraint modelling toolchain
Saved in:
| Title: | Model selection and testing for an automated constraint modelling toolchain |
|---|---|
| Authors: | Hussain, Bilal Syed |
| Committee Members: | Miguel, Ian |
| Summary: | Constraint Programming (CP) is a powerful technique for solving a variety of combinatorial problems. Automated modelling using a refinement based approach abstracts over modelling decisions in CP by allowing users to specify their problem in a high level specification language such as ESSENCE. This refinement process produces many models resulting from different choices that can be selected, each with their own strengths. A parameterised specification represents a problem class where the parameters of the class define the instance of the class we wish to solve. Since each model has different performance characteristics the model chosen is crucial to be able to solve the instance effectively. This thesis presents a method to generate instances automatically for the purpose of choosing a subset of the available models that have superior performance across the instance space. The second contribution of this thesis is a framework to automate the testing of a toolchain for automated modelling. This process includes a generator of test cases that covers all aspects of the ESSENCE specification language. This process utilises our first contribution namely instance generation to generate parameterised specifications. This framework can detect errors such as inconsistencies in the model produced during the refinement process. Once we have identified a specification that causes an error, this thesis presents our third contribution; a method for reducing the specification to a much simpler form, which still exhibits a similar error. Additionally this process can generate a set of complementary specifications including specifications that do not cause the error to help pinpoint the root cause. |
| URL: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.703481 |
| Database: | OpenDissertations |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: ddu DbLabel: OpenDissertations An: ddu.oai.ethos.bl.uk.703481 AccessLevel: 6 PubType: Dissertation/ Thesis PubTypeId: dissertation PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Model selection and testing for an automated constraint modelling toolchain – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Hussain%2C+Bilal+Syed%22">Hussain, Bilal Syed</searchLink> – Name: Author Label: Committee Members Group: Au Data: <searchLink fieldCode="CO" term="%22Miguel%2C+Ian%22">Miguel, Ian</searchLink> – Name: Abstract Label: Summary Group: Ab Data: Constraint Programming (CP) is a powerful technique for solving a variety of combinatorial problems. Automated modelling using a refinement based approach abstracts over modelling decisions in CP by allowing users to specify their problem in a high level specification language such as ESSENCE. This refinement process produces many models resulting from different choices that can be selected, each with their own strengths. A parameterised specification represents a problem class where the parameters of the class define the instance of the class we wish to solve. Since each model has different performance characteristics the model chosen is crucial to be able to solve the instance effectively. This thesis presents a method to generate instances automatically for the purpose of choosing a subset of the available models that have superior performance across the instance space. The second contribution of this thesis is a framework to automate the testing of a toolchain for automated modelling. This process includes a generator of test cases that covers all aspects of the ESSENCE specification language. This process utilises our first contribution namely instance generation to generate parameterised specifications. This framework can detect errors such as inconsistencies in the model produced during the refinement process. Once we have identified a specification that causes an error, this thesis presents our third contribution; a method for reducing the specification to a much simpler form, which still exhibits a similar error. Additionally this process can generate a set of complementary specifications including specifications that do not cause the error to help pinpoint the root cause. – Name: URL Label: URL Group: URL Data: <link linkTarget="URL" linkTerm="http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.703481" linkWindow="_blank">http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.703481</link> |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=ddu&AN=ddu.oai.ethos.bl.uk.703481 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English Subjects: – SubjectFull: 005.1 Type: general – SubjectFull: Constraint programming ; Constraint modelling ; Instance generation ; Model selection ; Automated testing ; QA276..612H8 ; Computer programs--Testing Type: general Titles: – TitleFull: Model selection and testing for an automated constraint modelling toolchain Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Hussain, Bilal Syed IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2017 |
| ResultId | 1 |
