Temporal, spatial, and constraint handling in the Conceptual Programming environment, CP
- 1 April 1992
- journal article
- research article
- Published by Taylor & Francis in Journal of Experimental & Theoretical Artificial Intelligence
- Vol. 4 (2) , 167-182
- https://doi.org/10.1080/09528139208953745
Abstract
The Conceptual Programming environment, CP, being developed at New Mexico State University (NMSU), is a complete knowledge representation programming environment for use with both dynamic, open-world, problem solving (weak) applications and static, closed-world, scientific analysis (strong) applications. CP is based upon a graphical methodology of visualization derived from John Sowa's conceptual graph theory. In this paper, we describe the formal basis for the internal CP representation and explain the mechanisms for the operators relating to the processing of time, space and constraints within the CP environment. The CP environment is a ‘working’ representation system, and makes a good foundation for suitable applicationsKeywords
This publication has 4 references indexed in Scilit:
- Knowledge representation and control in “gm1”, an automated DNA sequence analysis system based on the MGR architectureInternational Journal of Man-Machine Studies, 1991
- Temporal data base managementArtificial Intelligence, 1987
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969