Towards Interactive Logic Programming
Abstract
Linear logic programming uses provability as the basis for computation. In the operational semantics based on provability, executing the additive-conjunctive goal G1 \& G2 from a program P simply terminates with a success if both G1 and G2 are solvable from P. This is an unsatisfactory situation, as a central action of \& -- the action of choosing either G1 or G2 by the user -- is missing in this semantics. We propose to modify the operational semantics above to allow for more active participation from the user. We illustrate our idea via muProlog, an extension of Prolog with additive goals.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.