Lesson plan

logic programming

Logic programming is a programming, database, and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical form, representing knowledge about some problem domain. Computation is performed by applying logical reasoning to that knowledge, to solve problems in the domain. Major logic programming language families include Prolog, Answer Set Programming (ASP), and Datalog. In all of these languages, rules are written in the form of clauses: : A :- B 1 , ..., B n . and are read as declarative sentences in logical form: : A if B 1 and ... and B n . A is called the head of the rule, B 1 , ..., B n is called the body, and the B i are called literals or conditions. When n = 0, the rule is called a fact and is written in the simplified form: : A. Queries (or goals) have the same syntax as the bodies of rules and are commonly written in the form: : ?- B 1 , ..., B n . In the simplest case of Horn clauses (or "definite" clauses), all of the A, B 1 , ..., B n are atomic formulae of the form p(t 1 ,..., t m ), where p is a predicate symbol naming a relation, like "motherhood", and the t i are terms naming objects (or individuals). Terms include both constant symbols, like "charles", and variables, such as X, which start with an upper case letter. Consider, for example, the following Horn clause program: mother_child(elizabeth, charles).…

Back to article

Article summary

Logic programming is a programming, database, and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical form, representing knowledge about some problem domain. Computation is performed by applying logical reasoning to that knowledge, to solve problems in the domain. Major logic programming language families include Prolog, Answer Set Programming (ASP), and Datalog. In all of these languages, rules are written in the form of clauses: : A :- B 1 , ..., B n . and are read as declarative sentences in logical form: : A if B 1 and ... and B n . A is called the head of the rule, B 1 , ..., B n is called the body, and the B i are called literals or conditions. When n = 0, the rule is called a fact and is written in the simplified form: : A. Queries (or goals) have the same syntax as the bodies of rules and are commonly written in the form: : ?- B 1 , ..., B n . In the simplest case of Horn clauses (or "definite" clauses), all of the A, B 1 , ..., B n are atomic formulae of the form p(t 1 ,..., t m ), where p is a predicate symbol naming a relation, like "motherhood", and the t i are terms naming objects (or individuals). Terms include both constant symbols, like "charles", and variables, such as X, which start with an upper case letter. Consider, for example, the following Horn clause program: mother_child(elizabeth, charles).…

Key claims

  1. date of foundation: 1986 — source: Wikipedia · confidence 0.95
  2. publication date: 1974 — source: Wikipedia · confidence 0.95

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. The record states that the date of foundation is "1986". What evidence would count against this claim?
  3. The record states that the publication date is "1974". What evidence would count against this claim?
  4. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  5. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

  1. Wikipedia https://en.wikipedia.org/w/index.php?oldid=1375521752

Key claims and bibliography are generated from the same tracked claims and sources as the article page.