A Daemon-based programming system for office procedures.
Abstract
The paper presents a daemon-based approach to office programming systems. Daemons are “agents” users create to automate their tasks. They can be seen as user assistants which are able to recognize when their activation is required. Daemons can be exemplarly defined, by supplying them with concrete examples of what they will be asked to do, and are useful to support the individual work as well as to automate in a decentralized, “bottom-up” fashion complex office procedures. In fact, since they are independent pieces of code, they seem well suited for programming systems which are 'incrementally' developed by different users. A facility for “run-time” exception handling is also discussed.
References
[1]
Zloof, M.M and DeJong, S.P. "The System for Business Automation (SBA): Programming Language" CACM 20, 6(1977), 385-396
[2]
DeJong, S.P. "The System for Business Automation (SBA): a Unified Application Development System" Proc. of IFIP Congress 80 (1980)
[3]
Hewitt, C. "Viewing Control Structures as Patterns of Passing Messages" Artificial Intelligence Journal, Vol.8, no.3, June 1977, 323-364
[4]
Hewitt, C., Attardi, G., and Lieberman, H., "Specifying and Proving Properties of Guardians for Distributed Systems", Semantics of Concurrent Computations, Lecture Notes in Computer Science no.70, Springer-Verlag, Berlin 1979
[5]
Newell, A. and Simon, H.A. "Human Problem Solving" Prentice Hall, 1972
[6]
Tsichritzis, D. "Form Management" CACM 25, 7(1982), p.453
[7]
Attardi, M. and Simi, M. "Extending the Power of Programing by Example" Proc.SIGOA Conf. on Off. Inf.Systems, June 1982
[8]
Zisman, M.D. "Representation, Specification and Automation of Office Procedures" Ph.D Dissertation, Working Paper 77-09-04. Dep.Decision Sci., The Warthon School, Univ. of Pennsylvania, Scrancton, 1977
[9]
Zisman, M.D. "Use of Production Systems for Modeling Asynchronous, Concurrent Processes" In D.A.Waterman and F.Hayes-Roth, 'Pattern Directed Inference Systems', New York, NY:Academic Press Eds.
[10]
Hewitt, C. "Description and Theoretical Analysis (using schemata) of Planner: a Language for Proving Theorems and Manipulating Models in Robots" TR-258, MIT AI Lab., Cambridge, Massachussets, 1972
[11]
Sussman, G.J, Winograd, @@@@., and Charniak, E. "Microplanner Reference Manual", Memo 203a, MIT AI Lab., Cambridge, Massachussets, 1976
[12]
Rieger, C. "Spontaneous Computation and Its Roles in AI Modeling" In D.A.Waterman and F.Hayes-Roth, 'Pattern Directed Inference Systems', New York, NY:Academic Press Eds.
[13]
Rulifson, J.F., Derksen, J.A., and Waldinger, R.J. "QA4: a Procedural Calculus for Intuitive Reasoning", SRI, Menlo Park, California, 1972
[14]
Byrc, R.J., Smith, S.E., de Jorg, S.P. "An Actor-Based Programming System" Proc.SIGOA Conf. on Off.Inf.Systems, June 1982
[15]
Waterman, D.A. "Exemplary Programming in RITA" In D.A.Waterman and F.Hayes-Roth, 'Pattern Directed Inference Systems', New York, NY:Academic Press Eds.
[16]
Montini, G., Sirovich, F. "Access Control Models and Office Structures", Internal Report ISI-83/4
[17]
Perego, G., Lomanto, A., Sirovich, F. "A Capability Based Access Control Model for OIS" Proc. 1st Int. Conf. on Computers and Applications, Peking (China), June 20-22 1984
Index Terms
- A Daemon-based programming system for office procedures.
Recommendations
A Daemon-based programming system for office procedures.
COCS '84: Proceedings of the second ACM-SIGOA conference on Office information systemsThe paper presents a daemon-based approach to office programming systems. Daemons are “agents” users create to automate their tasks. They can be seen as user assistants which are able to recognize when their activation is required. Daemons can be ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1984 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1984
Published in SIGOA Volume 5, Issue 1-2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations2Total Citations
- 315Total Downloads
- Downloads (Last 12 months)91
- Downloads (Last 6 weeks)3
Reflects downloads up to 11 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in