Logic: The Big Picture • Propositional logic: atomic statements are facts – Inference via resolution is sound and complete (though likely computationally intractable) • First-order logic: adds variables, relations, and quantification – Inference is essentially a generalization of propositional inference – Resolution is still sound and complete, but not guaranteed to terminate on non- entailed sentences (semidecidable) – Simple inference procedures (forward
13
Embed
Logic: The Big Picture Propositional logic: atomic statements are facts –Inference via resolution is sound and complete (though likely computationally.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Logic: The Big Picture• Propositional logic: atomic statements are facts
– Inference via resolution is sound and complete (though likely computationally intractable)
• First-order logic: adds variables, relations, and quantification – Inference is essentially a generalization of propositional
inference– Resolution is still sound and complete, but not
guaranteed to terminate on non-entailed sentences (semidecidable)
– Simple inference procedures (forward chaining and backward chanining) available for knowledge bases consisting of definite clauses
• Closed-world assumption: – Every constant refers to a unique object– Atomic sentences not in the database are assumed to be false
• Inference by backward chaining, clauses are tried in the order in which they are listed in the program, and literals (predicates) are tried from left to right
Logic: The Big Picture• The original goal of formal logic was to axiomatize mathematics
– Hilbert’s program (1920’s): find a formalization of mathematics that is consistent, complete, and decidable
• Completeness theorem (Gödel, 1929):– Deduction in FOL is consistent and complete– Unfortunately, FOL is not strong enough to describe infinite structures
such as natural or real numbers• Incompleteness theorem (Gödel, 1931):
– Any consistent logic system strong enough to capture natural numbers and arithmetic will contain true sentences that cannot be proved
• Halting problem (Turing, 1936):– There cannot be a general algorithm for deciding whether a given
statement about natural numbers is true• Profound implications for foundations of mathematics
• Search problem: starting with the start state, find all applicable actions (actions for which preconditions are satisfied), compute the successor state based on the effects, etc.
Complexity of planning
• Planning is PSPACE-complete– Plans can be exponential in length!– Example: tower of Hanoi