In this paper we present a solver for a first-order logic language where sets and binary
relations can be freely and naturally combined. The language can express, at least, any full …

We present a scheme for translating logic programs, which may use aggregation and
arithmetic, into algebraic expressions that denote bag relations over ground terms of the …

We develop a compilation scheme and categorical abstract machine for execution of logic
programs based on allegories, the categorical version of the calculus of relations …

I present a new approach to implementing weighted logic programming languages. I first
present a bag-relational algebra that is expressive enough to capture the desired …

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser
posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y …