Bounded Choice Queries for Logic Programming

TL;DR

This paper introduces bounded choice goals in logic programming to enable more controlled user interactions, extending Prolog with new interactive capabilities.

Contribution

It proposes a new interactive goal construct for logic programming, enhancing user interaction beyond the traditional read predicate.

Findings

Enables more guided user participation in logic programming

Extends Prolog with bounded choice goals

Improves control over user input in logic queries

Abstract

Adding versatile interactions to goals and queries in logic programming is an essential task. Unfortunately, existing logic languages can take input from the user only via the $read$ construct. We propose to add a new interactive goal to allow for more controlled and more guided participation from the user. We illustrate our idea via \muprolog, an extension of Prolog with bounded choice goals.