Consider the following prolog database: married (logan, marcia), parent (logan, connor), parent (logan, kendall). parent (logan, roman). parent (logan, siobhan). dating(connor, willa). married(kendall, rava). dating( roman, grace). married(tom, siobhan) parent (caroline, kendall), parent (caroline, roman). parent (caroline, siobhan). Write a prolog rule to identify siblings. The rule sibling/2 receives two arguments and verifies if they are siblings or not. Two distinct persons are siblings if they have a common parent. A person is not a sibling of self. Example: ?- sibling(kendall, roman) true ?- sibling(kendall, tom) false ?- sibling(kendall, kendall) false

Consider the following prolog database:
married (logan, marcia),
parent (logan, connor),
parent (logan, kendall).
parent (logan, roman).
parent (logan, siobhan).
dating(connor, willa).
married(kendall, rava).
dating( roman, grace).
married(tom, siobhan)
parent (caroline, kendall),
parent (caroline, roman).
parent (caroline, siobhan).

Write a prolog rule to identify siblings. The rule sibling/2 receives two arguments
and verifies if they are siblings or not.
Two distinct persons are siblings if they have a common parent. A person is not a sibling of self.
Example:
?- sibling(kendall, roman)
true
?- sibling(kendall, tom)
false
?- sibling(kendall, kendall)
false