• No results found

Lecture 18 of 42. Lecture 18 of 42

N/A
N/A
Protected

Academic year: 2021

Share "Lecture 18 of 42. Lecture 18 of 42"

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

(1)

Computing & Information Sciences Kansas State University Lecture 18 of 42 CIS 530 / 730 Artificial Intelligence

Lecture 18 of 42

Lecture 18 of 42

Lecture 18 of 42

Lecture 18 of 42

Knowledge Representation Concluded:

KE, CIKM, & Representing Events over Time

Discussion: Structure Elicitation, Event Calculus

William H. Hsu

Department of Computing and Information Sciences, KSU

KSOL course page: http://snipurl.com/v9v3

Course web site: http://www.kddresearch.org/Courses/CIS730 Instructor home page: http://www.cis.ksu.edu/~bhsu

Reading for Next Class:

Section 10.4 – 10.6, p. 341 – 353, Russell & Norvig 2ndedition IM: http://en.wikipedia.org/wiki/Information_management Event calculus:http://en.wikipedia.org/wiki/Event_calculus

Protégé-OWL tutorial: http://bit.ly/3rM1pB

Computing & Information Sciences Lecture 18 of 42 CIS 530 / 730 Artificial Intelligence

Lecture Outline

Lecture Outline

Lecture Outline

Lecture Outline

Reading for Next Class: Sections 10.4 – 10.6 (p. 341 – 353), R&N 2

e

Last Class: Knowledge Engineering (KE), Protocol Analysis, Fluents

Ontology engineering: defining classes/concepts, slots

Concept elicitation techniques

Unstructured

Structured

Protocol analysis

Today: Event and Fluent Calculi, CIKM

Representing time, events: from situation calculus to event, fluent calculi

Knowledge acquisition (KA) and capture

Computational information and knowledge management (CIKM)

(2)

Computing & Information Sciences Kansas State University Lecture 18 of 42 CIS 530 / 730 Artificial Intelligence

Acknowledgements

Acknowledgements

Acknowledgements

Acknowledgements

© 2004 H. Knublauch TopQuadrant, Inc.

(formerly University of Manchester)

http://www.knublauch.com © 2005 M. Hauskrecht University of Pittsburgh CS 2710 Foundations of AI http://www.cs.pitt.edu/~milos

Milos Hauskrecht

Associate Professor of Computer Science University of Pittsburgh

Holger Knublauch

Vice President, TopQuadrant previously Research Fellow, Stanford Medical Informatics & Univ. of Manchester

© 2005 N. Noy & S. Tu Stanford Center for Biomedical Informatics Research

http://bit.ly/jwOf3 http://bit.ly/2NBeCI http://bmir.stanford.edu

Samson Tu

Senior Research Scientist BMIR

Natasha Noy

Senior Research Scientist BMIR

© 2001 G. Tecuci George Mason University

http://bit.ly/3tUACW http://lalab.gmu.edu/cs785/ http://lac.gmu.edu

Georghe Tecuci

Professor of Computer Science Director, Learning Agents Center George Mason University

Computing & Information Sciences Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Universe of Decision Problems

Recursive Enumerable Languages (RE) Recursive Languages (REC) H

L

VALID

L

VALID

L

L

SAT SAT

L

L

L

complem. under closure

D

L

Decision Problems:

Decision Problems:

Decision Problems:

Decision Problems:

Review

Review

Review

Review

Co-RE (REC) LH: Halting problem LD: Diagonal problem Semi-decidable duals: α α α α∈∈∈∈LVALID iff ¬αααα∈∈∈∈L SATC Undecidable duals α α α α∈∈∈∈L VALIDCiff ¬αααα∈∈∈∈LSAT α α α α ⊢⊢⊢⊢RES ⊥⊥⊥⊥? α α α α Y

N
(3)

Computing & Information Sciences Kansas State University Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

“Concept” and “Class” are used synonymously

Class: concept

in the domain

wines

wineries

red wines

Collection

of elements with similar properties

Instances

of classes

Particular glass of California wine

Adapted from slides © 2005 N. Noy & S. Tu

Stanford Center for Biomedical Informatics Research

http://bmir.stanford.edu

Concepts/Classes:

Concepts/Classes:

Concepts/Classes:

Concepts/Classes:

Review

Review

Review

Review

Middle level Top level Bottom level

Computing & Information Sciences Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Slots in class definition

C

Describe attributes of instances of C

Describe relationships to other instances

e.g., each wine will have color, sugar content, producer, etc.

Property constraints (facets): describe/limit possible values for slot

Adapted from slides © 2005 N. Noy & S. Tu

Stanford Center for Biomedical Informatics Research

http://bmir.stanford.edu

Slots/Attributes/Relations:

Slots/Attributes/Relations:

Slots/Attributes/Relations:

Slots/Attributes/Relations:

Review

Review

Review

Review

(4)

Computing & Information Sciences Kansas State University Lecture 18 of 42 CIS 530 / 730 Artificial Intelligence Tabs partition different work areas Buttons and widgets for manipulating slots Area for manipulating the class hierarchy

Prot

Prot

Prot

Proté

é

ég

é

g

g

é

é –

é

– Default Interface:

Default Interface:

Default Interface:

Default Interface:

Review

Review

Review

Review

Adapted from slides © 2005 N. Noy & S. Tu

Stanford Center for Biomedical Informatics Research

http://bmir.stanford.edu

Downloads, primer, documentation:

http://protege.stanford.edu

Computing & Information Sciences Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Advanced approaches to KB and agent development

Elicitation based on the personal construct theory

A scenario for manual knowledge acquisition

Elicitation of expert’s conception of a domain

Knowledge acquisition for role-limiting methods

Knowledge Engineering:

Knowledge Engineering:

Knowledge Engineering:

Knowledge Engineering:

Review

Review

Review

Review

© 2001 G. Tecuci, George Mason University

(5)

Computing & Information Sciences Kansas State University Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

A knowledge engineer attempts to understand how a subject matter expert reasons and solves problems and then encodes the acquired expertise into the agent's knowledge base.

The expert analyzes the solutions generated by the agent (and often the knowledge base itself) to identify errors, and the knowledge engineer corrects the knowledge base.

Knowledge

Engineer

Domain

Expert

Knowledge Base Inference Engine

Intelligent Agent

Programming Dialog Results

© 2001 G. Tecuci, George Mason University

CS 785 Knowledge Acquisition and Problem-Solving http://lalab.gmu.edu/cs785/

How Agents Are Built:

How Agents Are Built:

How Agents Are Built:

How Agents Are Built:

Review

Review

Review

Review

Computing & Information Sciences Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Defining problem to solve and system to be built:

requirements specification

Choosing or building an agent building tool:

Inference engine and representation formalism

Development of the object ontology

Development of problem solving rules or methods

Refinement of the knowledge base

Feedback

loops

among all

phases

Understanding the expertise domain

Adapted from slide © 2001 G. Tecuci, George Mason University

CS 785 Knowledge Acquisition and Problem-Solving http://lalab.gmu.edu/cs785/

Agent Development Process:

Agent Development Process:

Agent Development Process:

Agent Development Process:

Review

Review

Review

Review

(6)

Computing & Information Sciences Kansas State University Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

(based primarily on Gammack, 1987)

1.

Concept elicitation: methods

(elicit concepts of domain,

i.e.

agreed-upon vocabulary)

2.

Structure elicitation: card-sort method

(elicit some structure for concepts)

3.

Structure representation

(formally represent structure in semantic network)

4.

Transformation of representation

(transform representation to be used for some desired purpose)

© 2001 G. Tecuci, George Mason University

CS 785 Knowledge Acquisition and Problem-Solving http://lalab.gmu.edu/cs785/

Elicitation Methodology:

Elicitation Methodology:

Elicitation Methodology:

Elicitation Methodology:

Review

Review

Review

Review

Computing & Information Sciences Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Event Calculus: Reasoning about Entities over Time, Space

Fluent Calculus: Variant of Situation Calculus

Conditions (predicates) that can change over time Defaults

∘∘∘∘ (concatenation)

Figures © 2003 S. Russell & P. Norvig. Reused with permission. Situation calculus Figure 10.2 p. 329 R&N 2e Event calculus Figure 10.3 p. 336 R&N 2e State fluents Figure 10.6 p. 340 R&N 2e Washington Adams Jefferson

Actions, Situations, Time & Events [1]:

Actions, Situations, Time & Events [1]:

Actions, Situations, Time & Events [1]:

Actions, Situations, Time & Events [1]:

Situation Calculus Revisited

Situation Calculus Revisited

Situation Calculus Revisited

Situation Calculus Revisited

(7)

Computing & Information Sciences Kansas State University Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Actions, Situations, Time & Events [2]:

Actions, Situations, Time & Events [2]:

Actions, Situations, Time & Events [2]:

Actions, Situations, Time & Events [2]:

Event Calculus

Event Calculus

Event Calculus

Event Calculus

Event Calculus: Reasoning about Entities over Time, Space

Fluent Calculus: Variant of Situation Calculus

Conditions (predicates) that can change over time Defaults

∘∘∘∘ (concatenation)

Figures © 2003 S. Russell & P. Norvig. Reused with permission. Situation calculus Figure 10.2 p. 329 R&N 2e Event calculus Figure 10.3 p. 336 R&N 2e State fluents Figure 10.6 p. 340 R&N 2e Washington Adams Jefferson

Computing & Information Sciences Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Actions, Situations, Time & Events [3]:

Actions, Situations, Time & Events [3]:

Actions, Situations, Time & Events [3]:

Actions, Situations, Time & Events [3]:

Fluent Calculus

Fluent Calculus

Fluent Calculus

Fluent Calculus

Event Calculus: Reasoning about Entities over Time, Space

Fluent Calculus: Variant of Situation Calculus

Conditions (predicates) that can change over time Defaults

∘∘∘∘ (concatenation)

Figures © 2003 S. Russell & P. Norvig. Reused with permission. Situation calculus Figure 10.2 p. 329 R&N 2e Event calculus Figure 10.3 p. 336 R&N 2e State fluents Figure 10.6 p. 340 R&N 2e Washington Adams Jefferson

(8)

Computing & Information Sciences Kansas State University Lecture 18 of 42 CIS 530 / 730 Artificial Intelligence

Preview:

Preview:

Preview:

Preview: C

C

Computational

C

omputational

omputational

omputational IIIInformation &

nformation &

nformation &

nformation &

K

K

K

Knowledge

nowledge

nowledge

nowledge M

M

M

Management

anagement

anagement

anagement

Information Management

Data acquisition: instrumentation, collection, polling, elicitation Data and information integration: combining multiple sources

May be heterogeneous (different in quality, format, rate, etc.)

Underlying formats, properties may correspond to different ontologies Ontology mappings (functions to convert between ontologies) needed Data transformation: preparation for reasoning, learning

Preprocessing Cleaning

Includes knowledge capture: assimilation from various sources

Knowledge Management

Term used most often in business administration, management science Related to IM, but capability and process-centered

Focus on learning and KA, organization theory, decision theory Discussion, apprenticeship, forums, libraries, training/mentoring Modern theory: KBs, Expert Systems, Decision Support Systems

Computing & Information Sciences Lecture 18 of 42 CIS 530 / 730 Artificial Intelligence

Terminology

Terminology

Terminology

Terminology

Knowledge Engineering (KE): Process of KR Design, Acquisition

Knowledge

What agents possess (epistemology) that lets them reason Basis for rational cognition, action

Knowledge gain (acquisition, learning): improvement in problem solving Knowledge level (vs.symbol level): level at which agents reason

Semantic network: inheritance and membership/containment relationships Knowledge elicitation: KA/KE process from human domain experts

Protocol analysis: preparing, conducting, interpreting interview Less formal methods: subjective estimation & probabilities

Fluents: Conditions (Predicates) That Can Change over Time

Classes, nominals (objects / class instances): spatial, temporal extent Fluent calculus: situation calculus with defaults, ∘∘∘∘ (concatenation)

Computational Information and Knowledge Management (CIKM)

Data/info integration & transformation: collecting, preparing data Includes knowledge capture: assimilation from various sources

(9)

Computing & Information Sciences Kansas State University Lecture 18 of 42

CIS 530 / 730 Artificial Intelligence

Summary Points

Summary Points

Summary Points

Summary Points

Last Class: Prolog in Brief, Description Logics, Ontologies

Prolog examples

Ontologies: formal languages for describing domains for KR KR as basis of learning and reasoning

ALCALCALCALC, SHOINSHOINSHOINSHOIN, and Web Ontology Language (OWL)

Today: More Ontology Design; Knowledge Engineering, Elicitation

Concept elicitation techniques

Unstructured Structured Protocol analysis

Knowledge acquisition (KA); info and knowledge management defined Situation calculus revisited; time and event calculus, fluent calculus

Next Class: More KE, Semantic Nets

KA and knowledge capture: elicitation concluded (structure elicitation) Computational information and knowledge management (CIKM)

Coming Week: Logical KR Concluded; Planning

References

Related documents

What do these mean? The representation of true is a function that takes two arguments and returns the first one. On the other hand, false returns its second argument. To make sense

Muzej Slavonije Osijek uključio se u manifestaciju Noć muzeja gotovo od samog njenog početka u Hrvatskoj, točnije 2007. godine s radionicom na temu memorije. Tijekom godina,

Based on the analysis result, in this question, students are asked to identify the content of the text then find a specific information from the text. This question is

– Data for the “public Good: (see Orange’s Data for development) • Data Privacy Policy and its interaction with business models.. Business and

Introduction to calculus notes for an advanced text that one lecture note the lectures on advanced calculus and vectors and.. This course analyzes the functions of working

We will see that the theory of partial differential equations of diffusion type (the heat equation being the a prime example) and the theory of diffusion processes (Brownian

The way we organize the sequent calculus is that for each logical operator we develop rules to break it down on the right and on the left of the turnstile `..

This requires a specific competence in project management techniques (both in case of packaged solutions and custom development) and a broad knowledge of ICT and Information