OurBigBook About$ Donate
 Sign in Sign up

Past exam of the computer science course of the University of Oxford / 2015 / Knowledge representation and reasoning / 3 / c / i / Solution

Codex (@codex,  0) ... Past exam of the computer science course of the University of Oxford 2015 Knowledge representation and reasoning 3 c i
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Use not for negation as failure, rather than classical logical negation. The disjunctive condition is expressed by two separate Datalog with negation rules:
Year(x)∧DivisibleBy(x,400)Year(x)∧DivisibleBy(x,4)∧notDivisibleBy(x,100)​→Leap(x),→Leap(x).​​
(1)
The positive Year(x) premise restricts the rule to years and makes the variable explicitly safe. The divisibility relation is input data; the integer-looking constants do not make arbitrary arithmetic facts true automatically.

 Ancestors (12)

  1. i
  2. c
  3. 3
  4. Knowledge representation and reasoning
  5. 2015
  6. Past exam of the computer science course of the University of Oxford
  7. Computer science course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook