Semantic Information Processing at Universität Bamberg

Flashcards and summaries for Semantic Information Processing at the Universität Bamberg

Arrow Arrow

It’s completely free

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

Study with flashcards and summaries for the course Semantic Information Processing at the Universität Bamberg

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

Descire the iterative deepening search strategy

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

Difference between terminological and assertional knowledge

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

What does mean: X is conditionally independet of event Y?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

02 What is completeness?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

02 What is optimality?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

Which uninormed search methods are they?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

02 How can you compare several uninformed search methods? => 3

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

Is BFS optimal / complete?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

02 is DFS complete/optimal?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

Is uniform cost dearch based on DFS or BFS?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

02 What addition to BFS does Uniform Cost Search provide?

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

02 What is the termination criterion for Uniform Cost Search?

Your peers in the course Semantic Information Processing at the Universität Bamberg create and share summaries, flashcards, study plans and other learning materials with the intelligent StudySmarter learning app.

Get started now!

Flashcard Flashcard

Exemplary flashcards for Semantic Information Processing at the Universität Bamberg on StudySmarter:

Semantic Information Processing

Descire the iterative deepening search strategy
DFS with increasing depth, start for each depth with a new search tree until depth = d -1 Search trees, that already have been generated, are generated Complete bc bounded depth optimal: cost of all edges are equal

Semantic Information Processing

Difference between terminological and assertional knowledge
Terminological Knowledge (T-Box): provides concepts for desciribing factual knowledge, constrains structure of possible worlds, concepts are defined recursively by associations with other cooncepts and roles Assertional knowledge (A-Box: descr. facts that are true in modeled world; Instances and relations between them are represented by atomic formulas

Semantic Information Processing

What does mean: X is conditionally independet of event Y?
That in the graph there is no direct connectiont between X and Y.

Semantic Information Processing

02 What is completeness?
Complete = algorithm always finds solution (as long as it exists)

Semantic Information Processing

02 What is optimality?
Algorithm = optimal, if any returned solution is optimal (= there is no better solution)

Semantic Information Processing

Which uninormed search methods are they?
BFS, DFS, Uniform cost search, depth limited search, ...

Semantic Information Processing

02 How can you compare several uninformed search methods? => 3
Complexity (space/time), Completeness, Optimality

Semantic Information Processing

Is BFS optimal / complete?
Complete: yes; Optimal: yes

Semantic Information Processing

02 is DFS complete/optimal?
Complete: can get stuck in infinite loop optimal: no

Semantic Information Processing

Is uniform cost dearch based on DFS or BFS?
it'a a generalization of breadth-first-serach

Semantic Information Processing

02 What addition to BFS does Uniform Cost Search provide?
costs if path from goal node to start node

Semantic Information Processing

02 What is the termination criterion for Uniform Cost Search?
Search continues as long as node with lowest costs is not a goal node. (gol nodes may appear in search tree before termination)

Sign up for free to see all flashcards and summaries for Semantic Information Processing at the Universität Bamberg

Singup Image Singup Image
Wave

Other courses from your degree program

For your degree program Semantic Information Processing at the Universität Bamberg there are already many courses on StudySmarter, waiting for you to join them. Get access to flashcards, summaries, and much more.

Back to Universität Bamberg overview page

What is StudySmarter?

What is StudySmarter?

StudySmarter is an intelligent learning tool for students. With StudySmarter you can easily and efficiently create flashcards, summaries, mind maps, study plans and more. Create your own flashcards e.g. for Semantic Information Processing at the Universität Bamberg or access thousands of learning materials created by your fellow students. Whether at your own university or at other universities. Hundreds of thousands of students use StudySmarter to efficiently prepare for their exams. Available on the Web, Android & iOS. It’s completely free.

Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards
Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards