Abstract
This article explains how we have used WebKB1 - our Web-accessible and Conceptual Graph (CG) based knowledge acquisition and annotation tool - to provide a solution and an interface2 to solve the Sisyphus-I office allocation problem3, a problem intended to enable the comparison of knowledge acquisition tools.
We have exploited the WebKB CG assertion/query commands and script language to provide two procedural solutions to the problem. One is recursive and handles backtracking. We peresent the other which is simple and direct. The script, the data set and the ontology (i.e. structured set of types) may be stored in different Web-accessible documents, the URLs of which may be sent via a simple interface to the WebKB processor (a CGI server4) in order to solve the problem. Users may also provide their own files to test their solutions or use their own data sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, P., Eklund, P. (1999). WebKB and the Sisyphus-I Problem. In: Tepfenhart, W.M., Cyre, W. (eds) Conceptual Structures: Standards and Practices. ICCS 1999. Lecture Notes in Computer Science(), vol 1640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48659-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-48659-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66223-5
Online ISBN: 978-3-540-48659-6
eBook Packages: Springer Book Archive