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 Ex-trAKTor work presented at EKAW 2006. ExtrAKTor takes a Protégé 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 Protégé ontologies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. R. Apt and M. G. Wallace. Constraint Logic Programming using ECLiPSe. Cambridge University Press, 2007.
T. Le Provost and M. Wallace. Generalised Constraint Propagation Over the CLP Scheme. JPL, 16:319–359, 1991.
S. Marcus, J. Stout, and J. McDermott. VT: An Expert Designer That Uses Knowledge-Based Backtracking. AI Magazine, pages 95–111, 1988.
T. Menzies. Evaluation Issues for Problem Solving Methods. In KAW98, 1998.
E. Motta, K. O’Hara, N. Shadbolt, A. Stutt, and Z. Zdrahal. Solving VT in VITAL: a study in model construction and knowledge reuse. IJHCS, 44(3/4):333–371, 1996.
T. E. Rothenfluh, J. H. Gennari, H. Eriksson, A. R. Puerta, S. W. Tu, and M. A. Musen. Reusable ontologies, knowledge-acquisition tools, and performance systems: PROTÉGÉ-II solutions to Sisyphus-2. IJHCS, 44(3/4):303–332, 1996.
D. Sleeman, T. Runcie, and P. M. D. Gray. Reuse: Revisiting Sisyphus-VT. In Lecture Notes in Computer Science, pages 59–66, Podebrady, 2006. Springer.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.
Kit ying Hui and Peter M. D. Gray. Developing finite domain constraints — a data model approach. In CL’ 00: Proceedings of the First International Conference on Computational Logic, pages 448–462, London, UK, 2000. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this paper
Cite this paper
Runcie, T., Gray, P., Sleeman, D. (2009). Constraint Satisfaction and Fixes: Revisiting Sisyphus VT. In: Bramer, M., Petridis, M., Coenen, F. (eds) Research and Development in Intelligent Systems XXV. SGAI 2008. Springer, London. https://doi.org/10.1007/978-1-84882-171-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-84882-171-2_8
Publisher Name: Springer, London
Print ISBN: 978-1-84882-170-5
Online ISBN: 978-1-84882-171-2
eBook Packages: Computer ScienceComputer Science (R0)