For-loops in Logic Programming

TL;DR

This paper introduces a new construct called parallel bounded quantifier in logic programming, enabling the expression of iterative tasks over lists within goal formulas, thus enhancing the language's ability to handle iteration.

Contribution

It proposes a novel goal formula with a parallel bounded quantifier to express iteration over lists, addressing a key limitation in traditional logic programming.

Findings

Enables iteration over list elements within logic programming goals.

Provides a formal syntax and semantics for the new iterative goal formulas.

Improves expressiveness of logic programming for iterative tasks.

Abstract

Logic programming has traditiLogic programming has traditionally lacked devices for expressing iterative tasks. To overcome this problem, this paper proposes iterative goal formulas of the form $\seqandq{x}{L} G$ where $G$ is a goal, $x$ is a variable, and $L$ is a list. $\seqandq{x}{L}$ is called a parallel bounded quantifier. These goals allow us to specify the following task: iterate $G$ with $x$ ranging over all the elements of $L$. onally lacked devices for expressing iterative tasks. To overcome this problem, this paper proposes iterative goal formulas of the form $\seqandq{x}{L} G$ where $G$ is a goal, $x$ is a variable, and $L$ is a list. $\seqandq{x}{L}$ is called a parallel bounded quantifier. These goals allow us to specify the following task: iterate $G$ with $x$ ranging over all the elements of $L$.