Introduction to Logic

Exercise 4.5 - Constraints

Consider a deductive database with a single binary base relation p. Without mentioning any specific object constants, write a set of constraints that is satisfied by a dataset if and only if the p is acyclic, i.e. there is no sequence of pairs satisfying p that loops back on itself.