We say that an n-argument predicate $P\subset \Omega ^{n}$ is finite, if P is a finite set. Note that the set of individuals Ω is infinite! Finite predicates are ...

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including 'donkey ...

Knowledge representation and reasoning in logic programming constitute a core area of artificial intelligence that formalises how information is symbolically encoded and manipulated. This field ...