Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99387
DC FieldValue
dc.titleProblem acquisition in scheduling domains
dc.contributor.authorLiu, B.
dc.date.accessioned2014-10-27T06:03:38Z
dc.date.available2014-10-27T06:03:38Z
dc.date.issued1993-07
dc.identifier.citationLiu, B. (1993-07). Problem acquisition in scheduling domains. Expert Systems With Applications 6 (3) : 257-265. ScholarBank@NUS Repository.
dc.identifier.issn09574174
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99387
dc.description.abstractIn knowledge acquisition, knowledge engineers typically lack the background needed to pose optimal questions, to capture the right knowledge, and to structure the knowledge acquired about a particular application area. A large amount of time and effort is consumed in forming a detailed coherent model of the application domain. Even after the model is formed, it is typically informal both in their mind and in their documentation. This makes further acquisition of problem solving knowledge and later system design difficult. This paper discusses the situation and presents a model-based approach to problem acquisition in scheduling domains. In order for this approach to work, an adequate model of scheduling problems is a prerequisite. In the paper, a domain-independent model and a problem-formulation framework are described. Guided by them, knowledge engineers will know what to ask in their interview with domain experts and how to organise formally the domain knowledge they acquire. © 1993.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleExpert Systems With Applications
dc.description.volume6
dc.description.issue3
dc.description.page257-265
dc.description.codenESAPE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.