Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Logic Programming - Negation
- How do we handle negation in Logic Programs?
- Horn Logic only permits negation in limited form
- Consider (∀) ¬C1 ∨ … ∨ ¬Cn ∨ H
- Special solution: Negation-as-failure (NAF):
- Whenever a fact is not entailed by the knowledge base, its negation is entailed
- This is a form of “Default reasoning”
- This introduces non-monotonic behavior (previous conclusions might need to be revised during the inference process)
- NAF is not classical negation and pushes LP beyond classical First Order Logic
- This allows a form of negation in rules:
- (∀) C1 ∧ … ∧ Ci ∧ not Cn → H
- H :- B1, … Bi, not Bn
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Sources
There are currently no sources for this slide.