Abstract
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detailed by the problem description which together impose a partial ordering on any solution. A solution to Sisyphus-I is presented in order to illustrate pCG, a CG-oriented programming language which embodies Mineau’s (1998) state-transition based process mechanism. We consider pCG to be an experimental language and believe that feedback from the CG community would be useful at this stage of development. A non-trivial application with which the community is already familiar is an effective means by which to accomplish this. The solution involves automatic extraction of most of the information required to represent the problem from the Sisyphus-I web page, and a pCG program which produces suitable room allocations via a process. The means by which the presented solution could be further constrained to increase its robustness is briefly discussed, as is the likely future development of pCG.
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.
References
Baget, J.F., Genest, D., and Mugnier, M.L., A Pure Graph-Based Solution to the SCG-1 Initiative. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, pp. 355–376, July 1999.
Bos, C, Botella, B., and Vanheeghe, P., Modelling and Simulating Human Behaviours with Conceptual Graphs. In Proceedings of the 5 th International Conference on Conceptual Structures, Seattle, Washington, USA, pp. 275–289, August 1997.
Benn, D., Implementing Conceptual Graph Processes. Master of Computer and Information Science Minor Thesis, April 2001, University of South Australia. URL: http://www.adelaide.net.au/~dbenn/Masters/
Cyre, W., Executing Conceptual Graphs, In Proceedings of the 6 th International Conference on Conceptual Structures, Montpellier, France, pp. 51–64, August 1998.
Damianova, S. and Toutanova, K., Using Conceptual Graphs to Solve a Resource Allocation Task. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, pp. 355–376, July 1999.
Delugach, H., Dynamic Assertion and Retraction of Conceptual Graphs. In Proceedings of the 6 th Annual Workshop on Conceptual Graphs, Eileen C. Way, editor, SUNY Binghampton, New York, pp. 15–26, July 1991.
Ellis, G., Object-Oriented Conceptual Graphs. In Proceedings of the 3 rd International Conference on Conceptual Structures, Santa Cruz, CA, USA, pp. 144–157, August 1995.
Kabbaj, A., Synergy: A Conceptual Graph Activation-Based Language. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, pp. 198–213, July 1999.
Linster, M., Documentation for the Sisyphus-I Room Allocation Task, [Accessed Online: November 2000], URL: http://ksi.cpsc.ucalgary.ca/KAW/Sisvphus/Sisvphusl/
Lukose, D., Executable Conceptual Structures. In Proceedings of the I st International Conference on Conceptual Structures, Quebec City, Canada, pp. 223–237, August 1993.
Mann, G.A., A Rational Goal-Seeking Agent using Conceptual Graphs. In Proceedings of the 2 nd International Conference on Conceptual Structures, College Park, Maryland, USA, pp. 113–126, August 1994.
Martin, P. and Eklund, P., WebKB and the Sisyphus-I Problem. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, July 1999.
Mineau, G., From Actors to Processes: The Representation of Dynamic Knowledge Using Conceptual Graphs. In Proceedings of the 6 th International Conference on Conceptual Structures, Montpellier, France, pp. 65–79, August 1998.
Mineau, G., Constraints on Processes: Essential Elements for the Validation and Execution of Processes. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, pp. 66–82, July 1999.
Mineau, G., Constraints and Goals under the Conceptual Graph Formalism: One Way to Solve the SCG-1 Problem. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, pp. 334–354, July 1999.
Nenkova, A. and Angelova, G., User Modelling as an Application of Actors. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, pp. 83–89, July 1999.
Sowa, J.F., Conceptual Structures: Information Processing in Mind and Machine, Addison-Wesley, 1984.
Sowa, J.F., Knowledge Representation: Logical, Philosophical, and Computational Foundations, Brooks/Cole, 2000.
Thanitsukkarn, T. and Finkelstein, A., Multiperspective Analysis of the Sisyphus-I Room Allocation Task Modeled in a CG Meta-Representation Language. In Proceedings of the 7 th International Conference on Conceptual Structures, Blacksburg, VA, USA, July 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benn, D., Corbetr, D. (2001). An Application of the Process Mechanism to a Room Allocation Problem Using the pCG Language. In: Delugach, H.S., Stumme, G. (eds) Conceptual Structures: Broadening the Base. ICCS 2001. Lecture Notes in Computer Science(), vol 2120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44583-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-44583-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42344-7
Online ISBN: 978-3-540-44583-8
eBook Packages: Springer Book Archive