11: Logic and Inference Rules (Part 2) Flashcards

1
Q

What is horn logic?

A

Sub-set of predicate logic that allows efficient reasoning, orthogonal* to description logic

* orthogonal = statistically independent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is SQWRL?

A

Semantic Query-Enhanced Web Rule Language

A SWRL-based query language that provides SQL-like operators for extracting information from OWL ontologies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Which of the following inferred relations in the image is wrong? Why?

A

female(X), parent(P, X), parent(P, Y) -> sister(X, Y) is wrong

Because X may be Y and we need also notSame(X, Y) to have sister(X, Y)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is first-order logic?

A

A predicate (Q) can involve more than two instances: Q(a, b, c)

(As opposed to DL, in which a role can involve only two instances)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How do you negate a formula?

A
  • Using a proof technique called proof by contradiction
    • ​Prove that A follows from B (B -> A)
    • By assuming A is false and deriving a contradiction when combined with B
  • We prove that a goal can be answered positively be negating the goal and proving that we get a contradiction using the logic program
    • e.g. given the following logic program, we get a logical contradiction
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are Description Logic programs (DLP)?

A
  • Can be considered the intersection of Horn logic and description logic
  • Allows the combination of the advantages of both approaches
  • i.e.
    • A modeler may take a DL view, but
    • The implementation may be based on rule technology
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Using a diagram, show the relation of DLP with other related concepts.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

In Horn logic, is it possible that you can express that C is a sub-class of the intersection of D1 and D2?

A

Not possible–in Horn logic, the head cannot be combined of atoms and only the tail can be combined of atoms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Is it possible, as a pair of rules in Horn logic, to express that the union of C1 and C2 is a subclass of D?

A

Not possible–in Horn logic, the tail cannot have v and can only have ^ which is shown with a comma

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What are some properties of SWRL?

A
  • If the head of a rule has more than one atom, the rule can be transformed to an equivalent set of rules with one atom in the head
  • Expressions, such as restrictions, can appear in the head or body of a rule. This feature adds significant expressive power to OWL, but at the high price of undecidability
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the difference between DLP and SWRL?

A
  • DLP tries to combine the advantages of both languages (description logic and function-free rules) in their common sublanguage, with the goal of computational tractability*
  • SWRL takes a more maximalist approach and unites their respective expressivities

* tractability = easily managed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly