Bounded Choice Queries for Logic Programming

2013/05/27 by Keehang Kwon, Kwon, Keehang
Computer Science · #FOS: Computer and information sciences #Programming Languages (cs.PL) #cs.PL

paper · pdf · doi:10.48550/arxiv.1305.6108

5 pages

arxiv created 2013/08/03 · arxiv updated 2013/08/06

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.

Related

• Interactive Logic Programming via Choice-Disjunctive Clauses
• Towards Interactive Logic Programming
• Finite-Choice Logic Programming
• A Framework for Compiling Preferences in Logic Programs
• Logic Engines as Interactors