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 Summary

  • Logic Programming (without negation) is syntactically equivalent to Horn subset of First Order Logic
  • The semantics of a Logic Program are however based on its minimal Herbrand Model

  • Logic Programming comes in various variants for different applications (as programming language, for knowledge representation)
    • Full Logic Programming including function symbols is not decidable
    • Datalog is a syntactic restriction of LP, with desirable computational properties
    • Negation-as-failure introduced non-monotonic behavior and pushes LP beyond the expressivity of First Order Logic

  • A typical inference task for LP engines is conjunctive query answering

Speaker notes:

Content Tools


There are currently no sources for this slide.