Skip to main content
You are currently using guest access (
Log in
)
Artificial Intelligence fundamentals - 2017
Home
Courses
Corso di Laurea Magistrale in Informatica (LM-18)
AIF-17
I - Constraint Satisfaction
Heuristic search for CSP
Heuristic search for CSP
Click
CSP-3.pdf
link to view the file.
◄ Constraint propagation
Jump to...
Jump to...
Syllabus of AI fundamentals
Course plan
Social forum
Announcements
Grading strategy
Introduction and agents
Formalization and problem formulation
Constraint propagation
Your turn - Section I
Characterization of Knowledge Based systems
Knowledge engineering and Ontology engineering.
Nonmonotonic reasoning
Logics for knowledge and beliefs
Semantic networks and structured representation
Description logics
Your turn - Section II
Quantifying uncertainty
Belief networks
Probabilistic reasoning over time
Your turn - Session III
Classical planning; definition
Classical planning: heuristics and algorithms
Planning in the real world
Your turn - Session IV
Rule based systems: SLD resolution
Logic programming and Prolog
Production systems and CLIPS
Your turn - Session V
Computer Science as Empirical Inquiry: Symbols and Search, A. Newell and H. A. Simon
A fundamental tradeoff in knowledge representation and reasoning, Hector J. Levesque, Ronald j Brachman.
A Framework for representing knowledge, Marvin Minky.
Computer Science as Empirical Inquiry: Symbols and Search, A. Newell and H. A. Simon
A fundamental tradeoff in knowledge representation and reasoning, Hector J. Levesque, Ronald j Brachman.
A Framework for representing knowledge, Marvin Minky.
Your turn - Section I ►