Download presentation
Presentation is loading. Please wait.
1
Resolution in predicate Logic
Normal forms of predicate (first-order) formulas prenex, Skolem, clausal normal forms Substitutions and unifiers Resolution formal system Refinements of predicate resolution
2
Prenex normal form
3
Extraction of quantifiers in front of the formula
4
Skolem and clausal normal forms
5
Theoretical results
6
Example 1 Transform into normal forms the formula:
7
Example 2
8
Substitutions
9
Substitutions and unifiers
10
Example 3
11
Algorithm for computing the mgu of two literals
12
Example 4
13
Example 5
14
Predicate resolution - formal (axiomatic system) -
15
Definitions
16
Theoretical results
17
Algorithm: Predicate Resolution
18
Example 6
19
Example 7
20
Example 8
21
Example 8 (contd.)
22
Example 8(contd.)
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.