# Optimisation problems in logic programming: an algebraic approach

## Silvija Seres and Shin-Cheng Mu

Declarative programming, with its mathematical
underpinning, was aimed to simplify rigorous reasoning
about programs. For functional programs, an algebraic
calculus of relations has previously been applied to
optimisation problems to derive efficient greedy or
dynamic programs from the corresponding inefficient but
obviously correct specifications. Here we argue that this
approach is natural also in the logic programming setting.