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 - Subsets

  • Classical Logic Programming
    • Allows function symbols
    • Does not allow negation
    • Is turing complete

  • Full Logic Programming is not decideable
    • Prolog programs are not guaranteed to terminate

  • Several ways to guarantee the evaluation of a Logic Program
    • One is to enforce syntactical restrictions
    • This results in subsets of full logic programming
    • Datalog is such a subset

Speaker notes:

Content Tools


There are currently no sources for this slide.