Constraint satisfaction and fixes

revisiting Sisyphus VT

Trevor Runcie, Peter Gray, Derek Sleeman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper explores the solution of the VT Sisyphus II challenge using a Constraint Satisfaction Problem (CSP) paradigm and is an extension of the ExtrAKTor work presented at EKAW 2006. ExtrAKTor takes a Protege KB describing a propose and-revise (PnR) problem, including both constraints & fixes. Subsequently, it extracts and transforms these components so that they are directly usable by the ECLiPSe CSP toolkit to solve a range of configuration tasks. It was encouraging to note that (a) the solver coped very well with constraints involving real variables even when using a generalised propagation technique and (b) the techniques needed no "fix"' information, yet successfully dealt with the "antagonistic constraints" and the associated "thrashing" problem that had been a key issue in the original Marcus, Stout & McDermott VT paper. Consequently, we believe this is a widely useable technique for automatically generating and then solving this class of constraint problems, when they are expressed as Protege ontologies.

Original languageEnglish
Title of host publicationResearch and development in intelligent systems XXV
Subtitle of host publicationProceedings of AI-2008, The Twenty-eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence
EditorsFrans Coenen, Miltos Petridis
Place of PublicationGodalming
PublisherSpringer-Verlag
Pages105-118
Number of pages14
ISBN (Print)978-1-84882-170-5
Publication statusPublished - 2009

Cite this

Runcie, T., Gray, P., & Sleeman, D. (2009). Constraint satisfaction and fixes: revisiting Sisyphus VT. In F. Coenen, & M. Petridis (Eds.), Research and development in intelligent systems XXV: Proceedings of AI-2008, The Twenty-eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (pp. 105-118). Godalming: Springer-Verlag.

Constraint satisfaction and fixes : revisiting Sisyphus VT. / Runcie, Trevor; Gray, Peter; Sleeman, Derek.

Research and development in intelligent systems XXV: Proceedings of AI-2008, The Twenty-eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence. ed. / Frans Coenen; Miltos Petridis. Godalming : Springer-Verlag, 2009. p. 105-118.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Runcie, T, Gray, P & Sleeman, D 2009, Constraint satisfaction and fixes: revisiting Sisyphus VT. in F Coenen & M Petridis (eds), Research and development in intelligent systems XXV: Proceedings of AI-2008, The Twenty-eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence. Springer-Verlag, Godalming, pp. 105-118.
Runcie T, Gray P, Sleeman D. Constraint satisfaction and fixes: revisiting Sisyphus VT. In Coenen F, Petridis M, editors, Research and development in intelligent systems XXV: Proceedings of AI-2008, The Twenty-eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence. Godalming: Springer-Verlag. 2009. p. 105-118
Runcie, Trevor ; Gray, Peter ; Sleeman, Derek. / Constraint satisfaction and fixes : revisiting Sisyphus VT. Research and development in intelligent systems XXV: Proceedings of AI-2008, The Twenty-eighth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence. editor / Frans Coenen ; Miltos Petridis. Godalming : Springer-Verlag, 2009. pp. 105-118
@inproceedings{1ae66ec01a72415684e977e9433a4984,
title = "Constraint satisfaction and fixes: revisiting Sisyphus VT",
abstract = "This paper explores the solution of the VT Sisyphus II challenge using a Constraint Satisfaction Problem (CSP) paradigm and is an extension of the ExtrAKTor work presented at EKAW 2006. ExtrAKTor takes a Protege KB describing a propose and-revise (PnR) problem, including both constraints & fixes. Subsequently, it extracts and transforms these components so that they are directly usable by the ECLiPSe CSP toolkit to solve a range of configuration tasks. It was encouraging to note that (a) the solver coped very well with constraints involving real variables even when using a generalised propagation technique and (b) the techniques needed no {"}fix{"}' information, yet successfully dealt with the {"}antagonistic constraints{"} and the associated {"}thrashing{"} problem that had been a key issue in the original Marcus, Stout & McDermott VT paper. Consequently, we believe this is a widely useable technique for automatically generating and then solving this class of constraint problems, when they are expressed as Protege ontologies.",
author = "Trevor Runcie and Peter Gray and Derek Sleeman",
year = "2009",
language = "English",
isbn = "978-1-84882-170-5",
pages = "105--118",
editor = "Frans Coenen and Miltos Petridis",
booktitle = "Research and development in intelligent systems XXV",
publisher = "Springer-Verlag",

}

TY - GEN

T1 - Constraint satisfaction and fixes

T2 - revisiting Sisyphus VT

AU - Runcie, Trevor

AU - Gray, Peter

AU - Sleeman, Derek

PY - 2009

Y1 - 2009

N2 - This paper explores the solution of the VT Sisyphus II challenge using a Constraint Satisfaction Problem (CSP) paradigm and is an extension of the ExtrAKTor work presented at EKAW 2006. ExtrAKTor takes a Protege KB describing a propose and-revise (PnR) problem, including both constraints & fixes. Subsequently, it extracts and transforms these components so that they are directly usable by the ECLiPSe CSP toolkit to solve a range of configuration tasks. It was encouraging to note that (a) the solver coped very well with constraints involving real variables even when using a generalised propagation technique and (b) the techniques needed no "fix"' information, yet successfully dealt with the "antagonistic constraints" and the associated "thrashing" problem that had been a key issue in the original Marcus, Stout & McDermott VT paper. Consequently, we believe this is a widely useable technique for automatically generating and then solving this class of constraint problems, when they are expressed as Protege ontologies.

AB - This paper explores the solution of the VT Sisyphus II challenge using a Constraint Satisfaction Problem (CSP) paradigm and is an extension of the ExtrAKTor work presented at EKAW 2006. ExtrAKTor takes a Protege KB describing a propose and-revise (PnR) problem, including both constraints & fixes. Subsequently, it extracts and transforms these components so that they are directly usable by the ECLiPSe CSP toolkit to solve a range of configuration tasks. It was encouraging to note that (a) the solver coped very well with constraints involving real variables even when using a generalised propagation technique and (b) the techniques needed no "fix"' information, yet successfully dealt with the "antagonistic constraints" and the associated "thrashing" problem that had been a key issue in the original Marcus, Stout & McDermott VT paper. Consequently, we believe this is a widely useable technique for automatically generating and then solving this class of constraint problems, when they are expressed as Protege ontologies.

M3 - Conference contribution

SN - 978-1-84882-170-5

SP - 105

EP - 118

BT - Research and development in intelligent systems XXV

A2 - Coenen, Frans

A2 - Petridis, Miltos

PB - Springer-Verlag

CY - Godalming

ER -