NUDGE, a Knowledge-based Scheduling Program
Ira Goldstein, R.B. Roberts · De Gruyter eBooks · 1979
Traditional scheduling algorithms (using the techniques of PERT charts, decision analysis or operations research) require well-defined quantitative, complete sets of constraints. They are insufficient for scheduling situations where the problem description is ill-defined, involving incomplete, possibly inconsistent and generally qualitative constraints. The NUDGE program uses an extensive knowledge base to debug scheduling requests by supplying missing details and resolving minor inconsistencies. The result is that an informal request is converted to a complete description suitable for a traditional scheduler.
Cited by 99 works. doi:10.1515/9783110858778-004
Authors
References
- A FRAMEWORK FOR REPRESENTING KNOWLEDGE
- An Overview of KRL, a Knowledge Representation Language
- A Computational Model of Skill Acquisition
- PLANNER: a language for proving theorems in robots
- FRAME REPRESENTATIONS AND THE DECLARATIVE/PROCEDURAL CONTROVERSY
- How can Merlin understand?
- Summary of a Heuristic Line Balancing Procedure
- Understanding simple picture programs
- The Semantic Component of PAL: The Personal Assistant Language Understanding Program
- A design for a parser for English