## Technical Reports (CIS)

#### Document Type

Technical Report

#### Date of this Version

April 1992

#### Abstract

When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ∪ {D). Thus during the bottom-up search for a cut-free proof contexts, represented as the left-hand side of intuitionistic sequents, grow as stacks. While such an intuitionistic notion of context provides for elegant specifications of many computations, contexts can be made more expressive and flexible if they are based on linear logic. After presenting two equivalent formulations of a fragment of linear logic, we show that the fragment has a goal-directed interpretation, thereby partially justifying calling it a logic programming language. Logic programs based on the intuitionistic theory of hereditary Harrop formulas can be modularly embedded into this linear logic setting . Programming examples taken from theorem proving, natural language parsing, and data base programming are presented: each example requires a linear, rather than intuitionistic, notion of context to be modeled adequately. An interpreter for this logic programming language must address the problem of splitting contexts; that is, when attempting to prove a multiplicative conjunction (tensor), say *G _{1} ⊗ G_{2}*, from the context Δ, the latter must be split into disjoint contexts Δ

_{1}and Δ

_{2}for which G

_{1}follows from Δ

_{1}and G

_{2}follows from Δ

_{2}. Since there is an exponential number of such splits, it is important to delay the choice of a split as much as possible. A mechanism for the lazy splitting of contexts is presented based on viewing proof search as a process that takes a context, consumes part of it, and returns the rest (to be consumed elsewhere). In addition, we use collections of Kripke interpretations indexed by a commutative monoid to provide models for this logic programming language and show that logic programs admit a canonical model.

#### Recommended Citation

Joshua S. Hodes and Dale Miller, "Logic Programming in a Fragment of Intuitionistic Linear Logic", . April 1992.

**Date Posted:** 22 August 2007

## Comments

University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-92-33.