Abstract
Platypus is a constraint-based expert system shell for diagnosis, synthesis and other recognition tasks. Next-generation expert systems will augment the rule-based approach with more powerful knowledge representations and more efficient search mechanisms. In Platypus, a object-centered knowledge representation produces explicit descriptions of the entities recognized in the task domain, their identifying parameters and the semantic constraints that exist among the entities. Constraint propagation is used to refine these descriptions dynamically during recognition, thereby limiting search. A truth maintenance subsystem supports the dependency directed backtracking of the reasoning process. Platypus is implemented as an extension to the Scheme programming language. This paper outlines some of the programming aspects of Platypus. The classic n-queens problem is used to explain the reasoning architecture and its programming language.
This research was conducted while the author was at Tektronix Laboratoires, Beaverton, Oregon, USA 97077.
Preview
Unable to display preview. Download preview PDF.
References
N. Adams & J. Rees, Object-Oriented Programming in Scheme, Proc. 1988 ACM Conf. on Lisp and Functional Programming, Snowbird, Utah, July 1988, pp.277–288.
E. Davis, Constraint Propagation with Interval Labels, Artificial Intelligence 32, 1987, pp.281–331.
J. deKleer, An Assumption-based TMS, Artificial Intelligence 28, 2, 1986, pp.127–162.
J. Doyle, A Truth Maintenance System, Artificial Intelligence 12, 1979, pp.231–272.
W. B. Gevarter, The Nature and Evaluation of Commercial Expert Systems Building Tools, IEEE Computer 20, 5, pp.24–41, May 1987.
R. M. Haralick & G. L. Elliott, Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence 14, 1980, p.263–313.
W. Havens, A Theory of Schema Labelling, Computational Intelligence 1, 4, National Research Council of Canada, Ottawa, 1985.
W.S. Havens, Platypus Programming Description, Technical Report 88-12, Computer Research Lab, Tektronix Laboratories, Beaverton, Oregon, USA, 1988.
W.S. Havens & P.S. Rehfuss, Platypus: a Constraint-Based Reasoning System, Proc. 1989 Int. Joint Conf. on Artificial Intelligence, Detroit, Mich., August, 1989.
C. Hewitt, Description and Theoretical Analysis (using Schemata) of PLANNER: a Language for Proving Theorems and Manipulating Models in a Robot, Ph.D. thesis, AI-TR-258, MIT AI Lab, Cambridge, Mass., 1972.
J. Jaffar & J-L. Lassez, Constraint Logic Programming, in POPL-87, Munich, January 1987.
A. Mackworth, J. Mulder & W. Havens, Hierarchical Arc Consistency: Exploiting Structured Domains in Constraint Satisfaction Problems, Computational Intelligence 1, 4, National Research Council of Canada, Ottawa, 1985.
A. Mackworth, Constraint Satisfaction, in S. C. Shapiro (ed.) Encyclopedia of Artificial Intelligence, vol. 1, Wiley, 1987, p.205.
J.A. Rees et al. Revised Report on the Algorithmic Language Scheme, SIGPLAN Notices 21, 12, 1986.
P. Van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, Mass., 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Havens, B. (1990). The platypus expert system shell. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018372
Download citation
DOI: https://doi.org/10.1007/BFb0018372
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52850-0
Online ISBN: 978-3-540-47168-4
eBook Packages: Springer Book Archive