## Notes Information

Login / Sign Up to View Document

## Sample Document Text

CS 1571 Intro to AI
M. Hauskrecht
CS 1571 Introduction to AI
Lecture 14
Milos Hauskrecht
milos@cs.pitt.edu
5329 Sennott Square
Propositional logic: Horn normal form
First-order logic.
CS 1571 Intro to AI
M. Hauskrecht
Logical inference problem
Logical inference problem:
. Given:
- a knowledge base KB (a set of sentences) and
- a sentence (called a theorem),
. Does a KB semantically entail ?
In other words: In all interpretations in which sentences in
the KB are true, is also true?
Approaches:
. Truth-table approach
. Inference rules
. Conversion to SAT
- Resolution refutation
?=|KB
?
?
?
?
CS 1571 Intro to AI
M. Hauskrecht
?
Truth-table approach
Problem:
. We need to check all possible interpretations for which the KB is
true (models of KB) whether is true for each of them
Truth tables:
. enumerate truth values of sentences for all possible interpretations
(assignments of True/False to propositional symbols) and check
Example:
?
P Q QP ?
...

## Related Documents

Definite Truth Values Notes

Forward Chaining Notes

Complete Formulas Notes

Performance Measurement Notes

Performance Measurement Notes

Performance Measurement Exam

Propositional Exam

To, at (time) Notes

Static Evaluation Notes

Alcoholic Beverage Notes

Propositional Logic Notes

Declining Terms of Trade Notes

Industrial Engineering Notes

Secondary Authority Notes

Feminist Philosophers Notes

Propositional Exam

© Copyright 2020 , Koofers, Inc. All rights reserved.

The information provided on this site is protected by U.S. and International copyright law, and other applicable intellectual property laws, including laws covering data access and data compilations. This information is provided exclusively for the personal and academic use of students, instructors and other university personnel. Use of this information for any commercial purpose, or by any commercial entity, is expressly prohibited. This information may not, under any circumstances, be copied, modified, reused, or incorporated into any derivative works or compilations, without the prior written approval of Koofers, Inc.