2000 character limit reached
Bounded Choice Queries for Logic Programming
Published 27 May 2013 in cs.PL | (1305.6108v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.