Learn · Artificial Intelligence: Knowledge Representation And Reasoning
Lecture 28 of 114week-04
First Order Logic: Semantics
Prof. Deepak Khemani · IIT Madras
Credits and licence
- From
- Artificial Intelligence: Knowledge Representation And Reasoning, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- 1.1 - Introduction
- 1.2 - Abductive Inferences and Expectationsa
- 1.3 - On Machine Learning
- 1.4 - A New Test of Intelligence?
- 1.5 - The World According to Us
- 1.6 - From Particles to Concepts
- 1.7 - The Domains for Reasoning
- 1.8 - Hierarchies in Representation
- 1.9 - Logic and Representation: A Quick Tour
- 2.1 - Symbols and Thought
- 2.2 - From Gears to Symbols
- 2.3 - Truth, Logic, and Provability
- 2.4 - A Syntactic Machine
- 2.5 - Entailment and Proof
- 2.6 - The Languages of Logic
- 2.7 - Patterns in Arguments
- 2.8 - Rules of Inference
- Propositional Logic
- Propositional Logic: Syntax
- Propositional Logic: Semantics
- Proofs: Natural Deduction
- The Deduction Theorem
- Models
- The Tableau Method
- First Order Logic
- First Order Logic: Syntax
- FOL: Universal Instantiation
- First Order Logic: Semantics
- FOL: Truth Assignments
- Modified Modus Ponens
- The Unification Algorithm
- Skolemization
- Expert Systems
- Backward Chaining Systems
- Deductive Retrieval
- The Resolution Refutation Method
- Clause Form in FOL
- Resolution Refutation in FOL
- First Order Logic with Equality
- Who was the surgeon?
- Consistency vs. Completeness
- Logic Programming
- Arithmetic
- Horn Clauses and Prolog
- SLD Derivation = Backward Chaining
- Programming in Logic
- Prolog: Programming in Logic
- Prolog: Procedural Interpretation
- Prolog: Query Evaluation
- Prolog: Unifying Terms
- Prolog: Goal Order
- Prolog: Tabling
- Prolog: Negation by Failure
- Prolog: The Cut Operator
- Rule Based Expert Systems
- The OPS5 Language
- Match, Resolve, Execute
- Conflict Resolution Strategies
- The Rete Algorithm
- The Rete Net
- The Rete Net : Examples
- Knowledge Representation
- Synonyms, Antonyms, Hyponyms, Meronyms
- Binary Relations
- Describing Family Relations
- Recursive Descriptions
- Abstract Entities
- Reification: Units of Measurement
- Semantic Nets & Knowledge Graphs
- RDF Resource Description FrameWork
- RDF,RDFS,OWL, and The LOD Cloud
- DL: Description Logics
- Defining New Concepts and Roles
- The Sentences in DL
- A Family of Logics
- DL: Some Examples
- ALC Tableau
- Model Checking in ALC
- ALC Tableau: Examples
- Language Independent Represntation
- Conceptual Dependency Theory
- CD States
- Inferences in MARGIE
- CD: Actions
- English to CD
- Representing Complex Verbs
- Semantic Parsing of Language
- Knowledge Structures
- Scripts
- SAM: Script Apploer Mechanism
- A VIP Visit
- Invoking Scripts
- Goals, Plans, and Actions
- Goal Interactions
- Explanation Driven Understanding
- Tussle Over a Bicycle
- Plan Applier Mechanism (PAM)
- Requests and Rule Instances
- Knowledge Structures: Frames
- Inheritance
- A Frame System for Travel Planning
- Inheritance in Taxonomies
- Default Reasoning
- Closed World Assumption
- Circumscription
- Default Logic
- Autoepistemic Reasoning
- The Event Calculus
- The Effects of Events
- Epistemic Logic
- Kripke Structures: Possible Worlds Semantics
- The Muddy Children Puzzle
- The Effects of Epistemic Actions
- Reasoning with Beliefs