Template Knowledge Models: Reusing Knowledge Model Elements

Template knowledge models
Reusing knowledge model elements
Lessons

Knowledge models partially reused in new applications Type of task = main guide for reuse Catalog of task templates

small set in this book see also other repositories
The need for reuse

prevent "re-inventing the wheel" cost/time efficient decreases complexity quality-assurance
Task template
reusable combination of model elements

(provisional) inference structure typical control structure typical domain schema from task point-of-view
specific for a task type supports top-down knowledge modeling
A typology of tasks

range of task types is limited
advantage of KE compared to general SE
background: cognitive science/psychology several task typologies have been proposed in the literature typology is based on the notion of system
The term system

abstract term for object to which a task is applied. in technical diagnosis: artifact or device being diagnosed in elevator configuration: elevator to be designed does not need to exist (yet)
Analytic versus synthetic tasks
analytic tasks
system pre-exists
it is typically not completely "known"
input: some data about the system, output: some characterization of the system system does not yet exist input: requirements about system to be constructed output: constructed system description
synthetic tasks

Task hierarchy
knowledgeintensive task
analytic task
synthetic task
classification
diagnosis
prediction
design
planning
assignment
modelling assessment monitoring
scheduling
configuration design
Structure of template description in catalog

General characterization
typical features of a task roles, sub-functions, control structure, inference structure frequently occurring refinements/changes assumptions about underlying domain-knowledge structure
Default method
Typical variations
Typical domain-knowledge schema
Classification

establish correct class for an object object should be available for inspection
"natural" objects
examples: rock classification, apple classification terminology: object, class, attribute, feature one of the simplest analytic tasks; many methods other analytic tasks: sometimes reduced to classification problem especially diagnosis
10
Classification: pruning method

generate all classes to which the object may belong specify an object attribute obtain the value of the attribute remove all classes that are inconsistent with this value
11
Classification: inference structure

object specify attribute
generate
class
obtain
match
feature
truth value
12
Classification: method control

while new-solution generate(object -> candidate) do
candidate-classes := candidate union candidate-classes;
while new-solution specify(candidate-classes -> attribute)

and length candidate-classes > 1 do
obtain(attribute -> new-feature); current-feature-set := new-feature union current-feature-set; for-each candidate in candidate-classes do
match(candidate + current-feature-set -> truth-value); if truth-value = false; then candidate-classes := candidate-classes subtract candidate;
13
Classification: method variations

Limited candidate generation Different forms of attribute selection

decision tree information theory user control
Hierarchical search through class structure
14
Classification: domain schema

object type
has-attribute class-of
2+
object class
1+
attribute
requires value: universal
class constraint
15
Rock classification
rock
texture grain size colour
1+
mineral
minerals ontology
igneous rock
mineral content
percentage presence
silicate
volcanic rock
plutonic rock mineral content constraint
neso silicate
tecto silicate
syenite
diorite olivine quartz
peridotite
dunite
16
Nested classification
rock classifcation
rock sub-task obtain: Quartz percentage contains identify Quartz minerals
mineral classification
Quartz olivine
17
Rock classification prototype
18
Assessment

find decision category for a case based on domainspecific norms. typical domains: financial applications (loan application), community service terminology: case, decision, norms some similarities with monitoring
differences:
timing: assessment is more static different output: decision versus discrepancy
19
Assessment: abstract & match method

Abstract the case data Specify the norms applicable to the case
e.g. rent-fits-income, correct-household-size
Select a single norm Compute a truth value for the norm with respect to the case See whether this leads to a decision Repeat norm selection and evaluation until a decision is reached
20
Assessment: inference structure

case
abstract
abstracted case
specify
norms
select
evaluate
norm
decision
match
norm value
21
Assessment: method control

while new-solution abstract(case-description -> abstracted-case)
do case-description := abstracted-case;
end while
specify(abstracted-case -> norms);
repeat
select(norms -> norm); evaluate(abstracted-case + norm -> norm-value); evaluation-results := norm-value union evaluation-results;
until has-solution match(evaluation-results -> decision);
22
Assessment control: UML notation

[more abstractions] abstract
specify norms [no more abstractions] select norm [match fails no decision] [match succeeds: decision found]
evaluate norm
match decision
23
Assessment: method variations

norms might be case-specific
cf. housing application
case abstraction may not be needed knowledge-intensive norm selection

random, heuristic, statistical can be key to efficiency sometimes dictated by human expertise
only acceptable if done in a way understandable to experts
24
Assessment: domain schema

case abstraction rule
case datum
1+
value: universal 1+
has abstraction
case datum
implies
requirement
norm
indicates truth-value: boolean 1+

decision rule
decision
25
Claim handling for unemployment benefits

claim handling
collect data data entry decide about claim
finacial department
:claim
[no right] [right] compute benefit
send notification
prepare payment
26
Decision rules for claim handling

<norm> WW benefit requirement DEFINES <decision> WW benefit right
<decision rule> benefit decision rule
insured = false DEFINES WW-benefit-right.value = no-right iunemployed = false DEFINES WW-benefit-right.value = no-right weeks-worked-requirement = false DEFINES WW-benefit-right.value = no-right
insured = true AND unemployed = true AND weeks-worked--requirement = true AND years-worked-requirement = false DEFINES WW-benefit-right.value = short-benefit
insured = true AND unemployed = true AND weeks-worked--requirement = true AND years-worked-requirement = true DEFINES WW-benefit-right.value = long-benefit
27
Diagnosis

find fault that causes system to malfunction
example: diagnosis of a copier

complaint/symptom, hypothesis, differential, finding(s)/evidence, fault
terminology: nature of fault varies
state, chain, component
should have some model of system behavior

default method: simple causal model direct associations between symptoms and faults
sometimes reduced to classification task automation feasible in technical domains
28
Diagnosis: causal covering method

Find candidate causes (hypotheses) for the complaint using a causal network Select a hypothesis Specify an observable for this hypothesis and obtain its value Verify each hypothesis to see whether it is consistent with the new finding Continue this process until a single hypothesis is left or no more observables are available
29
Diagnosis: inference structure

hypothesis specify observable
complaint
select
obtain
cover
hypothesis
verify
finding
result
30
Diagnosis: method control

while new-solution cover(complaint -> hypothesis) do
differential := hypothesis add differential;
end while repeat

select(differential -> hypothesis); specify(hypothesis -> observable); obtain(observable -> finding); evidence := finding add evidence; foreach hypothesis in differential do verify(hypothesis + evidence -> result); if result = false then differential := differential subtract hypothesis
until length differential =< 1 or no observables left faults := hypothesis;
31
Diagnosis: method variations

inclusion of abstractions simulation methods see literature on model-based diagnosis
library of Benjamins
32
Diagnosis: domain schema

syst em feat ure
syst em st at e syst em observable syst em st at e
can cause
syst em feat ure
value: universal
status: universal
causal dependency
fault
prevalence: number[0..1]
33
Monitoring

analyze ongoing process to find out whether it behaves according to expectations terminology:
parameter, norm, discrepancy, historical data dynamic nature of the system cyclic task execution
main features:

output "just" discrepancy => no explanation often: coupling monitoring and diagnosis
output monitoring is input diagnosis
34
Monitoring: data-driven method

Starts when new findings are received For a find a parameter and a norm value is specified Comparison of the find with the norm generates a difference description This difference is classified as a discrepancy using data from previous monitoring cycles
35
Monitoring: inference structure

system model
receive
new finding
select
parameter
compare
norm
specify
difference
classify
discrepancy
historical data
36
Monitoring: method control

receive(new-finding); select(new-finding -> parameter) specify(parameter -> norm); compare(norm + finding -> difference); classify(difference + historical-data -> discrepancy); historical-data := finding add historical-data;
37
Monitoring: method variations
model-driven monitoring

system has the initiative typically executed at regular points in time example: software project management apply classification method
classification function treated as task in its won right
add data abstraction inference
38
Prediction

analytic task with some synthetic features analyses current system behavior to construct description of a system state at future point in time. example: weather forecasting often sub-task in diagnosis also found in knowledge-intensive modules of teaching systems e.g. for physics. inverse: retrodiction: big-bang theory
39
Synthesis
Given a set of requirements, construct a system description that fulfills these requirements
requirements (external)
soft requirement
"fast system"
constraints & preferences (internal)

preference
"prefer cheapest component"
hard requirement
"price lower than $2,000"
constraint
"P166 processor requires 16Mb"
40
Ideal synthesis method

Operationalize requirements
preferences and constraints
Generate all possible system structures Select sub-set of valid system structures
obey constraints based on preferences
Order valid system structures
41
Synthesis: inference structure

operationalize requirements
generate
system composition knowledge
possible system structures
hard requirements
select subset
constraints
valid system structures

preferences
soft requirements
sort
preference ordering knowledge
list of preferred system structures
42
Design

synthetic task system to be constructed is physical artifact example: design of a car can include creative design of components creative design is too hard a nut to crack for current knowledge technology sub-type of design which excludes creative design => configuration design
43
Configuration design

given predefined components, find assembly that satisfies requirements + obeys constraints example: configuration of an elevator; or PC terminology: component, parameter, constraint, preference,
requirement (hard & soft)
form of design that is well suited for automation computationally demanding
44
Elevator configuration: knowledge base reuse
45
Configuration: propose & revise method
Simple basic loop:

Propose a design extension Verify the new design, If verification fails, revise the design revise strategies assignment with backtracking skeletal planning
Specific domain-knowledge requirements
Method can also be used for other synthetic tasks

46
Configuration: method decomposition

requirements specify skeletal design
operationalize
soft requirements
propose
extension
hard requirements design verify
modify
action
critique
violation
truth value
select
action list
47
Configuration: method control

operationalize(requirements -> hard-reqs + soft-reqs); specify(requirements -> skeletal-design);
while new-solution propose(skeletal-design + design +soft-reqs > extension) do

design := extension union design; verify(design + hard-reqs -> truth-value + violation); if truth-value = false then critique(violation + design -> action-list); repeat select(action-list -> action);
modify(design + action -> design); verify(design + hard-reqs -> truth-value + violation);
until truth-value = true;
end while
48
Configuration: method variations
Perform verification plus revision only when for all design elements a value has been proposed.
can have a large impact on the competence of the method Fixes are search heuristics to navigate the potentially extensive space of alternative designs alternative: chronological backtracking
Avoid the use of fix knowledge

49
Configuration: domain schema

act ion t ype
fix act ion
1+
fix
const raint
preference rating: universal
implies
const raint expression
1+
design element
computes 1+
design element
1+
defines preference
calculat ion expression
preference expression
component
component
0+ has-parameter
paramet er value: universal
1+
model list: list
50
Types of configuration may require different methods
Parametric design

Assembly is largely fixed Emphasis on finding parameter values that obey global constraints and adhere to preferences Example: elevator design Component parameters are fixed Emphasis on constructing assembly (topological relations) Example: mould configuration
Layout

Literature: Motta (1999), Chandrasekaran (1992)
51
Assignment
create mapping between two sets of objects
allocation of offices to employees allocation of airplanes to gates
mapping has to satisfy requirements and be consistent with constraints terminology
subject, resource, allocation
can be seen as a degenerative form of configuration design
52
Assignment: method without backtracking

Order subject allocation to resources by selecting first a sub-set of subjects If necessary: group the subjects into subject-groups for joint resource assignment
requires special type of constraints and preferences
Take an subject(-group) and assign a resource to it. Repeat this process until all subjects have a resource
53
Assignment: inference structure

subjects select subset subject set
subject group
group
resources
assign
resource
current allocations
54
Assignment: method control

while not empty subjects do select-subset(subjects -> subject-set); while not empty subject-set do group(subject-set -> subject-group); assign(subject-group + resources + current-allocations -> resource); current-allocations := < subject-group, resource > union current-allocations; subject-set := subject-set/subject-group; resources := resources/resource; end while subjects := subjects/subject-set; end while
55
Assignment: method variations

Existing allocations
additional input see synthesis and configuration-design
subject-specific constraints and preferences
56
Planning

shares many features with design main difference: "system" consists of activities plus time dependencies examples: travel planning; planning of building activities automation only feasible, if the basic plan elements are predefined consider use of the general synthesis method (e.g therapy planning) or the configuration-design method
57
Planning method
requirements plan goal
generate
plan composition knowledge
operationalize possible plans
hard requirements
select subset
constraints
valid plans
preferences
soft requirements
sort
preference ordering knowledge
list of preferred plans
58
Scheduling
Given a set of predefined jobs, each of which consists of temporally sequenced activities called units, assign all the units to resources at time slots
production scheduling in plant floors
Terminology: job, unit, resource, schedule Often done after planning (= specification of jobs) Take care: use of terms planning and scheduling differs
59
Scheduling: temporal dispatching method

Specify an initial schedule Select a candidate unit to be assigned Select a target resource for this unit Assign unit to the target resource Evaluate the current schedule Modify the schedule, if needed
60
Scheduling: inference structure

job specify truth value
select
schedule
verify
candidate unit
assign
modify
select
target resource
61
Scheduling: method control

specify(jobs -> schedule); while new-solution select(schedule -> candidate-unit) do select(candidate-unit + schedule -> target-resource); assign(candidate-unit + target-resource -> schedule); evaluate(schedule -> truth-value); if truth-value = false then modify(schedule -> schedule); end while
62
Scheduling: method variations

Constructive versus repair method Refinement often necessary

see scheduling literature catalog of Hori (IBM Japan)
63
Scheduling: typical domain schema

schedule job
release-date: time due-date: time includes

{temporally ordered}
job unit
resource
{dynamically linked}
unit
preference constraint
type: string start-time: time end-time: time

is performed at
start: time end: time resource-type: string
resource capacity constraint
64
Modeling

included for completeness "construction of an abstract description of a system in order to explain or predict certain system properties or phenomena" examples:

construction of a simulation model of nuclear accident knowledge modeling itself
seldom automated => creative steps
exception: chip modeling
65
In applications: typical task combinations

monitoring + diagnosis
Production process Nursing task Troubleshooting devices Military applications
monitoring + assessment
diagnosis + planning
classification + planning
66
Example: apple-pest management
mintor crop
execute plan
[possible threat] [possible pest]
identify pest
plan measure
67
Comparison with O-O analysis
Reuse of functional descriptions is not common in OO analysis
notion of functional object strategy patterns templates are patterns of knowledge-intensive tasks
But: see work on design patterns

Only real leverage from reuse if the patterns are limited to restricted task types
68

Template Knowledge Models: Reusing Knowledge Model Elements

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Template Knowledge Models: Reusing Knowledge Model Elements

Caricato da

Copyright:

Formati disponibili

Template knowledge models

Reusing knowledge model elements

small set in this book see also other repositories