# AI News, Artificial Intelligence/Symbolic Programming

## Artificial Intelligence/Symbolic Programming

Theorem-proving method of Prolog is resolution refutation (assume the negated hypothesis and try to resolve the empty clause) - if you succeed, then it's safe to assert the hypothesis, otherwise not.

{~p,q},{p} stands for 'if socrates is a man (p) then he is mortal (q)' in CNF (p implies q is equivalent to ~p or q);

If we have a goal q, then it might make sense to assert the negated goal for resolution refutation, which is essentially proof by reductio.

This is a form of backward reasoning with sub-goaling: we assert the negated goal and try to work backwards, unifying and resolving clauses until we get to

The recursion goes down to a stopping condition, which returns a definite result that is passed on to the next higher level until we reach the top level again.

'Smart' compilers recognize tail recursion and stop the program once we hit the bottom - but some compilers 'bubble' the result up to the top level before returning it.

Lecture 6 -Resolution Principles & Application to PROLOG

Discrete Maths-Resolution Principles & Application-PROLOG.

Lecture - 12 Resolution Refutation Proofs

Lecture Series on Artificial Intelligence by Prof. P. Dasgupta, Department of Computer Science & Engineering, IIT Kharagpur. For more Courses visit ...

Lecture - 11 Resolution - Refutation Proofs

Lecture Series on Artificial Intelligence by Prof. P. Dasgupta, Department of Computer Science & Engineering, IIT Kharagpur. For more Courses visit ...

Mod-01 Lec- 44 Resolution Refutation for PL

Artificial Intelligence by Prof. Deepak Khemani,Department of Computer Science and Engineering,IIT Madras.For more details on NPTEL visit

Prolog - PartA

In this video, we talk about the Logic Programming Language, Prolog. We start with a small description of what is Logic Programming and what differences it has ...

Mod-01 Lec-41 Knowlege Based Systems

Artificial Intelligence by Prof. Deepak Khemani,Department of Computer Science and Engineering,IIT Madras.For more details on NPTEL visit

How to Solve Travelling Salesman Problems - TSP

A short tutorial on finding intervals for optimal routes, using nearest neighbour for upper bounds and using minimum spanning trees to find lower bounds for ...

Lecture - 15 Prolog: Exercising Control

Lecture Series on Artificial Intelligence by Prof. P. Dasgupta, Department of Computer Science & Engineering, IIT Kharagpur. For more Courses visit ...

Lecture - 15 Resolution in FOPL

Lecture Series on Artificial Intelligence by Prof.Sudeshna Sarkar and Prof.Anupam Basu, Department of Computer Science and Engineering,I.I.T, Kharagpur .

Lecture - 13 First Order Logic

Lecture Series on Artificial Intelligence by Prof.Sudeshna Sarkar and Prof.Anupam Basu, Department of Computer Science and Engineering,I.I.T, Kharagpur .